
    i                     &    S SK Jr   " S S\5      rg)   )AbstractIterc                   (    \ rS rSrSr\S 5       rSrg)LevelOrderIter   a  
Iterate over tree applying level-order strategy starting at `node`.

>>> from anytree import Node, RenderTree, AsciiStyle, LevelOrderIter
>>> 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 LevelOrderIter(f)]
['f', 'b', 'g', 'a', 'd', 'i', 'c', 'e', 'h']
>>> [node.name for node in LevelOrderIter(f, maxlevel=3)]
['f', 'b', 'g', 'a', 'd', 'i']
>>> [node.name for node in LevelOrderIter(f, filter_=lambda n: n.name not in ('e', 'g'))]
['f', 'b', 'a', 'd', 'i', 'c', 'h']
>>> [node.name for node in LevelOrderIter(f, stop=lambda n: n.name == 'd')]
['f', 'b', 'g', 'a', 'i', 'h']
c              #   0  #    SnU (       a  / nUS-  n[         R                  " XC5      (       a  U  H  nU" U5      (       d  M  Uv   M     O>U  H8  nU" U5      (       a  Uv   U[         R                  " UR                  U5      -  nM:     Un U (       a  M  g g 7f)Nr   )r   _abort_at_level_get_childrenchildren)r
   filter_stopmaxlevellevelnext_childrenchilds          M/app/mltbenv/lib/python3.13/site-packages/anytree/iterators/levelorderiter.py_iterLevelOrderIter._iter&   s     MQJE++E<<%Eu~~# & &Eu~~#!\%?%?PT%UUM & %H hs   <BABB N)__name__
__module____qualname____firstlineno____doc__staticmethodr   __static_attributes__r       r   r   r      s    B % %r   r   N)abstractiterr   r   r   r   r   <module>r      s    &1%\ 1%r   