wi^ATddlZddlmZddlmZddlmZmZddlm Z GddZ y) N) ASSERTIONS) PreOrderIter) LoopError TreeError)LightNodeMixinceZdZdZdZedZejdZdZdZ dZ edZ ed Z e d Ze jd Z e jd Z d ZdZdZdZedZdZedZedZedZedZedZedZedZedZedZedZedZ edZ!dZ"d Z#d!Z$d"Z%y#)$ NodeMixinu 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 /c4t|dr |jSy)uD 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)hasattrr selfs g/workspace/moltex-experiments/.pixi/envs/default/lib/python3.12/site-packages/anytree/node/nodemixin.pyparentzNodeMixin.parentPsH 4- .== c|'t|ttfsd|d}t|t |dr |j }nd}||ur4|j ||j||j|yy)Nz Parent node z is not of type 'NodeMixin'.r ) isinstancer rrrr _NodeMixin__check_loop_NodeMixin__detach_NodeMixin__attach)rvaluemsgrs rrzNodeMixin.parentxs{  Z >7R%S  )EFCC. 4- .]]FF     e $ MM& ! MM%  rc|J|urd}t|fztfd|jDrd}t||fzyy)Nz1Cannot set parent. %r cannot be parent of itself.c3&K|]}|u ywN.0childrs r z)NodeMixin.__check_loop..sG.FU5D=.Fz&Cannot set parent. %r is parent of %r.)ranyiter_path_reverse)rnoders` r __check_loopzNodeMixin.__check_loopsa  t|Itg ..Gd.D.D.FGG>tTl 233H rc|qj||j}trtfd|DsJd|Dcgc] }|us| c}|_d_j |yycc}w)Nc3&K|]}|u ywrrrs rr"z%NodeMixin.__detach..sEnU5D=nr#Tree is corrupt.) _pre_detach_NodeMixin__children_or_emptyrr$_NodeMixin__childrenr _post_detach)rrparentchildrenr!s` r__detachzNodeMixin.__detachs~     V $#77NEnEEYGYYE4B XN5eSWFWN XF  DM   f %  !Ys  A6A6c|hj||j}trtfd|DrJd|j |_j |yy)Nc3&K|]}|u ywrrrs rr"z%NodeMixin.__attach..sI.u}.r#r*) _pre_attachr,rr$appendr _post_attach)rrr/s` r__attachzNodeMixin.__attachsg     V $#77NI.II]K]]I  ! !$ '"DM   f % rc@t|dsg|_|jS)Nr-)rr-rs r__children_or_emptyzNodeMixin.__children_or_emptyst34 DOrc,t|jS)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. )tupler,rs rchildrenzNodeMixin.childrensbT--..rct}|D]Z}t|ttfsd|d}t |t |}||vr|j |Kd|d}t |y)NzCannot add non-node object z&. It is not a subclass of 'NodeMixin'.zCannot add node z multiple times as child.)setrr rridadd)r;seenr!rchildids r__check_childrenzNodeMixin.__check_childrensquEei%@A3E9>> 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 rpathzNodeMixin.paths zzrc#<K|}|||j}|yyw)ae 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%zNodeMixin.iter_path_reverse,s)*J;;DscXttt|jSr)r:reversedlistr%rs rrTzNodeMixin._pathFs Xd4#9#9#;<=>>rcH|jy|jjS)at 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)rrUrs r ancestorszNodeMixin.ancestorsJs! ;; {{rcRtjdtd|jS)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)warningswarnDeprecationWarningr]rs r anchestorszNodeMixin.anchestors^s!  SUgtuv~~rc0tt|ddS)aj 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'),) rNr:rrs r descendantszNodeMixin.descendantsis$\$'(,,rcT|}|j|j}|j|S)a> 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') rWrXs rrootzNodeMixin.root}s- kk%;;Dkk% rc^j}|ytfd|jDS)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')) rc3,K|] }|us| ywrr)r r&rs rr"z%NodeMixin.siblings..sJodT9ITos )rr:r;rrs` rsiblingszNodeMixin.siblingss+( >JfooJJJrc0tt|dS)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')) c|jSr)is_leaf)r&s rz"NodeMixin.leaves..sT\\r)filter_rfrs rleaveszNodeMixin.leavess \$0IJKKrc2t|jdk(S)aI `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)rGr,rs rrpzNodeMixin.is_leafs 4++,11rc|jduS)a6 `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 NrWrs ris_rootzNodeMixin.is_roots {{d""rcJ|j}|rtd|DdzSy)aI 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 c34K|]}|jywr)height)r r!s rr"z#NodeMixin.height..s:u||srr)r,maxrNs rryzNodeMixin.heights+ ++ :::Q> >rcHt|jD]\}}S)a4 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 rr}zNodeMixin.depths($"$"8"8":;HE1 < rc@tt|dD]\}}S)a 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)r|r)rsizer~s rrzNodeMixin.size s&,!d!3Q7GD! 8 rcy)z+Method call before detaching from `parent`.Nrrls rr+zNodeMixin._pre_detach&rOrcy)z*Method call after detaching from `parent`.Nrrls rr.zNodeMixin._post_detach)rOrcy)z)Method call before attaching to `parent`.Nrrls rr3zNodeMixin._pre_attach,rOrcy)z(Method call after attaching to `parent`.Nrrls rr5zNodeMixin._post_attach/rOrN)&__name__ __module__ __qualname____doc__ separatorpropertyrsetterrrrr,r; staticmethodrDdeleterrKrLrErFrUr%rTr]rdrgrirmrsrprvryr}rr+r.r3r5rrrr r sAFI %%N ]] ! !4 & & 0/0/d % %__&--7676"4??  &--&(KK0LL"22"##"(*2:987rr ) raanytree.configranytree.iteratorsr exceptionsrrlightnodemixinrr rrrrs %*,*f7f7r