=OUj"D UddlZddlZddlZddlZddlZddlZddlZddlmZddlm Z m Z m Z ddl m Z ddlmZmZmZmZmZmZmZmZmZmZmZmZerddlmZneZej:Zej<dZd e d ee!d e!fd Z"Gd dejFddZ$Gdde Z%ee%efZ&d>de$d e dee!d e'fdZ(d>de$d e dee!d dfdZ)de d e'fdZ*de!d eefdZ+de d efdZ,d?dede'd eee-ffdZ.ej^jaDchc]Q\}}e1|e2se3|ejhejjejlejnejpfr|Sc}}Z9d?de de'd eee e ffdZ:ej^jaDchc]#\}}e1|e2re3|ejvr|%c}}Zde&d e'fd!Z?de&d e'fd"Z@de&d e'fd#ZAde&d e'fd$ZBejfZDeed%feEd&< dd'lFmGZGeDeGfz ZDde&d e'fd(ZIde&d e'fd)ZJde&d e'fd*ZKde&d e'fd+ZLde&d e'fd,ZMeNZOde d-ee&ee$geee$ee$ffd.eee&ee$ee$gdfd dfd/ZPd?de de'd eee e&ffd0ZQde!d1eee e e!fd e!fd2ZRGd3d4ZSd5eed eefd6ZTd7eej:d eej:fd8ZUde&d e&fd9ZVe d:d e'fd;ZWdConstDelAttrDelName AssignAttr AssignNamec:|jjtvS)z+Returns whether node is an expression node.)rdr+expr_class_namesrXs r is_exprrp  $4 44r"c:|jjtvS)z)Returns whether node is a statement node.)rdr+stmt_class_namesrXs r is_stmtrtrqr"c4|jjdk(S)z&Returns whether node is a module node.rrdr+rXs r is_modulerws  H ,,r"c4|jjdk(S)zFReturns whether node is a JoinedStr node, used to represent f-strings. JoinedStrrvrXs r r\r\s  K //r"c4|jjdk(S)zSReturns whether node is an `Expr` node, which is a statement that is an expression.ExprrvrXs r is_expr_stmtr|s  F **r".CONSTANT_CLASSES)ric"t|tS)z(Returns whether node is a Constant node.)r^r}rXs r is_constantrs D* ++r"c@t|xr|jtuS)z)Returns whether node is an Ellipsis node.)rrgEllipsisrXs r is_ellipsisrs T  5tzzX55r"c4|jjdk(S)z2Returns whether node is a starred expression node.StarredrvrXs r is_starredrs  I --r"c |jjdvxsV|jjdk(xr;tttt t j|jS)z?Returns whether node represents a slice, e.g. `1:2` in `x[1:2]`)SliceExtSlicer) rdr+anymapis_slicerr_reltsrXs r rrsX  nn!66 .. ! !W , =#hSYY 5 : :;< r"c|jjdk(xrPt|tj xr3|j |j cxuxr|jcxuxrduScS)Nr)rdr+r^r_rloweruppersteprXs r is_empty_astroid_slicers\ nn(8sww' '8 ** 7dii 74 7 8r"previsit postvisitc|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&r0)rRpvaluergs r zvisit_tree..sDr"N) rYset _PREVISITpopaddappendleninsertrr r$)rRrr iter_childrendoneretstackcurrent par_valuergr post_valueinsns r visit_treers* 0I$T*- $ #;?y:Q9R% % GY  D   hhw#GY7fj llGY 34 JcW%! S1fi01& gy$x*F Gc  *r"c#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)rYrrrrr)rRrZrrrrrcs r walkr&s}%T*- $ &% iikG $  HHW M e*C 7$6 7 ll38 s A3A86A8 replacementscd}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)rHrppartsr@endnew_texts r replacerBsi! % &| 4uc8 LLa LL A!5,,tABx r"c6eZdZdZddZdedeeefde fdZ y) NodeMethodsz[ Helper to get `visit_{node_type}` methods given a node's class and cache the results. rNci|_yr&)_cacher(s r __init__zNodeMethods.__init__Ys fhDKr"objclsc|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_)rgetr+rgetattr visit_default)r)rrmethodnames r rzNodeMethods.get\sW [[__S !F   **, ,dsD#"3"34fdkk# Mr")rN) r+r,r-r.rrrrr'rrr0r"r rrUs0i S uWd]3  r"roriginal_tokensc#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'rMNAME ERRORTOKENNUMBERrr@rcombine_tokens)rgrouptokcombined_tokens r patched_generate_tokensris')E ((x}}h&9&98??K KE"IMMSYY6 S,U3N 4 )/ 0sB$B&rcLtd|Dr&t|Dchc]}|jc}dk7r|Stjtj dj d|D|dj|dj|djgScc}w)Nc3VK|]!}|jtjk(#ywr&)r'rMr).0rs r z!combine_tokens..s @%3sxx8...%s')rrc34K|]}|jywr&)r)rts r rz!combine_tokens..s/Aqxxsrr)r'rr@rline) rrrrM TokenInforrr@r)rrs r rrs @%@ @C]bHc]bVY]bHcDdhiDi 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)rYrtr'r+ last_stmt)rRrh child_stmtss r rrsl 0)$/5 5eu~e--2 5  [_ %% + s+A)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&)r_get_source_segmentid)rrRsources r rz)fstring_positions_work..s/ 64(DGG3s-0) r_parserr^Namer5 col_offsetrrall)treerR name_nodesname_positionspositions_are_uniquecorrect_source_segmentsrs @r fstring_positions_workrs & 6 $!$$N:dCHH3M*N?IJztT[[$//2z.JS01S5HH    9"99OJsB5B5B:rctjdk\ryt|dD]}t|tj s|j D]}t|ddt|tjs+ts't|jD]}t|dd|jsit|jddy)zy Add a special attribute `_broken_positions` to nodes inside f-strings if the lineno/col_offset cannot be trusted. ) NT)rZ_broken_positions) sys version_inforr^r_ryrbsetattrFormattedValuerrg format_spec)r joinedstrpartrhs r annotate_fstring_nodesrs    6i i /   d'. D#,, -%'DJJ'e E. 5(    $""$7 >!7r"r&)F)Yr_ collectionsrOrerrrMabcrrrr functoolsrtypingrr r r r r rrrrrrastroid_compatrrcompilerKr9r/r! namedtupler$r2AstNodeboolr=rArGrNrYlistrV__dict__itemsr^r' issubclass expr_contextboolopoperatorunaryopcmpoprerWstmtrsrorprtrwr\r|Constantr}r8 astroid.nodesri ImportErrorrrrrrobjectrrrrrrrrrr)rrs00r rs)  !!    $ &    bjj% BBhsmBB . "K " "7,^ _.(#  V# $QuQQhsmQtQ   x} PT ACADA W# W(9"5 WWSWXWDUS[]aSaMb LL..0c0DAqJq$4GS--szz3<<VYV_V_`a0c CThuUXZ^U^O_F`*#&,,"4"4"6H"6$!Q!!T*z!SXX/F"6H#&<<#5#5#7H#741a!!T*z!SXX/F#7HOP 5'5d55'5d5-G--00D0+w+4+ '*ll_%c "4!uh ,g,$, 6g6$6 .W.. 7 t T H + + gx/xQV7W1XX Y+ h%(5/JDPQ R+  + \s%PWBX9Y8#T%S# *>%?C&(Xi-@XiEX0 $x112 tH