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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
|
from anytree import (
LevelGroupOrderIter,
LevelOrderGroupIter,
LevelOrderIter,
Node,
PostOrderIter,
PreOrderIter,
ZigZagGroupIter,
)
from .helper import eq_
def test_preorder():
"""PreOrderIter."""
f = Node("f")
b = Node("b", parent=f)
a = Node("a", parent=b)
d = Node("d", parent=b)
c = Node("c", parent=d)
e = Node("e", parent=d)
g = Node("g", parent=f)
i = Node("i", parent=g)
h = Node("h", parent=i)
eq_(list(PreOrderIter(f)), [f, b, a, d, c, e, g, i, h])
eq_(list(PreOrderIter(f, maxlevel=0)), [])
eq_(list(PreOrderIter(f, maxlevel=3)), [f, b, a, d, g, i])
eq_(list(PreOrderIter(f, filter_=lambda n: n.name not in ("e", "g"))), [f, b, a, d, c, i, h])
eq_(list(PreOrderIter(f, stop=lambda n: n.name == "d")), [f, b, a, g, i, h])
it = PreOrderIter(f)
eq_(next(it), f)
eq_(next(it), b)
eq_(list(it), [a, d, c, e, g, i, h])
def test_postorder():
"""PostOrderIter."""
f = Node("f")
b = Node("b", parent=f)
a = Node("a", parent=b)
d = Node("d", parent=b)
c = Node("c", parent=d)
e = Node("e", parent=d)
g = Node("g", parent=f)
i = Node("i", parent=g)
h = Node("h", parent=i)
eq_(list(PostOrderIter(f)), [a, c, e, d, b, h, i, g, f])
eq_(list(PostOrderIter(f, maxlevel=0)), [])
eq_(list(PostOrderIter(f, maxlevel=3)), [a, d, b, i, g, f])
eq_(list(PostOrderIter(f, filter_=lambda n: n.name not in ("e", "g"))), [a, c, d, b, h, i, f])
eq_(list(PostOrderIter(f, stop=lambda n: n.name == "d")), [a, b, h, i, g, f])
it = PostOrderIter(f)
eq_(next(it), a)
eq_(next(it), c)
eq_(list(it), [e, d, b, h, i, g, f])
def test_levelorder():
"""LevelOrderIter."""
f = Node("f")
b = Node("b", parent=f)
a = Node("a", parent=b)
d = Node("d", parent=b)
c = Node("c", parent=d)
e = Node("e", parent=d)
g = Node("g", parent=f)
i = Node("i", parent=g)
h = Node("h", parent=i)
eq_(list(LevelOrderIter(f)), [f, b, g, a, d, i, c, e, h])
eq_(list(LevelOrderIter(f, maxlevel=0)), [])
eq_(list(LevelOrderIter(f, maxlevel=3)), [f, b, g, a, d, i])
eq_(list(LevelOrderIter(f, filter_=lambda n: n.name not in ("e", "g"))), [f, b, a, d, i, c, h])
eq_(list(LevelOrderIter(f, stop=lambda n: n.name == "d")), [f, b, g, a, i, h])
it = LevelOrderIter(f)
eq_(next(it), f)
eq_(next(it), b)
eq_(list(it), [g, a, d, i, c, e, h])
def test_levelgrouporder():
"""LevelGroupOrderIter."""
f = Node("f")
b = Node("b", parent=f)
a = Node("a", parent=b)
d = Node("d", parent=b)
c = Node("c", parent=d)
e = Node("e", parent=d)
g = Node("g", parent=f)
i = Node("i", parent=g)
h = Node("h", parent=i)
eq_(list(LevelGroupOrderIter(f)), [(f,), (b, g), (a, d, i), (c, e, h)])
eq_(list(LevelGroupOrderIter(f, maxlevel=0)), [])
eq_(list(LevelGroupOrderIter(f, maxlevel=3)), [(f,), (b, g), (a, d, i)])
eq_(list(LevelGroupOrderIter(f, filter_=lambda n: n.name not in ("e", "g"))), [(f,), (b,), (a, d, i), (c, h)])
eq_(list(LevelGroupOrderIter(f, stop=lambda n: n.name == "d")), [(f,), (b, g), (a, i), (h,)])
it = LevelGroupOrderIter(f)
eq_(next(it), (f,))
eq_(next(it), (b, g))
eq_(list(it), [(a, d, i), (c, e, h)])
def test_levelordergroup():
"""LevelOrderGroupIter."""
f = Node("f")
b = Node("b", parent=f)
a = Node("a", parent=b)
d = Node("d", parent=b)
c = Node("c", parent=d)
e = Node("e", parent=d)
g = Node("g", parent=f)
i = Node("i", parent=g)
h = Node("h", parent=i)
eq_(list(LevelOrderGroupIter(f)), [(f,), (b, g), (a, d, i), (c, e, h)])
eq_(list(LevelOrderGroupIter(f, maxlevel=0)), [])
eq_(list(LevelOrderGroupIter(f, maxlevel=3)), [(f,), (b, g), (a, d, i)])
eq_(list(LevelOrderGroupIter(f, filter_=lambda n: n.name not in ("e", "g"))), [(f,), (b,), (a, d, i), (c, h)])
eq_(list(LevelOrderGroupIter(f, stop=lambda n: n.name == "d")), [(f,), (b, g), (a, i), (h,)])
it = LevelOrderGroupIter(f)
eq_(next(it), (f,))
eq_(next(it), (b, g))
eq_(list(it), [(a, d, i), (c, e, h)])
def test_zigzaggroup():
"""ZigZagGroupIter."""
f = Node("f")
b = Node("b", parent=f)
a = Node("a", parent=b)
d = Node("d", parent=b)
c = Node("c", parent=d)
e = Node("e", parent=d)
g = Node("g", parent=f)
i = Node("i", parent=g)
h = Node("h", parent=i)
eq_(list(ZigZagGroupIter(f)), [(f,), (g, b), (a, d, i), (h, e, c)])
eq_(list(ZigZagGroupIter(f, maxlevel=0)), [])
eq_(list(ZigZagGroupIter(f, maxlevel=3)), [(f,), (g, b), (a, d, i)])
eq_(list(ZigZagGroupIter(f, filter_=lambda n: n.name not in ("e", "g"))), [(f,), (b,), (a, d, i), (h, c)])
eq_(list(ZigZagGroupIter(f, stop=lambda n: n.name == "d")), [(f,), (g, b), (a, i), (h,)])
it = ZigZagGroupIter(f)
eq_(next(it), (f,))
eq_(next(it), (g, b))
eq_(list(it), [(a, d, i), (h, e, c)])
|
