":h3dZddlmZddlmZmZddlmZmZGdde Z Gdd e Z Gd d e Z Gd d e e ZdZy)zNodes that make up parse trees Parsing spits out a tree of these, which you can then tell to walk itself and spit out a useful value. Or you can walk it yourself; the structural attributes are public. ) isfunction) version_infoexc_info)VisitationErrorUndefinedLabelcheZdZdZgdZd dZedZdZedZ d dZ d Z d Z d Z dd Zy)NodeaA parse tree node Consider these immutable once constructed. As a side effect of a memory-saving strategy in the cache, multiple references to a single ``Node`` might be returned in a single parse tree. So, if you start messing with one, you'll see surprising parallel changes pop up elsewhere. My philosophy is that parse trees (and their nodes) should be representation-agnostic. That is, they shouldn't get all mixed up with what the final rendered form of a wiki page (or the intermediate representation of a programming language, or whatever) is going to be: you should be able to parse once and render several representations from the tree, one after another. expr full_textstartendchildrenNcR||_||_||_||_|xsg|_yNr )selfr r rrrs e/var/www/html/turnos/venv/lib/python3.12/site-packages/ccxt/static_dependencies/parsimonious/nodes.py__init__z Node.__init__(s) "  B c.|jjSr)r namers r expr_namezNode.expr_name/syy~~rc,t|jS)zSupport looping over my children and doing tuple unpacks on me. It can be very handy to unpack nodes in arg lists; see :class:`PegVisitor` for an example. )iterrrs r__iter__z Node.__iter__4sDMM""rcH|j|j|jS)z"Return the text this node matched.)r rrrs rtextz Node.text=s~~djj22rc d}d|jj|jrd|jzndd|jd||urdndg}|D])}|j ||j |+d j |S) zReturn a unicode, pretty-printed representation of me. :arg error: The node to highlight because an error occurred there cNdjd|jDS)N c3&K|] }d|z yw)z N).0lines r z0Node.prettily..indent..MsKftmKs)join splitlines)rs rindentzNode.prettily..indentLs99K9JKK Krz <-- *** We were here. ***)errorr") __class____name__rrappendprettilyr()rr-r*retns rr1z Node.prettilyDs L NN # #15^dnn ,R G II-2d] ) B DE  8A JJvajjuj56 7 8yy~rc"|jS)z6Return a compact, human-readable representation of me.)r1rs r__str__z Node.__str__Ws}}rc8t|tstS|j|jk(xrj|j|jk(xrO|j |j k(xr4|j |j k(xr|j|jk(S)z>Support by-value deep comparison with other nodes for testing.) isinstancer NotImplementedr r rrrrothers r__eq__z Node.__eq__[s%&! ! UZZ'0%//10 ekk)0EII%0 /  1rc||k( Srr$r9s r__ne__z Node.__ne__fs5=  rc|rd|jzgng}|j|jjd|jd|j d|j |jr.unvisits#x848 Bd Br_ruler)Grammarrc.|jjSr) func_codeco_firstlinenoxs rz+RuleDecoratorMeta.__new__..s (B(Brc.|jjSr)__code__rYrZs rr\z+RuleDecoratorMeta.__new__..s (A(Ar)keyr"c3xK|]1}dj|j|j3yw)z{name} = {expr})rr N)formatr/rT)r%mrSs rr'z,RuleDecoratorMeta.__new__..s<,,22 8K893A,s7:grammar) itemshasattrrrcrUsortrr(superrM__new__) metaclassrbases namespacekvmethodsrUrSr.s @rrhzRuleDecoratorMeta.__new__s C"+!2:A1g&:a=::  ( LL ,Q! 3CA  D $+ ,#*,,$-Ii &((14 J K:s#B")r/rDrErh __classcell__)r.s@rrMrMsKKrrMc@eZdZdZdZdZdZdZd dZd dZ dZ d Z y) NodeVisitora}A shell for writing things that turn parse trees into something useful Performs a depth-first traversal of an AST. Subclass this, add methods for each expr you care about, instantiate, and call ``visit(top_node_of_parse_tree)``. It'll return the useful stuff. This API is very similar to that of ``ast.NodeVisitor``. These could easily all be static methods, but that would add at least as much weirdness at the call site as the ``()`` for instantiation. And this way, we support subclasses that require state: options, for example, or a symbol table constructed from a programming language's AST. We never transform the parse tree in place, because... * There are likely multiple references to the same ``Node`` object in a parse tree, and changes to one reference would surprise you elsewhere. * It makes it impossible to report errors: you'd end up with the "error" arrow pointing someplace in a half-transformed mishmash of nodes--and that's assuming you're even transforming the tree into another tree. Heaven forbid you're making it into a string or something else. Nr$c @t|d|jz|j} |||Dcgc]}|j|c}Scc}w#tt f$rt $r4}t||jrt|}t |||d}~wwxYw)aWalk a parse tree, transforming it into another representation. Recursively descend a parse tree, dispatching to the method named after the rule in the :class:`~.grammar.Grammar` that produced each node. If, for example, a rule was... :: bold = '' ...the ``visit_bold()`` method would be called. It is your responsibility to subclass :class:`NodeVisitor` and implement those methods. rPN) getattrr generic_visitvisitrr Exceptionr7unwrapped_exceptionstype)rnodemethodr3exc exc_classs rruzNodeVisitor.visitsx$..8$:L:LM 8$ =1A => > =0   8#t889S I!#y$7 7 8s(AA A AB)/BBcNtd|jjz)aeDefault visitor method :arg node: The node we're visiting :arg visited_children: The results of visiting the children of that node, in a list I'm not sure there's an implementation of this that makes sense across all (or even most) use cases, so we leave it to subclasses to implement for now. z5No visitor method was defined for this expression: %s)NotImplementedErrorr as_rule)rryvisited_childrens rrtzNodeVisitor.generic_visits)""Y"&))"3"3"5#67 7rc(|j||dS)zParse some text with this Visitor's default grammar and return the result of visiting it. ``SomeVisitor().parse('some_string')`` is a shortcut for ``SomeVisitor().visit(some_grammar.parse('some_string'))``. parse_parse_or_matchrrposs rrzNodeVisitor.parse##D#w77rc(|j||dS)a Parse and visit some text with this Visitor's default grammar, but don't insist on parsing all the way to the end. ``SomeVisitor().match('some_string')`` is a shortcut for ``SomeVisitor().visit(some_grammar.match('some_string'))``. rKrrs rrKzNodeVisitor.matchrrc|\}|S)z7Lift the sole child of ``node`` up to replace the node.r$)rryr first_childs r lift_childzNodeVisitor.lift_child s rc|js0tdj|jj||j t |j|||S)zExecute a parse or match on the default grammar, followed by a visitation. Raise RuntimeError if there is no default grammar specified. zThe {cls}.{method}() shortcut won't work because {cls} was never associated with a specific grammar. Fill out its `grammar` attribute, and try again.)clsrz)r)rc RuntimeErrorrar.r/rurs)rrr method_names rrzNodeVisitor._parse_or_matchsb||66.decoratorBs"  rr$)rrs` rruler"s@ rN)rFinspectrsysrr exceptionsrrobjectr rJrxrMrqrr$rrrsW&7h6hVKK2BM&$5BMJ#r