fE "ddlZddlZddlZddlZddlZddlZddlmZddlmZm Z m Z ddl m Z m Z mZmZmZmZmZmZmZmZmZddlmZerKddlmZGdd e ZeeefZej:dd k(reeeeeefeeefefZ n ej@Z d Z!Gd d ejDd dZ#ej:dk\r ejHZ%n GddZ%d3dZ&d3dZ'ej:dk\rdZ(ndZ(dZ)dZ*d4dZ+eejXDchc]Q\}}e-|e.se/|ej`ejbejdejfejhfr|Sc}}Z5d4dZ6eejXDchc]#\}}e-|e.re/|ejnr|%c}}Z8eejXDchc]#\}}e-|e.re/|ejr|%c}}hdzZ9dZ:dZ;dZd!Z?d"Z@eAZBd#ZCd4d$ZDd%ZEGd&d'eAZFej:dd k(rd(ZGnd)ZGd*ZHd+ZIej:dd d,k\rdd-lJmKZKeKd.d/ZLd0ZMyd1ZLd2ZMycc}}wcc}}wcc}}w)5N)ABCMeta)ModuleexprAST) CallableDictIterableIteratorListOptionalTupleUnioncastAny TYPE_CHECKING) iteritems)NodeNGceZdZdZdZdZy) EnhancedASTNr)__name__ __module__ __qualname__ first_token last_tokenlinenoI/var/www/cvtools/html/venv/lib/python3.12/site-packages/asttokens/util.pyrr!sKJ Frrcbtj|dt|jdS)zRReturns a human-friendly representation of a token with the given type and string.:u)tokentok_namereprlstrip)tok_typestrings r token_reprr*/s'NN8,d6l.A.A#.F GGrceZdZdZdZy)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)r*typer)selfs r__str__z Token.__str__Ds dii --rN)rrr__doc__r2rrrr,r,6s  .rr,z0type string start end line index startpos endpos)ceZdZeZy) AstConstantN)rrrobjectvaluerrrr7r7Ls HErr7cN|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)r/r)r$r(tok_strs r match_tokenr=Ps* 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 rN)r= ValueErrorr*strstartr;s r expect_tokenrBVsQ UHg . 7#SZ kk!nekk!nq(* ++ /r)r4cd|tjtjtjfvSzW These are considered non-coding tokens, as they don't affect the syntax tree. )r$NLCOMMENTENCODING token_types ris_non_coding_tokenrKds" %((EMM5>>B BBrc(|tjk\SrE)r$N_TOKENSrIs rrKrKks  ''rctjttgtft j |jS)z; Generates standard library tokens for the given code. )tokenizegenerate_tokensrrr@ioStringIOreadline)texts rrPrPss4  ! !$xC'8"++d:K:T:T"U VVrc2t|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 riter_children_funcr\~s#*$"? VEVVrc@|s t|rgS|jSr.) is_joined_strrV)r[include_joined_strs rrXrXs  d 3 I   rc#$K|s t|ryt|tjr3t |j |j D]\}}|||ytj|D]}|jtvs|ywr.) r^ isinstanceastrzipkeysvaluesiter_child_nodes __class__ SINGLETONS)r[r_keyr9childs rrYrYs  d 3 chhDIIt{{3 e  k ##D)e j( k s BB B>ConstDelAttrDelName AssignAttr AssignNamec:|jjtvS)z+Returns whether node is an expression node.)rgrexpr_class_namesrZs ris_exprrr  $4 44rc:|jjtvS)z)Returns whether node is a statement node.)rgrstmt_class_namesrZs ris_stmtrvrsrc4|jjdk(S)z&Returns whether node is a module node.rrgrrZs r is_modulerys  H ,,rc4|jjdk(S)zFReturns whether node is a JoinedStr node, used to represent f-strings. JoinedStrrxrZs rr^r^s  K //rc4|jjdk(S)z2Returns whether node is a starred expression node.StarredrxrZs r is_starredr~s  I --rc |jjdvxsV|jjdk(xr;tttt t j|jS)z?Returns whether node represents a slice, e.g. `1:2` in `x[1:2]`)SliceExtSlicer ) rgranymapis_slicerrbr eltsrZs rrrsX  nn!66 .. ! !W , =#hSYY 5 : :;< rc|jjdk(xrPt|tj xr3|j |j cxuxr|jcxuxrduScS)Nr)rgrrarbrloweruppersteprZs ris_empty_astroid_slicers^ nn(8sww' '8 ** 7dii 74 7 8rc|sd}t|}t}d}|dtfg}|r|j\}}} | turi||vsJ|j ||||\} } |j ||| ft |} ||D]} |j| | | tfn|||ttt| }|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. cyr.r)r[pvaluer9s rzvisit_tree..srN) r\set _PREVISITpopaddappendleninsertrr r,)r[previsit postvisit iter_childrendoneretstackcurrent par_valuer9r post_valueinsns r visit_treers$ 0I$T*- $ # $ " #% % GY  D   hhw#GY7fj llGY 34 JcW%2! S1fi012 gy$x*F Gc  *rc#Kt|}t}|g}|rZ|j}||vsJ|j||t |}|||D]}|j |||rYyyw)a1 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``. By default, ``JoinedStr`` (f-string) nodes and their contents are skipped because they previously couldn't be handled. Set ``include_joined_str`` to True to include them. N)r\rrrrr)r[r_rrrrrcs rwalkrs%T*- $ &% iikG $  HHW M e*C 7$6 7 ll3 s A3A86A8cd}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)sortedrjoin)rT replacementsppartsrAendnew_texts rreplacer1sn! % &| 4 uc8 LLa LL A ,,tABx rceZdZdZdZdZy) NodeMethodsz[ Helper to get `visit_{node_type}` methods given a node's class and cache the results. ci|_yr.)_cacher0s r__init__zNodeMethods.__init__Is 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_)rgetrrgetattr visit_default)r1objclsmethodnames rrzNodeMethods.getMsW [[__S !F   **, ,dsD#"3"34fdkk# MrN)rrrr3rrrrrrrEs rrct|Sr.)iter)original_tokenss rpatched_generate_tokensr^s   rc#PKg}|D]}|jtjtjtjfvr0|r|dj |j k(r|j|nt|D]}|g}|t|D]}|yw)a Fixes tokens yielded by `tokenize.generate_tokens` to handle more non-ASCII characters in identifiers. Workaround for https://github.com/python/cpython/issues/68382. Should only be used when tokenizing a string that is known to be valid syntax, because it assumes that error tokens are not actually errors. Combines groups of consecutive NAME, NUMBER, and/or ERRORTOKEN tokens into a single NAME token. N) r/rONAME ERRORTOKENNUMBERrrArcombine_tokens)rgrouptokcombined_tokens rrrbs E  ((x}}h&9&98??K KE"IMMSYY6 S,U3 N    )/ sB$B&cLtd|Dr&t|Dchc]}|jc}dk7r|Stjtj dj d|D|dj|dj|djgScc}w)Nc3VK|]!}|jtjk(#ywr.)r/rOr).0rs r z!combine_tokens..}s@3sxx8...@s')rrc34K|]}|jywr.)r))rts rrz!combine_tokens..s/Aqxx/srr)r/r)rArline) rrrrO TokenInforrrAr)rrs rrr{s @%@ @C]bHcVYHcDdhiDi l ]]ww///Ahnn "IMM 1X]]  IdsB!ct||Dcgc]&}t|st|jdvr|(}}|rt |dS|Scc}w)zq If the given AST node contains multiple statements, return the last one. Otherwise, just return the node. ) excepthandler ExceptHandler match_case MatchCase TryExcept TryFinallyr)r\rvr/r last_stmt)r[rj child_stmtss rrrsi0)$/5 u~e--2  +  [_ %% + s+A)r4) lru_cache)maxsizec~dtj}tj|Dcgc]}t|tjs|!}}|Dcgc]}|j |j f}}tt|t|k(}tfd|D}|xr|Scc}wcc}w)a The positions attached to nodes inside f-string FormattedValues have some bugs that were fixed in Python 3.9.7 in https://github.com/python/cpython/pull/27729. This checks for those bugs more concretely without relying on the Python version. Specifically this checks: - Values with a format spec or conversion - Repeated (i.e. identical-looking) expressions - f-strings implicitly concatenated over multiple lines. - Multiline, triple-quoted f-strings. z( f"a {b}{b} c {d!r} e {f:g} h {i:{j}} k {l:{m:n}}" f"a {b}{b} c {d!r} e {f:g} h {i:{j}} k {l:{m:n}}" f"{x + y + z} {x} {y} {z} {z} {z!a} {z:z}" f''' {s} {t} {u} {v} ''' )c3dK|]'}tj||jk()ywr.)rbget_source_segmentid)rr[sources rrz)fstring_positions_work..s/"  VT*dgg5"s-0) rbparserraNamer col_offsetrrall)treer[ name_nodesname_positionspositions_are_uniquecorrect_source_segmentsrs @rfstring_positions_workrs F 99V D#&88D>P4Zchh5O$PJPAKLt{{DOO4LNLs>23s>7JJ!"" ;$;;QLsB5B5B:ctjdk\ryt|dD]}t|tj s|j D]}t|ddt|tjs+ts't|jD]}t|dd|jsit|jddy)z Add a special attribute `_broken_positions` to nodes inside f-strings if the lineno/col_offset cannot be trusted. )r4 NT)r__broken_positions) sys version_inforrarbr{resetattrFormattedValuerr9 format_spec)r joinedstrpartrjs rannotate_fstring_nodesrs  7" $48A  3== 1"" A$)40 dC.. /')djj) 8e0$7 8   D$$&94 @ AArcy)NFrrrrrrs rcyr.r)_trees rrrsrr.)F)Nrb collectionsrQrr$rOabcrrrrtypingrrr r r r r rrrrsixrastroid_compatrrAstNoderintr@rr* namedtupler,Constantr7r=rBrKrPr\rX__dict__rar/ issubclass expr_contextboolopoperatorunaryopcmpoprhrYstmtrurqrrrvryr^r~rrr8rrrrrrrr functoolsrrr)rrs00rr s  !!mmmm$C +v% &'aAc3c3hsCx#EFI""IH. "K " "7,^ _.&v +Q +vC(WW&cll3cDAqz!T7JS--szz3<<VYV_V_`ac ,#,CLL"9H$!Q!!T*z!SXX/FH#,S\\#:H41a!!T*z!SXX/FHOP 5 5 - 0.  H ( V:(&,A!!2 ,BQ6!! T<<>A6 e c4HHsI?*AI? (J (J