1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
|
require 'classes/node'
module Helpers
module Trees
def self.included(base)
base.module_eval do
before(:all) do
@tree = Node.new('root', [
Node.new('leaf1', [
Node.new('subleaf1', []),
Node.new('subleaf2', [])
]),
Node.new('leaf2', [
Node.new('subleaf1', []),
Node.new('subleaf2', [])
])
])
@different_root = Node.new('wrong', [])
@added = Node.new('root', [
Node.new('leaf1', [
Node.new('subleaf1', []),
Node.new('subleaf3', []),
Node.new('subleaf2', [])
]),
Node.new('leaf2', [
Node.new('subleaf1', []),
Node.new('subleaf2', [])
])
])
@removed = Node.new('root', [
Node.new('leaf1', [
Node.new('subleaf1', [])
]),
Node.new('leaf2', [
Node.new('subleaf1', []),
Node.new('subleaf2', [])
])
])
@changed_order = Node.new('root', [
Node.new('leaf2', [
Node.new('subleaf1', []),
Node.new('subleaf2', [])
]),
Node.new('leaf1', [
Node.new('subleaf1', []),
Node.new('subleaf2', [])
])
])
end
end
end
end
end
|
