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 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609
|
# -*- coding: utf-8 -*-
from anytree import AnyNode, LoopError, Node, NodeMixin, PostOrderIter, PreOrderIter, TreeError
from .helper import assert_raises
def test_node_parent_error():
"""Node Parent Error."""
with assert_raises(TreeError, "Parent node 'parent' is not of type 'NodeMixin'."):
Node("root", "parent")
def test_parent_child():
"""A tree parent and child attributes."""
root = Node("root")
s0 = Node("sub0", parent=root)
s0b = Node("sub0B", parent=s0)
s0a = Node("sub0A", parent=s0)
s1 = Node("sub1", parent=root)
s1a = Node("sub1A", parent=s1)
s1b = Node("sub1B", parent=s1)
s1c = Node("sub1C", parent=s1)
s1ca = Node("sub1Ca", parent=s1c)
assert root.parent is None
assert root.children == tuple([s0, s1])
assert s0.parent == root
assert s0.children == tuple([s0b, s0a])
assert s0b.parent == s0
assert s0b.children == tuple()
assert s0a.parent == s0
assert s0a.children == tuple()
assert s1.parent == root
assert s1.children == tuple([s1a, s1b, s1c])
assert s1a.parent == s1
assert s1a.children == tuple()
assert s1b.parent == s1
assert s1b.children == tuple()
assert s1c.parent == s1
assert s1c.children == tuple([s1ca])
assert s1ca.parent == s1c
assert s1ca.children == tuple()
# change parent
s1ca.parent = s0
assert root.parent is None
assert root.children == tuple([s0, s1])
assert s0.parent == root
assert s0.children == tuple([s0b, s0a, s1ca])
assert s0b.parent == s0
assert s0b.children == tuple()
assert s0a.parent == s0
assert s0a.children == tuple()
assert s1.parent == root
assert s1.children == tuple([s1a, s1b, s1c])
assert s1a.parent == s1
assert s1a.children == tuple()
assert s1b.parent == s1
assert s1b.children == tuple()
assert s1c.parent == s1
assert s1c.children == tuple()
assert s1ca.parent == s0
assert s1ca.children == tuple()
# break tree into two
s1.parent = None
assert root.parent is None
assert root.children == tuple([s0])
assert s0.parent == root
assert s0.children == tuple([s0b, s0a, s1ca])
assert s0b.parent == s0
assert s0b.children == tuple()
assert s0a.parent == s0
assert s0a.children == tuple()
assert s1.parent is None
assert s1.children == tuple([s1a, s1b, s1c])
assert s1a.parent == s1
assert s1a.children == tuple()
assert s1b.parent == s1
assert s1b.children == tuple()
assert s1c.parent == s1
assert s1c.children == tuple()
assert s1ca.parent == s0
assert s1ca.children == tuple()
# set to the same
s1b.parent = s1
assert root.parent is None
assert root.children == tuple([s0])
assert s0.parent == root
assert s0.children == tuple([s0b, s0a, s1ca])
assert s0b.parent == s0
assert s0b.children == tuple()
assert s0a.parent == s0
assert s0a.children == tuple()
assert s1.parent is None
assert s1.children == tuple([s1a, s1b, s1c])
assert s1a.parent == s1
assert s1a.children == tuple()
assert s1b.parent == s1
assert s1b.children == tuple()
assert s1c.parent == s1
assert s1c.children == tuple()
assert s1ca.parent == s0
assert s1ca.children == tuple()
def test_detach_children():
root = Node("root")
s0 = Node("sub0", parent=root)
s0b = Node("sub0B", parent=s0)
s0a = Node("sub0A", parent=s0)
s1 = Node("sub1", parent=root)
s1a = Node("sub1A", parent=s1)
s1b = Node("sub1B", parent=s1)
s1c = Node("sub1C", parent=s1)
s1ca = Node("sub1Ca", parent=s1c)
assert root.descendants == (s0, s0b, s0a, s1, s1a, s1b, s1c, s1ca)
del s0.children
assert root.descendants == (s0, s1, s1a, s1b, s1c, s1ca)
del s1.children
assert root.descendants == (s0, s1)
def test_children_setter():
root = Node("root")
s0 = Node("sub0")
s1 = Node("sub0A")
s0a = Node("sub0B")
root.children = [s0, s1]
s0.children = [s0a]
assert root.descendants == (s0, s0a, s1)
with assert_raises(LoopError, "Cannot set parent. Node('/root/sub0') cannot be parent of itself."):
s0.children = [s0]
# test whether tree is unchanged after LoopError
assert root.descendants == (s0, s0a, s1)
with assert_raises(LoopError, "Cannot set parent. Node('/root/sub0') is parent of Node('/root/sub0/sub0B')."):
s0a.children = [s0]
# test whether tree is unchanged after LoopError
assert root.descendants == (s0, s0a, s1)
root.children = [s0, s1]
s0.children = [s0a]
s0a.children = [s1]
assert root.descendants == (s0, s0a, s1)
def test_children_setter_large():
root = Node("root")
s0 = Node("sub0")
s0b = Node("sub0B")
s0a = Node("sub0A")
s1 = Node("sub1")
s1a = Node("sub1A")
s1b = Node("sub1B")
s1c = Node("sub1C")
s1ca = Node("sub1Ca")
root.children = [s0, s1]
assert root.descendants == (s0, s1)
s0.children = [s0a, s0b]
assert root.descendants == (s0, s0a, s0b, s1)
s1.children = [s1a, s1b, s1c]
assert root.descendants == (s0, s0a, s0b, s1, s1a, s1b, s1c)
with assert_raises(TypeError, "'Node' object is not iterable"):
s1.children = s1ca
assert root.descendants == (s0, s0a, s0b, s1, s1a, s1b, s1c)
def test_node_children_type():
root = Node("root")
with assert_raises(TreeError, "Cannot add non-node object 'string'. It is not a subclass of 'NodeMixin'."):
root.children = ["string"]
def test_node_children_multiple():
root = Node("root")
sub = Node("sub")
with assert_raises(TreeError, "Cannot add node Node('/sub') multiple times as child."):
root.children = [sub, sub]
def test_recursion_detection():
"""Recursion detection."""
root = Node("root")
s0 = Node("sub0", parent=root)
Node("sub0B", parent=s0)
s0a = Node("sub0A", parent=s0)
# try recursion
assert root.parent is None
try:
root.parent = root
except LoopError as exc:
assert str(exc) == "Cannot set parent. Node('/root') cannot be parent of itself."
assert root.parent is None
else:
assert False
assert root.parent is None
try:
root.parent = s0a
except LoopError as exc:
assert str(exc) == ("Cannot set parent. Node('/root') is parent of Node('/root/sub0/sub0A').")
assert root.parent is None
else:
assert False
assert s0.parent is root
try:
s0.parent = s0a
except LoopError as exc:
assert str(exc) == ("Cannot set parent. Node('/root/sub0') is parent of Node('/root/sub0/sub0A').")
assert s0.parent is root
else:
assert False
def test_repr():
"""Node representation."""
root = Node("root")
s0 = Node("sub0", parent=root)
s1 = Node("sub1", parent=root, foo=42, bar="c0fe")
assert repr(root) == "Node('/root')"
assert repr(s0) == "Node('/root/sub0')"
assert repr(s1) == "Node('/root/sub1', bar='c0fe', foo=42)"
def test_ancestors():
"""Node.ancestors."""
root = Node("root")
s0 = Node("sub0", parent=root)
s0b = Node("sub0B", parent=s0)
s0a = Node("sub0A", parent=s0)
s1 = Node("sub1", parent=root)
s1c = Node("sub1C", parent=s1)
s1ca = Node("sub1Ca", parent=s1c)
assert root.ancestors == tuple()
assert s0.ancestors == tuple([root])
assert s0b.ancestors == tuple([root, s0])
assert s0a.ancestors == tuple([root, s0])
assert s1ca.ancestors == tuple([root, s1, s1c])
# deprecated typo
assert s1ca.anchestors == tuple([root, s1, s1c])
def test_node_children_init():
"""Node With Children Attribute."""
root = Node("root", children=[Node("a", children=[Node("aa")]), Node("b")])
assert repr(root.descendants) == "(Node('/root/a'), Node('/root/a/aa'), Node('/root/b'))"
def test_anynode_children_init():
"""Anynode With Children Attribute."""
root = AnyNode(foo="root", children=[AnyNode(foo="a", children=[AnyNode(foo="aa")]), AnyNode(foo="b")])
assert repr(root.descendants) == "(AnyNode(foo='a'), AnyNode(foo='aa'), AnyNode(foo='b'))"
def test_descendants():
"""Node.descendants."""
root = Node("root")
s0 = Node("sub0", parent=root)
s0b = Node("sub0B", parent=s0)
s0a = Node("sub0A", parent=s0)
s1 = Node("sub1", parent=root)
s1c = Node("sub1C", parent=s1)
s1ca = Node("sub1Ca", parent=s1c)
assert root.descendants == tuple([s0, s0b, s0a, s1, s1c, s1ca])
assert s1.descendants == tuple([s1c, s1ca])
assert s1c.descendants == tuple([s1ca])
assert s1ca.descendants == tuple()
def test_root():
"""Node.root."""
root = Node("root")
s0 = Node("sub0", parent=root)
s0b = Node("sub0B", parent=s0)
s0a = Node("sub0A", parent=s0)
s1 = Node("sub1", parent=root)
s1c = Node("sub1C", parent=s1)
s1ca = Node("sub1Ca", parent=s1c)
assert root.root == root
assert s0.root == root
assert s0b.root == root
assert s0a.root == root
assert s1.root == root
assert s1c.root == root
assert s1ca.root == root
def test_siblings():
"""Node.siblings."""
root = Node("root")
s0 = Node("sub0", parent=root)
s0b = Node("sub0B", parent=s0)
s0a = Node("sub0A", parent=s0)
s1 = Node("sub1", parent=root)
s1c = Node("sub1C", parent=s1)
s1ca = Node("sub1Ca", parent=s1c)
assert root.siblings == tuple()
assert s0.siblings == tuple([s1])
assert s0b.siblings == tuple([s0a])
assert s0a.siblings == tuple([s0b])
assert s1.siblings == tuple([s0])
assert s1c.siblings == tuple()
assert s1ca.siblings == tuple()
def test_is_leaf():
"""Node.is_leaf."""
root = Node("root")
s0 = Node("sub0", parent=root)
s0b = Node("sub0B", parent=s0)
s0a = Node("sub0A", parent=s0)
s1 = Node("sub1", parent=root)
s1c = Node("sub1C", parent=s1)
s1ca = Node("sub1Ca", parent=s1c)
assert root.is_leaf is False
assert s0.is_leaf is False
assert s0b.is_leaf is True
assert s0a.is_leaf is True
assert s1.is_leaf is False
assert s1c.is_leaf is False
assert s1ca.is_leaf is True
def test_leaves():
"""Node.leaves."""
root = Node("root")
s0 = Node("sub0", parent=root)
s0b = Node("sub0B", parent=s0)
s0a = Node("sub0A", parent=s0)
s1 = Node("sub1", parent=root)
s1c = Node("sub1C", parent=s1)
s1ca = Node("sub1Ca", parent=s1c)
assert root.leaves == tuple([s0b, s0a, s1ca])
assert s0.leaves == tuple([s0b, s0a])
assert s0b.leaves == tuple([s0b])
assert s0a.leaves == tuple([s0a])
assert s1.leaves == tuple([s1ca])
assert s1c.leaves == tuple([s1ca])
assert s1ca.leaves == tuple([s1ca])
def test_is_root():
"""Node.is_root."""
root = Node("root")
s0 = Node("sub0", parent=root)
s0b = Node("sub0B", parent=s0)
s0a = Node("sub0A", parent=s0)
s1 = Node("sub1", parent=root)
s1c = Node("sub1C", parent=s1)
s1ca = Node("sub1Ca", parent=s1c)
assert root.is_root is True
assert s0.is_root is False
assert s0b.is_root is False
assert s0a.is_root is False
assert s1.is_root is False
assert s1c.is_root is False
assert s1ca.is_root is False
def test_height():
"""Node.height."""
root = Node("root")
s0 = Node("sub0", parent=root)
s0b = Node("sub0B", parent=s0)
s0a = Node("sub0A", parent=s0)
s1 = Node("sub1", parent=root)
s1c = Node("sub1C", parent=s1)
s1ca = Node("sub1Ca", parent=s1c)
assert root.height == 3
assert s0.height == 1
assert s0b.height == 0
assert s0a.height == 0
assert s1.height == 2
assert s1c.height == 1
assert s1ca.height == 0
def test_size():
"""Node.size."""
root = Node("root")
s0 = Node("sub0", parent=root)
s0b = Node("sub0B", parent=s0)
s0a = Node("sub0A", parent=s0)
s1 = Node("sub1", parent=root)
s1c = Node("sub1C", parent=s1)
s1ca = Node("sub1Ca", parent=s1c)
assert root.size == 7
assert s0.size == 3
assert s0b.size == 1
assert s0a.size == 1
assert s1.size == 3
assert s1c.size == 2
assert s1ca.size == 1
def test_size():
"""Node.size."""
root = Node("root")
s0 = Node("sub0", parent=root)
s0b = Node("sub0B", parent=s0)
s0a = Node("sub0A", parent=s0)
s1 = Node("sub1", parent=root)
s1c = Node("sub1C", parent=s1)
s1ca = Node("sub1Ca", parent=s1c)
assert root.size == 7
assert s0.size == 3
assert s0b.size == 1
assert s0a.size == 1
assert s1.size == 3
assert s1c.size == 2
assert s1ca.size == 1
def test_depth():
"""Node.depth."""
root = Node("root")
s0 = Node("sub0", parent=root)
s0b = Node("sub0B", parent=s0)
s0a = Node("sub0A", parent=s0)
s1 = Node("sub1", parent=root)
s1c = Node("sub1C", parent=s1)
s1ca = Node("sub1Ca", parent=s1c)
assert root.depth == 0
assert s0.depth == 1
assert s0b.depth == 2
assert s0a.depth == 2
assert s1.depth == 1
assert s1c.depth == 2
assert s1ca.depth == 3
def test_parent():
"""Parent attribute."""
foo = NodeMixin()
assert foo.parent is None
def test_pre_order_iter():
"""Pre-Order Iterator."""
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)
assert [node.name for node in PreOrderIter(f)] == ["f", "b", "a", "d", "c", "e", "g", "i", "h"]
def test_post_order_iter():
"""Post-Order Iterator."""
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)
assert [node.name for node in PostOrderIter(f)] == ["a", "c", "e", "d", "b", "h", "i", "g", "f"]
def test_anyname():
"""Support any type as name."""
myroot = Node([1, 2, 3])
Node("/foo", parent=myroot)
assert str(myroot) == "Node('/[1, 2, 3]')"
def test_node_kwargs():
"""Ticket #24."""
class MyNode(Node):
def __init__(self, name, parent=None, **kwargs):
super(MyNode, self).__init__(name, parent, **kwargs)
def _post_attach(self, parent):
print(self.my_attribute)
node_a = MyNode("A")
node_b = MyNode("B", node_a, my_attribute=True)
assert repr(node_b) == "MyNode('/A/B', my_attribute=True)"
def test_hookups():
"""Hookup attributes #29."""
class MyNode(Node):
def _pre_attach(self, parent):
assert str(self.parent) == "None"
assert self.children == tuple()
assert str(self.path) == "(MyNode('/B'),)"
def _post_attach(self, parent):
assert str(self.parent) == "MyNode('/A')"
assert self.children == tuple()
assert str(self.path) == "(MyNode('/A'), MyNode('/A/B'))"
def _pre_detach(self, parent):
assert str(self.parent) == "MyNode('/A')"
assert self.children == tuple()
assert str(self.path) == "(MyNode('/A'), MyNode('/A/B'))"
def _post_detach(self, parent):
assert str(self.parent) == "None"
assert self.children == tuple()
assert str(self.path) == "(MyNode('/B'),)"
node_a = MyNode("A")
node_b = MyNode("B", node_a) # attach B on A
node_b.parent = None # detach B from A
def test_any_node_parent_error():
"""Any Node Parent Error."""
with assert_raises(TreeError, "Parent node 'r' is not of type 'NodeMixin'."):
AnyNode("r")
def test_any_node():
"""Any Node."""
r = AnyNode()
a = AnyNode()
b = AnyNode(foo=4)
assert r.parent is None
assert a.parent is None
assert b.parent is None
a.parent = r
b.parent = r
assert r.children == (a, b)
assert repr(r) == "AnyNode()"
assert repr(a) == "AnyNode()"
assert repr(b) == "AnyNode(foo=4)"
def test_eq_overwrite():
"""Node with overwritten __eq__."""
class EqOverwrittingNode(NodeMixin):
def __init__(self, a, b, parent=None):
super(EqOverwrittingNode, self).__init__()
self.a = a
self.b = b
self.parent = parent
def __eq__(self, other):
if isinstance(other, EqOverwrittingNode):
return self.a == other.a and self.b == other.b
else:
return NotImplemented
r = EqOverwrittingNode(0, 0)
a = EqOverwrittingNode(1, 0, parent=r)
b = EqOverwrittingNode(1, 0, parent=r)
assert a.parent is r
assert b.parent is r
assert a.a == 1
assert a.b == 0
assert b.a == 1
assert b.b == 0
def test_tuple():
"""Tuple as parent."""
with assert_raises(TreeError, "Parent node (1, 0, 3) is not of type 'NodeMixin'."):
Node((0, 1, 2), parent=(1, 0, 3))
def test_tuple_as_children():
"""Tuple as children."""
n = Node("foo")
with assert_raises(TreeError, "Cannot add non-node object (0, 1, 2). It is not a subclass of 'NodeMixin'."):
n.children = [(0, 1, 2)]
|