c*b.' ddlZddlZddlZddlmZdZGddej ddZddZddZ e ed rd Z nd Z d Z d Z eejDchc]Q\}}e|ese|ej$ej&ej(ej*ej,fr|Sc}}ZdZeejDchc]#\}}e|ere|ej2r|%c}}ZeejDchc]#\}}e|ere|ej6r|%c}}hdzZdZdZdZdZ dZ!dZ"e#Z$dZ%dZ&dZ'Gdde#Z(ycc}}wcc}}wcc}}w)N) iteritemscbtj|dt|jdS)zRReturns a human-friendly representation of a token with the given type and string.:u)tokentok_namereprlstrip)tok_typestrings .lib/python3.12/site-packages/asttokens/util.py token_reprrs'NN8,d6l.A.A#.F GGceZdZdZdZy)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. cBt|j|jSN)rtyper selfs r __str__z Token.__str__)s dii --rN)__name__ __module__ __qualname____doc__rrr rrs  .rrz0type string start end line index startpos endposcN|j|k(xr|duxs|j|k(S)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|||sGtdt||dt|d|jdd|jddzy)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&2sQ UHg . 7#SZ kk!nekk!nq(* ++ /rENCODINGcd|tjtjtjfvSzW These are considered non-coding tokens, as they don't affect the syntax tree. )rNLCOMMENTr' token_types r is_non_coding_tokenr.?s" %((EMM5>>B BBrc(|tjk\Sr))rN_TOKENSr,s r r.r.Es  ''rc2t|drtStS)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 #*$"? VEVVrc<t|rgS|jSr) is_joined_strr2r6s r r4r4Us4 I   rc# Kt|ryt|tjr3t |j |j D]\}}|||ytj|D]}|jtvs|ywr) r: isinstanceastDictzipkeysvaluesiter_child_nodes __class__ SINGLETONS)r7keyvaluechilds r r5r5`sz4 chhDIIt{{3 e  k4 ##D)e j( k *s BBB>ConstDelAttrDelName AssignAttr AssignNamec:|jjtvS)z+Returns whether node is an expression node.)rCrexpr_class_namesr6s r is_exprrO~  $4 44rc:|jjtvS)z)Returns whether node is a statement node.)rCrstmt_class_namesr6s r is_stmtrSrPrc4|jjdk(S)z&Returns whether node is a module node.ModulerCrr6s r is_modulerWs  H ,,rc4|jjdk(S)zFReturns whether node is a JoinedStr node, used to represent f-strings. JoinedStrrVr6s r r:r:s  K //rc4|jjdk(S)z2Returns whether node is a starred expression node.StarredrVr6s r is_starredr\s  I --rc|jjdvxs>|jjdk(xr#ttt|j S)z?Returns whether node represents a slice, e.g. `1:2` in `x[1:2]`)SliceExtSliceTuple)rCranymapis_sliceeltsr6s r rcrcsK  nn!66 .. ! !W , ,#h *+ rcz|sd}t|}t}d}|dtfg}|r|j\}}} | turi||vsJ|j ||||\} } |j ||| ft |} ||D]} |j| | | tfn |||| }|r|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. cyrr)r7pvaluerFs r zvisit_tree..sDrN)r8set _PREVISITpopaddappendleninsert)r7previsit postvisit iter_childrendoneretstackcurrent par_valuerFrg post_valueinsns r visit_treer{s" 0I$T*- $ # $ " #% % GY  D   hhw#GY7fj llGY 34 JcW%! S1fi01& gy% 0c  *rc#Kt|}t}|g}|rY|j}||vsJ|j||t |}||D]}|j |||rXyyw)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)r8rirkrlrnro)r7rrrsrurvrycs r walkr~sz%T*- $ &% iikG $  HHW M e*C 7 # ll3$ s A2A75A7cd}g}t|D]-\}}}|j||||j||}/|j||ddj|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)sortedrmjoin)text replacementsppartsr%endnew_texts r replacersi! % &| 4uc8 LLa LL A!5,,tABx rceZdZdZdZdZy) NodeMethodsz[ Helper to get `visit_{node_type}` methods given a node's class and cache the results. ci|_yr)_cachers r __init__zNodeMethods.__init__s DKrc|jj|}|sCd|jjz}t |||j }||j|<|S)z Using the lowercase name of the class as node_type, returns `obj.visit_{node_type}`, or `obj.visit_default` if the type-specific method is not found. visit_)rgetrlowergetattr visit_default)robjclsmethodnames r rzNodeMethods.getsW [[__S !F   **, ,dsD#"3"34fdkk# MrN)rrrrrrrrr rrs rrr))r= collectionsrsixrr namedtuplerr r&r3r.r8r4__dict__r<r issubclass expr_contextboolopoperatorunaryopcmpoprDr5stmtrRexprrNrOrSrWr:r\rcobjectrjr{r~rr)rzr}s00r rs  H . "K " "7,^ _.$Q + 5*C (W&cll3c3DAqz!T7JS--szz3<<VYV_V_`a3c ,#,CLL"9H"9$!Q!!T*z!SXX/F"9H#,S\\#:H#:41a!!T*z!SXX/F#:HOP 55-0.  H ' V2&&Ac2HHs%E77AE7(E=(F