cp ddlZddlZddlTddlmZ ddlmZn<#e$r4ejdksJededde de de de de d ed d iZYnwxYwdd ZdZGddejZdZdZdS)N)*) fscommands)_const_node_type_names NameConstantNumStrBytes.Ellipsisct|trtj|}d|vr*|dddd}|ds|dz } t j|g|Rd|i|S#ttf$r7}t}d|_ ||_ t||_ |d}~wwxYw)N s  filename) isinstancestrrunicode_to_file_datareplaceendswithastparse TypeError ValueError SyntaxErrorlinenormsg)sourcerargskwargseerrors -lib/python3.11/site-packages/rope/base/ast.pyrrs&#9088 F//77uEE ??5 ! !%yDTDDD(DVDDD z "  !FF  s3B C2C  Ccr||}|s'tj|D]}t||dSdS)a Pre-order depth-first traversal of AST nodes, calling `callback(node)` for each node visited. When each node is visited, `callback(node)` will be called with the visited `node`, then its children node will be visited. If `callback(node)` returns `True` for a node, then the descendants of that node will not be visited. See _ResultChecker._find_node for an example. N)riter_child_nodescall_for_nodes)nodecallbackresultchilds r%r(r()sZXd^^F ,)$// , ,E 5( + + + +,, , ,ceZdZdZdS)RopeNodeVisitorcbd|jjz}t|||j}||S)zMModified from ast.NodeVisitor to match rope's existing Visitor implementation_) __class____name__getattr generic_visit)selfr)methodvisitors r%visitzRopeNodeVisitor.visit=s3t~..$(:;;wt}}r-N)r3 __module__ __qualname__r9r-r%r/r/<s#r-r/ctjdks Jdt|tjsJt t |jS)zGet pre-3.8 ast node namerz2This should only be called in Python 3.8 and above)sys version_inforrConstantrtypevaluer)s r%get_const_subtype_namerDDsN  v %[['[[[[ dCL ) )))) !$tz"2"2 33r-clt|tjrt|n |jjS)N)rrr@rDr2r3rCs r%get_node_type_namerFMs3 dCL ) ) %t$$$ ^ $r-)r)rr> rope.baserr ImportErrorr?boolrAintfloatcomplexrbytesrr( NodeVisitorr/rDrFr<r-r%rOs;  *******     f $$$$ n T N U u U w S :  ",,,&co444s6AA