o DDi@sddlmZmZddlmZddlmZddlmZddl m Z m Z ddl m Z er0ddlmZedZGd d d e eZGd d d e eZd S)) TYPE_CHECKINGUnion)FlattenSentinel)MetadataDependent)RemovalSentinel)CSTTypedTransformerFunctionsCSTTypedVisitorFunctions)CSTNodeT)CSTNode)CSTTransformer CSTVisitorc @sreZdZdZdddefddZdededeeee effd d Z ddd e dd fd dZ ddd e dd fddZ d S)r aB The low-level base visitor class for traversing a CST and creating an updated copy of the original CST. This should be used in conjunction with the :func:`~libcst.CSTNode.visit` method on a :class:`~libcst.CSTNode` to visit each element in a tree starting with that node, and possibly returning a new node in its place. When visiting nodes using a :class:`CSTTransformer`, the return value of :func:`~libcst.CSTNode.visit` will be a new tree with any changes made in :func:`~libcst.CSTTransformer.on_leave` calls reflected in its children. noder returncC>t|dt|jd}|dur||}nd}|durdSdSz Called every time a node is visited, before we've visited its children. Returns ``True`` if children should be visited, and returns ``False`` otherwise. visit_NTFgetattrtype__name__selfr visit_funcretvalrI/var/www/Datamplify/venv/lib/python3.10/site-packages/libcst/_visitors.pyon_visit#  zCSTTransformer.on_visit original_node updated_nodecCs.t|dt|jd}|dur|||}|S)a{ Called every time we leave a node, after we've visited its children. If the :func:`~libcst.CSTTransformer.on_visit` function for this node returns ``False``, this function will still be called on that node. ``original_node`` is guaranteed to be the same node as is passed to :func:`~libcst.CSTTransformer.on_visit`, so it is safe to do state-based checks using the ``is`` operator. Modifications should always be performed on the ``updated_node`` so as to not overwrite changes made by child visits. Returning :attr:`RemovalSentinel.REMOVE` indicates that the node should be removed from its parent. This is not always possible, and may raise an exception if this node is required. As a convenience, you can use :func:`RemoveFromParent` as an alias to :attr:`RemovalSentinel.REMOVE`. leave_Nr)rrr leave_funcrrron_leave2s zCSTTransformer.on_leave attributeNcC6t|dt|jd|d}|dur||dSdSa Called before a node's child attribute is visited and after we have called :func:`~libcst.CSTTransformer.on_visit` on the node. A node's child attributes are visited in the order that they appear in source that this node originates from. r_Nrrr r#rrrron_visit_attributeK z!CSTTransformer.on_visit_attributecCr$)aF Called after a node's child attribute is visited and before we have called :func:`~libcst.CSTTransformer.on_leave` on the node. Unlike :func:`~libcst.CSTTransformer.on_leave`, this function does not allow modifications to the tree and is provided solely for state management. r r&Nrrrr#r!rrron_leave_attributeVs   z!CSTTransformer.on_leave_attribute)r __module__ __qualname____doc__boolrr rrrr"strr(r+rrrrr s   r c@sXeZdZdZdddefddZdd d Zddd eddfd d Zddd eddfddZ dS)r a The low-level base visitor class for traversing a CST. This should be used in conjunction with the :func:`~libcst.CSTNode.visit` method on a :class:`~libcst.CSTNode` to visit each element in a tree starting with that node. Unlike :class:`CSTTransformer`, instances of this class cannot modify the tree. When visiting nodes using a :class:`CSTVisitor`, the return value of :func:`~libcst.CSTNode.visit` will equal the passed in tree. r r rcCrrrrrrrrrrzCSTVisitor.on_visitrNcCs0t|dt|jd}|dur||dSdS)z Called every time we leave a node, after we've visited its children. If the :func:`~libcst.CSTVisitor.on_visit` function for this node returns ``False``, this function will still be called on that node. r Nr)rrr!rrrr"s zCSTVisitor.on_leaver#cCr$r%rr'rrrr(r)zCSTVisitor.on_visit_attributecCr$)z Called after a node's child attribute is visited and before we have called :func:`~libcst.CSTVisitor.on_leave` on the node. r r&Nrr*rrrr+s  zCSTVisitor.on_leave_attribute)rr rN) rr,r-r.r/rr"r0r(r+rrrrr fs    r N)typingrrlibcst._flatten_sentinelrlibcst._metadata_dependentrlibcst._removal_sentinelrlibcst._typed_visitorrr libcst._typesr libcst._nodes.baser CSTVisitorTr r rrrrs     P