c*b.'ddlZddlZddlZddlmZdZGddejddZddZddZ e ed rd Z nd Z d Z d Z deejDZdZdeejDZdeejDhdzZdZdZdZdZdZdZeZdZdZdZGddeZdS)N) iteritemscptj|dt|dS)zRReturns a human-friendly representation of a token with the given type and string.:u)tokentok_namereprlstrip)tok_typestrings .lib/python3.11/site-packages/asttokens/util.py token_reprrs3N8,,,d6ll.A.A#.F.F.F GGceZdZdZdZdS)Tokena TokenInfo is an 8-tuple containing the same 5 fields as the tokens produced by the tokenize module, and 3 additional ones useful for this module: - [0] .type Token type (see token.py) - [1] .string Token (a string) - [2] .start Starting (row, column) indices of the token (a 2-tuple of ints) - [3] .end Ending (row, column) indices of the token (a 2-tuple of ints) - [4] .line Original line (string) - [5] .index Index of the token in the list of tokens that it belongs to. - [6] .startpos Starting character offset into the input text. - [7] .endpos Ending character offset into the input text. c6t|j|jSN)rtyper selfs r __str__z Token.__str__)s di - --rN)__name__ __module__ __qualname____doc__rrr rrs-  .....rrz0type string start end line index startpos endposc6|j|ko|dup |j|kS)zVReturns true if token is of the given type and, if a string is given, has that string.N)rr rr tok_strs r match_tokenr -s$ x  PW_%O 8OPrc t|||sOtdt||dt|d|jdd|jddzdS)z Verifies that the given token is of the expected type. If tok_str is given, the token string is verified too. If the token doesn't match, raises an informative ValueError. zExpected token z, got z on line rz col N)r ValueErrorrstrstartrs r expect_tokenr&2sw UHg . .+ *7####SZZZZ k!nnnek!nq((* + ++++rENCODINGcL|tjtjtjfvSzW These are considered non-coding tokens, as they don't affect the syntax tree. )rNLCOMMENTr' token_types r is_non_coding_tokenr.?s %(EM5>B BBrc"|tjkSr))rN_TOKENSr,s r r.r.Es  ''rc>t|drtntS)z Returns a function which yields all direct children of a AST node, skipping children that are singleton nodes. The function depends on whether ``node`` is from ``ast`` or from the ``astroid`` module. get_children)hasattriter_children_astroiditer_children_astnodes r iter_children_funcr8Ls #*$"?"? V  EVVrcLt|rgS|Sr) is_joined_strr2r6s r r4r4Us)4 I    rc h|]c\}}t|tt|tjtjtjtjtjfa|dSr) isinstancer issubclassast expr_contextboolopoperatorunaryopcmpop.0ncs r rH]skcccDAqz!T7J7JcS-sz3<VYV_`aacacccrc# Kt|rdSt|tjr,t |j|jD]\}}||V|VdStj|D]}|jtvr|VdSr) r:r<r>Dictzipkeysvaluesiter_child_nodes __class__ SINGLETONS)r7keyvaluechilds r r5r5`s4  Fch DIt{33 e  kkkk F#D))e j(( kkk rcvh|]6\}}t|tt|tj4|7Sr)r<rr=r>stmtrDs r rHrHvsVHHH$!Q!!T**H/9!SX/F/FHAHHHrcvh|]6\}}t|tt|tj4|7Sr)r<rr=r>exprrDs r rHrHxsVHHH41a!!T**H/9!SX/F/FHQHHHr>ConstDelAttrDelName AssignAttr AssignNamec(|jjtvS)z+Returns whether node is an expression node.)rOrexpr_class_namesr6s r is_exprr_~  $4 44rc(|jjtvS)z)Returns whether node is a statement node.)rOrstmt_class_namesr6s r is_stmtrcr`rc"|jjdkS)z&Returns whether node is a module node.ModulerOrr6s r is_modulergs  H ,,rc"|jjdkS)zFReturns whether node is a JoinedStr node, used to represent f-strings. JoinedStrrfr6s r r:r:s  K //rc"|jjdkS)z2Returns whether node is a starred expression node.Starredrfr6s r is_starredrls  I --rc|jjdvp6|jjdko&ttt|jS)z?Returns whether node represents a slice, e.g. `1:2` in `x[1:2]`)SliceExtSliceTuple)rOranymapis_sliceeltsr6s r rsrssE  n!66 . !W , ,#h **++ rc|sd}t|}t}d}|dtfg}|r|\}}} | tur~||vsJ|||||\} } |||| ft |} ||D] } || | | tf!n |||| }||S)a5 Scans the tree under the node depth-first using an explicit stack. It avoids implicit recursion via the function call stack to avoid hitting 'maximum recursion depth exceeded' error. It calls ``previsit()`` and ``postvisit()`` as follows: * ``previsit(node, par_value)`` - should return ``(par_value, value)`` ``par_value`` is as returned from ``previsit()`` of the parent. * ``postvisit(node, par_value, value)`` - should return ``value`` ``par_value`` is as returned from ``previsit()`` of the parent, and ``value`` is as returned from ``previsit()`` of this node itself. The return ``value`` is ignored except the one for the root node, which is returned from the overall ``visit_tree()`` call. For the initial node, ``par_value`` is None. ``postvisit`` may be None. cdSrr)r7pvaluerRs r zvisit_tree..sDrN)r8set _PREVISITpopaddappendleninsert)r7previsit postvisit iter_childrendoneretstackcurrent par_valuerRrw post_valueinsrFs r visit_treers&" 100I$T**- $ # $ " #% 1 % GY  D  hhw#8GY77fj llGY 3444 JJc}W%%22! S1fi011112 Igy% 0 0c 1 *rc#"Kt|}t}|g}|rj|}||vsJ|||Vt |}||D]}||||hdSdS)a Recursively yield all descendant nodes in the tree starting at ``node`` (including ``node`` itself), using depth-first pre-order traversal (yieling parents before their children). This is similar to ``ast.walk()``, but with a different order, and it works for both ``ast`` and ``astroid`` trees. Also, as ``iter_children()``, it skips singleton nodes generated by ``ast``. N)r8ryr{r|r~r)r7rrrrrrGs r walkrs%T**- $ &% iikkG $    HHW MMM e**C ]7 # # ll3      rcd}g}t|D]:\}}}|||||||};|||dd|S)ah Replaces multiple slices of text with new values. This is a convenience method for making code modifications of ranges e.g. as identified by ``ASTTokens.get_text_range(node)``. Replacements is an iterable of ``(start, end, new_text)`` tuples. For example, ``replace("this is a test", [(0, 4, "X"), (8, 9, "THE")])`` produces ``"X is THE test"``. rN)sortedr}join)text replacementsppartsr%endnew_texts r replacers! % &| 4 4  uc8 LLag LL AA,,tABBx rceZdZdZdZdZdS) NodeMethodsz[ Helper to get `visit_{node_type}` methods given a node's class and cache the results. ci|_dSr)_cachers r __init__zNodeMethods.__init__s DKKKrc|j|}|s collectionsrsixrr namedtuplerr r&r3r.r8r4__dict__rPr5rbr^r_rcrgr:rlrsobjectrzrrrrrrr rs  HHH ..... "K "7,^ _ _...$QQQQ ++++ 75* (CCCC (((WWWccIIcl33ccc ,HH))CL"9"9HHHHH99S\#:#:HHHOOOP 555555---000...    FHH ' ' ' V2&&r