i)?@SSKJr SSKJr SSKJrJr "SS5rg)) ASSERTIONS) PreOrderIter) LoopError TreeErrorc\rSrSrSrSS/rSr\S5r\RS5rSr S r S r \S 5r \S 5r\S 5r\RS5r\R"S5rSrSrSrSr\S5rSr\S5r\S5r\S5r\S5r\S5r\S5r\S5r\S5r\S5r \S5r!\S 5r"S!r#S"r$S#r%S$r&S%r'g&)'LightNodeMixinu The :any:`LightNodeMixin` behaves identical to :any:`NodeMixin`, but uses `__slots__`. There are some minor differences in the object behaviour. See slots_ for any details. .. _slots: https://docs.python.org/3/reference/datamodel.html#slots The only tree relevant information is the `parent` attribute. If `None` the :any:`LightNodeMixin` is root node. If set to another node, the :any:`LightNodeMixin` becomes the child of it. The `children` attribute can be used likewise. If `None` the :any:`LightNodeMixin` has no children. The `children` attribute can be set to any iterable of :any:`LightNodeMixin` instances. These instances become children of the node. >>> from anytree import LightNodeMixin, RenderTree >>> class MyBaseClass(): # Just an example of a base class ... __slots__ = [] >>> class MyClass(MyBaseClass, LightNodeMixin): # Add Node feature ... __slots__ = ['name', 'length', 'width'] ... def __init__(self, name, length, width, parent=None, children=None): ... super().__init__() ... self.name = name ... self.length = length ... self.width = width ... self.parent = parent ... if children: ... self.children = children Construction via `parent`: >>> my0 = MyClass('my0', 0, 0) >>> my1 = MyClass('my1', 1, 0, parent=my0) >>> my2 = MyClass('my2', 0, 2, parent=my0) >>> for pre, _, node in RenderTree(my0): ... treestr = u"%s%s" % (pre, node.name) ... print(treestr.ljust(8), node.length, node.width) my0 0 0 ├── my1 1 0 └── my2 0 2 Construction via `children`: >>> my0 = MyClass('my0', 0, 0, children=[ ... MyClass('my1', 1, 0), ... MyClass('my2', 0, 2), ... ]) >>> for pre, _, node in RenderTree(my0): ... treestr = u"%s%s" % (pre, node.name) ... print(treestr.ljust(8), node.length, node.width) my0 0 0 ├── my1 1 0 └── my2 0 2 Both approaches can be mixed: >>> my0 = MyClass('my0', 0, 0, children=[ ... MyClass('my1', 1, 0), ... ]) >>> my2 = MyClass('my2', 0, 2, parent=my0) >>> for pre, _, node in RenderTree(my0): ... treestr = u"%s%s" % (pre, node.name) ... print(treestr.ljust(8), node.length, node.width) my0 0 0 ├── my1 1 0 └── my2 0 2 __children__parent/c>[US5(a UR$g)ut Parent Node. On set, the node is detached from any previous parent node and attached to the new node. >>> from anytree import Node, RenderTree >>> udo = Node("Udo") >>> marc = Node("Marc") >>> lian = Node("Lian", parent=marc) >>> print(RenderTree(udo)) Node('/Udo') >>> print(RenderTree(marc)) Node('/Marc') └── Node('/Marc/Lian') **Attach** >>> marc.parent = udo >>> print(RenderTree(udo)) Node('/Udo') └── Node('/Udo/Marc') └── Node('/Udo/Marc/Lian') **Detach** To make a node to a root node, just set this attribute to `None`. >>> marc.is_root False >>> marc.parent = None >>> marc.is_root True _LightNodeMixin__parentN)hasattrrselfs H/app/mltbenv/lib/python3.13/site-packages/anytree/node/lightnodemixin.pyparentLightNodeMixin.parentUs H 42 3 3== c[US5(a URnOSnX!La4URU5 URU5 UR U5 gg)Nr)rr_LightNodeMixin__check_loop_LightNodeMixin__detach_LightNodeMixin__attach)rvaluers rrr}sO 42 3 3]]FF     e $ MM& ! MM%  rc^UbQUTLaSn[UT4-5e[U4SjUR555(aSn[UTU4-5egg)Nz1Cannot set parent. %r cannot be parent of itself.c3*># UHoTLv M g7fN.0childrs r .LightNodeMixin.__check_loop..sG.FUD=.Fz&Cannot set parent. %r is parent of %r.)ranyiter_path_reverse)rnodemsgs` r __check_loopLightNodeMixin.__check_loopsd  t|Itg ..Gd.D.D.FGGG>tTl 233H rc^UbTRU5 URn[(a![U4SjU55(dS5eUVs/sH o3TLdM UPM snUlSTlTR U5 ggs snf)Nc3*># UHoTLv M g7frrr s rr#*LightNodeMixin.__detach..sEnUD=nr%Tree is corrupt.) _pre_detach"_LightNodeMixin__children_or_emptyrr&_LightNodeMixin__childrenr _post_detach)rrparentchildrenr"s` r__detachLightNodeMixin.__detachs     V $#77NzEnEEEYGYYE4B XN5SWFWN XF  DM   f %  !Ys BBc^UbsTRU5 URn[(a![U4SjU55(aS5eUR T5 UTlTR U5 gg)Nc3*># UHoTLv M g7frrr s rr#*LightNodeMixin.__attach..sI.}.r%r/) _pre_attachr1rr&appendr _post_attach)rrr4s` r__attachLightNodeMixin.__attachsl     V $#77NzI.III]K]]I  ! !$ '"DM   f % rcJ[US5(d/UlUR$)Nr2)rr2rs r__children_or_empty"LightNodeMixin.__children_or_emptys!t899 DOrc,[UR5$)a All child nodes. >>> from anytree import Node >>> n = Node("n") >>> a = Node("a", parent=n) >>> b = Node("b", parent=n) >>> c = Node("c", parent=n) >>> n.children (Node('/n/a'), Node('/n/b'), Node('/n/c')) Modifying the children attribute modifies the tree. **Detach** The children attribute can be updated by setting to an iterable. >>> n.children = [a, b] >>> n.children (Node('/n/a'), Node('/n/b')) Node `c` is removed from the tree. In case of an existing reference, the node `c` does not vanish and is the root of its own tree. >>> c Node('/c') **Attach** >>> d = Node("d") >>> d Node('/d') >>> n.children = [a, b, d] >>> n.children (Node('/n/a'), Node('/n/b'), Node('/n/d')) >>> d Node('/n/d') **Duplicate** A node can just be the children once. Duplicates cause a :any:`TreeError`: >>> n.children = [a, b, d, a] Traceback (most recent call last): ... anytree.node.exceptions.TreeError: Cannot add node Node('/n/a') multiple times as child. )tupler1rs rchildrenLightNodeMixin.childrensbT--..rc[5nUH6n[U5nX1;aURU5 M&SU<S3n[U5e g)NzCannot add node z multiple times as child.)setidaddr)rDseenr"childidr)s r__check_childrenLightNodeMixin.__check_childrensGuEiG"!( 1JKn$ rcN[U5n[RU5 URnU?UR U5 UH nXlM UR U5 [(a%[UR5[U5:Xdegg![a X lef=fr) rCr _LightNodeMixin__check_childrenrD_pre_attach_childrenr_post_attach_childrenrlen Exception)rrD old_childrenr"s rrDrEs?''1}} M   % %h /!# "  & &x 0z4==)S]::: (M  s A BB$cURnURU5 URH nSUlM [(a[ UR5S:XdeUR U5 g)Nr)rD_pre_detach_childrenrrrR_post_detach_children)rrDr"s rrDrEsX== !!(+]]EEL# :t}}%* ** ""8,rcg)z(Method call before detaching `children`.NrrrDs rrV#LightNodeMixin._pre_detach_children rcg)z'Method call after detaching `children`.NrrYs rrW$LightNodeMixin._post_detach_childrenr[rcg)z(Method call before attaching `children`.NrrYs rrP#LightNodeMixin._pre_attach_childrenr[rcg)z'Method call after attaching `children`.NrrYs rrQ$LightNodeMixin._post_attach_childrenr[rcUR$)a< Path from root node down to this `Node`. >>> from anytree import Node >>> udo = Node("Udo") >>> marc = Node("Marc", parent=udo) >>> lian = Node("Lian", parent=marc) >>> udo.path (Node('/Udo'),) >>> marc.path (Node('/Udo'), Node('/Udo/Marc')) >>> lian.path (Node('/Udo'), Node('/Udo/Marc'), Node('/Udo/Marc/Lian')) )_pathrs rpathLightNodeMixin.paths zzrc#B# UnUbUv URnUbMgg7f)a Iterate up the tree from the current node to the root node. >>> from anytree import Node >>> udo = Node("Udo") >>> marc = Node("Marc", parent=udo) >>> lian = Node("Lian", parent=marc) >>> for node in udo.iter_path_reverse(): ... print(node) Node('/Udo') >>> for node in marc.iter_path_reverse(): ... print(node) Node('/Udo/Marc') Node('/Udo') >>> for node in lian.iter_path_reverse(): ... print(node) Node('/Udo/Marc/Lian') Node('/Udo/Marc') Node('/Udo') Nrrr(s rr' LightNodeMixin.iter_path_reverse+s(*J;;DscX[[[UR5555$r)rCreversedlistr'rs rrcLightNodeMixin._pathEs Xd4#9#9#;<=>>rcJURcgURR$)a All parent nodes and their parent nodes. >>> from anytree import Node >>> udo = Node("Udo") >>> marc = Node("Marc", parent=udo) >>> lian = Node("Lian", parent=marc) >>> udo.ancestors () >>> marc.ancestors (Node('/Udo'),) >>> lian.ancestors (Node('/Udo'), Node('/Udo/Marc')) r)rrdrs r ancestorsLightNodeMixin.ancestorsIs! ;; {{rc0[[U55SS$)a All child nodes and all their child nodes. >>> from anytree import Node >>> udo = Node("Udo") >>> marc = Node("Marc", parent=udo) >>> lian = Node("Lian", parent=marc) >>> loui = Node("Loui", parent=marc) >>> soe = Node("Soe", parent=lian) >>> udo.descendants (Node('/Udo/Marc'), Node('/Udo/Marc/Lian'), Node('/Udo/Marc/Lian/Soe'), Node('/Udo/Marc/Loui')) >>> marc.descendants (Node('/Udo/Marc/Lian'), Node('/Udo/Marc/Lian/Soe'), Node('/Udo/Marc/Loui')) >>> lian.descendants (Node('/Udo/Marc/Lian/Soe'),) rNrCrrs r descendantsLightNodeMixin.descendants]s$\$'(,,rcZUnURbURnURbMU$)z Tree Root Node. >>> from anytree import Node >>> udo = Node("Udo") >>> marc = Node("Marc", parent=udo) >>> lian = Node("Lian", parent=marc) >>> udo.root Node('/Udo') >>> marc.root Node('/Udo') >>> lian.root Node('/Udo') rgrhs rrootLightNodeMixin.rootqs- kk%;;Dkk% rcb^TRnUcg[U4SjUR55$)a Tuple of nodes with the same parent. >>> from anytree import Node >>> udo = Node("Udo") >>> marc = Node("Marc", parent=udo) >>> lian = Node("Lian", parent=marc) >>> loui = Node("Loui", parent=marc) >>> lazy = Node("Lazy", parent=marc) >>> udo.siblings () >>> marc.siblings () >>> lian.siblings (Node('/Udo/Marc/Loui'), Node('/Udo/Marc/Lazy')) >>> loui.siblings (Node('/Udo/Marc/Lian'), Node('/Udo/Marc/Lazy')) rc34># UH oTLdM Uv M g7frr)r!r(rs rr#*LightNodeMixin.siblings..sJodT9ITTos )rrCrDrrs` rsiblingsLightNodeMixin.siblingss+( >JfooJJJrc*[[USS95$)a Tuple of all leaf nodes. >>> from anytree import Node >>> udo = Node("Udo") >>> marc = Node("Marc", parent=udo) >>> lian = Node("Lian", parent=marc) >>> loui = Node("Loui", parent=marc) >>> lazy = Node("Lazy", parent=marc) >>> udo.leaves (Node('/Udo/Marc/Lian'), Node('/Udo/Marc/Loui'), Node('/Udo/Marc/Lazy')) >>> marc.leaves (Node('/Udo/Marc/Lian'), Node('/Udo/Marc/Loui'), Node('/Udo/Marc/Lazy')) cUR$r)is_leaf)r(s r'LightNodeMixin.leaves..sT\\r)filter_rrrs rleavesLightNodeMixin.leavess \$0IJKKrc2[UR5S:H$)z `Node` has no children (External Node). >>> from anytree import Node >>> udo = Node("Udo") >>> marc = Node("Marc", parent=udo) >>> lian = Node("Lian", parent=marc) >>> udo.is_leaf False >>> marc.is_leaf False >>> lian.is_leaf True r)rRr1rs rrLightNodeMixin.is_leafs 4++,11rcURSL$)z `Node` is tree root. >>> from anytree import Node >>> udo = Node("Udo") >>> marc = Node("Marc", parent=udo) >>> lian = Node("Lian", parent=marc) >>> udo.is_root True >>> marc.is_root False >>> lian.is_root False Nrgrs ris_rootLightNodeMixin.is_roots {{d""rcTURnU(a[SU55S-$g)z Number of edges on the longest path to a leaf `Node`. >>> from anytree import Node >>> udo = Node("Udo") >>> marc = Node("Marc", parent=udo) >>> lian = Node("Lian", parent=marc) >>> udo.height 2 >>> marc.height 1 >>> lian.height 0 c38# UHoRv M g7fr)height)r!r"s rr#(LightNodeMixin.height..s:||srr)r1maxrYs rrLightNodeMixin.heights+ ++ :::Q> >rcJ[UR55HupM W$)z Number of edges to the root `Node`. >>> from anytree import Node >>> udo = Node("Udo") >>> marc = Node("Marc", parent=udo) >>> lian = Node("Lian", parent=marc) >>> udo.depth 0 >>> marc.depth 1 >>> lian.depth 2 ) enumerater')rdepth_s rrLightNodeMixin.depths&$"$"8"8":;HE < rcB[[U5S5HupM W$)aF Tree size --- the number of nodes in tree starting at this node. >>> from anytree import Node >>> udo = Node("Udo") >>> marc = Node("Marc", parent=udo) >>> lian = Node("Lian", parent=marc) >>> loui = Node("Loui", parent=marc) >>> soe = Node("Soe", parent=lian) >>> udo.size 5 >>> marc.size 4 >>> lian.size 2 >>> loui.size 1 r)rr)rsizers rrLightNodeMixin.sizes$,!d!3Q7GD 8 rcg)z+Method call before detaching from `parent`.Nrr{s rr0LightNodeMixin._pre_detachr[rcg)z*Method call after detaching from `parent`.Nrr{s rr3LightNodeMixin._post_detachr[rcg)z)Method call before attaching to `parent`.Nrr{s rr:LightNodeMixin._pre_attach r[rcg)z(Method call after attaching to `parent`.Nrr{s rr<LightNodeMixin._post_attach#r[r)r r rDN)(__name__ __module__ __qualname____firstlineno____doc__ __slots__ separatorpropertyrsetterrrrr1rD staticmethodrOdeleterrVrWrPrQrdr'rcrorsrvr|rrrrrrr0r3r:r<__static_attributes__rrrr r sGRz*II %%N ]]!!4 & & 0/0/d%%__&--7676"4??  &--&(KK0LL"22"##"(*2:987rr N)anytree.configranytree.iteratorsr exceptionsrrr rrrrs%*,]7]7r