hC %SSKrSSKrSSKrSSKrSSKrSSKrSSKJr SSKJrJ r J r SSK J r SSK JrJrJrJrJrJrJrJrJrJrJrJr \(a$SSKJr "SS \ 5r\\\4r\R<rS r"S S \R@"S S 55r!S.Sjr"S.Sjr#Sr$Sr%Sr&S/Sjr'\RPRS5VVs1sH^up\*"U\+5(dM\,"U\RZ\R\\R^\R`\Rb45(dM\UiM` snnr2S/Sjr3\RPRS5VVs1sH1up\*"U\+5(dM\,"U\Rh5(dM/UiM3 snnr5\RPRS5VVs1sH1up\*"U\+5(dM\,"U\R5(dM/UiM3 snn1Sk-r6Sr7Sr8Sr9Sr:Sr;\Rx4r=\\S4\>S'SSK?J@r@ \=\@4- r=SrBSrCS rDS!rES"rF\G"5rHS#rIS/S$jrJS%rK"S&S'5rLS(rMS)rNS*rO\ "SS+9S,5rPS-rQgs snnfs snnfs snnf!\Aa N^f=f)0N)ABCMeta)ModuleexprAST) lru_cache) CallableDictIterableIteratorListOptionalTupleUnioncastAny TYPE_CHECKINGType)NodeNGc \rSrSrSrSrSrSrg) EnhancedAST,Nr)__name__ __module__ __qualname____firstlineno__ first_token last_tokenlineno__static_attributes__raC:\Users\julio\OneDrive\Documentos\Trabajo\Ideas Frescas\venv\Lib\site-packages\asttokens/util.pyrr,sKJ Fr"rcf[RU<S[U5RS5<3$)zRReturns a human-friendly representation of a token with the given type and string.:u)tokentok_namereprlstrip)tok_typestrings r# token_reprr-7s'NN8,d6l.A.A#.F GGr"c\rSrSrSrSrSrg)Token>am 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. cB[URUR5$N)r-typer,selfs r#__str__ Token.__str__Ls dii --r"rN)rrrr__doc__r6r!rr"r#r/r/>s  .r"r/z0type string start end line index startpos endposcbURU:H=(a USL=(d URU:H$)zVReturns true if token is of the given type and, if a string is given, has that string.N)r3r,r'r+tok_strs r# match_tokenr<Qs* x  PW_%O 8OPr"c [XU5(dJ[S[X5<S[U5<SURS<SURSS-<35eg)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_tokenrAWsP Ug . . #SZ kk!nekk!nq(* ++ /r"cfU[R[R[R4;$)zO These are considered non-coding tokens, as they don't affect the syntax tree. )r'NLCOMMENTENCODING) token_types r#is_non_coding_tokenrGcs" %--@ @@r"c[R"[[/[4[ R "U5R55$)z7 Generates standard library tokens for the given code. )tokenizegenerate_tokensrrr?ioStringIOreadline)texts r#rJrJks4  ! !$xC'8"++d:K:T:T"U VVr"c<[US5(a[$[$)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_funcrVvs#*$"?"? VEVVr"cTU(d[U5(a/$UR5$r2) is_joined_strrP)rUinclude_joined_strs r#rRrRs#  d 3 3 I   r"c#R# U(d[U5(ag[U[R5(a5[ UR UR 5Hup#UbUv Uv M g[R"U5HnUR[;dMUv M g7fr2) rX isinstanceastr zipkeysvaluesiter_child_nodes __class__ SINGLETONS)rUrYkeyvaluechilds r#rSrSs  d 3 3 chhDIIt{{3   k4 ##D)e j( k *s BB' B'>ConstDelAttrDelName AssignAttr AssignNamec<URR[;$)z+Returns whether node is an expression node.)rarexpr_class_namesrTs r#is_exprrm  $4 44r"c<URR[;$)z)Returns whether node is a statement node.)rarstmt_class_namesrTs r#is_stmtrqrnr"c4URRS:H$)z&Returns whether node is a module node.rrarrTs r# is_modulerts  H ,,r"c4URRS:H$)zFReturns whether node is a JoinedStr node, used to represent f-strings. JoinedStrrsrTs r#rXrXs  K //r"c4URRS:H$)zSReturns whether node is an `Expr` node, which is a statement that is an expression.ExprrsrTs r# is_expr_stmtrys  F **r".CONSTANT_CLASSES)rfc"[U[5$)z(Returns whether node is a Constant node.)r[rzrTs r# is_constantr|s D* ++r"cJ[U5=(a UR[L$)z)Returns whether node is an Ellipsis node.)r|rdEllipsisrTs r# is_ellipsisrs T  5tzzX55r"c4URRS:H$)z2Returns whether node is a starred expression node.StarredrsrTs r# is_starredrs  I --r"c URRS;=(d[ URRS:H=(a; [[[[ [ RU5R55$)z?Returns whether node represents a slice, e.g. `1:2` in `x[1:2]`)SliceExtSlicer) raranymapis_slicerr\reltsrTs r#rrsX  nn!66 .. ! !W , =#hSYY 5 : :;< r"cURRS:H=(ac [U[R5(+=(a= UR UR s=L=(a URs=L=(a SL$s $)Nr)rarr[r\rloweruppersteprTs r#is_empty_astroid_slicersd nn(8sww' '8 ** 7 7dii 7 74 7 8r"cU(dSn[U5n[5nSnUS[4/nU(aUR5upxn U [LahXt;deUR U5 U"Xx5upUR XxU 45 [ U5n U"U5Hn URXU [45 M OU"Xx[[[U 55nU(aMU$)a 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. cgr2r)rUpvaluerds r#visit_tree..sDr"N) rVset _PREVISITpopaddappendleninsertrr r/)rUprevisit postvisit iter_childrendoneretstackcurrent par_valuerdr post_valueinsns r# visit_treers$ 0I$T*- $ # $ " #% % G     hhw#G7f llG 34 JcW%! Sfi01& g$x*F Gc  *r"c# # [U5n[5nU/nU(aaUR5nXS;deURU5 Uv [ U5nU"XQ5HnUR Xg5 M U(aM`gg7f)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``. 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)rVrrrrr)rUrYrrrrrcs r#walkr'sw%T*- $ &% iikG   HHW M e*C 7 7 ll38 s A>BBcSn/n[U5H,upEnURXU5 URU5 UnM. URXS5 SRU5$)a\ 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)rN replacementsppartsr@endnew_texts r#replacerDsc! % &| 4u8 LL LL A!5,,tBx r"c$\rSrSrSrSrSrSrg) NodeMethodsiXzW Helper to get `visit_{node_type}` methods given a node's class and cache the results. c0Ulgr2_cacher4s r#__init__NodeMethods.__init__\s DKr"cURRU5nU(dASURR5-n[ XUR 5nX0RU'U$)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)r5objclsmethodnames r#rNodeMethods.get`sS [[__S !F   **, ,ds#"3"34fkk# Mr"rN)rrrrr8rrr!rr"r#rrXs r"rc#n# /nUHnUR[R[R[R4;a7U(aUSR UR :XaURU5 Mw[U5HnUv M /nUv M [U5HnUv M g7f)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) r3rINAME ERRORTOKENNUMBERrr@rcombine_tokens)original_tokensgrouptokcombined_tokens r#patched_generate_tokensrns E ((x}}h&9&98??K KE"IMMSYY6 S,U3N 4 )/ 0sB3B5cX[SU55(a)[UVs1sHoRiM sn5S:waU$[R"[R SR SU55USRUSRUSRS9/$s snf)Nc3Z# UH!oR[R:Hv M# g7fr2)r3rIr).0rs r# !combine_tokens..s@%3xx8...%s)+rrc38# UHoRv M g7fr2)r,)rts r#rrs/Axxsrr)r3r,r@rline) rrrrI TokenInforrr@r)rrs r#rrs @%@ @ @C]bHc]bVY]bHcDdhiDi l ]]ww///Ahnn "IMM 1X]]  IdsB'c[U5"U5Vs/sH0n[U5(d[U5RS;dM.UPM2 nnU(a[ US5$U$s snf)zk If the given AST node contains multiple statements, return the last one. Otherwise, just return the node. ) excepthandler ExceptHandler match_case MatchCase TryExcept TryFinallyr)rVrqr3r last_stmt)rUre child_stmtss r#rrsk*$/5 5eu~~e--2 5  [_ %% + s -A$A$)maxsizec^Sm[R"T5n[R"U5Vs/sH&n[U[R5(dM$UPM( nnUVs/sHoR UR 4PM nn[[U55[U5:Hn[U4SjU55nU=(a U$s snfs snf)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} ''' )c3l># UH)n[R"TU5UR:Hv M+ g7fr2)r\get_source_segmentid)rrUsources r#r)fstring_positions_work..s. 64(DGG3s14) r\parserr[Namer col_offsetrrall)treerU name_nodesname_positionspositions_are_uniquecorrect_source_segmentsrs @r#fstring_positions_workrs & 6 $!$$N:dCHH3M*N?IJzt[[$//2z.JS01S5HH    9"99OJs#CC%!C c[RS:ag[USS9Hn[U[R 5(dM$UR Hn[USS5 [U[R5(dM1[5(d)[UR5Hn[USS5 M UR(dM|[URSS5 M M g)zs Add a special attribute `_broken_positions` to nodes inside f-strings if the lineno/col_offset cannot be trusted. ) NT)rY_broken_positions) sys version_inforr[r\rvr_setattrFormattedValuerrd format_spec)r joinedstrpartres r#annotate_fstring_nodesrs    6i i / /   d'. D#,, - -%''DJJ'e E. 5(     $""$7 >!7r"r2)F)Rr\ collectionsrKrr'rIabcrrrr functoolsrtypingrr r r r r rrrrrrastroid_compatrrAstNoderr- namedtupler/r<rArGrJrVrR__dict__itemsr[r3 issubclass expr_contextboolopoperatorunaryopcmpoprbrSstmtrprlrmrqrtrXryConstantrz__annotations__astroidrf ImportErrorr|rrrrobjectrrrrrrrrrr)rrs00r#rs  !!    $C +v% &'  )H.K " "7,^ _.&Q +AWW LL..0c0DAJq$4GaS--szz3<<VYV_V_`a0c ,#&,,"4"4"6H"6$!!!T*/9!SXX/F"6H#&<<#5#5#7H#741!!T*/9!SXX/F#7HOP 5 5 - 0+'*ll_%c "4uh , 6 .  H ( V:(,2 . 4::>?K c4HHPsI I'#AI'*I'I-.I-I-/I3I3!I3 I99JJ