forked from pydata/xarray
-
Notifications
You must be signed in to change notification settings - Fork 0
/
test_treenode.py
389 lines (313 loc) · 11.3 KB
/
test_treenode.py
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
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
from __future__ import annotations
from collections.abc import Iterator
from typing import cast
import pytest
from xarray.core.treenode import InvalidTreeError, NamedNode, NodePath, TreeNode
from xarray.datatree_.datatree.iterators import LevelOrderIter, PreOrderIter
class TestFamilyTree:
def test_lonely(self):
root: TreeNode = TreeNode()
assert root.parent is None
assert root.children == {}
def test_parenting(self):
john: TreeNode = TreeNode()
mary: TreeNode = TreeNode()
mary._set_parent(john, "Mary")
assert mary.parent == john
assert john.children["Mary"] is mary
def test_no_time_traveller_loops(self):
john: TreeNode = TreeNode()
with pytest.raises(InvalidTreeError, match="cannot be a parent of itself"):
john._set_parent(john, "John")
with pytest.raises(InvalidTreeError, match="cannot be a parent of itself"):
john.children = {"John": john}
mary: TreeNode = TreeNode()
rose: TreeNode = TreeNode()
mary._set_parent(john, "Mary")
rose._set_parent(mary, "Rose")
with pytest.raises(InvalidTreeError, match="is already a descendant"):
john._set_parent(rose, "John")
with pytest.raises(InvalidTreeError, match="is already a descendant"):
rose.children = {"John": john}
def test_parent_swap(self):
john: TreeNode = TreeNode()
mary: TreeNode = TreeNode()
mary._set_parent(john, "Mary")
steve: TreeNode = TreeNode()
mary._set_parent(steve, "Mary")
assert mary.parent == steve
assert steve.children["Mary"] is mary
assert "Mary" not in john.children
def test_multi_child_family(self):
mary: TreeNode = TreeNode()
kate: TreeNode = TreeNode()
john: TreeNode = TreeNode(children={"Mary": mary, "Kate": kate})
assert john.children["Mary"] is mary
assert john.children["Kate"] is kate
assert mary.parent is john
assert kate.parent is john
def test_disown_child(self):
mary: TreeNode = TreeNode()
john: TreeNode = TreeNode(children={"Mary": mary})
mary.orphan()
assert mary.parent is None
assert "Mary" not in john.children
def test_doppelganger_child(self):
kate: TreeNode = TreeNode()
john: TreeNode = TreeNode()
with pytest.raises(TypeError):
john.children = {"Kate": 666}
with pytest.raises(InvalidTreeError, match="Cannot add same node"):
john.children = {"Kate": kate, "Evil_Kate": kate}
john = TreeNode(children={"Kate": kate})
evil_kate: TreeNode = TreeNode()
evil_kate._set_parent(john, "Kate")
assert john.children["Kate"] is evil_kate
def test_sibling_relationships(self):
mary: TreeNode = TreeNode()
kate: TreeNode = TreeNode()
ashley: TreeNode = TreeNode()
TreeNode(children={"Mary": mary, "Kate": kate, "Ashley": ashley})
assert kate.siblings["Mary"] is mary
assert kate.siblings["Ashley"] is ashley
assert "Kate" not in kate.siblings
def test_ancestors(self):
tony: TreeNode = TreeNode()
michael: TreeNode = TreeNode(children={"Tony": tony})
vito = TreeNode(children={"Michael": michael})
assert tony.root is vito
assert tony.parents == (michael, vito)
assert tony.ancestors == (vito, michael, tony)
class TestGetNodes:
def test_get_child(self):
steven: TreeNode = TreeNode()
sue = TreeNode(children={"Steven": steven})
mary = TreeNode(children={"Sue": sue})
john = TreeNode(children={"Mary": mary})
# get child
assert john._get_item("Mary") is mary
assert mary._get_item("Sue") is sue
# no child exists
with pytest.raises(KeyError):
john._get_item("Kate")
# get grandchild
assert john._get_item("Mary/Sue") is sue
# get great-grandchild
assert john._get_item("Mary/Sue/Steven") is steven
# get from middle of tree
assert mary._get_item("Sue/Steven") is steven
def test_get_upwards(self):
sue: TreeNode = TreeNode()
kate: TreeNode = TreeNode()
mary = TreeNode(children={"Sue": sue, "Kate": kate})
john = TreeNode(children={"Mary": mary})
assert sue._get_item("../") is mary
assert sue._get_item("../../") is john
# relative path
assert sue._get_item("../Kate") is kate
def test_get_from_root(self):
sue: TreeNode = TreeNode()
mary = TreeNode(children={"Sue": sue})
john = TreeNode(children={"Mary": mary}) # noqa
assert sue._get_item("/Mary") is mary
class TestSetNodes:
def test_set_child_node(self):
john: TreeNode = TreeNode()
mary: TreeNode = TreeNode()
john._set_item("Mary", mary)
assert john.children["Mary"] is mary
assert isinstance(mary, TreeNode)
assert mary.children == {}
assert mary.parent is john
def test_child_already_exists(self):
mary: TreeNode = TreeNode()
john: TreeNode = TreeNode(children={"Mary": mary})
mary_2: TreeNode = TreeNode()
with pytest.raises(KeyError):
john._set_item("Mary", mary_2, allow_overwrite=False)
def test_set_grandchild(self):
rose: TreeNode = TreeNode()
mary: TreeNode = TreeNode()
john: TreeNode = TreeNode()
john._set_item("Mary", mary)
john._set_item("Mary/Rose", rose)
assert john.children["Mary"] is mary
assert isinstance(mary, TreeNode)
assert "Rose" in mary.children
assert rose.parent is mary
def test_create_intermediate_child(self):
john: TreeNode = TreeNode()
rose: TreeNode = TreeNode()
# test intermediate children not allowed
with pytest.raises(KeyError, match="Could not reach"):
john._set_item(path="Mary/Rose", item=rose, new_nodes_along_path=False)
# test intermediate children allowed
john._set_item("Mary/Rose", rose, new_nodes_along_path=True)
assert "Mary" in john.children
mary = john.children["Mary"]
assert isinstance(mary, TreeNode)
assert mary.children == {"Rose": rose}
assert rose.parent == mary
assert rose.parent == mary
def test_overwrite_child(self):
john: TreeNode = TreeNode()
mary: TreeNode = TreeNode()
john._set_item("Mary", mary)
# test overwriting not allowed
marys_evil_twin: TreeNode = TreeNode()
with pytest.raises(KeyError, match="Already a node object"):
john._set_item("Mary", marys_evil_twin, allow_overwrite=False)
assert john.children["Mary"] is mary
assert marys_evil_twin.parent is None
# test overwriting allowed
marys_evil_twin = TreeNode()
john._set_item("Mary", marys_evil_twin, allow_overwrite=True)
assert john.children["Mary"] is marys_evil_twin
assert marys_evil_twin.parent is john
class TestPruning:
def test_del_child(self):
john: TreeNode = TreeNode()
mary: TreeNode = TreeNode()
john._set_item("Mary", mary)
del john["Mary"]
assert "Mary" not in john.children
assert mary.parent is None
with pytest.raises(KeyError):
del john["Mary"]
def create_test_tree() -> tuple[NamedNode, NamedNode]:
a: NamedNode = NamedNode(name="a")
b: NamedNode = NamedNode()
c: NamedNode = NamedNode()
d: NamedNode = NamedNode()
e: NamedNode = NamedNode()
f: NamedNode = NamedNode()
g: NamedNode = NamedNode()
h: NamedNode = NamedNode()
i: NamedNode = NamedNode()
a.children = {"b": b, "c": c}
b.children = {"d": d, "e": e}
e.children = {"f": f, "g": g}
c.children = {"h": h}
h.children = {"i": i}
return a, f
class TestIterators:
def test_preorderiter(self):
root, _ = create_test_tree()
result: list[str | None] = [
node.name for node in cast(Iterator[NamedNode], PreOrderIter(root))
]
expected = [
"a",
"b",
"d",
"e",
"f",
"g",
"c",
"h",
"i",
]
assert result == expected
def test_levelorderiter(self):
root, _ = create_test_tree()
result: list[str | None] = [
node.name for node in cast(Iterator[NamedNode], LevelOrderIter(root))
]
expected = [
"a", # root Node is unnamed
"b",
"c",
"d",
"e",
"h",
"f",
"g",
"i",
]
assert result == expected
class TestAncestry:
def test_parents(self):
_, leaf = create_test_tree()
expected = ["e", "b", "a"]
assert [node.name for node in leaf.parents] == expected
def test_lineage(self):
_, leaf = create_test_tree()
expected = ["f", "e", "b", "a"]
assert [node.name for node in leaf.lineage] == expected
def test_ancestors(self):
_, leaf = create_test_tree()
ancestors = leaf.ancestors
expected = ["a", "b", "e", "f"]
for node, expected_name in zip(ancestors, expected):
assert node.name == expected_name
def test_subtree(self):
root, _ = create_test_tree()
subtree = root.subtree
expected = [
"a",
"b",
"d",
"e",
"f",
"g",
"c",
"h",
"i",
]
for node, expected_name in zip(subtree, expected):
assert node.name == expected_name
def test_descendants(self):
root, _ = create_test_tree()
descendants = root.descendants
expected = [
"b",
"d",
"e",
"f",
"g",
"c",
"h",
"i",
]
for node, expected_name in zip(descendants, expected):
assert node.name == expected_name
def test_leaves(self):
tree, _ = create_test_tree()
leaves = tree.leaves
expected = [
"d",
"f",
"g",
"i",
]
for node, expected_name in zip(leaves, expected):
assert node.name == expected_name
def test_levels(self):
a, f = create_test_tree()
assert a.level == 0
assert f.level == 3
assert a.depth == 3
assert f.depth == 3
assert a.width == 1
assert f.width == 3
class TestRenderTree:
def test_render_nodetree(self):
sam: NamedNode = NamedNode()
ben: NamedNode = NamedNode()
mary: NamedNode = NamedNode(children={"Sam": sam, "Ben": ben})
kate: NamedNode = NamedNode()
john: NamedNode = NamedNode(children={"Mary": mary, "Kate": kate})
printout = john.__str__()
expected_nodes = [
"NamedNode()",
"NamedNode('Mary')",
"NamedNode('Sam')",
"NamedNode('Ben')",
"NamedNode('Kate')",
]
for expected_node, printed_node in zip(expected_nodes, printout.splitlines()):
assert expected_node in printed_node
def test_nodepath():
path = NodePath("/Mary")
assert path.root == "/"
assert path.stem == "Mary"