o DDiK@sUddlmZmZddlmZddlmZmZmZm Z ddl m Z m Z m Z mZmZmZmZmZmZddlmZddlmZddlmZddlmZdd lmZdd lmZm Z m!Z!ed d d Z"dZ#ed e$d<Gddde%Z&Gddde%Z'Gddde Z(GdddeZ)GdddeZ*GdddeZ+de,de-fddZ.d ee,de-fd!d"Z/de-de-fd#d$Z0d%e,de,fd&d'Z1ed(d)Gd*d d eZ2Gd+d,d,e2eZ3Gd-d.d.e3eZ4d/S)0)ABCabstractmethod)deepcopy) dataclassfieldfieldsreplace) AnycastClassVarDictListMappingSequenceTypeVarUnion)FlattenSentinel) CodegenState)RemovalSentinel)is_value_of_type)CSTNodeT)CSTTransformer CSTVisitor CSTVisitorT _CSTNodeSelfTCSTNode)bound_EMPTY_SEQUENCEc@ eZdZdS)CSTValidationErrorN__name__ __module__ __qualname__rrrK/var/www/Datamplify/venv/lib/python3.10/site-packages/libcst/_nodes/base.pyr r c@r)CSTCodegenErrorNr!rrrr%r'r&r'c@s(eZdZd ddZdddefddZdS) _ChildrenCollectionVisitorreturnNcCs g|_dSN)childrenselfrrr%__init__s z#_ChildrenCollectionVisitor.__init__nodercCs|j|dS)NF)r+appendr-r/rrr%on_visit"s z#_ChildrenCollectionVisitor.on_visitr)N)r"r#r$r.boolr2rrrr%r(s r(c@sZeZdZdddedefddfddZdddefd d Zd dd ddedeffd dZdS)_ChildReplacementTransformerold_nodernew_noder)NcC||_||_dSr*r6r7)r-r6r7rrr%r.(s z%_ChildReplacementTransformer.__init__r/cC ||juSr*r6r1rrr%r2. z%_ChildReplacementTransformer.on_visit original_node updated_nodecCs||jur|jS|Sr*r9r-r=r>rrr%on_leave3s z%_ChildReplacementTransformer.on_leave) r"r#r$rrr.r4r2r@rrrr%r5's    r5c@sFeZdZdddeeefddfddZdddefd d Zdd dZ dS)_ChildWithChangesTransformerr6rchangesr)NcCr8r*)r6rB)r-r6rBrrr%r.<s z%_ChildWithChangesTransformer.__init__r/cCr:r*r;r1rrr%r2@r<z%_ChildWithChangesTransformer.on_visitr=r>cCs ||jur|jdi|jS|S)Nr)r6 with_changesrBr?rrr%r@Es z%_ChildWithChangesTransformer.on_leave)r=rr>rr)r) r"r#r$rstrr r.r4r2r@rrrr%rA;srAc@r) _NOOPVisitorNr!rrrr%rEKr&rEvaluer)cCs$t|tst|trt|St|Sr*) isinstancerDr_pretty_repr_sequencereprrFrrr% _pretty_reprOsrKseqcCs.t|dkrdSddgdd|DdS)Nrz[] [cSsg|] }tt|dqS),)_indentrI).0elrrr% Zsz)_pretty_repr_sequence..])lenjoin)rLrrr%rHVs rHcCsddd|dDS)NrMcss|]}d|VqdS)z Nr)rQlinerrr% ^sz_indent..)rVsplitrJrrr%rP]srPvalcCs&z|WStyt|YSwr*) deep_cloneAttributeErrorr)rZrrr%_cloneas    r]T)frozenc seZdZUdZeeeed<d8ddZe de ddffdd Z d8d d Z d8d d Z d8ddZededfddZdededeeeeeffddZededdfddZdefddZededdfddZdede ddfddZdede defd d!Zdedefd"d#Zd$ddefd%d&Z ded'dd(e!deee!ffd)d*Z"ded'ddeeeffd+d,Z#ded'dde defd-d.Z$ded$e%defd/d0Z&de'fd1d2Z(defd3d4Z)e d5e%de%de fd6d7Z*Z+S)9rr __slots__r)NcCs |dSr*) _validater,rrr% __post_init__rs zCSTNode.__post_init__kwargsc sPtjdi|d|jvrtj|_d|jvrtj|_d|jvr&tj|_dSdS)ae HACK: Add our implementation of `__repr__`, `__hash__`, and `__eq__` to the class's __dict__ to prevent dataclass from generating it's own `__repr__`, `__hash__`, and `__eq__`. The alternative is to require each implementation of a node to remember to add `repr=False, eq=False`, which is more error-prone. __repr____eq____hash__Nr)super__init_subclass____dict__rrcrdre)clsrb __class__rr%rgws    zCSTNode.__init_subclass__cCdS)a Override this to perform runtime validation of a newly created node. The function is called during `__init__`. It should check for possible mistakes that wouldn't be caught by a static type checker. If you can't use a static type checker, and want to perform a runtime validation of this node's types, use `validate_types` instead. Nrr,rrr%r`s zCSTNode._validatecCsbt|D]*}t||j}t||js.td|jdt|jd|jddt|qdS)a  Compares the type annotations on a node's fields with those field's actual values at runtime. Raises a TypeError is a mismatch is found. Only validates the current node, not any of it's children. For a recursive version, see :func:`validate_types_deep`. If you're using a static type checker (highly recommended), this is useless. However, if your code doesn't use a static type checker, or if you're unable to statically type your code for some reason, you can use this method to help validate your tree. Some (non-typing) validation is done unconditionally during the construction of a node. That validation does not overlap with the work that :func:`validate_types_deep` does. zExpected an instance of z on z's 'z' field, but instead got zan instance of N)rgetattrnamertype TypeErrorr")r-frFrrr%validate_types_shallows     zCSTNode.validate_types_shallowcCs ||jD]}|qdS)z` Like :func:`validate_types_shallow`, but recursively validates the whole tree. N)rrr+validate_types_deep)r-chrrr%rss  zCSTNode.validate_types_deepcCst}|||jS)a The immediate (not transitive) child CSTNodes of the current node. Various properties on the nodes, such as string values, will not be visited if they are not a subclass of CSTNode. Iterable properties of the node (e.g. an IndentedBlock's body) will be flattened into the children's sequence. The children will always be returned in the same order that they appear lexically in the code. )r(_visit_and_replace_childrenr+r-visitorrrr%r+s zCSTNode.childrenr-rwcCsv||}|rtt||}n|}t|tr|||}n|||}t|ttt fs9t ddt |j |S)z Visits the current node, its children, and all transitive children using the given visitor's callbacks. z6Expected a node of type CSTNode or a RemovalSentinel, zbut got a return value of ) r2r rrurGrr@rrr Exceptionror")r-rwshould_visit_childrenwith_updated_children leave_resultrrr%visits"     z CSTNode.visitcCrl)a Intended to be overridden by subclasses to provide a low-level hook for the visitor API. Don't call this directly. Instead, use `visitor.visit_and_replace_node` or `visitor.visit_and_replace_module`. If you need list of children, access the `children` property instead. The general expectation is that children should be visited in the order in which they appear lexically. Nrrvrrr%rus z#CSTNode._visit_and_replace_childrencCrl)z Intended to be overridden by nodes that will be iterated over inside Module and IndentedBlock. Returning true signifies that this node is essentially useless and can be dropped when doing a visit across it. Frr,rrr% _is_removableszCSTNode._is_removablestatecCsdSr*rr-r~rrr% _codegen_impl&szCSTNode._codegen_implcKs*|||j|fi|||dSr*)before_codegenr after_codegen)r-r~rbrrr%_codegen)s zCSTNode._codegenrBcKst|fi|S)a A convenience method for performing mutation-like operations on immutable nodes. Creates a new object of the same type, replacing fields with values from the supplied keyword arguments. For example, to update the test of an if conditional, you could do:: def leave_If(self, original_node: cst.If, updated_node: cst.If) -> cst.If: new_node = updated_node.with_changes(test=new_conditional) return new_node ``new_node`` will have the same ``body``, ``orelse``, and whitespace fields as ``updated_node``, but with the updated ``test`` field. The accepted arguments match the arguments given to ``__init__``, however there are no required or positional arguments. TODO: This API is untyped. There's probably no sane way to type it using pyre's current feature-set, but we should still think about ways to type this or a similar API in the future. )r)r-rBrrr%rC.szCSTNode.with_changesc Csi}t|D];}|j}|ddkrqt||}t|ttfr%t|||<qz tdd|D||<WqtyAt|||<Yqwt |di|S)aY Recursively clone the entire tree. The created tree is a new tree has the same representation but different identity. >>> tree = cst.parse_expression("1+2") >>> tree.deep_clone() == tree False >>> tree == tree True >>> tree.deep_equals(tree.deep_clone()) True r_css|]}t|VqdSr*)r])rQvrrr%rXesz%CSTNode.deep_clone..Nr) rrnrmrGrDbytesr]tuplerpro)r- cloned_fieldsrkeyrZrrr%r[Fs    zCSTNode.deep_cloneothercCsddlm}|||S)z Recursively inspects the entire tree under ``self`` and ``other`` to determine if the two trees are equal by representation instead of identity (``==``). r) deep_equals)libcst._nodes.deep_equalsr)r-rdeep_equals_implrrr%rks  zCSTNode.deep_equalsr6r7cC*|t||}t|ttfrtd|S)a Recursively replaces any instance of ``old_node`` with ``new_node`` by identity. Use this to avoid nested ``with_changes`` blocks when you are replacing one of a node's deep children with a new node. Note that if you have previously modified the tree in a way that ``old_node`` appears more than once as a deep child, all instances will be replaced. )Logic error, cannot get a *Sentinel here!)r|r5rGrrrx)r-r6r7new_treerrr% deep_replacets zCSTNode.deep_replacecCs(|t|tj}t|trtd|S)z Recursively removes any instance of ``old_node`` by identity. Note that if you have previously modified the tree in a way that ``old_node`` appears more than once as a deep child, all instances will be removed. z/Logic error, cannot get a FlattenSentinel here!)r|r5rREMOVErGrrx)r-r6rrrr% deep_removes   zCSTNode.deep_removecKr)a A convenience method for applying :attr:`with_changes` to a child node. Use this to avoid chains of :attr:`with_changes` or combinations of :attr:`deep_replace` and :attr:`with_changes`. The accepted arguments match the arguments given to the child node's ``__init__``. TODO: This API is untyped. There's probably no sane way to type it using pyre's current feature-set, but we should still think about ways to type this or a similar API in the future. r)r|rArGrrrx)r-r6rBrrrr%with_deep_changesszCSTNode.with_deep_changescCs||uS)a CSTNodes are only treated as equal by identity. This matches the behavior of CPython's AST nodes. If you actually want to compare the value instead of the identity of the current node with another, use `node.deep_equals`. Because `deep_equals` must traverse the entire tree, it can have an unexpectedly large time complexity. We're not exposing value equality as the default behavior because of `deep_equals`'s large time complexity. r)r-rrrr%rds zCSTNode.__eq__cCst|Sr*)idr,rrr%reszCSTNode.__hash__cCstt|dkrt|jdSt|jdg}t|D]}|j}|ddkrszCSTNode.field..)default_factory)r)rirrbrrr%rs z CSTNode.fieldr3),r"r#r$r_r rrD__annotations__ra classmethodr rgr`rrrspropertyr+rrrrrr|rrur4r}rrrrCr[rrrrrobjectrdintrercr __classcell__rrrjr%rnsp     =%       c@s<eZdZdZedeefddZdede defddZ d S) BaseLeafrr)cCstSr*)rr,rrr%r+zBaseLeaf.childrenr-rwcCs|Sr*rrvrrr%rurz$BaseLeaf._visit_and_replace_childrenN) r"r#r$r_rrrr+rrrurrrr%rsrc@s0eZdZUdZdZeed<deddfddZdS) BaseValueTokenaT Represents the subset of nodes that only contain a value. Not all tokens from the tokenizer will exist as BaseValueTokens. In places where the token is always a constant value (e.g. a COLON token), the token's value will be implicitly folded into the parent CSTNode, and hard-coded into the implementation of _codegen. rrFr~r)NcCs||jdSr*) add_tokenrFrrrr%rszBaseValueToken._codegen_impl) r"r#r$__doc__r_rDrrrrrrr%rs rN)5abcrrcopyr dataclassesrrrrtypingr r r r r rrrrlibcst._flatten_sentinelrlibcst._nodes.internalrlibcst._removal_sentinelrlibcst._type_enforcer libcst._typesrlibcst._visitorsrrrrrr SyntaxErrorr r'r(r5rArErrDrKrHrPr]rrrrrrr%s8 ,        j