a d @s ddlZddlmZddlmZmZmZmZmZm Z m Z m Z m Z e rxddl mZmZejdkrlddlmZn ddlmZddlmZGd d d Ze d Zeed fZGd dde eZedZGdddeZdeedddddZdedddZdedddZdS)N)deepcopy) ListCallableIteratorUnionOptionalGenericTypeVarAny TYPE_CHECKING) TerminalDefToken))Literal) OrderedDictc@s^eZdZUeed<eed<eed<eed<eed<eed<eed<ded <eed <d d Zd S)MetaemptylinecolumnZ start_posZend_lineZ end_columnZend_poszList[TerminalDef]Zorig_expansionZ match_treecCs d|_dS)NT)rselfrR/var/www/html/stable-diffusion-webui/venv/lib/python3.9/site-packages/lark/tree.py__init__sz Meta.__init__N)__name__ __module__ __qualname__bool__annotations__intrrrrrrs r_Leaf_T Tree[_Leaf_T]c@s*eZdZUdZeed<ded<d;edeeddddZe ed d d Z d d Z ddZ ddZ dTreeaThe main tree class. Creates a new tree, and stores "data" and "children" in attributes of the same name. Trees can be hashed and compared. Parameters: data: The name of the rule or alias children: List of matched sub-rules and terminals meta: Line & Column numbers (if ``propagate_positions`` is enabled). meta attributes: line, column, start_pos, end_line, end_column, end_pos datazList[Branch[_Leaf_T]]childrenN)r%r&metareturncCs||_||_||_dSN)r%r&_meta)rr%r&r'rrrr4sz Tree.__init__)r(cCs|jdurt|_|jSr))r*rrrrrr'9s z Tree.metacCsd|j|jfS)Nz Tree(%r, %r)r%r&rrrr__repr__?sz Tree.__repr__cCs|jSr)r%rrrr _pretty_labelBszTree._pretty_labelcCst|jdkr@t|jdts@|||dd|jdfdgS|||dg}|jD]@}t|tr||||d|7}qX|||dd|fdg7}qX|S)Nr r z%s )lenr& isinstancer$r._pretty)rlevel indent_strlnrrrr3Es"  z Tree._pretty )r5r(cCsd|d|S)z]Returns an indented string representation of the tree. Great for debugging. r)joinr3)rr5rrrprettyRsz Tree.prettyzrich.tree.Tree)parentr(cCs ||S)zReturns a tree widget for the 'rich' library. Example: :: from rich import print from lark import Tree tree = Tree('root', ['node1', 'node2']) print(tree) )_rich)rr<rrr__rich__Ys z Tree.__rich__cCsh|r|d|jd}nddl}|j|j}|jD],}t|trP||q6|d|dq6|S)Nz[bold]z[/bold]rz[green]z[/green])addr%Z rich.treetreer$r&r2r=)rr<r@Zrichcrrrr=fs   z Tree._richcCs4z|j|jko|j|jkWSty.YdS0dS)NF)r%r&AttributeErrorrotherrrr__eq__us z Tree.__eq__cCs ||k Sr)rrCrrr__ne__{sz Tree.__ne__cCst|jt|jfSr))hashr%tupler&rrrr__hash__~sz Tree.__hash__zIterator[Tree[_Leaf_T]]csP|g}t|D],}|t|<|fddt|jD7}q~ttS)zDepth-first iteration. Iterates over all the subtrees, never returning to the same node twice (Lark's parse-tree is actually a DAG). cs&g|]}t|trt|vr|qSr)r2r$id).0rAZsubtreesrr sz&Tree.iter_subtrees..)rrJreversedr&listvalues)rqueuesubtreerrLr iter_subtreess zTree.iter_subtreeszCallable[[Tree[_Leaf_T]], bool])predr(cCst||S)z?Returns all nodes of the tree that evaluate pred(node) as true.)filterrS)rrTrrr find_predszTree.find_pred)r%r(cs|fddS)z?Returns all nodes of the tree whose data equals the given data.cs |jkSr)r-)tr-rrz Tree.find_data..)rV)rr%rr-r find_dataszTree.find_datacGsZd}tt|jdddD]:}|j|}t|tr|j|vr|j|j||d<d}q|S)z\Expand (inline) children with any of the given data values. Returns True if anything changedFr T)ranger1r&r2r$r%)rZ data_valueschangedichildrrrexpand_kids_by_datas zTree.expand_kids_by_dataz!Callable[[Branch[_Leaf_T]], bool]ccs@|jD]4}t|tr,||D] }|Vqq||r|VqdS)zReturn all values in the tree that evaluate pred(value) as true. This can be used to find all the tokens in the tree. Example: >>> all_tokens = tree.scan_values(lambda v: isinstance(v, Token)) N)r&r2r$ scan_values)rrTrArWrrrras    zTree.scan_valuesccsD|g}|r@|}t|tsq|Vt|jD]}||q.qdS)ztBreadth-first iteration. Iterates over all the subtrees, return nodes in order like pretty() does. N)popr2r$rNr&append)rstacknoder_rrriter_subtrees_topdowns zTree.iter_subtrees_topdowncCst||jt|j||jdS)N)r')typer%rr&r*)rmemorrr __deepcopy__szTree.__deepcopy__r#cCst||j|jSr))rgr%r&rrrrcopysz Tree.copy)r%r&r(cCs||_||_dSr)r+)rr%r&rrrsetszTree.set)N)r8)N) rrr__doc__strr rrrpropertyr'r,r.r3r;r>r=rErFr!rIrSrVrZr`rr"rarfrirjrkrrrrr$$s0     r$rc@seZdZdZdS) SlottedTree)r%r&Zruler*N)rrr __slots__rrrrrosroLRzLiteral["TB", "LR", "BT", "RL"])r@filenamerankdirr(cKs t||fi|}||dSr))pydot__tree_to_graphZ write_pngr@rrrskwargsgraphrrrpydot__tree_to_pngsrx)r@cKs t||fi|}||dSr))rtwriterurrrpydot__tree_to_dotsrzc sTddljfd|d|dgfddfdd|S) aCreates a colorful image that represents the tree (data+children, without meta) Possible values for `rankdir` are "TB", "LR", "BT", "RL", corresponding to directed graphs drawn from top to bottom, from left to right, from bottom to top, and from right to left, respectively. `kwargs` can be any graph attribute (e. g. `dpi=200`). For a list of possible attributes, see https://www.graphviz.org/doc/info/attrs.html. rNZdigraph)Z graph_typerscs4jdt|d}dd7<||S)Nr)labelr )Noderepradd_node)Zleafre)rwr^pydotrrnew_leafs z&pydot__tree_to_graph..new_leafcst|jd@}|dO}fdd|jD}jddd||jd}dd 7<||D]}||qf|S) Niics&g|]}t|tr|n|qSr)r2r$)rKr_) _to_pydotrrrrMsz;pydot__tree_to_graph.._to_pydot..rZfilledz#%x)styleZ fillcolorr{r )rGr%r&r|r~Zadd_edgeZEdge)rRcolorZsubnodesreZsubnoderrwr^rrrrrs  z'pydot__tree_to_graph.._to_pydot)rZDot)r@rsrvrrrrts rt)rq)rq)rq)sysrjrtypingrrrrrrr r r lexerr r version_inforZtyping_extensions collectionsrrr"ZBranchr$Z ParseTreerormrxrzrtrrrrs$ ,    ,