o tBh'4 @sddlmZddlmZddlmZmZmZmZmZm Z m Z m Z m Z ddl mZmZddlmZddlmZmZgd ZGd d d eZe eZejZejZejZd Zeee ed ffZGddde ZGdddZGddde Z ddedede edefddZ GdddeZ!d S))copy)Enum) AnyCallable CollectionDictList NamedTupleOptionalTupleUnion)inspectsnake_to_camel)ast)NodeQUERY_DOCUMENT_KEYS)VisitorParallelVisitor VisitorActionvisitBREAKSKIPREMOVEIDLEc@seZdZdZdZdZeZdS)VisitorActionEnumzkSpecial return values for the visitor methods. You can also use the values of this enum directly. TFN)__name__ __module__ __qualname____doc__rrEllipsisrr"r"o/var/www/html/riverr-enterprise-integrations-main/venv/lib/python3.10/site-packages/graphql/language/visitor.pyr s rN.c@sBeZdZUdZeedeefed<eedeefed<dS)EnterLeaveVisitorz0Visitor with functions for entering and leaving..enterleaveN)rrrr r rr__annotations__r"r"r"r#r$8s r$c seZdZUdZeeeef\ZZZZee e fe d<dfdd Z dddZ d e de fd d Z dd e d edeedeeffddZZS)raVisitor that walks through an AST. Visitors can define two generic methods "enter" and "leave". The former will be called when a node is entered in the traversal, the latter is called after visiting the node and its child nodes. These methods have the following signature:: def enter(self, node, key, parent, path, ancestors): # The return value has the following meaning: # IDLE (None): no action # SKIP: skip visiting this node # BREAK: stop visiting altogether # REMOVE: delete this node # any other value: replace this node with the returned value return def leave(self, node, key, parent, path, ancestors): # The return value has the following meaning: # IDLE (None) or SKIP: no action # BREAK: stop visiting altogether # REMOVE: delete this node # any other value: replace this node with the returned value return The parameters have the following meaning: :arg node: The current node being visiting. :arg key: The index or key to this node from the parent node or Array. :arg parent: the parent immediately above this node, which may be an Array. :arg path: The key path to get to this node from the root node. :arg ancestors: All nodes and Arrays visited before reaching parent of this node. These correspond to array indices in ``path``. Note: ancestors includes arrays which contain the parent of visited node. You can also define node kind specific methods by suffixing them with an underscore followed by the kind of the node to be visited. For instance, to visit ``field`` nodes, you would defined the methods ``enter_field()`` and/or ``leave_field()``, with the same signature as above. If no kind specific method has been defined for a given node, the generic method is called. enter_leave_mapreturnNcst|jD]C\}}|drq |dd}t|dkr#d}n|\}}|dvrM|rMt|d}tt |d}|rEt |t rEt |t sMtd|dq dS) z+Verify that all defined handlers are valid._rr N)r%r&rzInvalid AST node kind: .)super__init_subclass____dict__items startswithsplitlenrgetattrr isinstancetype issubclassr TypeError)clsattrval attr_kindkindnamenode_cls __class__r"r#r-ms(       zVisitor.__init_subclass__cCs i|_dSN)r()selfr"r"r#__init__s zVisitor.__init__r<cCs|z|j|WSty=t|d|d}|st|dd}t|d|d}|s/t|dd}t||}||j|<|YSw)>Given a node kind, return the EnterLeaveVisitor for that kind.enter_Nr%leave_r&)r(KeyErrorr3r$)rBr<enter_fnleave_fn enter_leaver"r"r#get_enter_leave_for_kinds      z Visitor.get_enter_leave_for_kindF is_leaving.cCs||}|r |jS|jS)zGet the visit function for the given node kind and direction. .. deprecated:: 3.2 Please use ``get_enter_leave_for_kind`` instead. Will be removed in v3.3. )rKr&r%)rBr<rLrJr"r"r# get_visit_fns zVisitor.get_visit_fn)r)N)F)rrrr rrrrrstrr$r'r-rCrKboolr rrrM __classcell__r"r"r?r#r?s ) rc@sVeZdZUdZeed<eed<eedfed<e ee ee fefed<e ed<dS) StackzA stack for the visit function.in_arrayidx.keyseditsprevN) rrrr rOr'intr rrr rNrr"r"r"r#rQs  rQrootvisitor visitor_keysr)cCs"t|tstdt|dt|tstdt|d|dur$t}d}d}|f}d}g}|}d} d} g} | j} | j} g}|j}|j} |d7}|t|k}|oS|}|r|r\| dnd} | }|re|nd} |r|rt |}d }|D]\}}||}|t us|t ur|||d7}qs|||<qst |}nt |}|D] \}}t|||q|j}|j}|j}|j}|j}n| r|r|} | | }n ||} t| | d}|durqE| | t|t rd}ndt|tstd t|d||j}|r|jn|j}|r@||| | | |}|tus|durnu|tus|dur#|s"| qEn|dur?|| |f|s?t|tr;|}n| qEnd}|durQ|rQ|| |f|r[| rZ| n&t|||||}t|t }|rm|n||jd }d}g}| r|| |} |snqF|r|ddS|S) aVisit each node in an AST. :func:`~.visit` will walk through an AST using a depth-first traversal, calling the visitor's enter methods at each node in the traversal, and calling the leave methods after visiting that node and all of its child nodes. By returning different values from the enter and leave methods, the behavior of the visitor can be altered, including skipping over a sub-tree of the AST (by returning False), editing the AST by returning a value or None to remove the value, or to stop the whole traversal by returning :data:`~.BREAK`. When using :func:`~.visit` to edit an AST, the original AST will not be modified, and a new version of the AST with the changes applied will be returned from the visit function. To customize the node attributes to be used for traversal, you can provide a dictionary visitor_keys mapping node kinds to node attributes. zNot an AST Node: r+zNot an AST Visitor: NFTrrzInvalid AST Node: r")r4rr7rrrappendpopr2listrr!tuplersetattrrSrTrUrRrVr3rKr<r&r%rrrQget)rXrYrZstackrRrTrSrUnodekeyparentpath path_appendpath_pop ancestorsancestors_append ancestors_poprL is_edited edit_offsetedit_key edit_value array_keyresultrJvisit_fnr"r"r#rs                 X rcs<eZdZdZdeeffdd ZdedefddZ Z S) rzA Visitor which delegates to many visitors to run in parallel. Each visitor will be visited for each node before moving on. If a prior visitor edits a node, no following visitors will see that node. visitorscs$t||_dgt||_dS)z>Create a new visitor from the given list of parallel visitors.N)r,rCrsr2skipping)rBrsr?r"r#rC;s zParallelVisitor.__init__r<r)c szj|WStygd}ggjD]}||\}}|s'|s%|r'd}||q|rUdtdtdttffdd }dtdtdttffdd }nd }}t ||}|j|<|YSw) rDFTrcargsr)cs|j}tD]4\}}||s;|r;||g|R}|tus!|dur&|||<q|tus.|dur3t||<q|dur;|SqdS)NFT)rt enumeraterrrcrurtifnrq) enter_listrBr"r#r%Rs  z7ParallelVisitor.get_enter_leave_for_kind..entercsj}tD]:\}}||s7|r6||g|R}|tus!|dur&t||<q|dur6|tur6|dur6|Sq|||urAd||<qdS)NTF)rtrvrrrw) leave_listrBr"r#r&`s   z7ParallelVisitor.get_enter_leave_for_kind..leaveN) r(rGrsrKr\rrr rr$)rBr< has_visitorrYr%r&rJr")rzr{rBr#rKAs(       "  z(ParallelVisitor.get_enter_leave_for_kind) rrrr rrrCrNr$rKrPr"r"r?r#r3srrA)"renumrtypingrrrrrr r r r pyutilsrrrrr__all__rrrrrrrN VisitorKeyMapr$rrQrrr"r"r"r#s: ,   a