wi&ddlmZGddeZy)) AbstractIterc0eZdZdZedZedZy) PostOrderItera Iterate over tree applying post-order strategy starting at `node`. >>> from anytree import Node, RenderTree, AsciiStyle, PostOrderIter >>> 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) >>> print(RenderTree(f, style=AsciiStyle()).by_attr()) f |-- b | |-- a | +-- d | |-- c | +-- e +-- g +-- i +-- h >>> [node.name for node in PostOrderIter(f)] ['a', 'c', 'e', 'd', 'b', 'h', 'i', 'g', 'f'] >>> [node.name for node in PostOrderIter(f, maxlevel=3)] ['a', 'd', 'b', 'i', 'g', 'f'] >>> [node.name for node in PostOrderIter(f, filter_=lambda n: n.name not in ('e', 'g'))] ['a', 'c', 'd', 'b', 'h', 'i', 'f'] >>> [node.name for node in PostOrderIter(f, stop=lambda n: n.name == 'd')] ['a', 'b', 'h', 'i', 'g', 'f'] c4tj|d|||SNr)r_PostOrderIter__next)childrenfilter_stopmaxlevels p/workspace/moltex-experiments/.pixi/envs/default/lib/python3.12/site-packages/anytree/iterators/postorderiter.py_iterzPostOrderIter._iter&s##Ha$IIc#Ktj||sY|D]S}tj|j|}tj ||dz|||Ed{||sP|Uyy7wr)r_abort_at_level _get_childrenr rr)r levelr r r child grandchildrens r __nextzPostOrderIter.__next*so++E8<! , : :5>>4 P (// uqy'SWYabbb5>K "=csAA5A3 A5+ A5N)__name__ __module__ __qualname____doc__ staticmethodrrrr rrs2BJJ  rrN) abstractiterrrrrr rs&- L- r