֠ 2 U d Z ddlmZ ddlZddlZddlZddlmZmZ ddl m
Z
ddl m Z m
Z
ddlmZmZmZmZmZ ddlmZ dd lmZmZmZ dd
lmZm Z m Z m Z m Z dd l m!Z! dd l"m#Z# dd
l$m%Z% ddl&m'Z' ej( dk rddlm)Z) nddl*m)Z) ddddddddZ+de,d< eddded Z- ed ej. ej/ Z0 ed ej1 ej2 Z3 ed ej4 ej5 Z6eej7 ej8 ej. f Z9 G d d! Z:dS )"zlThis module contains utilities for rebuilding an _ast tree in
order to get a single Astroid representation.
) annotationsN)Callable Generator)StringIO) TokenInfogenerate_tokens)
TYPE_CHECKINGTypeVarUnioncastoverload)nodes) ParserModuleget_parser_moduleparse_function_type_comment)IS_PYPYPY38 PY38_PLUS PY39_PLUSContext)AstroidManager)NodeNG)Position)SuccessfulInferenceResult )Final Arguments
Comprehension
ExceptHandlerKeyword MatchCase) arguments
comprehension ListCompFor
GenExprFor
excepthandlerkeyword
match_casezFinal[dict[str, str]]REDIRECTT_Doc
ast.Module ast.ClassDef)ast.FunctionDefast.AsyncFunctionDef
_FunctionT_ForT_WithTc e Zd ZdZ ddd ZddZddZddZddZdd Z dd$Z
e r2e dd( Z
e dd+ Z
e dd. Z
e dd1 Z
e dd4 Z
e dd7 Z
e dd: Z
e dd= Z
e dd@ Z
e ddC Z
e ddF Z
e ddI Z
e ddL Z
e ddO Z
e ddR Z
e ddU Z
e ddX Z
e dd[ Z
e dd^ Z
e dda Z
e ddd Z
e ddg Z
e ddj Z
e ddm Z
e ddp Z
e dds Z
e ddv Z
e ddy Z
e dd| Z
e dd Z
e dd Z
e dd Z
e dd Z
e dd Z
ej dk r
e dd Z
ej dk re dd Z
e dd Z
e dd Z
e dd Z
e dd Z
e dd Z
e dd Z
e dd Z
ej dk rAe dd Z
e dd Z
e dd Z
e dd Z
e dd Z
e dd Z
e dd Z
e dd Z
e dd Z
e dd Z
e ddĄ Z
e ddDŽ Z
e ddɄ Z
e dd̄ Z
e ddτ Z
ej dk r
e ddӄ Z
e ddՄ Z
e dd Z
e ddۄ Z
e ddބ Z
e dd Z
e dd Z
ej dk re dd Z
e dd Z
e dd Z
e dd Z
e dd Z
e dd Z
e dd Z
e dd Z
e dِd Z
e dڐd Z
e dېd Z
e dܐd Z
e dݐd Z
dސd Z
dߐdZddZddZddZddZddZddZddZddZddZdd Zdd Ze dd Z e dd Z dd"Z dd#Z dd$Z dd%Z dd&Z dd'Z! ddd*Z"dd+Z#dd,Z$dd-Z%dd/Z&dd0Z'dd2Z(dd3Z)dd4Z*dd5Z+dd6Z,e dd9 Z-e dd; Z-dd?Z-dd@Z.ddAZ/e ddC Z0e ddE Z0ddHZ0ddIZ1ddJZ2ddLZ3ddMZ4ddNZ5ddOZ6ddPZ7ddQZ8ddRZ9ej dk rddSZ:ej dk r ddTZ;ddUZ<ddVZ=ddWZ>ddXZ?ddYZ@dd[ZAdd\ZBdd]ZCej dk rdd^ZDdd_ZEddaZFeFZGddbZHddcZIdddZJdÐdeZKdĐdfZLdŐdgZMdƐdhZNdǐdiZOdȐdjZPddlZQddnZRdʐdoZSdːdpZTd̐dqZUd͐drZVe ddt ZWe ddv ZWddzZWdd{ZXdd|ZYdd}ZZej dk r>dѐd~Z[dҐdZ\dӐdZ]dԐdZ^dՐdZ_ddZ`dאdZadؐdZbdِdZcdڐdZddS dS (
TreeRebuilderz1Rebuilds the _ast tree to become an Astroid tree.Nmanagerr
parser_moduleParserModule | Nonedata
str | NonereturnNonec || _ |r| d nd | _ g | _ g | _ g | _ i | _ |t | _ n|| _ | j j | _
d S )N
) _managersplit_data
_global_names_import_from_nodes_delayed_assattr _visit_methsr _parser_modulemodule_module)selfr6 r7 r9 s c/builddir/build/BUILD/cloudlinux-venv-1.0.10/venv/lib/python3.11/site-packages/astroid/rebuilder.py__init__zTreeRebuilder.__init__< sx
)-7TZZ%%%4
BD:< 8: VX "3"5"5D "/D *1 noder, +tuple[T_Doc, ast.Constant | ast.Str | None]c |j rt |j d | j j r|j d j }t || j j s;t r`t || j j rFt |j t r,|}|j dd |_ |j dk rd|_ ||fS n# t $ r Y nw xY w|dfS )zReturn the doc ast node.r N) body
isinstancerH ExprvalueStrr Constantstr
col_offset
IndexError)rI rM first_value doc_ast_nodes rJ _get_doczTreeRebuilder._get_docO s y
.Z ! dl6G H H
. "il 0 k4<+;<< . ."; 0EFF . #;#4c:: .
$/L $ !""
DI $."4426 / -- D Tzs B>C
CCMast.Attribute | ast.List | ast.Name | ast.Subscript | ast.Starred | ast.Tupler c z | j j t |j t
j S N)rF context_classesgettypectxr LoadrI rM s rJ _get_contextzTreeRebuilder._get_contextd s* "266tDH~~w|TTTrL 5ast.ClassDef | ast.FunctionDef | ast.AsyncFunctionDefparent;nodes.ClassDef | nodes.FunctionDef | nodes.AsyncFunctionDefPosition | Nonec | j sdS t |dd }|j r|j d j }d | j |j dz
| }d}t
j f}t |t j rd}n t |t j
rd}nd}t t | j
D ]N}|'|j t
j k r|j |j k r n&|j |v r|j |k r|}B|j d v rLd}OdS t# |j |j d z dz
|j d |j |j d z dz
|j d
S ) a* Return position information for ClassDef and FunctionDef nodes.
In contrast to AST positions, these only include the actual keyword(s)
and the class / function name.
>>> @decorator
>>> async def some_func(var: int) -> None:
>>> ^^^^^^^^^^^^^^^^^^^
N
end_linenor r> rP asyncdefclass> ro )linenorY rm end_col_offset)rA getattrrR rq jointokenNAMErS r AsyncFunctionDef FunctionDefr r readlinerc stringnamer startend) rI rM ri rm r9 start_tokenkeyword_tokens search_tokents rJ _get_position_infoz TreeRebuilder._get_position_infoq s z 4!(|T!B!B
9 - 1 ,JyyDK!Oj$@ABB(, +0:- fe 4 5 5 #"LL
1
2
2 # LL"L $ !899 A'Fej((H ))v ''8|++"#K 8w&& KK4;!21!559"(+{QU1X-1 58
rL NodesWithDocsTypec
| j r|j r|j dS t rdS |j pd}|j j }t r t
sd}d | j |dz
| }d\ }}d}t j t j t j
t j h}t |t j rd}t t! | j D ]} |du r|du r!| j t j k r | j dv rd}nl|du rh| j t j k rS| j t j k r |dk rd}n5| j t j k r|dz
}n| j t j k r|dz }| j |v r| j t j k r n dS dS || j d z dz
|j _ | j d |j _ || j d z dz
|j _ | j d |j _ dS ) z9Fix start and end position of doc nodes for Python < 3.8.NrP r> )FFr TF> ro rp ) rA doc_noderq r r r rt ru NEWLINEINDENTNLCOMMENTrS r Moduler r ry rc rv rz OP
exact_typeCOLONLPARRPARSTRINGr| rY r} rm rr )
rI rM rq end_ranger9 found_start found_end
open_brackets
skip_tokenr s
rJ _fix_doc_node_positionz$TreeRebuilder._fix_doc_node_position s z $+2E F F! $
4 9 IyyFQJ$:;<<!- Y
%
u|UXu} U
dEL ) ) I $ !899 AE!! 5((%*,,$444"&KK D((QVux-?-?|u{22}7I7I$( 33%*
33%*
v##v %% FF F %
2Q 6
#$71:
#)AE!H#4q#8
'(uQx
$$$rL newnode nodes.NodeNGc z d|_ d|_ | D ]}| | dS )a$ Reset end_lineno and end_col_offset attributes for PyPy 3.8.
For some nodes, these are either set to -1 or only partially assigned.
To keep consistency across astroid and pylint, reset all.
This has been fixed in PyPy 3.9.
For reference, an (incomplete) list of nodes with issues:
- ClassDef - For
- FunctionDef - While
- Call - If
- Decorators - TryExcept
- With - TryFinally
- Assign
N)rm rr get_children_reset_end_lineno)rI r
child_nodes rJ r z TreeRebuilder._reset_end_lineno sP "!% !..00 / /J " ": . . . . / /rL r- modnamerX modpathpackagebool nodes.Modulec X | \ }}t j |||g|d fd|j D | t r t r S )zmVisit a Module node by returning a fresh instance of it.
Note: Method not called by 'visit'
N)r{ filepathr ri c < g | ]} | S visit.0childr rI s rJ
z.TreeRebuilder.visit_module.. ' ? ? ?ETZZw
'
' ? ? ?rL )r )
r] r r postinitrR r r r r r )rI rM r r r r\ r s ` @rJ visit_modulezTreeRebuilder.visit_module s "]]4 0 0l,
? ? ? ? ?TY ? ? ?ZZ g66
##G,,, ,t , " "7 + + +rL ast.argr nodes.AssignNamec d S r` r rI rM ri s rJ r zTreeRebuilder.visit CrL
ast.argumentsnodes.Argumentsc d S r` r r s rJ r zTreeRebuilder.visit r rL
ast.Assert nodes.Assertc d S r` r r s rJ r zTreeRebuilder.visit r rL r0 nodes.AsyncFunctionDefc d S r` r r s rJ r zTreeRebuilder.visit
CrL ast.AsyncFornodes.AsyncForc d S r` r r s rJ r zTreeRebuilder.visit r rL ast.Await nodes.Awaitc d S r` r r s rJ r zTreeRebuilder.visit r rL
ast.AsyncWithnodes.AsyncWithc d S r` r r s rJ r zTreeRebuilder.visit" r rL
ast.Assign nodes.Assignc d S r` r r s rJ r zTreeRebuilder.visit& r rL
ast.AnnAssignnodes.AnnAssignc d S r` r r s rJ r zTreeRebuilder.visit* r rL
ast.AugAssignnodes.AugAssignc d S r` r r s rJ r zTreeRebuilder.visit. r rL ast.BinOp nodes.BinOpc d S r` r r s rJ r zTreeRebuilder.visit2 r rL
ast.BoolOp nodes.BoolOpc d S r` r r s rJ r zTreeRebuilder.visit6 r rL ast.Break nodes.Breakc d S r` r r s rJ r zTreeRebuilder.visit: r rL ast.Call
nodes.Callc d S r` r r s rJ r zTreeRebuilder.visit> r rL r. nodes.ClassDefc d S r` r r s rJ r zTreeRebuilder.visitB r rL ast.Continuenodes.Continuec d S r` r r s rJ r zTreeRebuilder.visitF r rL ast.Compare
nodes.Comparec d S r` r r s rJ r zTreeRebuilder.visitJ r rL ast.comprehensionnodes.Comprehensionc d S r` r r s rJ r zTreeRebuilder.visitN r rL
ast.Delete nodes.Deletec d S r` r r s rJ r zTreeRebuilder.visitR r rL ast.Dict
nodes.Dictc d S r` r r s rJ r zTreeRebuilder.visitV r rL ast.DictCompnodes.DictCompc d S r` r r s rJ r zTreeRebuilder.visitZ r rL ast.Expr
nodes.Exprc d S r` r r s rJ r zTreeRebuilder.visit^ r rL ast.ExceptHandlernodes.ExceptHandlerc d S r` r r s rJ r zTreeRebuilder.visitb r rL ast.For nodes.Forc d S r` r r s rJ r zTreeRebuilder.visitf r rL ast.ImportFromnodes.ImportFromc d S r` r r s rJ r zTreeRebuilder.visitj r rL r/ nodes.FunctionDefc d S r` r r s rJ r zTreeRebuilder.visitn r rL ast.GeneratorExpnodes.GeneratorExpc d S r` r r s rJ r zTreeRebuilder.visitr r rL
ast.Attributenodes.Attributec d S r` r r s rJ r zTreeRebuilder.visitv r rL
ast.Global nodes.Globalc d S r` r r s rJ r zTreeRebuilder.visitz r rL ast.Ifnodes.Ifc d S r` r r s rJ r zTreeRebuilder.visit~ r rL ast.IfExp nodes.IfExpc d S r` r r s rJ r zTreeRebuilder.visit r rL
ast.Import nodes.Importc d S r` r r s rJ r zTreeRebuilder.visit r rL
ast.JoinedStrnodes.JoinedStrc d S r` r r s rJ r zTreeRebuilder.visit r rL ast.FormattedValuenodes.FormattedValuec d S r` r r s rJ r zTreeRebuilder.visit r rL r
ast.NamedExprnodes.NamedExprc d S r` r r s rJ r zTreeRebuilder.visit rL )r ast.ExtSlicenodes.Subscript nodes.Tuplec d S r` r r s rJ r zTreeRebuilder.visit r rL ast.Indexc d S r` r r s rJ r zTreeRebuilder.visit r rL ast.keyword
nodes.Keywordc d S r` r r s rJ r zTreeRebuilder.visit r rL
ast.Lambda nodes.Lambdac d S r` r r s rJ r zTreeRebuilder.visit r rL ast.List
nodes.Listc d S r` r r s rJ r zTreeRebuilder.visit r rL ast.ListCompnodes.ListCompc d S r` r r s rJ r zTreeRebuilder.visit r rL ast.Name;nodes.Name | nodes.Const | nodes.AssignName | nodes.DelNamec d S r` r r s rJ r zTreeRebuilder.visit r rL ast.Nonlocalnodes.Nonlocalc d S r` r r s rJ r zTreeRebuilder.visit r rL ast.Ellipsis nodes.Constc d S r` r r s rJ r zTreeRebuilder.visit r rL ast.NameConstantc d S r` r r s rJ r zTreeRebuilder.visit r rL ast.Strc d S r` r r s rJ r zTreeRebuilder.visit r rL ast.Bytesc d S r` r r s rJ r zTreeRebuilder.visit r rL ast.Numc d S r` r r s rJ r zTreeRebuilder.visit r rL ast.Constantc d S r` r r s rJ r zTreeRebuilder.visit r rL ast.Pass
nodes.Passc d S r` r r s rJ r zTreeRebuilder.visit r rL ast.Raise nodes.Raisec d S r` r r s rJ r zTreeRebuilder.visit r rL
ast.Return nodes.Returnc d S r` r r s rJ r zTreeRebuilder.visit r rL ast.Set nodes.Setc d S r` r r s rJ r zTreeRebuilder.visit r rL ast.SetComp
nodes.SetCompc d S r` r r s rJ r zTreeRebuilder.visit r rL ast.Slice nodes.Slicec d S r` r r s rJ r zTreeRebuilder.visit r rL
ast.Subscriptc d S r` r r s rJ r zTreeRebuilder.visit r rL ast.Starred
nodes.Starredc d S r` r r s rJ r zTreeRebuilder.visit r rL ast.Try"nodes.TryExcept | nodes.TryFinallyc d S r` r r s rJ r zTreeRebuilder.visit r rL )r ast.TryStar
nodes.TryStarc d S r` r r s rJ r zTreeRebuilder.visit r rL ast.Tuplec d S r` r r s rJ r zTreeRebuilder.visit r rL ast.UnaryOp
nodes.UnaryOpc d S r` r r s rJ r zTreeRebuilder.visit r rL ast.While nodes.Whilec d S r` r r s rJ r zTreeRebuilder.visit r rL ast.With
nodes.Withc d S r` r r s rJ r zTreeRebuilder.visit r rL ast.Yield nodes.Yieldc d S r` r r s rJ r zTreeRebuilder.visit r rL
ast.YieldFromnodes.YieldFromc d S r` r r s rJ r zTreeRebuilder.visit r rL )r
ast.Match nodes.Matchc d S r` r r s rJ r zTreeRebuilder.visit r rL ast.match_casenodes.MatchCasec d S r` r r s rJ r zTreeRebuilder.visit" r rL ast.MatchValuenodes.MatchValuec d S r` r r s rJ r zTreeRebuilder.visit& r rL ast.MatchSingletonnodes.MatchSingletonc d S r` r r s rJ r zTreeRebuilder.visit* rL ast.MatchSequencenodes.MatchSequencec d S r` r r s rJ r zTreeRebuilder.visit0 r| rL ast.MatchMappingnodes.MatchMappingc d S r` r r s rJ r zTreeRebuilder.visit6 r| rL ast.MatchClassnodes.MatchClassc d S r` r r s rJ r zTreeRebuilder.visit< r rL
ast.MatchStarnodes.MatchStarc d S r` r r s rJ r zTreeRebuilder.visit@ r rL ast.MatchAs
nodes.MatchAsc d S r` r r s rJ r zTreeRebuilder.visitD r rL ast.MatchOr
nodes.MatchOrc d S r` r r s rJ r zTreeRebuilder.visitH r rL ast.pattern
nodes.Patternc d S r` r r s rJ r zTreeRebuilder.visitL r rL ast.ASTc d S r` r r s rJ r zTreeRebuilder.visitP r rL c d S r` r r s rJ r zTreeRebuilder.visitT r rL ast.AST | None
NodeNG | Nonec |d S |j }|| j v r| j | }nQ|j }dt || z }t
| | }|| j |< ||| S )Nvisit_) __class__rE __name__r+ rb lowerrs )rI rM ri cls visit_methodcls_name
visit_names rJ r zTreeRebuilder.visitX s <4n $# # # ,S1LL|H!HLL8$D$D$J$J$L$LLJ"444L%1D c "|D&)))rL nodes.AssignName | nodes.DelNamec | j rC|j | j d v r/| |j | dS |j sJ |j sJ |j |j | dS )zASave assignment situation since node.parent is not available yet.rQ N)rB r{ root set_localri rf s rJ _save_assignmentz TreeRebuilder._save_assignmente s 3$)t/A"/E"E"E IIKK ! !$)T 2 2 2 2 2; ;9 9 K ! !$)T 2 2 2 2 2rL c : | |||j S )z8Visit an arg node by returning a fresh AssName instance.)visit_assignnameargr s rJ visit_argzTreeRebuilder.visit_argn s $$T648<<.{ s' BBBu
5'**BBBrL c < g | ]} | S r r r s rJ r z1TreeRebuilder.visit_arguments..| s' JJJ5DJJug..JJJrL c < g | ]} | S r r r s rJ r z1TreeRebuilder.visit_arguments.. s' NNNUdjj00NNNrL c < g | ]} | S r r r s rJ r z1TreeRebuilder.visit_arguments.. s' PPPetzz%11PPPrL c F g | ] } |j S r r
annotationr r r rI s rJ r z1TreeRebuilder.visit_arguments.. s) PPPstzz#.'::PPPrL c F g | ] } |j S r r r s rJ r z1TreeRebuilder.visit_arguments.. s6 "
"
"
47DJJs~w / /"
"
"
rL c < g | ]} | S r r r s rJ r z1TreeRebuilder.visit_arguments.. s' TTT%4::eW55TTTrL c F g | ] } |j S r r r s rJ r z1TreeRebuilder.visit_arguments.. s6 ' ' '8;
3>733' ' 'rL c > g | ]} | S ri check_type_commentr s rJ r z1TreeRebuilder.visit_arguments.. s9
?DD # #E' # : :
rL c > g | ]} | S r r r s rJ r z1TreeRebuilder.visit_arguments.. s9 #
#
#
?DD # #E' # : :#
#
#
rL c > g | ]} | S r r r s rJ r z1TreeRebuilder.visit_arguments.. s< ( ( ( ''g'>>( ( (rL )
argsdefaults
kwonlyargs posonlyargs kw_defaultsr kwonlyargs_annotationsposonlyargs_annotationsvarargannotationkwargannotationtype_comment_argstype_comment_kwonlyargstype_comment_posonlyargs)r r varargr kwargr r r r r r rm rr r r r r ri r )rI rM ri r r r r r r r r r r r r r r r r r s ` @rJ visit_argumentsz TreeRebuilder.visit_argumentsr sT ! / #{ 4DKOO "j 2DJNNd
CBBBB BBBJJJJJDMJJJ*.)-.0 ; K[_F #zz$+*@' J J : IJNE "jj)> H HO G
G
G>-%(^%>CN), )FC&NNNNNdoNNN
PPPPPt?OPPP PPPPPdiPPP "
"
"
"
"
;??"
"
"
8: TTTTT4CSTTTK' ' ' ' '?C?O' ' ' #
HL
#
#
#
#
#
HL#
#
#
9; ( ( ( ( ( ! -( ( ( $
!####9$; - + /$;%=
~ ~ 6 N $ $VW 5 5 5 5 N $ $UG 4 4 4rL c
. t j |j |j t |dd t |dd | }d}|j r| |j | }| | |j | | |S )z8Visit a Assert node by returning a fresh instance of it.rm Nrr rq rY rm rr ri ) r Assertrq rY rs msgr r test)rI rM ri r r s rJ visit_assertzTreeRebuilder.visit_assert s ,; t\488"4)94@@
" 8 0**TXw//CDIw77===rL Hast.Assign | ast.arg | ast.For | ast.AsyncFor | ast.With | ast.AsyncWithZnodes.Assign | nodes.Arguments | nodes.For | nodes.AsyncFor | nodes.With | nodes.AsyncWithc " t |dd }|sd S | j | }n# t $ r Y d S w xY w|j sd S | |j d | }t
|t j sd S |j S )N type_commentr r )
rs rF parse SyntaxErrorrR r rS r rT rU )rI rM ri r type_comment_ast type_objects rJ r z TreeRebuilder.check_type_comment s t^T:: 4 # 2 8 8 F F 44 $ 4jj!1!6q!9&jII +uz22 4 s 2
A A &ast.FunctionDef | ast.AsyncFunctionDef)tuple[NodeNG | None, list[NodeNG]] | Nonec t |dd }|sd S t | }n# t $ r Y d S w xY w|sd S d } fd|j pg D }|j r |j }||fS )Nr c < g | ]} | S r r )r elemri rI s rJ r z=TreeRebuilder.check_function_type_comment.. s4 "
"
"
)-DJJtV $ $"
"
"
rL )rs r r argtypesreturnsr )rI rM ri r r r r s ` ` rJ check_function_type_commentz)TreeRebuilder.check_function_type_comment s t^T:: 4 :< H H 44 4!%"
"
"
"
"
2B2K2Qr"
"
"
# Cjj!1!96BBG s )
77c D | t j || S r` )_visit_functiondefr rw r s rJ visit_asyncfunctiondefz$TreeRebuilder.visit_asyncfunctiondef s &&u'=tVLLLrL c D | t j || S r` )
_visit_forr AsyncForr s rJ visit_asyncforz TreeRebuilder.visit_asyncfor s u~tV<< >???rL c D | t j || S r` ) _visit_withr AsyncWithr s rJ visit_asyncwithz TreeRebuilder.visit_asyncwith s v>>>rL c
@ t j |j |j t |dd t |dd | | } fd|j D |j | S )z8Visit a Assign node by returning a fresh instance of it.rm Nrr r r c < g | ]} | S r r r s rJ r z.TreeRebuilder.visit_assign../ s' JJJETZZw//JJJrL )targetsrU type_annotation)
r Assignrq rY rs r r r r rU )rI rM ri r r s ` @rJ visit_assignzTreeRebuilder.visit_assign# s ,; t\488"4)94@@
11$w1GGJJJJJT\JJJ**TZ11 +
rL c
Z t j |j |j t |dd t |dd | }| | |j | | |j | |j | |j
| |S )z. ' NNN$**UG44NNNrL ) r BoolOprF bool_op_classesrc r rq rY rs r valuesr s ` @rJ visit_boolopzTreeRebuilder.visit_boolop s ,"24==A; t\488"4)94@@
NNNNN$+NNNOOOrL c
t j |j |j t |dd t |dd | S )z7Visit a Break node by returning a fresh instance of it.rm Nrr r )r Breakrq rY rs r s rJ visit_breakzTreeRebuilder.visit_break sG {; t\488"4)94@@
rL c
6 t j |j |j t |dd t |dd | |j fd|j D fd|j D S )z:Visit a CallFunc node by returning a fresh instance of it.rm Nrr r c < g | ]} | S r r r s rJ r z,TreeRebuilder.visit_call.. ' DDD$**UG,,DDDrL c < g | ]} | S r r r s rJ r z,TreeRebuilder.visit_call.. s' LLLUdjj00LLLrL )funcr keywords)
r Callrq rY rs r r r r r r s ` @rJ
visit_callzTreeRebuilder.visit_call s *; t\488"4)94@@
DIw//DDDDD$)DDDLLLLLdmLLL
rL Tnewstylec
| | \ }}t j |j |j |j t
|dd t
|dd | d}|j D ]*}|j dk r | j
} n+ | } fd|j
D fd|j D ||| fd|j D | | S )
z(Visit a ClassDef node to become astroid.rm Nrr r metaclassc < g | ]} | S r r r s rJ r z0TreeRebuilder.visit_classdef.. s' @ @ @ETZZw
'
' @ @ @rL c < g | ]} | S r r r s rJ r z0TreeRebuilder.visit_classdef.. r rL c R g | ]#}|j d k
| $S )r% )r r )r kwdr rI s rJ r z0TreeRebuilder.visit_classdef.. s>
7k))
3(()))rL )positionr )r] r ClassDefr{ rq rY rs r r r rU visit_decoratorsr basesrR r r ) rI rM ri r# r\ r% r)
decoratorsr s ` @rJ visit_classdefz TreeRebuilder.visit_classdef s "]]4 0 0l.; t\488"4)94@@
} G{k)) JJw 8 8 > * **499
@ @ @ @ @TZ @ @ @ ? ? ? ? ?TY ? ? ?
=
,,T7;;ZZ g66
##G,,,rL c
t j |j |j t |dd t |dd | S )z:Visit a Continue node by returning a fresh instance of it.rm Nrr r )r Continuerq rY rs r s rJ visit_continuez TreeRebuilder.visit_continue sG ~; t\488"4)94@@
rL c
4 t j |j |j t |dd t |dd | |j fdt |j |j
D S )z9Visit a Compare node by returning a fresh instance of it.rm Nrr r c p g | ]2\ }}j j |j | f3S r )rF cmp_op_classesr r )r r exprr rI s rJ r z/TreeRebuilder.visit_compare.. sR
R '6r|DJJtW--
rL ) r Comparerq rY rs r r r zipops comparatorsr s ` @rJ
visit_comparezTreeRebuilder.visit_compare s -; t\488"4)94@@
JJty' * *
#&dh0@"A"A
rL c t j | |j |j fd|j D t |j S )z?Visit a Comprehension node by returning a fresh instance of it.c < g | ]} | S r r r s rJ r z5TreeRebuilder.visit_comprehension.. s' > > >ETZZw
'
' > > >rL ) r r r r r iterifsr is_asyncr s ` @rJ visit_comprehensionz!TreeRebuilder.visit_comprehension s %f-- JJt{G , , JJty' * * > > > > >TX > > >
rL nodes.Decorators | Nonec J |j sdS t j dk r7|j d j }|j d j }|j d j }n |j }d}d}t
j ||j ||| fd|j D S )zqVisit a Decorators node by returning a fresh instance of it.
Note: Method not called by 'visit'
Nr r rQ r c < g | ]} | S r r r s rJ r z2TreeRebuilder.visit_decorators.. s' VVV$**UG44VVVrL )
decorator_listsys version_inforq rm rr r
DecoratorsrY r )rI rM ri rq rm rr r s ` @rJ r, z TreeRebuilder.visit_decorators s " 4 v % %(+2F ,R0;J ! 0 4 CNN[F J !N"!)
VVVVV$BUVVVWWWrL c
t j |j |j t |dd t |dd | fd|j D S )z8Visit a Delete node by returning a fresh instance of it.rm Nrr r c < g | ]} | S r r r s rJ r z.TreeRebuilder.visit_delete..- s' OOO$**UG44OOOrL )r Deleterq rY rs r r r s ` @rJ visit_deletezTreeRebuilder.visit_delete# s{ ,; t\488"4)94@@
OOOOO$,OOOPPPrL ,Generator[tuple[NodeNG, NodeNG], None, None]c # 6 K t |j |j D ]{\ }}| || }|sBt j |j |j t |dd t |dd | }n| || }||fV |d S Nrm rr r ) r8 keysr r r
DictUnpackrq rY rs )rI rM ri r keyrU
rebuilt_value rebuilt_keys rJ _visit_dict_itemsz TreeRebuilder._visit_dict_items0 s di55 - -JC JJug 6 6M
7 # .(/ , 7 &}lD I I#*=:JD#Q#Q!
#jjg 6 6 }, , , , , - -rL c
t j |j |j t |dd t |dd | }t | ||| }| | |S )z6Visit a Dict node by returning a fresh instance of it.rm Nrr r )r Dictrq rY rs listrU r )rI rM ri r itemss rJ
visit_dictzTreeRebuilder.visit_dictD s *; t\488"4)94@@
TX " "4 9 9T
T
rL c
B t j |j |j t |dd t |dd | |j |j fd|j D S )z:Visit a DictComp node by returning a fresh instance of it.rm Nrr r c < g | ]} | S r r r s rJ r z0TreeRebuilder.visit_dictcomp..a ' E E EETZZw
'
' E E ErL )
r DictComprq rY rs r r rR rU
generatorsr s ` @rJ visit_dictcompz TreeRebuilder.visit_dictcompT s .; t\488"4)94@@
JJtx ) ) JJtz7 + + E E E E ET_ E E E
rL c
t j |j |j t |dd t |dd | }| | |j | |S )z6Visit a Expr node by returning a fresh instance of it.rm Nrr r )r rT rq rY rs r r rU r s rJ
visit_exprzTreeRebuilder.visit_expre so *; t\488"4)94@@
DJ88999rL c
D t j |j |j t |dd t |dd | |j ||j fd|j
D S )z@Visit an ExceptHandler node by returning a fresh instance of it.rm Nrr r c < g | ]} | S r r r s rJ r z5TreeRebuilder.visit_excepthandler.. r rL ) r r! rq rY rs r r rc r r{ rR r s ` @rJ visit_excepthandlerz!TreeRebuilder.visit_excepthandlerr s %; t\488"4)94@@
JJty' * * ! !$ ; ; ? ? ? ? ?TY ? ? ?
rL r type[nodes.For]c d S r` r rI r rM ri s rJ r zTreeRebuilder._visit_for r rL type[nodes.AsyncFor]c d S r` r rh s rJ r zTreeRebuilder._visit_for r rL type[_ForT]ast.For | ast.AsyncForr2 c
: |j }t rPt sIt |t j r/ j r( j |j dz
d } ||j |t |dd t |dd |
| } |j
|j fd|j D fd |j D |
S ) z5Visit a For node by returning a fresh instance of it.rP rn rm Nrr r r c < g | ]} | S r r r s rJ r z,TreeRebuilder._visit_for.. r rL c < g | ]} | S r r r s rJ r z,TreeRebuilder._visit_for.. s' HHH5DJJug..HHHrL )r r> rR orelser )rY r r rS astr rA rq indexrs r r r r r> rR rp )rI r rM ri rY r r s ` @rJ r zTreeRebuilder._visit_for s; _
D9 DD#,)G)G DDJ D DK!O4::7CCJ#;! t\488"4)94@@
11$w1GG::dk733DIw//DDDDD$)DDDHHHHHDKHHH +
rL c D | t j || S r` )r r Forr s rJ visit_forzTreeRebuilder.visit_for s uy$777rL c
d |j D }t j |j pd||j pd|j |j t |dd t |dd | }| j | |S )z=Visit an ImportFrom node by returning a fresh instance of it.c * g | ]}|j |j fS r r{ asnamer aliass rJ r z2TreeRebuilder.visit_importfrom.. ! DDD%*el+DDDrL Nrm rr )fromnamenameslevelrq rY rm rr ri )
r r
ImportFromrG r rq rY rs rC append)rI rM ri r r s rJ visit_importfromz TreeRebuilder.visit_importfrom s EDDDD"[&B*$; t\488"4)94@@
&&w///rL type[nodes.FunctionDef]c d S r` r rh s rJ r z TreeRebuilder._visit_functiondef r rL type[nodes.AsyncFunctionDef]c d S r` r rh s rJ r z TreeRebuilder._visit_functiondef s rL type[_FunctionT]r1 c
" j i | \ }}|j }t r|j r|j d j } ||j ||j t |dd t |dd | | }|j
r |j
}nd}dx}} | }
|
r|
\ } }
|j fd|j D ||| | | | j S )z,Visit an FunctionDef node to become astroid.r rm Nrr r c < g | ]} | S r r r s rJ r z4TreeRebuilder._visit_functiondef.. r rL )r rR r. r type_comment_returnsr r* r )rB r r] rq r rE r{ rY rs r, r r r r r rR r r pop) rI r rM ri r\ rq r. r r r type_comment_annotationr s ` @rJ r z TreeRebuilder._visit_functiondef s
!!"%%% !]]4 0 0l 3, 3 (+2F# t\488"4)94@@
**499
< jj w77GGG377 0"&"B"B4"Q"Q " N6M 3 "3DIw//DDDDD$)DDD!!5 /,,T7;;ZZ g66
##G,,, rL c D | t j || S r` )r r rx r s rJ visit_functiondefz TreeRebuilder.visit_functiondef s &&u'8$GGGrL c
t j |j |j t |dd t |dd | |j fd|j D S )z>Visit a GeneratorExp node by returning a fresh instance of it.rm Nrr r c < g | ]} | S r r r s rJ r z4TreeRebuilder.visit_generatorexp.. r] rL ) r GeneratorExprq rY rs r r eltr_ r s ` @rJ visit_generatorexpz TreeRebuilder.visit_generatorexp s $; t\488"4)94@@
JJtx ) ) E E E E ET_ E E E
rL 2nodes.Attribute | nodes.AssignAttr | nodes.DelAttrc | | }|t j k rHt j |j |j |j t |dd t |dd | }n|t j k r|t j
|j |j |j t |dd t |dd | }t |t j s| j
| nGt j |j |j |j t |dd t |dd | }| | |j | |S )z|j D ]6}| j d |g | 7|S )z&Visit a Global node to become astroid.rm Nrr r rq rY rm rr ri rQ ) r Globalr rq rY rs rB
setdefaultr )rI rM ri r r{ s rJ visit_globalzTreeRebuilder.visit_globalO s ,*; t\488"4)94@@
L
L
L"2&11$;;BB7KKKKrL c
4 t j |j |j t |dd t |dd | |j fd|j D fd|j D S )z5Visit an If node by returning a fresh instance of it.rm Nrr r c < g | ]} | S r r r s rJ r z*TreeRebuilder.visit_if..k r rL c < g | ]} | S r r r s rJ r z*TreeRebuilder.visit_if..l ' A A AETZZw
'
' A A ArL )
r Ifrq rY rs r r r rR rp r s ` @rJ visit_ifzTreeRebuilder.visit_if_ s (; t\488"4)94@@
JJty' * * ? ? ? ? ?TY ? ? ? A A A A AT[ A A A
rL c
L t j |j |j t |dd t |dd | }| | |j | | |j | | |j | |S )z7Visit a IfExp node by returning a fresh instance of it.rm Nrr r )
r IfExprq rY rs r r r rR rp r s rJ visit_ifexpzTreeRebuilder.visit_ifexpp s +; t\488"4)94@@
JJty' * * JJty' * * JJt{G , ,
rL c , d |j D }t j ||j |j t |dd t |dd | }|j D ]8\ }}|p|}| | d d | 9|S )z8Visit a Import node by returning a fresh instance of it.c * g | ]}|j |j fS r rx rz s rJ r z.TreeRebuilder.visit_import.. r| rL rm Nrr r .r )r r Importrq rY rs r r@ )rI rM ri r r r{ ry s rJ visit_importzTreeRebuilder.visit_import s DDDDD,; t\488"4)94@@
$M : :LD&>TD TZZ__Q / 9 9 9 9rL c
t j |j |j t |dd t |dd | fd|j D S )Nrm rr r c < g | ]} | S r r r s rJ r z1TreeRebuilder.visit_joinedstr.. r rL )r JoinedStrrq rY rs r r r s ` @rJ visit_joinedstrz TreeRebuilder.visit_joinedstr s{ /; t\488"4)94@@
NNNNN$+NNNOOOrL c
& t j |j |j t |dd t |dd | }| | |j | |j | |j | |S )Nrm rr r )rU
conversion format_spec)
r FormattedValuerq rY rs r r rU r r r s rJ visit_formattedvaluez"TreeRebuilder.visit_formattedvalue s &; t\488"4)94@@
**TZ11
4#3W==
rL c
t j |j |j t |dd t |dd | }| | |j | | |j | |S rO ) r NamedExprrq rY rs r r r rU r s rJ visit_namedexprz TreeRebuilder.visit_namedexpr s o{ ?"4 t<< &t-=t D D
G
4;00$**TZ2Q2Q
NrL c t j t j | fd|j D S )z>Visit an ExtSlice node by returning a fresh instance of Tuple.)rd ri c < g | ]} | S r r )r dimr rI s rJ r z0TreeRebuilder.visit_extslice.. s' L L L3djjg 6 6 L L LrL )r Tupler re r dimsr s ` @rJ visit_extslicez TreeRebuilder.visit_extslice sO
kgl6BBBG L L L L L$) L L L M M MNrL c 8 | |j | S )z;Visit a Index node by returning a fresh instance of NodeNG.)r rU r s rJ visit_indexzTreeRebuilder.visit_index s ::dj&11 1rL c t j |j t |dd t |dd t |dd t |dd | }| | |j | |S )z9Visit a Keyword node by returning a fresh instance of it.rq NrY rm rr )r rq rY rm rr ri )r r" r rs r r rU r s rJ
visit_keywordzTreeRebuilder.visit_keyword s -4400 t\488 t\488"4)94@@
DJ88999rL c
t j |j |j t |dd t |dd | }| | |j | | |j | |S )z8Visit a Lambda node by returning a fresh instance of it.rm Nrr r ) r Lambdarq rY rs r r r rR r s rJ visit_lambdazTreeRebuilder.visit_lambda s ,; t\488"4)94@@
DIw77DIw9W9WXXXrL c | }t j ||j |j t |dd t |dd | fd|j D S )z6Visit a List node by returning a fresh instance of it.rm Nrr rd rq rY rm rr ri c < g | ]} | S r r r s rJ r z,TreeRebuilder.visit_list.. ' LLL$**UG44LLLrL )rg r Listrq rY rs r eltsr s ` @rJ
visit_listzTreeRebuilder.visit_list s ##D))*; t\488"4)94@@
LLLLL$)LLLMMMrL c
t j |j |j t |dd t |dd | |j fd|j D S )z:Visit a ListComp node by returning a fresh instance of it.rm Nrr r c < g | ]} | S r r r s rJ r z0TreeRebuilder.visit_listcomp.. r] rL ) r ListComprq rY rs r r r r_ r s ` @rJ visit_listcompz TreeRebuilder.visit_listcomp s .; t\488"4)94@@
JJtx ) ) E E E E ET_ E E E
rL -nodes.Name | nodes.AssignName | nodes.DelNamec | | }|t j k rHt j |j |j |j t |dd t |dd | }n|t j k rHt j
|j |j |j t |dd t |dd | }nGt j |j |j |j t |dd t |dd | }|t j t j fv rFt t t j
t j f | }| | |S )z6Visit a Name node by returning a fresh instance of it.rm Nrr r )rg r r r DelNameidrq rY rs r r Namer r r r s rJ r zTreeRebuilder.visit_name s\ ##D)) gk ! !mW{ ?"4 t<< &t-=t D D GG
%
%&W{ ?"4 t<< &t-=t D D GG jW{ ?"4 t<< &t-=t D D G w{GM2 2 25!15=!@A7KKG ! !' * * *rL c t j |j |j |j t |dd t |dd | S )z6Visit a Nonlocal node and return a new instance of it.rm Nrr r )r Nonlocalr rq rY rs r s rJ visit_nonlocalz TreeRebuilder.visit_nonlocal6 sL ~*; t\488"4)94@@
rL c t j |j |j |j |j t
|dd t
|dd | S )z=Visit a Constant node by returning a fresh instance of Const.rm Nrr )rU kindrq rY rm rr ri )r ConstrU r rq rY rs r s rJ visit_constantz TreeRebuilder.visit_constantB sQ {*; t\488"4)94@@
rL c P t j t |j |j | S )z>Visit an Ellipsis node by returning a fresh instance of Const.)rU rq rY ri )r r Ellipsisrq rY r s rJ visit_ellipsisz TreeRebuilder.visit_ellipsisQ s+ ; { ?
rL c N t j |j |j |j | S r` )r r rU rq rY r s rJ visit_nameconstantz TreeRebuilder.visit_nameconstantZ s* ;
rL ast.Str | ast.Bytesc N t j |j |j |j | S )zAVisit a String/Bytes node by returning a fresh instance of Const.)r r srq rY r s rJ visit_strzTreeRebuilder.visit_stre ( ;
rL c N t j |j |j |j | S )z8Visit a Num node by returning a fresh instance of Const.)r r nrq rY r s rJ visit_numzTreeRebuilder.visit_nump r rL c
t j |j |j t |dd t |dd | S )z6Visit a Pass node by returning a fresh instance of it.rm Nrr r )r Passrq rY rs r s rJ
visit_passzTreeRebuilder.visit_passy sG z; t\488"4)94@@
rL c
t j |j |j t |dd t |dd | }| | |j | | |j | |S )z7Visit a Raise node by returning a fresh instance of it.rm Nrr r )exccause) r Raiserq rY rs r r r r r s rJ visit_raisezTreeRebuilder.visit_raise s +; t\488"4)94@@
48W--**TZ11
rL c
t j |j |j t |dd t |dd | }|j .| | |j | |S )z8Visit a Return node by returning a fresh instance of it.rm Nrr r )r Returnrq rY rs rU r r r s rJ visit_returnzTreeRebuilder.visit_return sw ,; t\488"4)94@@
: ! TZZ
G < < = = =rL c
t j |j |j t |dd t |dd | fd|j D S )z5Visit a Set node by returning a fresh instance of it.rm Nrr r c < g | ]} | S r r r s rJ r z+TreeRebuilder.visit_set.. r rL )r Setrq rY rs r r r s ` @rJ visit_setzTreeRebuilder.visit_set s{ ); t\488"4)94@@
LLLLL$)LLLMMMrL c
t j |j |j t |dd t |dd | |j fd|j D S )z9Visit a SetComp node by returning a fresh instance of it.rm Nrr r c < g | ]} | S r r r s rJ r z/TreeRebuilder.visit_setcomp.. r] rL ) r SetComprq rY rs r r r r_ r s ` @rJ
visit_setcompzTreeRebuilder.visit_setcomp s -; t\488"4)94@@
JJtx ) ) E E E E ET_ E E E
rL c
v t j t |dd t |dd t |dd t |dd | }| | |j | | |j | | |j | |S )z7Visit a Slice node by returning a fresh instance of it.rq NrY rm rr r )r upperstep)r Slicers r r r r r r s rJ visit_slicezTreeRebuilder.visit_slice s +4400 t\488 t\488"4)94@@
**TZ11**TZ11DIw//
rL c D | | }t j ||j |j t |dd t |dd | }| | |j | | |j | |S )z;Visit a Subscript node by returning a fresh instance of it.rm Nrr r )
rg r Subscriptrq rY rs r r rU slicer s rJ visit_subscriptz TreeRebuilder.visit_subscript s ##D))/; t\488"4)94@@
JJtz7 + +TZZ
G-L-L
rL c | | }t j ||j |j t |dd t |dd | }| | |j | |S )z5Visit a Starred node and return a new instance of it.rm Nrr r ) rg r Starredrq rY rs r r rU r s rJ
visit_starredzTreeRebuilder.visit_starred s ##D))-; t\488"4)94@@
DJ88999rL nodes.TryExceptc t j dk ri|j }|j }g |j |j |j }t | D ]}|j }|j } t j |j
|j ||| n t j |j
|j | fd|j D fd|j D fd|j D S )z;Visit a TryExcept node by returning a fresh instance of it.r r c < g | ]} | S r r r s rJ r z1TreeRebuilder.visit_tryexcept.. r rL c < g | ]} | S r r r s rJ r z1TreeRebuilder.visit_tryexcept.. s' C C CETZZw
'
' C C CrL c < g | ]} | S r r r s rJ r z1TreeRebuilder.visit_tryexcept..
r rL )
rF rG rm rr rR handlersrp reversedr TryExceptrq rY r )rI rM ri rm rr all_childrenr r s ` @rJ visit_tryexceptz TreeRebuilder.visit_tryexcept s v % % J ! 0N*TDI*T
*T *TL!,//
" -
!&!5o{ ?% - GG odk4?FKKG ? ? ? ? ?TY ? ? ? C C C C CT] C C C A A A A AT[ A A A
rL )nodes.TryExcept | nodes.TryFinally | Nonec
|j rt j |j |j t |dd t |dd | |j r | g}n fd|j D } | fd|j D S |j r || S d S )Nrm rr r c < g | ]} | S r r r s rJ r z+TreeRebuilder.visit_try.. s' JJJu
5'22JJJrL c < g | ]} | S r r r r r rI s rJ r z+TreeRebuilder.visit_try..! s' #S#S#SqDJJq'$:$:#S#S#SrL )
finalbodyr
TryFinallyrq rY rs r r rR r )rI rM ri rR r s ` @rJ visit_tryzTreeRebuilder.visit_try s
> &{ ?"4 t<< &t-=t D D
G }
K ,,T7;;<JJJJJ JJJ T#S#S#S#S#SDN#S#S#S T T TN = 6''f55 5trL c
N t j |j |j t |dd t |dd | fd|j D fd|j D fd|j D fd|j D S ) Nrm rr r c < g | ]} | S r r r s rJ r z/TreeRebuilder.visit_trystar..0 s' <<.1 s' DDDdjjG,,DDDrL c < g | ]} | S r r r s rJ r z/TreeRebuilder.visit_trystar..2 s' @@@qDJJq'**@@@rL c < g | ]} | S r r r s rJ r z/TreeRebuilder.visit_trystar..3 s' FFF!tzz!W--FFFrL )rR r rp r )
r TryStarrq rY rs r rR r rp r r s ` @rJ
visit_trystarzTreeRebuilder.visit_trystar' s -; t\488"4)94@@
<<<<<$)<<<DDDDDdmDDD@@@@@DK@@@FFFFFt~FFF
rL c | }t j ||j |j t |dd t |dd | fd|j D S )z7Visit a Tuple node by returning a fresh instance of it.rm Nrr r c < g | ]} | S r r r s rJ r z-TreeRebuilder.visit_tuple..C r rL )rg r r rq rY rs r r r s ` @rJ visit_tuplezTreeRebuilder.visit_tuple7 s ##D))+; t\488"4)94@@
LLLLL$)LLLMMMrL c t j | j j |j j |j |j t |dd t |dd | }| |
|j | |S )z9Visit a UnaryOp node by returning a fresh instance of it.rm Nrr r ) r UnaryOprF unary_op_classesr r rq rY rs r r operandr s rJ
visit_unaryopzTreeRebuilder.visit_unaryopF s -"3DG4EF; t\488"4)94@@
DL'::;;;rL c
4 t j |j |j t |dd t |dd | |j fd|j D fd|j D S )z7Visit a While node by returning a fresh instance of it.rm Nrr r c < g | ]} | S r r r s rJ r z-TreeRebuilder.visit_while..` r rL c < g | ]} | S r r r s rJ r z-TreeRebuilder.visit_while..a r rL )
r Whilerq rY rs r r r rR rp r s ` @rJ visit_whilezTreeRebuilder.visit_whileT s +; t\488"4)94@@
JJty' * * ? ? ? ? ?TY ? ? ? A A A A AT[ A A A
rL type[nodes.With]c d S r` r rh s rJ r zTreeRebuilder._visit_withe r rL type[nodes.AsyncWith]c d S r` r rh s rJ r zTreeRebuilder._visit_withk r rL type[_WithT]ast.With | ast.AsyncWithr3 c
|j }t rPt sIt |t j r/ j r( j |j dz
d } ||j |t |dd t |dd | d fd
| } fd |j D fd
|j
D | S )NrP rn rm rr r r ast.withitemr; tuple[NodeNG, NodeNG | None]c x | j } | j }||fS r` )r context_expr
optional_vars)r r6 varr rI s rJ visit_childz.TreeRebuilder._visit_with..visit_child s9 ::e 0'::D**U 0'::C9 rL r c & g | ]
} | S r r )r r rC s rJ r z-TreeRebuilder._visit_with.. s# >>>%;;u%%>>>rL c < g | ]} | S r r r s rJ r z-TreeRebuilder._visit_with.. r rL )rY rR r )r r= r; r> )rY r r rS rq r rA rq rr rs r r rY rR )rI r rM ri rY r r rC s ` @@rJ r zTreeRebuilder._visit_withq s6 _
D9 DD#-)H)H DTZ D DK!O4::7CCJ#;! t\488"4)94@@
11$w1GG>>>>4:>>>DDDDD$)DDD +
rL c D | t j || S r` )r r Withr s rJ
visit_withzTreeRebuilder.visit_with s
D&999rL c
t j |j |j t |dd t |dd | }|j .| | |j | |S )z7Visit a Yield node by returning a fresh instance of it.rm Nrr r )r Yieldrq rY rs rU r r r s rJ visit_yieldzTreeRebuilder.visit_yield sw +; t\488"4)94@@
: ! TZZ
G < < = = =rL c
t j |j |j t |dd t |dd | }|j .| | |j | |S rO )r YieldFromrq rY rs rU r r r s rJ visit_yieldfromz TreeRebuilder.visit_yieldfrom sw /; t\488"4)94@@
: ! TZZ
G < < = = =rL c t j |j |j |j |j | |j fd|j D S )Nr c < g | ]} | S r r )r caser rI s rJ r z-TreeRebuilder.visit_match.. s' HHHTtzz$00HHHrL )subjectcases)
r Matchrq rY rm rr r r rR rS r s ` @rJ visit_matchzTreeRebuilder.visit_match s k{ ? ? # 2 G
4<99HHHHHTZHHH
NrL c t j | |j |j fd|j D S )Nr c < g | ]} | S r r r s rJ r z1TreeRebuilder.visit_matchcase.. ' HHHUdjj00HHHrL )patternguardrR )r r# r r rY rZ rR r s ` @rJ visit_matchcasez TreeRebuilder.visit_matchcase s~ oV444G
4<99jjW55HHHHHdiHHH
NrL c t j |j |j |j |j | }| | |j | |S )Nr r ) r
MatchValuerq rY rm rr r r rU r s rJ visit_matchvaluez TreeRebuilder.visit_matchvalue sa &{ ? ? # 2 G
4::dj'#B#B C C CNrL c h t j |j |j |j |j |j | S )N)rU rq rY rm rr ri )r MatchSingletonrU rq rY rm rr r s rJ visit_matchsingletonz"TreeRebuilder.visit_matchsingleton s; 'j{ ? ? # 2
rL c t j |j |j |j |j | fd|j D S )Nr c < g | ]} | S r r r rY r rI s rJ r z5TreeRebuilder.visit_matchsequence.. ' TTT7$**Wg66TTTrL patterns)r
MatchSequencerq rY rm rr r rg r s ` @rJ visit_matchsequencez!TreeRebuilder.visit_matchsequence sw ){ ? ? # 2 G
TTTTTdmTTT
NrL c t j |j |j |j |j | fd|j D fd|j D ||j
S )Nr c < g | ]} | S r r r s rJ r z4TreeRebuilder.visit_matchmapping.. rX rL c < g | ]} | S r r rd s rJ r z4TreeRebuilder.visit_matchmapping.. re rL )rP rg rest) r MatchMappingrq rY rm rr r rP rg r rm r s ` @rJ visit_matchmappingz TreeRebuilder.visit_matchmapping s ({ ? ? # 2 G
HHHHHdiHHHTTTTTdmTTT**4$)DD
NrL c t j |j |j |j |j | |j fd|j D |j
fd|j D S )Nr c < g | ]} | S r r rd s rJ r z2TreeRebuilder.visit_matchclass.. re rL c < g | ]} | S r r rd s rJ r z2TreeRebuilder.visit_matchclass.. s4 5.B re rL rf )r MatchOrrq rY rm rr r rg r s ` @rJ
visit_matchorzTreeRebuilder.visit_matchor9 st m{ ? ? # 2 G
TTTTTdmTTT
NrL )NN)r6 r r7 r8 r9 r: r; r< )rM r, r; rN )rM r^ r; r )rM rh ri rj r; rk )rM r r; r< )r r r; r< )
rM r- r rX r rX r r r; r )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r0 ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r. ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r/ ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r
ri r r; r )rM r
ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r! ri r r; r" )rM r$ ri r r; r% )rM r' ri r r; r( )rM r* ri r r; r+ )rM r- ri r r; r. )rM r0 ri r r; r1 )rM r3 ri r r; r4 )rM r6 ri r r; r4 )rM r8 ri r r; r4 )rM r: ri r r; r4 )rM r< ri r r; r4 )rM r> ri r r; r4 )rM r@ ri r r; rA )rM rC ri r r; rD )rM rF ri r r; rG )rM rI ri r r; rJ )rM rL ri r r; rM )rM rO ri r r; rP )rM rR ri r r; r )rM rT ri r r; rU )rM rW ri r r; rX )rM r[ ri r r; r\ )rM r^ ri r r; r )rM r` ri r r; ra )rM rc ri r r; rd )rM rf ri r r; rg )rM ri ri r r; rj )rM rl ri r r; rm )rM rp ri r r; rq )rM rs ri r r; rt )rM rv ri r r; rw )rM ry ri r r; rz )rM r} ri r r; r~ )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r ri r r; r )rM r< ri r r; r< )rM r ri r r; r )rM r r; r< )rM r ri r r; r )rM r ri r r; r )rM r ri r r rX r; r )rM r ri r r r< r; r< )rM r ri r r r: r; r )T)rM r. ri r r# r r; r )rM rh ri r r; rB )rM r ri r r r r; rM )r rf rM r ri r r; r )r ri rM r ri r r; r )r rk rM rl ri r r; r2 )r r rM r/ ri r r; r )r r rM r0 ri r r; r )r r rM r ri r r; r1 )rM r ri r r; r )rM r- ri r r; r )rM r ri r r; r4 )rM rW ri r r; r )rM rW ri r r; r )r r6 rM rf ri r r; rg )r r8 rM r ri r r; r )r r: rM r; ri r r; r3 )rM rf ri r r; r )rM ri ri r r; r )rM rl ri r r; r )er
__module__ __qualname____doc__rK r] rg r r r r r r
r rF rG r r r r r r r r r r r r r r r r r r" r/ r2 r; rA r, rL rU rZ r` rb re r ru r r r r r r r r r r r r r r r r r r r r r r r r visit_bytesr r r r r r r r r r r! r( r+ r0 r5 r rH rK rN rU r[ r^ ra ri ro rv ry r| r r rL rJ r5 r5 9 s ;;
.2 2 2 2 2 2& * U U U U5
5
5
5
n00 00 00 00d/ / / /( 0 P
v % %
X
f $ $
X
X
f $ $
X
X
X
X
X
w & &
X
w & &
X
X
X
X
X
X
X
X
X
X
X
* * * *3 3 3 3= = = =L L L L\ !! !! !! !!F! ! ! !2M M M M
= = = =
? ? ? ? $ $ X
X *
$ DH# # # # #J
, @ - - - -( " & X
X
68 8 8 8 ( X
X 5 5 5 5nH H H H
$- - - -^ " " $
$ 6!! & 2 2 2 2
( ( ( (T
&
" " "
: 2
" X
X
B: : : : 7""
& (
S #"rL r5 );r
__future__r rq rF ru collections.abcr r ior tokenizer r typingr r
r r r
astroidr astroid._astr r r
astroid.constr r r r r astroid.managerr
astroid.nodesr astroid.nodes.utilsr astroid.typingr rG r typing_extensionsr+ __annotations__r, rx rw r1 rt r r2 rG r r3 r r+ r r5 r rL rJ r s
# " " " " "
/ / / / / / / / / / / / / / / / @ @ @ @ @ @ @ @ @ @ @ @ @ @ U U U U U U U U U U F F F F F F F F F F F F F F * * * * * * ( ( ( ( ( ( 4 4 4 4 4 4v '''''' $"!$ # #
34 W\5#4e6L
M
M
EN33 5:u 7 7%,8IIJ K K K K K K K K K K rL