MhCTUddlZddlZddlZddlZddlZddlZddlmZddlmZm Z m Z ddl m Z ddl mZmZmZmZmZmZmZmZmZmZmZmZer%ddlmZGdd e ZeeefZejZd ZGd d ej d d Z!d2dZ"d2dZ#dZ$dZ%dZ&d3dZ'dej()DZ*d3dZ+dej()DZ,dej()DhdzZ-dZ.dZ/dZ0dZ1dZ2ej3fZ4eedfe5d < dd!l6m7Z7e4e7fz Z4n #e8$rYnwxYwd"Z9d#Z:d$Z;d%ZZ?d'Z@d3d(ZAd)ZBGd*d+ZCd,ZDd-ZEd.ZFe d/d0ZGd1ZHdS)4N)ABCMeta)ModuleexprAST) lru_cache) CallableDictIterableIteratorListOptionalTupleUnioncastAny TYPE_CHECKINGType)NodeNGceZdZdZdZdZdS) EnhancedASTNr)__name__ __module__ __qualname__ first_token last_tokenlinenoN/var/www/html/test/jupyter/venv/lib/python3.11/site-packages/asttokens/util.pyrr,sKJ FFFrrcptj|dt|dS)zRReturns a human-friendly representation of a token with the given type and string.:u)tokentok_namereprlstrip)tok_typestrings r token_reprr*7s3N8,,,d6ll.A.A#.F.F.F GGrceZdZdZdZdS)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)r*typer)selfs r __str__z Token.__str__Ls di - --rN)rrr__doc__r2rrr r,r,>s-  .....rr,z0type 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)r/r)r$r(tok_strs r match_tokenr7Qs& 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 rN)r7 ValueErrorr*strstartr5s r expect_tokenr<Wsw UHg . .+ *7####SZZZZ k!nnnek!nq((* + ++++rcL|tjtjtjfvS)zS These are considered non-coding tokens, as they don't affect the syntax tree. )r$NLCOMMENTENCODING) token_types r is_non_coding_tokenrBcs %-@ @@rctjttgtft j|jS)z; Generates standard library tokens for the given code. )tokenizegenerate_tokensrrr:ioStringIOreadline)texts r rErEks5  !$xC'8"+d:K:K:T"U"U V VVrc>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_funcrQvs #*$"?"? V  EVVrFcP|st|rgS|Sr.) is_joined_strrK)rPinclude_joined_strs r rMrMs0  d 3 3 I    rc h|]c\}}t|tt|tjtjtjtjtjfa|dSr) isinstancer/ issubclassast expr_contextboolopoperatorunaryopcmpop.0ncs r rbskcccDAqJq$4G4GcS-sz3<VYV_`aacacccrc#K|st|rdSt|tjr,t |j|jD]\}}||V|VdStj|D]}|jtvr|VdSr.) rSrVrXr zipkeysvaluesiter_child_nodes __class__ SINGLETONS)rPrTkeyvaluechilds r rNrNs  d 3 3  Fch DIt{33 e  kkkk F#D))e j(( kkk rcvh|]6\}}t|tt|tj4|7Sr)rVr/rWrXstmtr^s r rbrbsVHHH$!Q!!T**H/9!SX/F/FHAHHHrcvh|]6\}}t|tt|tj4|7Sr)rVr/rWrXrr^s r rbrbsVHHH41a!!T**H/9!SX/F/FHQHHHr>ConstDelAttrDelName AssignAttr AssignNamec(|jjtvS)z+Returns whether node is an expression node.)rhrexpr_class_namesrOs r is_exprrw  $4 44rc(|jjtvS)z)Returns whether node is a statement node.)rhrstmt_class_namesrOs r is_stmtr{rxrc"|jjdkS)z&Returns whether node is a module node.rrhrrOs r is_moduler~s  H ,,rc"|jjdkS)zFReturns whether node is a JoinedStr node, used to represent f-strings. JoinedStrr}rOs r rSrSs  K //rc"|jjdkS)zSReturns whether node is an `Expr` node, which is a statement that is an expression.Exprr}rOs r is_expr_stmtrs  F **r.CONSTANT_CLASSES)rpc,t|tS)z(Returns whether node is a Constant node.)rVrrOs r is_constantrs D* + ++rc<t|o |jtuS)z)Returns whether node is an Ellipsis node.)rrkEllipsisrOs r is_ellipsisrs T   5tzX55rc"|jjdkS)z2Returns whether node is a starred expression node.Starredr}rOs r is_starredrs  I --rc |jjdvpN|jjdko>tttt t j|jS)z?Returns whether node represents a slice, e.g. `1:2` in `x[1:2]`)SliceExtSlicer) rhranymapis_slicerrXreltsrOs r rrsR  n!66 . !W , =#hSY 5 5 :;;<< rc|jjdko:t|tj o|j|jcxuo |jcxuoduncS)Nr)rhrrVrXrloweruppersteprOs r is_empty_astroid_slicerse n(8sw'' '8 * 7 7 7 7di 7 7 7 74 7 7 7 7rc|sd}t|}t}d}|dtfg}|r|\}}} | tur~||vsJ|||||\} } |||| ft |} ||D] } || | | tf!n+|||ttt| }||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. cdSr.r)rPpvaluerks r zvisit_tree..sDrN) rQset _PREVISITpopaddappendleninsertrr r,)rPprevisit postvisit iter_childrendoneretstackcurrent par_valuerkr post_valueinsr`s r visit_treers6$ 100I$T**- $ # $ " #% H % GY  D  hhw#8GY77fj llGY 3444 JJc}W%%22! S1fi011112 Igy$x*F*F G Gc H *rc#$Kt|}t}|g}|rk|}||vsJ|||Vt |}|||D]}||||idSdS)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)rQrrrrr)rPrTrrrrrras r walkr's%T**- $ &% iikkG $    HHW MMM e**C ]7$6 7 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)sortedrjoin)rI replacementsppartsr;endnew_texts r replacerDs! % &| 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.)_cacher0s r __init__zNodeMethods.__init__\s DKKKrc|j|}|sz!combine_tokens..s,@@3sx8..@@@@@@rch|] }|j Sr)liners r rbz!combine_tokens..sHcHcHcVYHcHcHcrrrc3$K|] }|jV dSr.)r))r_ts r rz!combine_tokens..s$//Aqx//////rrr)r/r)r;rr) rrrD TokenInforrr;rr)rs r rrs @@%@@@ @ @CHcHc]bHcHcHcDdDdhiDiDi l ]ww///////Ahn "IM 1X]  rcxdt||D}|rt|dS|S)zq If the given AST node contains multiple statements, return the last one. Otherwise, just return the node. c\g|])}t|st|jdv'|*S)) excepthandler ExceptHandler match_case MatchCase TryExcept TryFinally)r{r/r)r_rls r zlast_stmt..sQ   u~~ e-2 rr)rQ last_stmt)rP child_stmtss r rrsT  /)$//55   +& [_ % %% +r)maxsizecdtj}dtj|D}d|D}tt |t|k}t fd|D}|o|S)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} ''' )cFg|]}t|tj|Sr)rVrXNamer_rPs r rz*fstring_positions_work..s)NNN:dCH3M3MNNNNrc*g|]}|j|jfSr)r col_offsetrs r rz*fstring_positions_work..s!JJJtT[$/2JJJrc3TK|]"}tj||jkV#dSr.)rXget_source_segmentid)r_rPsources r rz)fstring_positions_work..sK   64((DG3      r)rXparserrrall)tree name_nodesname_positionspositions_are_uniquecorrect_source_segmentsrs @r fstring_positions_workrs & 6  $NN$NNN*JJzJJJ.S0011S5H5HH         9"99rctjdkrdSt|dD]}t|tjs|jD]}t|ddt|tjrSts(t|j D]}t|dd|j rt|j dddS)zy Add a special attribute `_broken_positions` to nodes inside f-strings if the lineno/col_offset cannot be trusted. ) NT)rT_broken_positions) sys version_inforrVrXrrfsetattrFormattedValuerrk format_spec)r joinedstrpartrls r annotate_fstring_nodesrs     F666??i i / / ? ? d'... D#, - -?%'' 6DJ'' 6 6e E. 5 5 5 5   ? $"$7 > > > ???rr.)F)IrX collectionsrFrr$rDabcrrrr functoolsrtypingrr r r r r rrrrrrastroid_compatrrAstNoderr* namedtupler,r7r<rBrErQrM__dict__itemsrirNrzrvrwr{r~rSrConstantr__annotations__astroidrp ImportErrorrrrrrobjectrrrrrrrrrrrrr rs  !!!!!!!!!!                             !$$$$$$C +v% &' )HHH..... "K "7,^ _ _...&QQQQ + + + +AAAWWWWWWccCL..00ccc ,HH#,"4"4"6"6HHHHH3<#5#5#7#7HHHOOOP 555 555 --- 000+++'*l_%c "444uh$,,, 666 ...    FHH ( ( ( V:(,2   . 4:::>?????s? E EE