wi)?@ddlmZddlmZddlmZmZGddZy)) ASSERTIONS) PreOrderIter) LoopError TreeErrorceZdZdZddgZdZedZejdZdZ dZ d Z ed Z ed Z ed Ze jd Z e j dZ dZdZdZdZedZdZedZedZedZedZedZedZedZedZedZedZ edZ!d Z"d!Z#d"Z$d#Z%y$)%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/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 _LightNodeMixin__parentN)hasattrrselfs l/workspace/moltex-experiments/.pixi/envs/default/lib/python3.12/site-packages/anytree/node/lightnodemixin.pyparentzLightNodeMixin.parentUsH 42 3== ct|dr |j}nd}||ur4|j||j||j |yy)Nr)rr_LightNodeMixin__check_loop_LightNodeMixin__detach_LightNodeMixin__attach)rvaluers rrzLightNodeMixin.parent}sN 42 3]]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.LightNodeMixin.__check_loop..sG.FU5D=.Fz&Cannot set parent. %r is parent of %r.)ranyiter_path_reverse)rnodemsgs` r __check_loopzLightNodeMixin.__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*LightNodeMixin.__detach..sEnU5D=nr"Tree is corrupt.) _pre_detach"_LightNodeMixin__children_or_emptyrr#_LightNodeMixin__childrenr _post_detach)rrparentchildrenr s` r__detachzLightNodeMixin.__detachs~     V $#77NEnEEYGYYE4B XN5eSWFWN XF  DM   f %  !Ys  A6A6c|hj||j}trtfd|DrJd|j |_j |yy)Nc3&K|]}|u ywrrrs rr!z*LightNodeMixin.__attach..sI.u}.r"r*) _pre_attachr,rr#appendr _post_attach)rrr/s` r__attachzLightNodeMixin.__attachsg     V $#77NI.II]K]]I  ! !$ '"DM   f % rc@t|dsg|_|jS)Nr-)rr-rs r__children_or_emptyz"LightNodeMixin.__children_or_emptyst89 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 rchildrenzLightNodeMixin.childrensbT--..rct}|D]3}t|}||vr|j|$d|d}t|y)NzCannot add node z multiple times as child.)setidaddr)r;seenr childidr&s r__check_childrenzLightNodeMixin.__check_childrensIuEiGd"!( 1JKn$ rc@t|}tj||j}|` |j ||D] }||_ |j |tr$t|jt|k(sJyy#t$r ||_wxYwr) r:r _LightNodeMixin__check_childrenr;_pre_attach_childrenr_post_attach_childrenrlen Exception)rr; old_childrenr s rr;zLightNodeMixin.childrens?''1}} M   % %h /!# "  & &x 04==)S]::: (DM  s AB Bc|j}|j||jD] }d|_ trt |jdk(sJ|j |y)Nr)r;_pre_detach_childrenrrrG_post_detach_children)rr;r s rr;zLightNodeMixin.childrensV== !!(+]]EEL# t}}%* ** ""8,rcy)z(Method call before detaching `children`.Nrrr;s rrKz#LightNodeMixin._pre_detach_children rcy)z'Method call after detaching `children`.NrrNs rrLz$LightNodeMixin._post_detach_childrenrOrcy)z(Method call before attaching `children`.NrrNs rrEz#LightNodeMixin._pre_attach_childrenrOrcy)z'Method call after attaching `children`.NrrNs rrFz$LightNodeMixin._post_attach_childrenrOrc|jS)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 rpathzLightNodeMixin.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$z LightNodeMixin.iter_path_reverse+s)*J;;DscXttt|jSr)r:reversedlistr$rs rrTzLightNodeMixin._pathEs 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 ancestorszLightNodeMixin.ancestorsIs! ;; {{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 descendantszLightNodeMixin.descendants]s$\$'(,,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 rrootzLightNodeMixin.rootqs- 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)rr%rs rr!z*LightNodeMixin.siblings..sJodT9ITos )rr:r;rrs` rsiblingszLightNodeMixin.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'LightNodeMixin.leaves..sT\\r)filter_r_rs rleaveszLightNodeMixin.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 rrizLightNodeMixin.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_rootzLightNodeMixin.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)rr s rr!z(LightNodeMixin.height..s:u||srr)r,maxrNs rrrzLightNodeMixin.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 rrvzLightNodeMixin.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)rur)rsizerws rryzLightNodeMixin.sizes&,!d!3Q7GD! 8 rcy)z+Method call before detaching from `parent`.Nrres rr+zLightNodeMixin._pre_detachrOrcy)z*Method call after detaching from `parent`.Nrres rr.zLightNodeMixin._post_detachrOrcy)z)Method call before attaching to `parent`.Nrres rr3zLightNodeMixin._pre_attach rOrcy)z(Method call after attaching to `parent`.Nrres rr5zLightNodeMixin._post_attach#rOrN)&__name__ __module__ __qualname____doc__ __slots__ separatorpropertyrsetterrrrr,r; staticmethodrDdeleterrKrLrErFrUr$rTr]r`rbrfrlrirorrrvryr+r.r3r5rrrr r sGRz*II %%N ]]!!4 & & 0/0/d%%__&--7676"4??  &--&(KK0LL"22"##"(*2:987rr N)anytree.configranytree.iteratorsr exceptionsrrr rrrrs%*,]7]7r