i^ATSSKrSSKJr SSKJr SSKJrJr SSKJ r "SS5r g) N) ASSERTIONS) PreOrderIter) LoopError TreeError)LightNodeMixinc\rSrSrSrSr\S5r\RS5rSr Sr Sr \S 5r \S 5r \S 5r\ RS 5r \ R S 5r SrSrSrSr\S5rSr\S5r\S5r\S5r\S5r\S5r\S5r\S5r\S5r\S5r\S5r \S5r!\S5r"S r#S!r$S"r%S#r&S$r'g%)& NodeMixin u The :any:`NodeMixin` class extends any Python class to a tree node. The only tree relevant information is the `parent` attribute. If `None` the :any:`NodeMixin` is root node. If set to another node, the :any:`NodeMixin` becomes the child of it. The `children` attribute can be used likewise. If `None` the :any:`NodeMixin` has no children. The `children` attribute can be set to any iterable of :any:`NodeMixin` instances. These instances become children of the node. >>> from anytree import NodeMixin, RenderTree >>> class MyBaseClass(object): # Just an example of a base class ... foo = 4 >>> class MyClass(MyBaseClass, NodeMixin): # Add Node feature ... def __init__(self, name, length, width, parent=None, children=None): ... super(MyClass, self).__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 /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 _NodeMixin__parentN)hasattrrselfs C/app/mltbenv/lib/python3.13/site-packages/anytree/node/nodemixin.pyparentNodeMixin.parentPs H 4- . .== cUb-[U[[45(dSU<S3n[U5e[ US5(a UR nOSnX1La4UR U5 URU5 URU5 gg)Nz Parent node z is not of type 'NodeMixin'.r) isinstancer rrrr_NodeMixin__check_loop_NodeMixin__detach_NodeMixin__attach)rvaluemsgrs rrrxs  Z >7R%S%S  )EFCC. 4- . .]]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 )NodeMixin.__check_loop..sG.FUD=.Fz&Cannot set parent. %r is parent of %r.)ranyiter_path_reverse)rnoders` r __check_loopNodeMixin.__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 g7frr r!s rr$%NodeMixin.__detach..sEnUD=nr&Tree is corrupt.) _pre_detach_NodeMixin__children_or_emptyrr'_NodeMixin__childrenr _post_detach)rrparentchildrenr#s` r__detachNodeMixin.__detachs     V $#77NzEnEEEYGYYE4B XN5SWFWN XF  DM   f %  !Ys BBc^UbsTRU5 URn[(a![U4SjU55(aS5eUR T5 UTlTR U5 gg)Nc3*># UHoTLv M g7frr r!s rr$%NodeMixin.__attach..sI.}.r&r/) _pre_attachr1rr'appendr _post_attach)rrr4s` r__attachNodeMixin.__attachsl     V $#77NzI.III]K]]I  ! !$ '"DM   f % rcJ[US5(d/UlUR$)Nr2)rr2rs r__children_or_emptyNodeMixin.__children_or_emptys!t344 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 rchildrenNodeMixin.childrensbT--..rc[5nUHcn[U[[45(dSU<S3n[ U5e[ U5nXA;aUR U5 MSSU<S3n[ U5e g)NzCannot add non-node object z&. It is not a subclass of 'NodeMixin'.zCannot add node z multiple times as child.)setrr rridadd)rDseenr#rchildids r__check_childrenNodeMixin.__check_childrensruEei%@AA3E9>> 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 rpathNodeMixin.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(NodeMixin.iter_path_reverse,s(*J;;DscX[[[UR5555$r)rCreversedlistr(rs rrcNodeMixin._pathFs 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 ancestorsNodeMixin.ancestorsJs! ;; {{rcN[R"S[SS9 UR$)z All parent nodes and their parent nodes - see :any:`ancestors`. The attribute `anchestors` is just a typo of `ancestors`. Please use `ancestors`. This attribute will be removed in the 3.0.0 release. z;.anchestors was a typo and will be removed in version 3.0.0) stacklevel)warningswarnDeprecationWarningrors r anchestorsNodeMixin.anchestors^s!  SUgtuv~~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 descendantsNodeMixin.descendantsis$\$'(,,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 rrootNodeMixin.root}s- 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')) r c34># UH oTLdM Uv M g7frr )r"r)rs rr$%NodeMixin.siblings..sJodT9ITTos )rrCrDrrs` rsiblingsNodeMixin.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"NodeMixin.leaves..sT\\r)filter_rzrs rleavesNodeMixin.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 rrNodeMixin.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_rootNodeMixin.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$#NodeMixin.height..s:||srr)r1maxrYs rrNodeMixin.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 rrNodeMixin.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 rrNodeMixin.size s$,!d!3Q7GD 8 rcg)z+Method call before detaching from `parent`.Nr rs rr0NodeMixin._pre_detach&r[rcg)z*Method call after detaching from `parent`.Nr rs rr3NodeMixin._post_detach)r[rcg)z)Method call before attaching to `parent`.Nr rs rr:NodeMixin._pre_attach,r[rcg)z(Method call after attaching to `parent`.Nr rs rr<NodeMixin._post_attach/r[r) __children__parentrDN)(__name__ __module__ __qualname____firstlineno____doc__ separatorpropertyrsetterrrrr1rD staticmethodrOdeleterrVrWrPrQrdr(rcrorwr{r~rrrrrrrr0r3r:r<__static_attributes__r rrr r sAFI %%N ]] ! !4 & & 0/0/d % %__&--7676"4??  &--&(KK0LL"22"##"(*2:987rr ) rtanytree.configranytree.iteratorsr exceptionsrrlightnodemixinrr r rrrs %*,*f7f7r