+ i*a0t$Rt^RIHt^RIt^RIt^RIt^RIt^RIt^RI t ^RI t ^RI H t H t HtHtHt^RIHt^RI HtHtHtHtHt^RIHtHtHt^RIHtHt^RIH t H!t!H"t"^R I#H$t$H%t%H&t&^R I'H(t(H)t)H*t*H+t+H,t,H-t-H.t.H/t/H0t0H1t1H2t2^R I3H4t4^R I5H6t6^R I7H8t8^RI9H:t:^RI;Ht>^RI?H@t@HAtAHBtBHCtC]PR8d^RI HEtEM^RIFHEtE]'d^RIHGtG^RI7HHtH^RI;HItIRRltJ] P!R]R?]8P]8P4tq!R@RA]8P]8P]8P4ts!RBRC]8P4tt!RDRE]<4tu!RFRG]8P]8P4tv!RHRI]<4twRJ]PRK]PRL]PRM]PRN]PRO]PRPRQRRRS/t~RT]RU&RVRW0t!RXRY]<4t!RZR[]<4t!R\R]]8P]4t!R^R_]8P]8P4t!R`Ra]<4t!RbRc]8P4t!RdRe]8P]8P4t!RfRg]<]4t!RhRi]8P4t!RjRk]8P4t!RlRm]8EP]8P]8P4t!RnRo]8EP]8P]8P4t!RpRq]4t!RrRs]<4t!RtRu]8EP"4t!RvRw]<4t!RxRy]8P]8P4t!RzR{]8EP]8P4t!R|R}]<4t!R~R]8EP"4t!RR]<4t!RR]a4t!RR]8P]8P4t!RR]8P4t!RR]8P]8P4t!RR]8P4t!RR]8P4t!RR]a4t!RR]<4t!RR]8P4t!RR]<4t!RR]8EP]8P4t!RR]8EP]8P4t!RR]a4t!RR]8P]8P4t!RR]8P4tK!RR]8P4tRRRRRRRR/t!RR]8P4t!RR]8EP]8P4t!RR]8EP]8P]8P4t!RR]4t!RR]<4t!RR]4t!RR]8P4t!RR]<4tRt!RR]<4t!RR]8P4t!RR]8P4t]!]>R7t!RR]<4t!RR]8P]8EP4t!RR]<4t!RR]8EP4t!RR]4t!RR]4t!RR]4t!RR]8P]4t!RR]4t!RR]8P]4t!RR]8P]4t!RR]4t!RR]<4t!RR]<4t]P]]]]]]]]!R4]]!]4]]!R4]]]]Q]]]]]]U]]]/ tR]R&RRltRRltRRltR#)z;Module for some node classes. More nodes in scoped_nodes.py) annotationsN)Callable GeneratorIterableIteratorMapping)cached_property) TYPE_CHECKINGAnyClassVarLiteralUnion) decorators protocolsutil)Instance _infer_stmts)_EMPTY_OBJECT_MARKER PY314_PLUSContext) CallContextInferenceContext copy_context) AstroidBuildingError AstroidErrorAstroidIndexErrorAstroidTypeErrorAstroidValueErrorAttributeInferenceErrorInferenceErrorNameInferenceError NoDefaultParentMissingError_NonDeducibleTypeHierarchy) dunder_lookup)AstroidManager) _base_nodes) OP_PRECEDENCE)NodeNG)SYNTHETIC_ROOT)ConstFactoryResultInferenceErrorInfoInferenceResultSuccessfulInferenceResult)Selfnodes)LocalsDictNodeNG) FrameTypecV^8dQhRR/#returnbool)formats" RVRV/#LL5i)zrecursively generate nodes inferred by the given statement. If the inferred value is a list or a tuple, recurse on the elements NnoderN) r?rHrIeltsr Uninferable unpack_infernextinferUninferableBase)stmtrNeltinferreds&& r:rTrTZs $u &&99Cd&&& #C1 1 1  i11DJJw')9)9:Hi11JJw' h 4 4 5 5N#H6 6 6 ( D)W -- 2 7s%AC8C4BC8%C6&C86C8c V^8dQhRRRR/#r5 exceptionszlist[str] | Noner6r7r8)r9s"r:r;r;usFF,<FFr<cX/p/pTpVP4F p^W6&WTV&TpK TpVP4EFkpWc9Ed_\V\4'dIVfEVPV4wrxVPWF,4wrRW39dR#W8wdR#R#\V\4'dVPV4wrxVPWF,4wrWJdVR8H;'dV R8H;'dVP V4p VR8H;'d%V R8H;'dWF,P V4p VR8H;'dV R8Hp VR8H;'dV R8Hp\ V V V V34'dR#R#VR8XdV R8Xd WTV,Ju#R#TpEKn R#)areturn true if the two given statements are mutually exclusive `exceptions` may be a list of exception names. If specified, discard If branches and check one of the statement is in an exception handler catching one of the given exceptions. algorithm : 1) index stmt1's parents 2) climb among stmt2's parents until we find a common parent 3) if the common parent is a If or Try statement, look if nodes are in exclusive branches testFThandlersbodyorelse)node_ancestorsr?If locate_childTrycatchany)stmt1stmt2r] stmt1_parentschildrenpreviousrQc2attrc2nodec1attrc1node first_in_body_caught_by_handlers!second_in_body_caught_by_handlersfirst_in_else_other_in_handlers second_in_else_other_in_handlerss&&& r: are_exclusivervusMHH$$& !' H$$&  $## (:!%!2!28!<!%!2!28>!Bf--!#$D?D#&&!%!2!28!<!%!2!28>!B'*,77"f,77$NN:65 &(=="j0==$N00<6 *,CC81C4(*CCv/C5<=;<  $z)f .B#D>99]'^ r<cV^8dQhRR/#rMr8)r9s"r:r;r;s!8r<c\V\4'd?\VP\\ R434'd VP#\#VfR#\ VP VR74p\V\4'd8\VP\\ R434'd VP#\# \\3d \#i;i)z'Get the value of the given slice index.NrN) r?ConstrCinttyperUrVr StopIteration_SLICE_SENTINEL)indexrNrZs&& r: _slice_valuers% ekkCd#4 5 5;;  6( %   *EKKK89H(E**hnnsDJ.?@@#>>)  .    sC C#"C#cV^8dQhRR/#rMr8)r9s"r:r;r;s   7 r<cL\VPV4p\VPV4p\VPV4p\;QJdRW#V34F 'dK RM RM!RW#V344'd \ W#V4#\ RVVPVR7h)c30"TF q\JxK R#5ir>)r~.0elems& r: _infer_slice..s H3G4 &3GsFTz'Could not infer slice used in subscriptmessagerQrrN)rlowerupperstepallslicerparent)rQrNrrrs&& r: _infer_slicers W -E W -E  7 +D s HE$3G Hsss HE$3G HHHU4(( 9 kk  r<cV^8dQhRR/#rMr8)r9s"r:r;r;sHH7NHr<c\V\4'd=\W#R7pVP4pW,VnVP VnV#\V\ 4'dWP,#\RT R24h \dp\RTTTR7ThRp?i\dp\RTTTR7ThRp?i\dp\RYTR7ThRp?ii;i) zHGet a slice or an item, using the given *index*, for the given sequence.ryz&Slice {index!r} cannot index containerrNzIndex {index!s} out of rangeType error {error!r}zCould not use  as subscript index)r?Slicer __class__rRrrzrC ValueErrorr IndexErrorr TypeErrorr)instancerRrrN index_slicenew_clsexcs&&&& r:_container_getitemrs eU # #&u>K((*G,GL%__GNN eU # # $ $ $* ^E72EF GG' <     2     *PW  sBAB 'B C'B'' C'4C'5C C'C'C""C'ca]tRtRtRtRtRV3RlltRRlt]RRl4t R t RR R llt ] PR R l4tRt]P"RRRll4tRRRlltRtV;t#) BaseContaineriz.Base class for Set, FrozenSet, Tuple and List.c 0V^8dQhRRRRRRRRRRRR /# r5lineno int | None col_offsetr NodeNG | None end_linenoend_col_offsetr6Noner8)r9s"r:r;BaseContainer.__annotate__F        #   r<c @<.Vn\SV` VVVVVR7R#rrrrrN)rRsuper__init__selfrrrrrrs&&&&$$r:rBaseContainer.__init__s068 ' !!)  r<c V^8dQhRRRR/#)r5rRlist[SuccessfulInferenceResult]r6rr8)r9s"r:r;r's<r<c WnR#r>rR)rrRs&&r:postinitBaseContainer.postinit' r<c V^8dQhRRRR/#)r5rR Iterable[Any]r6r.r8)r9s"r:r;r+s4r<c V!RRRRRR7pVUu.uF!p\V4'd \V4MTNK# upVnV#uupi)zCreate a node of this type from the given list of elements. :param elts: The list of elements that the node should contain. :returns: A new node containing the given elements. Nrrrrr)rD const_factoryrR)clsrRrQes&& r: from_elementsBaseContainer.from_elements*sT  GKKd1]1%1rrs&r: get_childrenBaseContainer.get_childrenRs99 c$V^8dQhRRRRRR/#)r5rNrOkwargsr r6zIterator[Self]r8)r9s"r:r;rVs((  r<c+ "\;QJd&RVP4F 'gK RM RM!RVP44pV'dqVPV4p\V4!VPVP VP VPVPR7pVPV4VxR#VxR#5i)c3N"TFp\V\\34xK R#5ir>)r?Starred NamedExpr)rrs& r:r'BaseContainer._infer..[s"% 9BAJq7I. / /s#%TFrN) rhrR_infer_sequence_helperr|rrrrrr)rrNrhas_starred_named_exprvaluesnew_seqs&&, r:_inferBaseContainer._inferUs "%% 9=% % 9=% "  "009F4j{{??{{??#22 G   V $MJs'C &C A6C c V^8dQhRRRR/#)r5rNrOr6rr8)r9s"r:r;rms. (r<c $.pVPFp\V\4'dv\P!VP V4pV'g \ WR7h\VR4'g \ WR7hVPVPV44K\V\4'dI\P!VP V4pV'g \ WR7hVPV4KVPV4K V#)z-Infer all values based on BaseContainer.elts.rQrNrR) rRr?rr safe_inferrCrhasattrextendrrappend)rrNrrYstarredrCs&& r:r$BaseContainer._infer_sequence_helperms99C#w''//#))W=(dDDw//(dDD g<)__name__ __module__ __qualname____firstlineno____doc___astroid_fieldsrr classmethodrrrabcabstractmethodrrrraise_if_nothing_inferredrr__static_attributes__ __classcell__rs@r:rrs{8O  ("   ))*.r<r) metaclassca]tRtRtRtR tRV3Rllt]Pt ] P] PR RRll44t ] PR RRll4tR tV;t#) rJiaVariation of :class:`ast.Assign` representing assignment to a name. An :class:`AssignName` is the name of something that is assigned to. This includes variables defined in a function signature or in a loop. >>> import astroid >>> node = astroid.extract_node('variable = range(10)') >>> node >>> list(node.get_children()) [, ] >>> list(node.get_children())[0].as_string() 'variable' c4V^8dQhRRRRRRRRRR R R R R /# r5namerrr{rrr(rrrr6rr8)r9s"r:r;AssignName.__annotate__P         #   r<c ><Wn\SV` VVVVVR7R#rrrrrrrrrrrrs&&&&&$$r:rAssignName.__init__s. + !!)  r<c$V^8dQhRRRRRR/#r5rNrOrr r6;Generator[InferenceResult, None, InferenceErrorInfo | None]r8)r9s"r:r;r$ , ,. ,AD , D ,r<c \VP\4'dVPPV4#\ VP VR74p\ W14#)zFInfer an AssignName: need to inspect the RHS part of the assign node. ryr?r AugAssignrVlistassigned_stmtsrrrNrstmtss&&, r:rAssignName._inferM dkk9 - -;;$$W- -T(((9:E++r<c$V^8dQhRRRRRR/#rr8)r9s"r:r;r$33.3AD3 D3r<c ^RIHp^RIHpVP VP 4wrVV'gjV!VP 44pV'dVP VP 4wrV'g'\VP VP 4VR7h\V4pVP Vn V!W4VPVP &\WaV4#)zIInfer a Name: use name lookup rules. Same implementation as Name._infer.get_constraints_higher_function_scoperscoperN astroid.constraintrastroid.helpersrlookuprrr r lookupname constraintsr rrNrrrframerparent_function_s &&, r: infer_lhsAssignName.infer_lhss 7:{{499- 5TZZ\BO*11$))<($**,w'!YY)8)EDII&EE22r<rr>)rrrrr _other_fieldsrrassend_assigned_stmtsrrr path_wrapperrr'rrrs@r:rJrJsm M  *44N)) ,* ,))3*3r<c6a]tRtRtRtRtRV3RlltRtV;t#)DelNameiaHVariation of :class:`ast.Delete` representing deletion of a name. A :class:`DelName` is the name of something that is deleted. >>> import astroid >>> node = astroid.extract_node("del variable #@") >>> list(node.get_children()) [] >>> list(node.get_children())[0].as_string() 'variable' c4V^8dQhRRRRRRRRRR R R R R /#rr8)r9s"r:r;DelName.__annotate__rr<c ><Wn\SV` VVVVVR7R#rrrs&&&&&$$r:rDelName.__init__s. - !!)  r<r) rrrrrr*rrrrs@r:r.r.s M  r<r.ca]tRtRtRtRtRV3RlltRt]P]PR RRll44t Rt V;t #) Namei aClass representing an :class:`ast.Name` node. A :class:`Name` node is something that is named, but not covered by :class:`AssignName` or :class:`DelName`. >>> import astroid >>> node = astroid.extract_node('range(10)') >>> node >>> list(node.get_children()) [, ] >>> list(node.get_children())[0].as_string() 'range' c4V^8dQhRRRRRRRRRR R R R R /#rr8)r9s"r:r;Name.__annotate__rr<c ><Wn\SV` VVVVVR7R#rrrs&&&&&$$r:r Name.__init__s. 0 !!)  r<c# x"VxVP4FpVP4RjxL K R#L 5ir>)r_get_name_nodes)r child_nodes& r:r;Name._get_name_nodes3s2 ++-J!113 3 3. 3s +:8 :c$V^8dQhRRRRRR/#rr8)r9s"r:r;r7;rr<c ^RIHp^RIHpVP VP 4wrVV'gjV!VP 44pV'dVP VP 4wrV'g'\VP VP 4VR7h\V4pVP Vn V!W4VPVP &\WaV4#)zRInfer a Name: use name lookup rules Same implementation as AssignName._infer_lhs.rrrrr#s &&, r:r Name._infer9s 7:{{499- 5TZZ\BO*11$))<($**,w'!YY)8)EDII&EE22r<r)r>)rrrrrr*rr;rrr,rrrrs@r:r5r5 sF M  *4 ))3*3r<r5DEPRECATED_ARGUMENT_DEFAULTca]tRtRt$RtR1tR2tR]R&R]R&R]R&R]R&R]R&R]R &R]R&R]R &R]R &R]R&R]R&R]R &R]R &R]R&R]R&R3RV3RllltR4RRllt ] Pt Rt ]RV3R ll4t]R!4tR"R/R#R$lltR%R&ltR'tR(R)lt]3R*ltR+tR,R-lt]P4R5R.R/ll4tR0tV;t#)6 Argumentsi[a.Class representing an :class:`ast.arguments` node. An :class:`Arguments` node represents that arguments in a function definition. >>> import astroid >>> node = astroid.extract_node('def foo(bar): pass') >>> node >>> node.args argsdefaults kwonlyargs posonlyargsposonlyargs_annotations kw_defaultsrvarargannotationkwargannotationkwonlyargs_annotationstype_comment_argstype_comment_kwonlyargstype_comment_posonlyargslist[AssignName] | Nonelist[NodeNG] | Nonelist[AssignName]list[NodeNG | None] | Nonelist[NodeNG | None]rAssignName | None vararg_node kwarg_nodeNc 0V^8dQhRRRRRRRRRRR R /#) r5vararg str | Nonekwargrr(rVrUrWr6rr8)r9s"r:r;Arguments.__annotate__sF%%%% % ' % & % %r<c d<\SV`VRRRRR7WnW nW@nWPnR#)zPAlmost all attributes can be None for living objects where introspection failed.Nrrrrr)rrrYr[rVrW)rrYr[rrVrWrs&&&&&&r:rArguments.__init__sC    8 @&$r<cPV^8dQhRRRRRRRRR R R RR R R R RRRRRRRRRRRR/#)r5rDrPrErQrFrRrIrSrrTrGrLrHrJrrKrMrNrOr6rr8)r9s"r:r;r\s$A$A%$A&$A% $A 0 $A ) $A&$A!4$A"5$A($A'$A6$A"<$A#=$A $Ar<c WnW nW0nW`nW@nWPnWpnWnWnWn V f.p Wn V f.p Wn V f.p Wn R#r>) rDrErFrGrIrrLrHrJrKrMrNrO)rrDrErFrIrrGrLrHrJrKrMrNrOs&&&&&&&&&&&&&&r:rArguments.postinitsu   $&&&&<#'>$!1.  $ " !2 " *&( #'>$ # +') $(@%r<c *VPVJdV#R#r>rrr$rs&&&r: _infer_nameArguments._infer_name s ;;% Kr<cV^8dQhRR/#r5r6r{r8)r9s"r:r;r\s88C8r<c j<\SV`p\YPP;'g^4#)zsThe first line that this node appears on in the source code. Can also return 0 if the line can not be determined. )r fromlinenomaxr)rrrs& r:rkArguments.fromlinenos, #6;;1166Q77r<c \\P!VP;'gRVP;'gR44pVP 'dVP VP 4YP;'gR, pVP'dVP VP4V#)zGet all the arguments for this node. This includes: * Positional only arguments * Positional arguments * Keyword arguments * Variable arguments (.e.g *args) * Variable keyword arguments (e.g **kwargs) r8) r itertoolschainrGrDrVrrFrW)rretvals& r: argumentsArguments.argumentssioot'7'7'='=2bRS     MM$** +//''R' ??? MM$// * r<skippable_namesc V^8dQhRRRR/#r5rtzset[str] | Noner6rr8)r9s"r:r;r\,s0!0!o0!0!r<c  .p.pVPpVP'dbVP;'g.pVP\V4)RpVPR\VP4\V4, pVP'dDVP \ VPVVP VR74VP R4VP'd4VP \ VPV\VRR4VR74VP'dVP RVP 24VP'd`VP'gVP R4VP \ VPVPVPVR74VP'dVP RVP 24RPV4#)zWGet the arguments formatted as string. :returns: The formatted arguments. :rtype: str N)rt/r***, )rErDlenrGr _format_argsrHgetattrrYrFrIrLr[join)rrtresultpositional_only_defaultspositional_or_keyword_defaultsrDs&$ r: format_argsArguments.format_args,s #% )-& ===99??D-1]]CI:<-H *'+}}5Us4==7ICPTI7U'V $     MM$$,00$3   MM#  999 MMII2D-6$3   ;;; MMAdkk]+ , ???;;; c" MMOO$$//$3   ::: MMBtzzl+ ,yy  r<cV^8dQhRR/#)r5r6zYtuple[dict[str, tuple[str | None, str | None]], dict[str, tuple[str | None, str | None]]]r8)r9s"r:r;r\^sC!C! C!r<c X/p/p.pVPpVP'dbVP;'g.pVP\V4)RpVPR\VP4\V4, p\VP4FZwrgVP V,RrVeVP 4pV'dW6,P 4p W3WP&K\ \VP4FwrjVPV,RrVeVP 4pV'dU\VP4\V4, p Wk, p V R8d!WL,eWL,P 4p W3WP&K VP'd1VPpVeVP 4pVR3WP&\VP4FbwrmVPV,pVeVP 4pVPV,p V eV P 4p W3W-P&Kd VP'd1VPpVeVP 4pVR3W P&W3#)aQGet the arguments as dictionary with information about typing and defaults. The return tuple contains a dictionary for positional and keyword arguments with their typing and their default value, if any. The method follows a similar order as format_args but instead of formatting into a string it returns the data that is used to do so. N)rErDr| enumeraterGrH as_stringrrrYrJrFrLrIr[rK)rpos_onlykw_onlyrrrDrposonly annotationdefaultargdefaults_offset default_indexr[s& r:_get_arguments_dataArguments._get_arguments_data^sQ>@<>$& )-& ===99??D-1]]CI:<-H *'+}}5Us4==7ICPTI7U'V $'(8(89NE"&">">u"Et%'113 '29CCE&0%:H\\ " :$DII.JE"&"2"25"94%'113 -"%dii.37U3V"V % 7 !B&6EQ<KUUWG",!6HXX / ;;;..J%'113 %/$6H[[ !%doo6LE44U;J%'113 &&u-G"!++-#-"7GJJ 7 :::--J%'113 #-t"4GJJ   r<c VPUu.uF-q"PVPVP39gK+VNK/ pp\ WP 4^,pVeZ\ VP4V8d@VPV,eVPV,#\VPVR7h\ W4^,pVeaV\ V4\ VP4, \ VP4, , pV^8dVPV,#\VPVR7huupi)zGet the default value for an argument. :param argname: The name of the argument to get the default value for. :type argname: str :raises NoDefault: If there is no default value defined for the given argument. )funcr) rrrrYr[ _find_argrFr|rIr!rrE)rargnamerrDridxs&& r: default_valueArguments.default_values  >> )CXXdkk4::=V-VCC>  '??3A6  C(8(8$9E$A&2''..7; ;'(+  3t9s4=='99C@P@P>>'@OE&r<c# p"VP;'gRRjxL VPF pVfK VxK VP;'gRRjxL VPeVPRjxL VPRjxL VP ;'gRF pVfK VxK VP F pVfK VxK VPeVPxVPeVPxVPF pVfK VxK R#ELLLL5i)Nr8) rGrHrDrErFrIrrJrKrLrrYs& r:rArguments.get_childrens##))r))//C 099??"" == $}} $ $??""##))r)C *##C $  ,'' '    +&& &..C /5 * # %"siD6D-D6D6D6D0!D69D2:D6 D4D6%D61D6AD6# D60D62D64D6cV^8dQhRR/#)r5r6zIterator[nodes.NodeNG]r8)r9s"r:r;r\s''!7'r<c# 0"VPF pVfK VxK VPF pVfK VxK VPeVPxVPF pVfK VxK VPeVPxR#R#5i)z#Iterate over all annotations nodes.N)rHrrJrLrKrs& r:get_annotationsArguments.get_annotationss//C 0##C $  ,'' '..C /    +&& & ,sBB4B.(Bc$V^8dQhRRRRRR/#r5rNrOrr r6Generator[InferenceResult]r8)r9s"r:r;r\s)KK.KADK #Kr<c p^RIHpVeVPf \WR7hV!WPV4#))_arguments_infer_argnamer)astroid.protocolsrr!r)rrNrrs&&, r:rArguments._infers5 ? ?g008 d< <'.@.@'JJr<)rrDrErIr[rWrKrFrLrGrHrMrNrOrYrVrJ) rDrErFrGrHrIrrJrKrLrMrNrO)rYr[r)NNNNNr>)rrrrrrr*__annotations__rrrarguments_assigned_stmtsrrfrrkrrrrrrrArrrrrrrrrs@r:rCrC[sL .O (M !!"!K  C!!=++V$$L00Q//O** 10 21 $#@""H""0!!1%%6$AL77N 88"0!0!dC!J86 6)D*>'"))K*Kr<rCcZ\V4Fwr#VPV8XgKW#3u# R#)Nr)rr)rrDirs&& r:rrs-D/ 88w 6M" r<c V^8dQhRRRR/#rvr8)r9s"r:r;r;$s&&& >>$--AAA!. 3*4 4 99B #       !. s[A(E +BD9;E<D9D7D9 E!E 7D99EEEEEE c a]tRtRt$RtR]R&RtRtRV3RlltRRlt ] Pt R t ]P]P RR R ll44t]P]P RR R ll44tRtV;t#)rKimamVariation of :class:`ast.Assign` representing assignment to an attribute. >>> import astroid >>> node = astroid.extract_node('self.attribute = range(10)') >>> node >>> list(node.get_children()) [, ] >>> list(node.get_children())[0].as_string() 'self.attribute' r(rc4V^8dQhRRRRRRRRRR R R R R /# r5rrrr{rrr(rrrr6rr8)r9s"r:r;AssignAttr.__annotate__P         #   r<c ><Wn\SV` VVVVVR7R#rrrrrrrrrrrrs&&&&&$$r:rAssignAttr.__init__s.! : !!)  r<c V^8dQhRRRR/#r5rr(r6rr8)r9s"r:r;rVr<c WnR#r>rrrs&&r:rAssignAttr.postinitrr<c# *"VPxR#5ir>rrs&r:rAssignAttr.get_childreniic$V^8dQhRRRRRR/#rr8)r9s"r:r;rr r<c \VP\4'dVPPV4#\ VP VR74p\ W14#)zFInfer an AssignAttr: need to inspect the RHS part of the assign node. ryr rs&&, r:rAssignAttr._inferrr<c$V^8dQhRRRRRR/#rr8)r9s"r:r;rs$99.9AD9 D9r<c \W3/VB#r>rrrNrs&&,r:r'AssignAttr.infer_lhs  888r<rrrrr>)rrrrrrrr*rrrr+rrrrr,rr'rrrs@r:rKrKms  LO!M  *44N)) ,* ,))9*9r<cJ]tRtRt$RtR tR]R&R]R&RRltR tR t R #) AssertizClass representing an :class:`ast.Assert` node. An :class:`Assert` node represents an assert statement. >>> import astroid >>> node = astroid.extract_node('assert len(things) == 10, "Not enough things"') >>> node r_failr(rc$V^8dQhRRRRRR/#)r5r_r(rrr6rr8)r9s"r:r;Assert.__annotate__s!V=Tr<c W nWnR#r>rr_)rr_rs&&&r:rAssert.postinits   r<c# f"VPxVPeVPxR#R#5ir>r_rrs&r:rAssert.get_childrens&ii 99 ))O !/1rNr rrrrrrrrrrr8r<r:rrs)'O L6 5r<rc]tRtRt$RtR]R&R]R&R]R&RtRtR R lt] Pt R t ] R R l4tRtRtRtR#)AssignizClass representing an :class:`ast.Assign` node. An :class:`Assign` is a statement where something is explicitly asssigned to. >>> import astroid >>> node = astroid.extract_node('variable = range(10)') >>> node list[NodeNG]targetsr(rCrtype_annotationc(V^8dQhRRRRRRRR/#) r5r rrCr(r rr6rr8)r9s"r:r;Assign.__annotate__s2////' /  /r<c *WnW nW0nR#r>)r rCr )rr rCr s&&&&r:rAssign.postinits   .r<c# V"VPRjxL VPxR#L5ir>r rCrs&r:rAssign.get_childrens!<<jj s )')cV^8dQhRR/#)r5r6zlist[nodes.Assign]r8)r9s"r:r;r s::(::r<c 4V.VPPO#r>)rC_assign_nodes_in_scopers&r:rAssign._assign_nodes_in_scopes9tzz8899r<c# V"VPP4RjxL R#L5ir>)rC_get_yield_nodes_skip_functionsrs&r:r&Assign._get_yield_nodes_skip_functionss::==??? )')c# V"VPP4RjxL R#L5ir>)rC_get_yield_nodes_skip_lambdasrs&r:r$Assign._get_yield_nodes_skip_lambdass::;;===r)r r rCNrr )rrrrrrr_other_other_fieldsrrassign_assigned_stmtsrrrrrrrr8r<r:rrsi $ M4""T*O./44N ::@>r<rc]tRtRt$RtRtRtR]R&R]R&R ]R&R ]R&R R lt] Pt R t Rt R#) AnnAssigni zClass representing an :class:`ast.AnnAssign` node. An :class:`AnnAssign` is an assignment with a type annotation. >>> import astroid >>> node = astroid.extract_node('variable: List[int] = range(10)') >>> node targetrrCsimpleName | Attribute | Subscriptr(rr{c ,V^8dQhRRRRRRRRR R /#) r5r"r$rr(r#r{rCrr6rr8)r9s"r:r;AnnAssign.__annotate__$s<  ,       r<c 6WnW nW@nW0nR#r>)r"rrCr#)rr"rr#rCs&&&&&r:rAnnAssign.postinit$s $  r<c# "VPxVPxVPeVPxR#R#5ir>r"rrCrs&r:rAnnAssign.get_children5s2kkoo :: !**  "=?)rr#r"rCNr*)r#)rrrrrrr*rrrassign_annassigned_stmtsrrrr8r<r:r!r! sR8OM (($; 4 KG 77Nr<r!ca]tRtRt$RtRtRtR]R&R]R&RV3RlltR R lt ] Pt RR R llt R tV3RltV3RltRRRllt]P&]P(RRRll44tRtV;t#)r i=zClass representing an :class:`ast.AugAssign` node. An :class:`AugAssign` is an assignment paired with an operator. >>> import astroid >>> node = astroid.extract_node('variable += 1') >>> node r"rCr$r(c4V^8dQhRRRRRRRRRR R R R R /# r5oprrr{rrr(rrrr6rr8)r9s"r:r;AugAssign.__annotate__SsP         #   r<c ><Wn\SV` VVVVVR7R#rr1rrrr1rrrrrrs&&&&&$$r:rAugAssign.__init__Ss2 !!)  r<c$V^8dQhRRRRRR/#)r5r"r$rCr(r6rr8)r9s"r:r;r2ks";Ftr<c WnW nR#r>r"rCrr"rCs&&&r:rAugAssign.postinitk   r<c V^8dQhRRRR/#r5rNrOr6z$list[util.BadBinaryOperationMessage]r8)r9s"r:r;r2t. -r<c .pVPVR7FPpV\PJd\h\ V\P 4'gK?VP V4KR V# \d.u#i;i)zGet a list of type errors which can occur during inference. Each TypeError is represented by a :class:`BadBinaryOperationMessage` , which holds the original exception. If any inferred result is uninferable, an empty list is returned. ry)_infer_augassignrrSrr?BadBinaryOperationMessagerrrNbadrs&& r: type_errorsAugAssign.type_errorstsw ///@T---((fd&D&DEEJJv& A  I A A,A,, A<;A<c# F"VPxVPxR#5ir>r9rs&r:rAugAssign.get_childrenskkjj!c# <"VPP4RjxL \SV`4RjxL R#LL5iz7An AugAssign node can contain a Yield node in the valueN)rCrrrrs&r:r)AugAssign._get_yield_nodes_skip_functionss6::==???7:<<< @<A>AAAAc# <"VPP4RjxL \SV`4RjxL R#LL5irL)rCrrrMs&r:r'AugAssign._get_yield_nodes_skip_lambdass5::;;===78::: >:rOc V^8dQhRRRR/#)r5rNrOr6z;Generator[InferenceResult | util.BadBinaryOperationMessage]r8)r9s"r:r;r2s''.' D'r<c # D"T;'g \4pVP4pVPPVR7pVPP VR7p\ P!W44FwrV\;QJdRWe34F 'gK RM RM!RWe344'd\PxR#VPVVVVVPR7RjxL K R#L \d\PxKi;i5i)z0Inference logic for augmented binary operations.ryc3V"TFp\V\P4xK! R#5ir>r?rrWrrCs& r:r-AugAssign._infer_augassign.. S u:eT%9%9:: ')TFN)leftright binary_opnoderN flow_factory)rcloner"r'rCrVroproductrhrrS_infer_binary_operation _get_aug_flowr#)rrN rhs_contextlhs_iterrhs_iterlhsrhss&& r:rAAugAssign._infer_augassigns//-/mmo ;;(((9::##K#8!))(=HCsS SsssS SSS&&& '77"&#!%!3!3 8>. '&&& 'sHBD D 6D  #C</C:0C<4D :C<<DD DD c$V^8dQhRRRRRR/#rr8)r9s"r:r;r2$  . AD # r<c XVPVPV\P4#r>)_filter_operation_errorsrArrBrs&&,r:rAugAssign._infers* ,,  ! !7D,J,J  r<)r1r"rCr9r1r>)rrrrrrr*rrrrrrrErrrrArrr,rrrrs@r:r r =s*OM (($ M3  044N*= ; '8)) * r<r ca]tRtRt$RtRtRtR]R&R]R&RV3RlltRR lt RR R llt R t R Rlt RRlt RRRllt]P ]P"RRRll44tRtV;t#)BinOpizClass representing an :class:`ast.BinOp` node. A :class:`BinOp` node is an application of a binary operator. >>> import astroid >>> node = astroid.extract_node('a + b') >>> node rZr[r(c4V^8dQhRRRRRRRRRR R R R R /#r0r8)r9s"r:r;BinOp.__annotate__P         #   r<c ><Wn\SV` VVVVVR7R#rr4r5s&&&&&$$r:rBinOp.__init__. !!)  r<c$V^8dQhRRRRRR/#)r5rZr(r[r6rr8)r9s"r:r;rqs!VFtr<c WnW nR#r>rZr[)rrZr[s&&&r:rBinOp.postinits   r<c V^8dQhRRRR/#r>r8)r9s"r:r;rqr?r<c .pVPVR7FPpV\PJd\h\ V\P 4'gK?VP V4KR V# \d.u#i;i)zGet a list of type errors which can occur during inference. Each TypeError is represented by a :class:`BadBinaryOperationMessage`, which holds the original exception. If any inferred result is uninferable, an empty list is returned. ry) _infer_binoprrSrr?rBrrCs&& r:rEBinOp.type_errorssv ++G+<T---((fd&D&DEEJJv& =  I rGc# F"VPxVPxR#5ir>rxrs&r:rBinOp.get_childrensiijjrJcV^8dQhRR/#rir8)r9s"r:r;rq&&s&r<c 0\VP,#r>r'r1rs&r: op_precedenceBinOp.op_precedenceTWW%%r<cV^8dQhRR/#r4r8)r9s"r:r;rqsTr<c VPR8g#)rzrmrs&r:op_left_associativeBinOp.op_left_associativesww$r<c$V^8dQhRRRRRR/#rr8)r9s"r:r;rq s$''.'AD' #'r<c+ R"VPpVPpT;'g \4p\V4p\V4pVP VR7pVP VR7p\ P !Wx4F|wr\;QJdRW34F 'gK RM RM!RW344'd\PxR#VPWWVP4RjxL K~ R#L \d\PxKi;i5i)z!Binary operation inference logic.ryc3V"TFp\V\P4xK! R#5ir>rUrVs& r:r%BinOp._infer_binop..rXrYTFN) rZr[rrrVror_rhrrSr`_get_binop_flowr#) rrNrrZr[ lhs_contextrbrcrdrerfs &&, r:r|BinOp._infer_binop syy  //-/"7+ "7+ ::k:2;;{;3!))(=HCsS SsssS SSS&&& '77dT-A-A>. '&&& 'sHBD'$D'D' D6D7D;D'DD$ D'#D$$D'c$V^8dQhRRRRRR/#rr8)r9s"r:r;rq(rir<c XVPVPV\P4#r>)rkr|rrBrs&&,r:r BinOp._infer&s* ,,   w(F(F  r<)rZr1r[rxrmr>)rrrrrrr*rrrrErrrr|ryes_if_nothing_inferredr,rrrrs@r:rorost(OM LA MB  **&'8'' ( r<roca]tRtRtRtRtRtRRRRR/RV3RlllltRRR lltR t R R lt ] P] PRR Rll44tRtV;t#)BoolOpi0zClass representing an :class:`ast.BoolOp` node. A :class:`BoolOp` is an application of a boolean operator. >>> import astroid >>> node = astroid.extract_node('a and b') >>> node Nrrc4V^8dQhRRRRRRRRRRR RR R /#) r5r1rrrrrrrrr6rr8)r9s"r:r;BoolOp.__annotate__>sP% % % %  %  % % #%  % r<c N<Wn.Vn\SV` VVVVVR7R#)a :param op: The operator. :param lineno: The line that this node appears on in the source code. :param col_offset: The column that this node appears on in the source code. :param parent: The parent node in the syntax tree. :param end_lineno: The last line this node appears on in the source code. :param end_col_offset: The end column this node appears on in the source code. Note: This is after the last symbol. rN)r1rrrr5s&&&&&$$r:rBoolOp.__init__>s82$& 7 !!)  r<c V^8dQhRRRR/#r5rrQr6rr8)r9s"r:r;res!!2!d!r<c Ve WnR#R#)z^Do some setup after initialisation. :param values: The values being applied to the operator. Nrrrs&&r:rBoolOp.postinites   K r<c# :"VPRjxL R#L5ir>rrs&r:rBoolOp.get_childrenm;;rcV^8dQhRR/#rir8)r9s"r:r;rprr<c 0\VP,#r>rrs&r:rBoolOp.op_precedenceprr<c$V^8dQhRRRRRR/#rr8)r9s"r:r;rus$2>2>.2>AD2> D2>r<c+ `"VPpVPR8Xd\PpM\PpVUu.uFqUP VR7NK pp\P!T!Fp\;QJdRT4F 'gK RM RM !RT44'd\PxKQTUu.uFqP4NK p p\;QJdRT 4F 'gK RM RM !RT 44'd\PxK\Pp\Yy4FwrZT!T 4'gKTxK TxK \YR7#uupi \ d\PxR#i;iuupi5i) zInfer a boolean operation (and / or / not). The function will calculate the boolean operation for all pairs generated through inference for each component node. orryNc3V"TFp\V\P4xK! R#5ir>rUritems& r:r BoolOp._infer..s Kdd:dD$8$899drYTFc3V"TFp\V\P4xK! R#5ir>rUrs& r:rrs Rkd:dD$8$899krYr)rr1operatortruthnot_rVrrrSror_rhrzipr+) rrNrr predicaterCinferred_valuespairr bool_valuesrs &&, r:r BoolOp._inferssN 77d? I I IOP{{7{;OP %%7DsKdKsssKdKKK&&&9=>??,K>sRkRsssRkRRR&&&$$E%(%;!Z((K&<  78:"t==EQ "" " ?se?F.FF F"3F.F.3F. F)#F.F.?F.#F.FF&"F.%F&&F.)r1rrrmNNNr>)rrrrrrr*rrrrrrr,rrrrs@r:rr0sj"OM% "&% &*% % N!&))2>*2>r<rc]tRtRtRtRtR#)BreakizClass representing an :class:`ast.Break` node. >>> import astroid >>> node = astroid.extract_node('break') >>> node r8Nrrrrrrr8r<r:rrr<rc]tRtRt$RtRtR]R&R]R&R]R&R R lt]R R l4t ]R Rl4t Rt ] P] PRRRll44tRRltRtR#)CallizClass representing an :class:`ast.Call` node. A :class:`Call` node is a call to a function, method, etc. >>> import astroid >>> node = astroid.extract_node('function()') >>> node rrDkeywordsr(r list[Keyword]c(V^8dQhRRRRRRRR/#) r5rr(rDrrrr6rr8)r9s"r:r;Call.__annotate__s,!!!".!:G! !r<c *WnW nW0nR#r>rrDr)rrrDrs&&&&r:r Call.postinits   r<cV^8dQhRR/#)r5r6z list[Starred]r8)r9s"r:r;rsFF-Fr<c tVPUu.uFp\V\4'gKVNK up#uupi)z/The positional arguments that unpack something.)rDr?r)rrs& r:starargs Call.starargss+ $yyEyJsG,DyEEEs55cV^8dQhRR/#)r5r6rr8)r9s"r:r;rsMM Mr<c bVPUu.uFqPeKVNK up#uupi)z,The keyword arguments that unpack something.)rr)rkeywords& r:r Call.kwargss&(,}}L}G }LLLs,,c# "VPxVPRjxL VPRjxL R#LL5ir>rrs&r:rCall.get_childrens0ii99==    ?;?=??Nc$V^8dQhRRRRRR/#r5rNrOrr r6rr8)r9s"r:r;rs$>>.>AD> =>r<c+ "\V4pRVnVe%VPVP44VnVP P V4Fp\V\P4'dVxK)\VR4'dD\VPVPVR7VnVPWR7RjxL KK \#WR7#L \ dKi;i5i)z?Infer a Call node by trying to guess what the function returns.Ninfer_call_result)rDrcallee)callerrNr)rr_populate_context_lookupr^ extra_contextrrVr?rrWrrrDr callcontextrrr+)rrNrrrs&&, r:r Call._infers #7+ $   (,(E(Egmmo(VK %iioog.F&$"6"677  6#677.9!YYv/K+ &77# 8  8 /"t== "  s=A?C;AC)C'C)C;'C)) C84C;7C88C;cV^8dQhRR/#rMr8)r9s"r:r;rs  0G r<c /pVfV#VPF-p\V\4'dWVP&K)WV&K/ VPe VPM.pVFpWVP&K V#)zEAllows context to be saved for later for inference inside a function.)rDr?rrCr)rrNcontext_lookuprrrs&& r:rCall._populate_context_lookupssBD ?! !99C#w'',3syy)&-s#  %)MM$=4==2G,37== ) r<)rDrrrr>)rrrrrrrrpropertyrrrrrr,rrrr8r<r:rrs3O L ;8!FFMM!))>*>2  r<rz==z!=z>=inc W9#r>r8abs&&r:rsqvr<znot inc W9#r>r8rs&&r:rrs1:r<z%dict[str, Callable[[Any, Any], bool]] COMPARE_OPSiszis notc]tRtRt$RtRtR]R&R]R&RRltR tR t ] R R l4t R Rlt RRRllt RtR#)Compareia,Class representing an :class:`ast.Compare` node. A :class:`Compare` node indicates a comparison. >>> import astroid >>> node = astroid.extract_node('a <= b <= c') >>> node >>> node.ops [('<=', ), ('<=', )] rZopsr(list[tuple[str, NodeNG]]c$V^8dQhRRRRRR/#)r5rZr(rrr6rr8)r9s"r:r;Compare.__annotate__2s"V*Btr<c WnW nR#r>rZr)rrZrs&&&r:rCompare.postinit2s  r<c# \"VPxVPF wrVxK R#5i)zGet the child nodes below this node. Overridden to handle the tuple fields and skip returning the operator strings. :returns: The children. :rtype: iterable(NodeNG) Nr)rr& comparators& r:rCompare.get_children6s&ii!XXMA &s*,c 6VPR,^,#)z[An optimized version of list(get_children())[-1] :returns: The last child. :rtype: NodeNG r)rrs&r: last_childCompare.last_childCsxx|Ar<c V^8dQhRRRR/#)r5rQr-r6r r8)r9s"r:r;rOs22322r<c J\P!VP44#r>)ast literal_evalr)rQs&r: _to_literalCompare._to_literalNs  011r<c(V^8dQhRRRRRRRR/#)r5 left_iterzIterable[InferenceResult]r1r right_iterr6zbool | util.UninferableBaser8)r9s"r:r;rUs2..,. .. . % .r<c xRpV\9d\P#\V,p\P !W4Fwrg\ V\P4'g!\ V\P4'd\Pu#VPV4VPV4rvT!Yg4pTfTpKYH8wgK\Pu# VfQhV# \\\\3d\Puu#i;i \d p \T hRp ? ii;i)a9 If all possible combinations are either True or False, return that: >>> _do_compare([1, 2], '<=', [3, 4]) True >>> _do_compare([1, 2], '==', [3, 4]) False If any item is uninferable, or if some combinations are True and some are False, return Uninferable: >>> _do_compare([1, 3], '<=', [2, 4]) util.Uninferable N)UNINFERABLE_OPSrrSrror_r?rWr SyntaxErrorrrrr) rrr1rrqop_funcrZr[rrs &&&& r: _do_compareCompare._do_compareUs$#  ## #b/$,,YCKD$ 4 455t++::''' ("..t4d6F6Fu6Me 0t+~''''D,!!!  ^YG (''' (  0&C/ 0s*!C/;D"/+DD" D9-D44D9Nc$V^8dQhRRRRRR/#)r5rNrOrr r6z-Generator[nodes.Const | util.UninferableBase]r8)r9s"r:r;rs$  . AD 6 r<c+ "RpVPpVPp\VPVR74pVF=wrx\VPVR74p VP WgV 4pTRJdMT pK? V\ PJdVxR#\V4xR# \ d\ PpKHi;i5i)z#Chained comparison inference logic.TryN) rrZrrVrrrrSrz) rrNrrqr left_noderer1 right_noderfs &&, r:rCompare._infers/3hhII 9??7?34!NBz'''89C ))#37T!C" T%% %L- $ )) s*ACB$-7C$C?CCCrr>)rrrrrrrrrr staticmethodrrrrr8r<r:rrsR &O LG !!M 22 .`  r<rc]tRtRt$RtRtRtRtR]R&R]R&R ]R&R ]R&R R lt ] Pt R t RRltRtRtR#) ComprehensioniaClass representing an :class:`ast.comprehension` node. A :class:`Comprehension` indicates the loop inside any type of comprehension including generator expressions. >>> import astroid >>> node = astroid.extract_node('[x for x in some_values]') >>> list(node.get_children()) [, ] >>> list(node.get_children())[1].as_string() 'for x in some_values' r"iterifsis_asyncTr(rr7c ,V^8dQhRRRRRRRRRR /#) r5r"r(rrrrr7r6rr8)r9s"r:r;Comprehension.__annotate__s< ! ! ! ! !  !  !r<c 6WnW nW0nW@nR#r>)r"rrr)rr"rrrs&&&&&r:rComprehension.postinits   r<c V#)z_The type of assignment that this node performs. :returns: The assignment type. :rtype: NodeNG r8rs&r: assign_typeComprehension.assign_types  r<cV^8dQhRR/#)r5mystmtz_base_nodes.Statement | Noner8)r9s"r:r;rs0Lr<c WJd'\V\\34'dV.R3#VR3#VP4VJdV.R3#VR3#)zmethod used in filter_stmtsTF)r?rzr5 statement)r lookup_noderQrrs&&&&&r:_get_filtered_stmts!Comprehension._get_filtered_stmtssa >+t}55#}d**6e| ^^  '64< e|r<c# r"VPxVPxVPRjxL R#L5ir>r"rrrs&r:rComprehension.get_childrens%kkii88s ,757)rrrr"Nr$)r)rrrrrrr*optional_assignrrrfor_assigned_stmtsrrr!rrr8r<r:rrsb 0O!MO: N3 L5 JN? !11N r<rca]tRtRtRtRtRR]R3RRRR/RV3Rllllt]Pt ]Pt V3Rlt RR R lltR R ltR tRRltRRRlltRRRlltRtV;t#)rziaClass representing any constant including num, str, bool, None, bytes. >>> import astroid >>> node = astroid.extract_node('(5, "This is a string.", True, None, b"bytes")') >>> node >>> list(node.get_children()) [, , , , ] Nrrc8V^8dQhRRRRRRRRRR R RR RR R /#)r5rCr rrrrr(kindrZrrr6rr8)r9s"r:r;Const.__annotate__sZ3&3&3&3& 3&  3&  3&3&#3& 3&r<c <\VRR4R8Xd\P!R\^R7WnWPn\ SV`VVVVVR7\P!VR4R#)a- :param value: The value that the constant represents. :param lineno: The line that this node appears on in the source code. :param col_offset: The column that this node appears on in the source code. :param parent: The parent node in the syntax tree. :param kind: The string prefix. "u" for u-prefixed strings and ``None`` otherwise. Python 3.8+ only. :param end_lineno: The last line this node appears on in the source code. :param end_col_offset: The end column this node appears on in the source code. Note: This is after the last symbol. rNrzYou have most likely called a __doc__ field of some object and it didn't return a string. That happens to some symbols from the standard library. Check for isinstance(.__doc__, str).rr) r~rrRuntimeWarningrCr*rrr) rrCrrrr*rrrs &&&&&&$$r:rConst.__init__st8 5*d +y 8 MM:   5 $ f !!)   $%r<c <<VR8Xd\h\SV` V4#rB)rr __getattr__)rrrs&&r:r0Const.__getattr__9s" 7? w"4((r<cV^8dQhRR/#rMr8)r9s"r:r;r+Ds&A&A&=&Ar<c V\V\4'dVPpM;\V\4'd\ WR7pM\ R\ V4 R24h\VP\\34'd\VPV,4#\ T: R TP R 24h \d$p\RTP: RT: 24ThRp?i\dp\RTTTR7ThRp?i\dp\ R YTR7ThRp?ii;i) zGet an item from this node if subscriptable. :param index: The node to use as a subscript index. :type index: Const or Slice :raises AstroidTypeError: When the given index cannot be used as a subscript index, or if this node is not subscriptable. ryzCould not use type rzCould not index z with NzIndex {index!r} out of rangerrz (value=r)r?rzrCrrrr|rbytesrrrrr)rrrN index_valuers&&& r:getitem Const.getitemDs$ eU # #++K u % %&u>K#%d5k]2EF  $**sEl33TZZ 4554$$$**Q?@@! #"4::.{oF  #6      ".TPW  s= AB?? D( C(( D(5D(6D D(D(D##D(cV^8dQhRR/#r4r8)r9s"r:r;r+lsTr<c R#)zCheck if the node has a custom __getattr__ or __getattribute__. :returns: Whether the class has a custom __getattr__ or __getattribute__. For a :class:`Const` this is always ``False``. Fr8rs&r:has_dynamic_getattrConst.has_dynamic_getattrls r<c \VP\4'd&VPUu.uFp\V4NK up#\ R\ VP4: 24huupi)zAn iterator over the elements this node contains. :returns: The contents of this node. :rtype: iterable(Const) :raises TypeError: If this node does not represent something that is iterable. zCannot iterate over type )r?rCrrrr|)rrs& r:r Const.iteredtsV djj# & &48JJ?JDM$'J? ?3D4D3GHII@sA(cV^8dQhRR/#rr8)r9s"r:r;r+s%%%r<c 6VPP4#)r)rqnamers&r:r Const.pytypes }}""$$r<cV^8dQhRR/#rMr8)r9s"r:r;r+s   "9  r<c VP\Jd\'d\P#R#\ VP4#)zqDetermine the boolean value of this node. :returns: The boolean value of this node. :rtype: bool or Uninferable T)rCNotImplementedrrrSr7rs&&r:rConst.bool_values4 :: ''1z4## ;t ;DJJr<c$V^8dQhRRRRRR/#)r5rNrOrr r6zIterator[Const]r8)r9s"r:r;r+$.AD r<c+ "VxR#5ir>r8rs&&,r:r Const._infer   )r*rC)rCr*r>)rrrrrr*r)rrconst_infer_unary_opinfer_unary_opconst_infer_binary_opinfer_binary_opr0r6r:rrrrrrrs@r:rzrzs &M "!%' 3&"&3&&*3&3&j33N55O )&AP J%  r<rzc]tRtRtRtRtR#)ContinueizClass representing an :class:`ast.Continue` node. >>> import astroid >>> node = astroid.extract_node('continue') >>> node r8Nrr8r<r:rQrQrr<rQcV]tRtRt$RtR tR]R&RRltRRltR R lt R t R t R #) DecoratorsiaeA node representing a list of decorators. A :class:`Decorators` is the decorators that are applied to a method or function. >>> import astroid >>> node = astroid.extract_node(''' @property def my_property(self): return 3 ''') >>> node >>> list(node.get_children())[0] r0rc V^8dQhRRRR/#)r5r0rr6rr8)r9s"r:r;Decorators.__annotate__sltr<c WnR#r>r/)rr0s&&r:rDecorators.postinit r<cV^8dQhRR/#r5r6r1r8)r9s"r:r;rUs * *' *r<c VP'g \VR7hVPP'g\VPR7hVPPP4#zThe first parent node defining a new scope. These can be Module, FunctionDef, ClassDef, Lambda, or GeneratorExp nodes. :returns: The first parent scope node. r")rr"rrs&r:rDecorators.scopesP{{{$D1 1{{!!!$DKK8 8{{!!''))r<cV^8dQhRR/#r5r6r2r8)r9s"r:r;rUs**y*r<c VP'g \VR7hVPP'g\VPR7hVPPP4#)z+The first parent node defining a new frame.r])rr"r$rs&r:r$Decorators.framesP{{{$D1 1{{!!!$DKK8 8{{!!''))r<c# :"VPRjxL R#L5ir>r/rs&r:rDecorators.get_childrens::rr/N) rrrrrrrrrr$rrr8r<r:rSrSs+"!O 1 **r<rScZa]tRtRt$RtR tR tR]R&RV3RlltRRlt R t R t V;t #) DelAttrizVariation of :class:`ast.Delete` representing deletion of an attribute. >>> import astroid >>> node = astroid.extract_node('del self.attr') >>> node >>> list(node.get_children())[0] rr(c4V^8dQhRRRRRRRRRR R R R R /#rr8)r9s"r:r;DelAttr.__annotate__rr<c ><Wn\SV` VVVVVR7R#rrrs&&&&&$$r:rDelAttr.__init__s.! > !!)  r<c V^8dQhRRRR/#rr8)r9s"r:r;rhrr<c WnR#r>rrs&&r:rDelAttr.postinitrr<c# *"VPxR#5ir>rrs&r:rDelAttr.get_children rrrrr rrrrrrr*rrrrrrrs@r:rfrfs5 O!M L-  *r<rfcHa]tRtRtRtRtRV3RlltRRltRtRt V;t #) Deletei zClass representing an :class:`ast.Delete` node. A :class:`Delete` is a ``del`` statement this is deleting something. >>> import astroid >>> node = astroid.extract_node('del self.attr') >>> node c 0V^8dQhRRRRRRRRRRR R /#) r5rr{rrr(rrrr6rr8)r9s"r:r;Delete.__annotate__ sF        #   r<c @<.Vn\SV` VVVVVR7R#r)r rrrs&&&&$$r:rDelete.__init__ s0&( $ !!)  r<c V^8dQhRRRR/#)r5r rr6rr8)r9s"r:r;rt% s r<c WnR#r>r )rr s&&r:rDelete.postinit%  r<c# :"VPRjxL R#L5ir>ryrs&r:rDelete.get_children( s<<rry rrrrrrrrrrrrs@r:rrrr s(#O  (  r<rrca]tRtRtRtRtRV3RlltRRlt]Pt RRlt R t R t R tRR R lltRRRlltRRRllt]RRl4tRRltRtV;t#)Dicti, zClass representing an :class:`ast.Dict` node. A :class:`Dict` is a dictionary that is created with ``{}`` syntax. >>> import astroid >>> node = astroid.extract_node('{1: "1"}') >>> node c 0V^8dQhRRRRRRRRRRRR /#rr8)r9s"r:r;Dict.__annotate__9 rr<c @<.Vn\SV` VVVVVR7R#r)itemsrrrs&&&&$$r:r Dict.__init__9 s2EG > !!)  r<c V^8dQhRRRR/#)r5rz-list[tuple[InferenceResult, InferenceResult]]r6rr8)r9s"r:r;rM sKPTr<c WnR#)zdDo some setup after initialisation. :param items: The key-value pairs contained in the dictionary. Nr)rrs&&r:r Dict.postinitM s  r<cV^8dQhRR/#)r5r6zLiteral['builtins.dict']r8)r9s"r:r;rV 0r<c R#)rz builtins.dictr8rs&r:r Dict.pytypeV  r<c# H"VPF wrVxVxK R#5i)zGet the key and value nodes below this node. Children are returned in the order that they are defined in the source code, key first then the value. :returns: The children. :rtype: iterable(NodeNG) Nr)rkeyrCs& r:rDict.get_children] s!**JCIK%s "c ^VP'dVPR,^,#R#)zAn optimized version of list(get_children())[-1] :returns: The last child, or None if no children exist. :rtype: NodeNG or None Nrrrs&r:rDict.last_childj s# :::::b>!$ $r<c NVPUUu.uFwrVNK upp#uuppi)ziAn iterator over the keys this node contains. :returns: The keys of this node. :rtype: iterable(NodeNG) r)rrr&s& r:r Dict.iteredt s" %)JJ/JJ///s !c$V^8dQhRRRRRR/#)r5rz Const | SlicerNrOr6r(r8)r9s"r:r;r| s$''"'-D' 'r<c :VPFwr4\V\4'dC\P!WB4p\V\ 4'gKIVP W4u#VPV4Fvp\V\P4'dK%\V\4'gK=\V\4'gKUVPVP8XgKrVuu# K \V4h \\3dEK i;i)a$Get an item from this node. :param index: The node to use as a subscript index. :raises AstroidTypeError: When the given index cannot be used as a subscript index, or if this node is not subscriptable. :raises AstroidIndexError: If the given index does not exist in the dictionary. ) rr? DictUnpackrrrr6rrrVrWrzrC)rrrNrrCinferred_value inferredkeys&&& r:r6 Dict.getitem| s**JC#z**!%!@!.$77)11%AA #yy1 k4+?+?@@k511j6N6N"((EKK7$ 2%& &&)*;<sDDDcV^8dQhRR/#rMr8)r9s"r:r;r s  "9 r<c ,\VP4#)zbDetermine the boolean value of this node. :returns: The boolean value of this node. :rtype: bool )r7rrs&&r:rDict.bool_value s DJJr<c$V^8dQhRRRRRR/#)r5rNrOrr r6zIterator[nodes.Dict]r8)r9s"r:r;r s$.AD r<c+ "\;QJd&RVP4F 'gK RM RM!RVP44'gVxR#VPV4p\V4!VPVP VP VPVPR7pVP\VP444VxR#5i)c3F"TFwr\V\4xK R#5ir>)r?r)rkr&s& r:rDict._infer.. sD:a,,rJTFrN) rhr _infer_mapr|rrrrrrr)rrNrrrs&&, r:r Dict._infer ssDDsssDDDDJOOG,E4j{{??{{??#22 G   T%++-0 1Ms'C$CB Cc$V^8dQhRRRRRR/#)r5lhs_dict:dict[SuccessfulInferenceResult, SuccessfulInferenceResult]rhs_dictr6r8)r9s"r:r;r s'))L)L) D)r<c \P!VP4VP44pVUUu/uFwr4VP4W43bK ppp\ VP 44#uuppi)aDelete nodes that equate to duplicate keys. Since an astroid node doesn't 'equal' another node with the same value, this function uses the as_string method to make sure duplicate keys don't get through Note that both the key and the value are astroid nodes Fixes issue with DictUnpack causing duplicate keys in inferred Dict items :param lhs_dict: Dictionary to 'merge' nodes into :param rhs_dict: Dictionary with nodes to pull from :return : merged dictionary of nodes )rorprrdictr)rr combined_dictrrC string_maps&& r:_update_with_replacementDict._update_with_replacement s_("(8(..:JK FSTm cmmo|3m TJ%%'((UsA2c V^8dQhRRRR/#)r5rNrOr6rr8)r9s"r:r;r s. Cr<c J/pVPEFwr4\V\4'dk\P!WA4pV'g\ h\V\ 4'g \ WR7hVPV4pVPW&4pK\P!W1R7p\P!WAR7p\;QJdRWx34F 'gK RM RM!RWx344'd \ WR7hVPW'V/4pEK V#)z%Infer all values based on Dict.items.rryc3."TF q'*xK R#5ir>r8rs& r:r"Dict._infer_map.. s>,=Dxx,=sTF) rr?rrrrrrrrh) rrNrrrCdouble_starred unpack_itemsr safe_values && r:rDict._infer_map sNP::KD$ ++!%!@%((!.$77(dDD-88A 66vLood<!__UD 3>S,=>333>S,=>>>(dDD66vZ?PQ&  r<rr>)rrrrrrrrrdict_infer_unary_oprMrrrrr6rrrrrrrrs@r:rr, sm!O  (22N 0'B "))2r<rcJ]tRtRt$RtR tR]R&RRltRtRt R t R t R #) Expri aClass representing an :class:`ast.Expr` node. An :class:`Expr` is any expression that does not have its value used or stored. >>> import astroid >>> node = astroid.extract_node('method()') >>> node >>> node.parent rCr(c V^8dQhRRRR/#r5rCr(r6rr8)r9s"r:r;Expr.__annotate__ fr<c WnR#r>rBrrCs&&r:r Expr.postinit rXr<c# *"VPxR#5ir>rBrs&r:rExpr.get_children jjrc# "VPP'g%VPP4RjxL R#R#L5ir>)rC is_functionrrs&r:r$Expr._get_yield_nodes_skip_functions s3zz%%%zzAAC C C& C:AA Ac# "VPP'g%VPP4RjxL R#R#L5ir>)rC is_lambdarrs&r:r"Expr._get_yield_nodes_skip_lambdas s3zz###zz??A A A$ ArrBN rrrrrrrrrrrrr8r<r:rr s, !O M#DBr<rca]tRtRtRtRtRR]3RRRR/RV3RlllltRR lt] P] PR R R ll44t R t V;t#) EmptyNodei zAHolds an arbitrary object in the :attr:`LocalsDictNodeNG.locals`.Nrrc 0V^8dQhRRRRRRRRRRRR/#) r5rrrrr(rrr6r8)r9s"r:r;EmptyNode.__annotate__ sF           r<c 0<\SV`VVVVVR7R#rrrrs&&&&$$r:rEmptyNode.__init__ & !!)  r<cV^8dQhRR/#r4r8)r9s"r:r;r sSStSr<c RVPRJ;'dVP\J#r>)objectrrs&r:has_underlying_objectEmptyNode.has_underlying_object s#{{$&RR4;;>R+RRr<c$V^8dQhRRRRRR/#rr8)r9s"r:r;r% s$ ' '. 'AD ' # 'r<c+ "VP4'g\PxR#\4P VP VR7RjxL R#L \ d\PxR#i;i5i)ryN)rrrSr%infer_ast_from_somethingrrrs&&,r:rEmptyNode._infer# sm ))++"" " ')+DDKKE  '&&& 's:+B(AAABAB<B?BBr8r>)rrrrrrr)rrrrr,rrrrs@r:rr sbK F'     $  "S)) '* 'r<rc]tRtRt$RtRtRtR]R&R]R&R]R&]Pt R R lt R t ] R 4tR RltRtR#) ExceptHandleri3 arClass representing an :class:`ast.ExceptHandler`. node. An :class:`ExceptHandler` is an ``except`` block on a try-except. >>> import astroid >>> node = astroid.extract_node(''' try: do_something() except Exception as error: print("Error!") ''') >>> node >>> node.handlers [] r|rrarrUrc(V^8dQhRRRRRRRR/#) r5r|rrrUrarr6rr8)r9s"r:r;ExceptHandler.__annotate__X s2    r<c *WnW nW0nR#r>r|rra)rr|rras&&&&r:rExceptHandler.postinitX s    r<c# "VPeVPxVPeVPxVPRjxL R#L5ir>rrs&r:rExceptHandler.get_childrenb s8 99 ))O 99 ))O99sAA A Ac VP'dVPP#VP'dVPP#VP#@The line on which the beginning of this block ends. :type: int )rtolinenor|rrs&r:blockstart_tolineno!ExceptHandler.blockstart_tolinenok s@ 99999%% % 99999%% %{{r<c V^8dQhRRRR/#r\r8)r9s"r:r;rw sTT 0TTTr<c aVPeSfR#\;QJd7V3RlVPP44F 'gK R# R#!V3RlVPP444#)zjCheck if this node handles any of the given :param exceptions: The names of the exceptions to check for. Tc3@<"TFqPS9xK R#5ir>r))rrQr]s& r:r&ExceptHandler.catch..~ sS7Rt99 *7RsF)r|rhr;)rr]s&fr:rgExceptHandler.catchw sZ 99  2sStyy7P7P7RSssSsSsStyy7P7P7RSSSr<)rarr|Nrra)rrrrrr_multi_line_block_fieldsrrexcepthandler_assigned_stmtsrrrrrrgrr8r<r:rr3 si"/O( + < $;;N  TTr<rc]tRtRt$RtRtRtRtRtR ] R&R ] R&R ] R&R ] R&R ] R&R R lt ] Pt ]R4tRtRtR#)Fori zClass representing an :class:`ast.For` node. >>> import astroid >>> node = astroid.extract_node('for thing in things: print(thing)') >>> node r"rrarbr Tr(rrc 0V^8dQhRRRRRRRRRRR R /#) r5r"r(rrarrbr rr6rr8)r9s"r:r;For.__annotate__ sF / / / / /  / ' /  /r<c BWnW nW0nW@nWPnR#r>)r"rrarbr )rr"rrarbr s&&&&&&r:r For.postinit s    .r<c .VPP#r)rrrs&r:rFor.blockstart_tolineno  yy!!!r<c# "VPxVPxVPRjxL VPRjxL R#LL5ir>r"rrarbrs&r:rFor.get_children s:kkii99;; s!,A A A A A  A )rarrbr"r Nrrrarb)rrrrrrrrr&rrrr'rrrrrr8r<r:rr s ;O.1O N# L& / 9""T /11N""r<rc]tRtRtRtRtR#)AsyncFori a|Class representing an :class:`ast.AsyncFor` node. An :class:`AsyncFor` is an asynchronous :class:`For` built with the ``async`` keyword. >>> import astroid >>> node = astroid.extract_node(''' async def func(things): async for thing in things: print(thing) ''') >>> node >>> node.body[0] r8Nrr8r<r:rr sr<rc>]tRtRt$RtRtR]R&RRltRtRt R #) Awaiti atClass representing an :class:`ast.Await` node. An :class:`Await` is the ``await`` keyword. >>> import astroid >>> node = astroid.extract_node(''' async def func(things): await other_func() ''') >>> node >>> node.body[0] >>> list(node.body[0].get_children())[0] rCr(c V^8dQhRRRR/#rr8)r9s"r:r;Await.__annotate__ rr<c WnR#r>rBrs&&r:rAwait.postinit rXr<c# *"VPxR#5ir>rBrs&r:rAwait.get_children rrrBNrr8r<r:rr s "!O Mr<rca]tRtRtRtR tR RRRR/RV3Rllllt]P]PR RR ll44t R t V;t #) ImportFromi zClass representing an :class:`ast.ImportFrom` node. >>> import astroid >>> node = astroid.extract_node('from my_package import my_module') >>> node Nrrc<V^8dQhRRRRRRRRRRR R R RR RR R/ #)r5fromnamerZnameslist[tuple[str, str | None]]levelrrrrrrrr6rr8)r9s"r:r;ImportFrom.__annotate__ sd: : : ,:  :  :  : : : #:  : r<c Z<WnW nW0n\S V`VVVVVR7R#)a. :param fromname: The module that is being imported from. :param names: What is being imported from the module. :param level: The level of relative import. :param lineno: The line that this node appears on in the source code. :param col_offset: The column that this node appears on in the source code. :param parent: The parent node in the syntax tree. :param end_lineno: The last line this node appears on in the source code. :param end_col_offset: The end column this node appears on in the source code. Note: This is after the last symbol. rN)modnamerrrr) rrrrrrrrrrs &&&&&&&$$r:rImportFrom.__init__ sJ>$,  49  "'  !!)  r<c(V^8dQhRRRRRRRR/#) r5rNrOasnamer7rr r6rr8)r9s"r:r;rD s2(  $ r<c T;'g \4pVPpVf \WR7hV'dVPV4pVP 4p\T4pYAnTPYFTP4JR7p\Yq4# \dp\YR7ThRp?ii;i \ dp\YR7ThRp?ii;i \dp\\T4YTR7ThRp?ii;i)z;Infer a ImportFrom node: return the imported module/object.Nr) ignore_localsr" attributerN) rr!r real_namerdo_import_modulerrr~rootrr) rrNrrrrmodulererrors &&&, r:rImportFrom._inferB s//-/!! < d< <  J~~d+ F**,F "7+G!% NN47LNME/ /+ J$$@cI J $ F d<# E F'  E 4  sGB B;=C B8& B33B8; C CC D&C>>D)rrr)rrr)rNNNNT rrrrrr*rrrr,rrrrs@r:r r  sV2M: "&: &*: : x))*r<r ca]tRtRt$RtR]R&R tRtRV3RlltRRlt R t ] P] PRR R ll44tR tV;t#) Attributeie z2Class representing an :class:`ast.Attribute` node.r(rc4V^8dQhRRRRRRRRRR R R R R /#rr8)r9s"r:r;Attribute.__annotate__m rr<c ><Wn\SV` VVVVVR7R#rrrs&&&&&$$r:rAttribute.__init__m s.! ( !!)  r<c V^8dQhRRRR/#rr8)r9s"r:r;r( rr<c WnR#r>rrs&&r:rAttribute.postinit rr<c# *"VPxR#5ir>rrs&r:rAttribute.get_children rrc$V^8dQhRRRRRR/#rr8)r9s"r:r;r( s$99.9AD9 =9r<c \W3/VB#r>rrs&&,r:rAttribute._infer rr<rrrr>)rrrrrrrr*rrrrrr,rrrrs@r:r&r&e sQ< LO!M  *))9*9r<r&ca]tRtRtRtR tR RRRR/RV3RlllltRt]P]PR R R ll44t R t V;t #)Globali zClass representing an :class:`ast.Global` node. >>> import astroid >>> node = astroid.extract_node('global a_global') >>> node Nrrc4V^8dQhRRRRRRRRRRR RR R /# r5r list[str]rrrrrrrr6rr8)r9s"r:r;Global.__annotate__ P" " " "  "  " " #"  " r<c ><Wn\SV` VVVVVR7R#)a :param names: The names being declared as global. :param lineno: The line that this node appears on in the source code. :param col_offset: The column that this node appears on in the source code. :param parent: The parent node in the syntax tree. :param end_lineno: The last line this node appears on in the source code. :param end_col_offset: The end column this node appears on in the source code. Note: This is after the last symbol. rNrrrrrrrrrrrs&&&&&$$r:rGlobal.__init__ s.2!& 1 !!)  r<c V#r>r8res&&&r:rfGlobal._infer_name  r<c$V^8dQhRRRRRR/#rr8)r9s"r:r;r8 s$  . AD  # r<c VeVPf \WR7h\VP4P VP4V4# \ d(p\\ T4YPTR7ThRp?ii;i)Nrr)r!rrrr~rr)rrNrr!s&&, r:r Global._infer sy ?g008 d< <  3 3G4F4F GQ Q&  E 43E3Ew  s2A B"BBrrr>)rrrrrr*rrfrrr,rrrrs@r:r4r4 s[M" "&" &*" " H)) * r<r4ca]tRtRt$RtRtRtR]R&R]R&R]R&RR lt] R 4t R R lt R t RRlt V3RltV3RltRtV;t#)rdi zClass representing an :class:`ast.If` node. >>> import astroid >>> node = astroid.extract_node('if condition: print(True)') >>> node r_rarbr(rc(V^8dQhRRRRRRRR/#r5r_r(rarrbr6rr8)r9s"r:r;If.__annotate__ s)V<RVr<c *WnW nW0nR#r>r_rarbrr_rarbs&&&&r:r If.postinit    r<c .VPP#rr_rrs&r:rIf.blockstart_tolineno rr<c V^8dQhRRRR/#r5rr{r6ztuple[int, int]r8)r9s"r:r;rH s Y Y# Y/ Yr<c DWP^,P8XdW3#WPR,P8:dWPR,P3#VPWPVP^,P^, 4#)Get a range from the given line number to where this node ends. :param lineno: The line number to start the range at. :returns: The range of line numbers that this node belongs to, starting at the given line number. r)rarkr_elsed_block_rangerbrrs&&r: block_rangeIf.block_range sv YYq\,, ,> ! YYr]++ +99R=111 1&&v{{DIIaLrJrs&r:rIf.get_children 0ii99;; rcV^8dQhRR/#r4r8)r9s"r:r;rH sHHHr<c \VP4^8H;'d"\VP^,\4#))r|rbr?rdrs&r:has_elif_blockIf.has_elif_block s-4;;1$GGDKKNB)GGr<c# <"VPP4RjxL \SV`4RjxL R#LL5iz/An If node can contain a Yield node in the testNr_rrrMs&r:r"If._get_yield_nodes_skip_functions 599<<>>>7:<<< ?>> import astroid >>> node = astroid.extract_node('value if condition else other') >>> node r_rarbr(c(V^8dQhRRRRRRRR/#)r5r_r(rarbr6rr8)r9s"r:r;IfExp.__annotate__) s(V66dr<c *WnW nW0nR#r>rJrKs&&&&r:rIfExp.postinit) rMr<c# b"VPxVPxVPxR#5ir>rJrs&r:rIfExp.get_children. s!iiiikks-/cV^8dQhRR/#)r5r6zLiteral[False]r8)r9s"r:r;rn3 s^r<c R#)Fr8rs&r:rIfExp.op_left_associative3 sr<Nc$V^8dQhRRRRRR/#rr8)r9s"r:r;rn9 s$(>(>.(>AD(> #(>r<c+ "T;'g \4p\V4p\V4pRpVPPVP 4R7Fmp\ V\ P4'dRpMKVP4p\ V\ P4'dRpMVfTpKcWu8wgKkRpM VRJgVf%VPPVR7RjxL VRJgVf'VPPVR7RjxL R#R# \dRpLoi;iLIL5i)zSupport IfExp inference. If we can't infer the truthiness of the condition, we default to inferring both branches. Otherwise, we infer either branch depending on the condition. NryTF) rrr_rVr^r?rrWrrrarb)rrNrrrb conditionr_test_bool_values&&, r:r IfExp._infer8 s%//-/"7+ "7+ "&    @dD$8$899 $I"&//"3ot/C/CDD $I$ /I$1 $IA   1yy{; ; ;  !2{{(((= = ="3  I  < =sq-EAD,E3D,4E5 D,D,E D, *E5D?6-E#E$E, D<9E;D<<EErjrJr>)rrrrrrrrrrrrrrr8r<r:rlrl sO1O L1 L$ N-   ))(>*(>r<rlca]tRtRtRtR tR RRRR/RV3Rllllt]P]PR RR ll44t R t V;t #) Importid zClass representing an :class:`ast.Import` node. >>> import astroid >>> node = astroid.extract_node('import astroid') >>> node Nrrc4V^8dQhRRRRRRRRRRR RR R /#) r5rrrrrrrrrr6rr8)r9s"r:r;Import.__annotate__n sP& & +& &  &  & & #&  & r<c ><Wn\SV` VVVVVR7R#)a :param names: The names being imported. :param lineno: The line that this node appears on in the source code. :param col_offset: The column that this node appears on in the source code. :param parent: The parent node in the syntax tree. :param end_lineno: The last line this node appears on in the source code. :param end_col_offset: The end column this node appears on in the source code. Note: This is after the last symbol. rNr;r<s&&&&&$$r:rImport.__init__n s2249  !!)  r<c(V^8dQhRRRRRRRR/#) r5rNrOrr7rr r6zGenerator[nodes.Module]r8)r9s"r:r;r~ s8FF(FF F ! Fr<c+ ."T;'g \4pVPpVf \WR7hV'd%VPVP V44xR#VPV4xR# \ dp\YR7ThRp?ii;i5i)z8Infer an Import node: return the imported module/object.Nr)rr!rrrr)rrNrrrrs&&&, r:r Import._infer s//-/!! < d< < F++DNN4,@AA++D11# F d<# E Fs91BA5"A5B A53B5 B B  BBrDrr#r$rs@r:r|r|d sXM& "&& &*& & P))F*Fr<r|cZa]tRtRt$RtR tR tR]R&RV3RlltRRlt R t R t V;t #) Keywordi zClass representing an :class:`ast.keyword` node. >>> import astroid >>> node = astroid.extract_node('function(a_kwarg=True)') >>> node >>> node.keywords [] rCr(c4V^8dQhRRRRRRRRRRR RR R /#) r5rrZrrrrr(rrr6rr8)r9s"r:r;Keyword.__annotate__ sP         #   r<c ><Wn\SV` VVVVVR7R#r)rrr)rrrrrrrrs&&&&&$$r:rKeyword.__init__ s.- !!)  r<c V^8dQhRRRR/#rr8)r9s"r:r;r rr<c WnR#r>rBrs&&r:rKeyword.postinit rXr<c# *"VPxR#5ir>rBrs&r:rKeyword.get_children rr)rrCrB)rrprs@r:rr s5!OM M;  *r<rca]tRtRtRtR tR RRRR/RV3Rllllt]Pt ]Pt ]Pt RR ltRR R lltR tV;t#)rHi zClass representing an :class:`ast.List` node. >>> import astroid >>> node = astroid.extract_node('[1, 2, 3]') >>> node Nrrc4V^8dQhRRRRRRRRRRR RR R /# r5ctxzContext | Nonerrrrrrrr6rr8)r9s"r:r;List.__annotate__ P" " " "  "  " " #"  " r<c ><Wn\SV` VVVVVR7R#)a :param ctx: Whether the list is assigned to or loaded from. :param lineno: The line that this node appears on in the source code. :param col_offset: The column that this node appears on in the source code. :param parent: The parent node in the syntax tree. :param end_lineno: The last line this node appears on in the source code. :param end_col_offset: The end column this node appears on in the source code. Note: This is after the last symbol. rNrrrrrrrrrrrs&&&&&$$r:r List.__init__ s.2$'= !!)  r<cV^8dQhRR/#)r5r6zLiteral['builtins.list']r8)r9s"r:r;r rr<c R#)rz builtins.listr8rs&r:r List.pytype rr<cV^8dQhRR/#rMr8)r9s"r:r;r KK&=Kr<c 0\WPWR7#zmGet an item from this node. :param index: The node to use as a subscript index. :type index: Const or Slice ryrrRrrrNs&&&r:r6 List.getitem  "$ 5JJr<rNNNNr>)rrrrrr*rrsequence_assigned_stmtsrlist_infer_unary_oprMtl_infer_binary_oprOrr6rrrs@r:rHrH siM" "&" &*" " H66N22N22OKKr<cLa]tRtRtRtR tR RRRR/RV3RlllltRtR tV;t #) Nonlocali! zClass representing an :class:`ast.Nonlocal` node. >>> import astroid >>> node = astroid.extract_node(''' def function(): nonlocal var ''') >>> node >>> node.body[0] Nrrc4V^8dQhRRRRRRRRRRR RR R /#r6r8)r9s"r:r;Nonlocal.__annotate__1 r9r<c ><Wn\SV` VVVVVR7R#)a :param names: The names being declared as not local. :param lineno: The line that this node appears on in the source code. :param col_offset: The column that this node appears on in the source code. :param parent: The parent node in the syntax tree. :param end_lineno: The last line this node appears on in the source code. :param end_col_offset: The end column this node appears on in the source code. Note: This is after the last symbol. rNr;r<s&&&&&$$r:rNonlocal.__init__1 s.2!& 4 !!)  r<c V#r>r8res&&&r:rfNonlocal._infer_nameU r@r<rDr) rrrrrr*rrfrrrs@r:rr! s8 M" "&" &*" " Hr<rca]tRtRt$RtRtR]R&R]R&RV3RlltR R ltRR R llt ] Pt R t V;t#) ParamSpeciY zClass representing a :class:`ast.ParamSpec` node. >>> import astroid >>> node = astroid.extract_node('type Alias[**P] = Callable[P, int]') >>> node.type_params[0] rrrJrc 0V^8dQhRRRRRRRRRRRR /# r5rr{rrr(rrr6rr8)r9s"r:r;ParamSpec.__annotate__f F           r<c 0<\SV`VVVVVR7R#rrrs&&&&$$r:rParamSpec.__init__f rr<c$V^8dQhRRRRRR/#r5rrJrrr6rr8)r9s"r:r;rw s!++ +=+T+r<c WnW nR#r>rrrrrs&$$r:rParamSpec.postinitw s  *r<c$V^8dQhRRRRRR/#)r5rNrOrr r6zIterator[ParamSpec]r8)r9s"r:r;r{ $.AD r<c+ "VxR#5ir>r8rs&&,r:rParamSpec._infer{ rJrKrrrr>rrrrrrrrrrrgeneric_type_assigned_stmtsrrrrs@r:rrY sA0O     "+ ::Nr<rc]tRtRtRtRtR#)Passi zClass representing an :class:`ast.Pass` node. >>> import astroid >>> node = astroid.extract_node('pass') >>> node r8Nrr8r<r:rr rr<rcV]tRtRt$RtR tR]R&R]R&RRltRR ltR t R t R #)Raisei zClass representing an :class:`ast.Raise` node. >>> import astroid >>> node = astroid.extract_node('raise RuntimeError("Something bad happened!")') >>> node rcauserc$V^8dQhRRRRRR/#)r5rrrr6rr8)r9s"r:r;Raise.__annotate__ s(   r<c WnW nR#r>rr)rrrs&&&r:rRaise.postinit s  r<cV^8dQhRR/#r4r8)r9s"r:r;r s     r<c VP'gR#\;QJd4RVPP44F 'gK R# R#!RVPP444#)z~Check if this node raises a :class:`NotImplementedError`. :returns: Whether this node raises a :class:`NotImplementedError`. Fc3>"TFqPR8HxK R#5i)NotImplementedErrorNr))rrs& r:r/Raise.raises_not_implemented.. s ;U4II. .;UsT)rrhr;rs&r:raises_not_implementedRaise.raises_not_implemented se xxxs ;?88;S;S;U ss s s ;?88;S;S;U   r<c# "VPeVPxVPeVPxR#R#5ir>rrs&r:rRaise.get_children s1 88 ((N :: !**  "r,)rrNr) rrrrrrrrrrrr8r<r:rr s/'O  5  r<rcP]tRtRt$RtR tR]R&RRltRtRR lt R t R t R #) Returni zClass representing an :class:`ast.Return` node. >>> import astroid >>> node = astroid.extract_node('return True') >>> node rCrc V^8dQhRRRR/#r5rCrr6rr8)r9s"r:r;Return.__annotate__ mr<c WnR#r>rBrs&&r:rReturn.postinit rXr<c# J"VPeVPxR#R#5ir>rBrs&r:rReturn.get_children  :: !**  "!#cV^8dQhRR/#r4r8)r9s"r:r;r s---r<c 6\VP\4#r>)r?rCrIrs&r:is_tuple_returnReturn.is_tuple_return s$**e,,r<c# "VxR#5ir>r8rs&r: _get_return_nodes_skip_functions'Return._get_return_nodes_skip_functions  rKrBN) rrrrrrrrrrrrr8r<r:rr s+!O #-r<rc>]tRtRtRt]P tRRltRt R#)Seti zClass representing an :class:`ast.Set` node. >>> import astroid >>> node = astroid.extract_node('{1, 2, 3}') >>> node cV^8dQhRR/#)r5r6zLiteral['builtins.set']r8)r9s"r:r;Set.__annotate__ s/r<c R#)rz builtins.setr8rs&r:r Set.pytype s r<r8N) rrrrrrset_infer_unary_oprMrrr8r<r:rr s11Nr<rc]tRtRt$RtRtR]R&R]R&R]R&RRltR t] R R l4t R R lt RRlt RRRllt RRRlltRtRRRlltRtR#)ri zClass representing an :class:`ast.Slice` node. >>> import astroid >>> node = astroid.extract_node('things[1:3]') >>> node >>> node.slice rrrrc(V^8dQhRRRRRRRR/#)r5rrrrr6rr8)r9s"r:r;Slice.__annotate__s2   r<c *WnW nW0nR#r>rrr)rrrrs&&&&r:rSlice.postinits    r<c <V'g\V4pWnV#V#)z7Wrap the empty attributes of the Slice in a Const node.)rr)rattrconsts&& r:_wrap_attributeSlice._wrap_attribute s!$'ELL r<cV^8dQhRR/#)r5r6znodes.ClassDefr8)r9s"r:r;rs,,.,r<c Z\4PpVPR4^,#)r)r%builtins_moduler~)rbuiltinss& r:rSlice._proxieds&!#33(++r<cV^8dQhRR/#)r5r6zLiteral['builtins.slice']r8)r9s"r:r;r  1 r<c R#)rzbuiltins.slicer8rs&r:r Slice.pytype  r<cV^8dQhRR/#)r5r6zLiteral['Slice']r8)r9s"r:r;rs.r<c R#)zFA human readable type of this node. :returns: The type of this node. rr8rs&r: display_typeSlice.display_types r<Nc$V^8dQhRRRRRR/#)r5rrrNrOr6z#Iterator[SuccessfulInferenceResult]r8)r9s"r:r;r&s$???&=? ,?r<c# *"VR8Xd VPVP4xR#VR8Xd VPVP4xR#VR8Xd VPVP4xR#VP WR7RjxL R#L5i)zInfer the possible values of the given attribute on the slice. :param attrname: The name of the attribute to infer. :returns: The inferred possible values. startstoprryN)rrrrr~rrrNs&&&r:rSlice.igetattr&sr w &&tzz2 2  &&tzz2 2  &&tyy1 1||H|> > >sBB B BcV^8dQhRR/#rMr8)r9s"r:r;r8s88)@8r<c 8VPPW4#r>)rr~rs&&&r:r~ Slice.getattr8s}}$$X77r<c# "VPeVPxVPeVPxVPeVPxR#R#5ir>rrs&r:rSlice.get_children;sE :: !**  :: !**  99 ))O !sAAc$V^8dQhRRRRRR/#)r5rNrOrr r6zIterator[Slice]r8)r9s"r:r;rErGr<c+ "VxR#5ir>r8rs&&,r:r Slice._inferErJrK)rrrrr>)rrrrrrrrrrrrr rr~rrrr8r<r:rr sj1O ' ' +,, ?$8r<rcta]tRtRt$RtR tR tR]R&RV3RlltRRlt ] Pt R t R tV;t#) riKzClass representing an :class:`ast.Starred` node. >>> import astroid >>> node = astroid.extract_node('*args') >>> node rCr(c4V^8dQhRRRRRRRRRR R R R R /# r5rrrr{rrr(rrrr6rr8)r9s"r:r;Starred.__annotate__ZP         #   r<c ><Wn\SV` VVVVVR7R#rrrs&&&&&$$r:rStarred.__init__Zs.E !!)  r<c V^8dQhRRRR/#rr8)r9s"r:r;rorr<c WnR#r>rBrs&&r:rStarred.postinitorXr<c# *"VPxR#5ir>rBrs&r:rStarred.get_childrenwrr)rrCrBr)rrrrrrr*rrrrstarred_assigned_stmtsrrrrrs@r:rrKsG!OM M!  *55Nr<rca]tRtRt$Rt]!4tRtRtR] R&R] R&RV3Rllt RR lt R t RR R llt ]P]P RR Rll44t]PRRRll4tRtV;t#) Subscripti{zClass representing an :class:`ast.Subscript` node. >>> import astroid >>> node = astroid.extract_node('things[1:3]') >>> node rCrr(c4V^8dQhRRRRRRRRRR R R R R /#rr8)r9s"r:r;Subscript.__annotate__rr<c ><Wn\SV` VVVVVR7R#rrrs&&&&&$$r:rSubscript.__init__s.I !!)  r<c$V^8dQhRRRRRR/#)r5rCr(rr6rr8)r9s"r:r;r+s!fVr<c WnW nR#r>rCr)rrCrs&&&r:rSubscript.postinits   r<c# F"VPxVPxR#5ir>r0rs&r:rSubscript.get_childrensjjjjrJc$V^8dQhRRRRRR/#rr8)r9s"r:r;r+s$99.9AD9 D9r<c + "^RIHpRpVPPV4EFmp\ V\ P 4'd\ PxR#VPPV4EFp\ V\ P 4'd\ PxR#VPpVP\8XdTpM3VP\8XdVPV4pV'dTpMTpWpPJd \WR7hVPWq4p Y Jg!\ T \ P 4'd\ PxR#T PT4RjxL RpEK EKp V'd \)WR7#R# \\ \"\$\&3dp \YR7T hRp ? ii;iL[5i)zInference for subscripts. We're understanding if the index is a Const or a slice, passing the result of inference to the value's `getitem` method, which should handle each supported index type accordingly. )helpersFNrT)astroidr6rCrVr?rrWrSr_SUBSCRIPT_SENTINELrrclass_instance_as_indexrr6rrrrrr+) rrNrr6 found_onerCrr5instance_as_indexassignedrs &&, r:_infer_subscriptSubscript._infer_subscripts $ ZZ%%g.E%!5!566&&&))'2eT%9%9::***#66 ??h."'K__0(/(G(G(N%(&7 "'K":"::(dDD N$}}[BH#z(D>'222 I3 /T %4A A%%%%+" N)dD#MN3sCDG% G%'F.8AG%G#G% G%. G  GG  G%c V^8dQhRRRR/#r5rNrOrr r8)r9s"r:r;r+s88588r<c (VP!V3/VB#r>r=rs&&,r:rSubscript._infers$$W777r<c V^8dQhRRRR/#r@r8)r9s"r:r;r+s88!8838r<c (VP!V3/VB#r>rBrs&&,r:r'Subscript.infer_lhss$$W777r<)rrrCr0rr>)rrrrrrr8rr*rrrrr=rrr,rr'rrrs@r:r)r){s!((OM M M)  ,9v))8*8))8*8r<r)c^a]tRtRtRtR tR tRV3RlltRRltRt RR lt R t R t V;t #) rfiaClass representing a :class:`ast.Try` node. >>> import astroid >>> node = astroid.extract_node(''' try: do_something() except Exception as error: print("Error!") finally: print("Cleanup!") ''') >>> node c 0V^8dQhRRRRRRRRRRRR /#) r5rr{rrrrr(r6rr8)r9s"r:r;Try.__annotate__sH( ( (  (  (  ( (  ( r<c p<.Vn.Vn.Vn.Vn\SV`VVVVVR7R# :param lineno: The line that this node appears on in the source code. :param col_offset: The column that this node appears on in the source code. :param parent: The parent node in the syntax tree. :param end_lineno: The last line this node appears on in the source code. :param end_col_offset: The end column this node appears on in the source code. Note: This is after the last symbol. rNrar`rb finalbodyrrrrrrrrrs&$$$$$r:r Try.__init__sN,#% A-/ %$& 1')4 !!)  r<c ,V^8dQhRRRRRRRRRR/#) r5rarr`zlist[ExceptHandler]rbrNr6rr8)r9s"r:r;rI.s>###& #  #  # #r<c 6WnW nW0nW@nR#)zDo some setup after initialisation. :param body: The contents of the block to catch exceptions from. :param handlers: The exception handlers. :param orelse: The contents of the ``else`` block. :param finalbody: The contents of the ``finally`` block. Nrar`rbrNrrar`rbrNs&$$$$r:r Try.postinit.s$   "r<c V#r>r8res&&&r:rfTry._infer_nameEr@r<c V^8dQhRRRR/#rRr8)r9s"r:r;rIH%%#%/%r<c WP8XdW3#VP'dgVP^,PTu;8:d#VPR,P8:d"MMWPR,P3#VPFpVP'd WPP8XdW3u#VP^,PTu;8:d%VPR,P8:gK{MKWPR,P3u# VP 'dVP ^,P^, V8XdW3#VP ^,PTu;8:d#VP R,P8:d"MMWP R,P3#VP 'dVP ^,P^, V8XdW3#VP ^,PTu;8:d#VP R,P8:d"MMWP R,P3#WP3#z=Get a range from a given line number to where this node ends.rrkrarr`r|rbrNrr exhandlers&& r:rWTry.block_rangeH __ $> ! 999100FTdiim>T>TT99R=111 1I~~~&NN,E,E"E~%~~a ++vT9K9T9TTT~~b1:::: ' ;;;{{1~((1,6~%{{1~((FNdkk"o6N6NN{{27777 >>>~~a ++a/69~%~~a ++vT9K9T9TT~~b1::::}}$$r<c# "VPRjxL VPRjxL VPRjxL VPRjxL R#LBL0LL 5ir>rSrs&r:rTry.get_children`G99==  ;;>>!!  !AAAAAAAAAAAAArarNr`rbrSrrrrrrrrrrfrWrrrrs@r:rfrfs: BOJ( ( T#.%0""r<rfc a]tRtRtRtRtRtRRR RR RR RR R/R V3RllltRRRRRRRR/RRlltRt RRlt Rt Rt V;t #)TryStarigz0Class representing an :class:`ast.TryStar` node.rar`rbrNrNrrrrc 0V^8dQhRRRRRRRRRRRR /#) r5rrrrrrrr6rr8)r9s"r:r;TryStar.__annotate__msH$ $ $  $  $ # $ $  $ r<c p<.Vn.Vn.Vn.Vn\SV`VVVVVR7R#)a :param lineno: The line that this node appears on in the source code. :param col_offset: The column that this node appears on in the source code. :param parent: The parent node in the syntax tree. :param end_lineno: The last line this node appears on in the source code. :param end_col_offset: The end column this node appears on in the source code. Note: This is after the last symbol. rNrMrOs&$$$$$r:rTryStar.__init__msN$#% A-/ %$& 1')4 !!)  r<c ,V^8dQhRRRRRRRRRR/#) r5rarQr`zlist[ExceptHandler] | NonerbrNr6rr8)r9s"r:r;rjs>''"'- ' $ ' ' ' 'r<c zV'dWnV'dW nV'dW0nV'd W@nR#R#)zDo some setup after initialisation. :param body: The contents of the block to catch exceptions from. :param handlers: The exception handlers. :param orelse: The contents of the ``else`` block. :param finalbody: The contents of the ``finally`` block. NrSrTs&$$$$r:rTryStar.postinits) I $M  K &N r<c V#r>r8res&&&r:rfTryStar._infer_namer@r<c V^8dQhRRRR/#rRr8)r9s"r:r;rjrYr<c WP8XdW3#VP'dgVP^,PTu;8:d#VPR,P8:d"MMWPR,P3#VPFpVP'd WPP8XdW3u#VP^,PTu;8:d%VPR,P8:gK{MKWPR,P3u# VP 'dVP ^,P^, V8XdW3#VP ^,PTu;8:d#VP R,P8:d"MMWP R,P3#VP 'dVP ^,P^, V8XdW3#VP ^,PTu;8:d#VP R,P8:d"MMWP R,P3#WP3#r[r\r]s&& r:rWTryStar.block_ranger`r<c# "VPRjxL VPRjxL VPRjxL VPRjxL R#LBL0LL 5ir>rSrs&r:rTryStar.get_childrenrcrdrerSrfrs@r:rhrhgs:AOJ$ "$ "& $ "& $ &* $ !%$ $ L'%)'04 ' '+ ' *. '.%0""r<rhca]tRtRtRtR tR RRRR/RV3Rllllt]Pt ]Pt ]Pt RR ltRR R lltR tV;t#)rIizClass representing an :class:`ast.Tuple` node. >>> import astroid >>> node = astroid.extract_node('(1, 2, 3)') >>> node Nrrc4V^8dQhRRRRRRRRRRR RR R /#rr8)r9s"r:r;Tuple.__annotate__rr<c ><Wn\SV` VVVVVR7R#)a :param ctx: Whether the tuple is assigned to or loaded from. :param lineno: The line that this node appears on in the source code. :param col_offset: The column that this node appears on in the source code. :param parent: The parent node in the syntax tree. :param end_lineno: The last line this node appears on in the source code. :param end_col_offset: The end column this node appears on in the source code. Note: This is after the last symbol. rNrrs&&&&&$$r:rTuple.__init__s.2$'> !!)  r<cV^8dQhRR/#)r5r6zLiteral['builtins.tuple']r8)r9s"r:r;ryrr<c R#)rzbuiltins.tupler8rs&r:r Tuple.pytyperr<cV^8dQhRR/#rMr8)r9s"r:r;ry rr<c 0\WPWR7#rrrs&&&r:r6 Tuple.getitem rr<rrr>)rrrrrr*rrrrtuple_infer_unary_oprMrrOrr6rrrs@r:rIrIsiM" "&" &*" " H66N33N22O KKr<ca]tRtRt$RtRtR]R&R]R&R]R&R V3R lltR R ltRR Rllt ] Pt R]R&Rt V;t#) TypeAliasizClass representing a :class:`ast.TypeAlias` node. >>> import astroid >>> node = astroid.extract_node('type Point = tuple[float, float]') >>> node r type_paramsrCrJ(list[TypeVar | ParamSpec | TypeVarTuple]r(c 0V^8dQhRRRRRRRRRRRR /#rr8)r9s"r:r;TypeAlias.__annotate__"rr<c 0<\SV`VVVVVR7R#rrrs&&&&$$r:rTypeAlias.__init__"rr<c(V^8dQhRRRRRRRR/#) r5rrJrrrCr(r6rr8)r9s"r:r;r3s4   >     r<c *WnW nW0nR#r>rrrC)rrrrCs&$$$r:rTypeAlias.postinit3s & r<c$V^8dQhRRRRRR/#)r5rNrOrr r6zIterator[TypeAlias]r8)r9s"r:r;r>rr<c+ "VxR#5ir>r8rs&&,r:rTypeAlias._infer>rJrKz]ClassVar[Callable[[TypeAlias, AssignName, InferenceContext | None, None], Generator[NodeNG]]]rrr>)rrrrrrrrrrrrrrrrs@r:rrsS7O 99 M  "  ''  ( (r<rca]tRtRt$RtRtR]R&R]R&R]R&RV3R lltRR /R R lltRR Rllt ] Pt Rt V;t#)TypeVariPzClass representing a :class:`ast.TypeVar` node. >>> import astroid >>> node = astroid.extract_node('type Point[T] = tuple[float, float]') >>> node.type_params[0] rrFrrJrc 0V^8dQhRRRRRRRRRRRR /#rr8)r9s"r:r;TypeVar.__annotate__^rr<c 0<\SV`VVVVVR7R#rrrs&&&&$$r:rTypeVar.__init__^rr<Nc(V^8dQhRRRRRRRR/#)r5rrJrFrrr6rr8)r9s"r:r;ros4 + + + + % +  +r<c *WnW nW0nR#r>rrFr)rrrFrs&$$$r:rTypeVar.postinitos  *r<c$V^8dQhRRRRRR/#)r5rNrOrr r6zIterator[TypeVar]r8)r9s"r:r;rzs$.AD r<c+ "VxR#5ir>r8rs&&,r:rTypeVar._inferzrJrK)rFrrrr>rrs@r:rrPsQ9O      " + (, + ::Nr<rca]tRtRt$RtRtR]R&R]R&RV3RlltRR /R R lltRR R llt ] Pt Rt V;t#) TypeVarTupleizClass representing a :class:`ast.TypeVarTuple` node. >>> import astroid >>> node = astroid.extract_node('type Alias[*Ts] = tuple[*Ts]') >>> node.type_params[0] rrrJrc 0V^8dQhRRRRRRRRRRRR /#rr8)r9s"r:r;TypeVarTuple.__annotate__rr<c 0<\SV`VVVVVR7R#rrrs&&&&$$r:rTypeVarTuple.__init__rr<Nc$V^8dQhRRRRRR/#rr8)r9s"r:r;rs$++!+2?+ +r<c WnW nR#r>rrs&$$r:rTypeVarTuple.postinits *r<c$V^8dQhRRRRRR/#)r5rNrOrr r6zIterator[TypeVarTuple]r8)r9s"r:r;rs$.AD r<c+ "VxR#5ir>r8rs&&,r:rTypeVarTuple._inferrJrKrrr>rrs@r:rrsI0O     "+BF+  ::Nr<r+__pos__-__neg__~ __invert__notca]tRtRt$RtRtRtR]R&RV3RlltRRlt RR R llt R t R V3R llt RRRllt ]P]P RRRll44tRtV;t#)UnaryOpizClass representing an :class:`ast.UnaryOp` node. >>> import astroid >>> node = astroid.extract_node('-5') >>> node operandr(c4V^8dQhRRRRRRRRRR R R R R /#r0r8)r9s"r:r;UnaryOp.__annotate__rrr<c ><Wn\SV` VVVVVR7R#rr4r5s&&&&&$$r:rUnaryOp.__init__rur<c V^8dQhRRRR/#)r5rr(r6rr8)r9s"r:r;rs4r<c WnR#r>r)rrs&&r:rUnaryOp.postinitr{r<c V^8dQhRRRR/#)r5rNrOr6z#list[util.BadUnaryOperationMessage]r8)r9s"r:r;rs. ,r<c .pVPVR7FPpV\PJd\h\ V\P 4'gK?VP V4KR V# \d.u#i;i)zGet a list of type errors which can occur during inference. Each TypeError is represented by a :class:`BadUnaryOperationMessage`, which holds the original exception. If any inferred result is uninferable, an empty list is returned. ry)_infer_unaryoprrSrr?BadUnaryOperationMessagerrCs&& r:rEUnaryOp.type_errorssv --g->T---((fd&C&CDDJJv& ?  I rGc# *"VPxR#5ir>rrs&r:rUnaryOp.get_childrensllrcV^8dQhRR/#rir8)r9s"r:r;rs''s'r<c p<VPR8Xd\VP,#\SV` 4#)r)r1r'rrrMs&r:rUnaryOp.op_precedences, 77e  ) )w$&&r<c$V^8dQhRRRRRR/#)r5rNrOrr r6zTGenerator[InferenceResult | util.BadUnaryOperationMessage, None, InferenceErrorInfo]r8)r9s"r:r;rs&>/>/.>/AD>/ >/r<c+ "^RIHpVPPV4F!pVP VP 4xK# R# \ d/p\P!Y@P T4xRp?K[Rp?i\Ed8p\TP ,pTfaTP4p\T\P4'g\T'*4xRp?K\PxRp?K\T\ T34'g+\P!Y@P T4xRp?EK'\"P$!YF4pM: \&d-\P!Y@P T4xRp?EKvi;iT^,p\)TPTR7R4p \T \P4'gT P+4'gRp?EK\-T4pYAn\1.T R7TnT P5YR7p \)T R4p T f TxRp?EK,T xRp?EK7 \&d4p \P!Y@P T 4xRp ? Rp?EKpRp ? i\6d\PxRp?EKi;iRp?ii;i5i)3Infer what an UnaryOp should return when evaluated.rNry)rDr)rrrrVrMr1rrrrUNARY_OP_METHODrr?rWrrSrr$r rrUcallablerrrrrr) rrNrrrrmethrmethodsrZ call_resultsr inner_excs &&, r:rUnaryOp._infer_unaryops +||))'2G5 /,,TWW553 K33GWWcJJJ!0 /&tww/<")!3!3!5J%j$2F2FGG+ N;;;"....%g(/CDD#;;GWWcRR /%&3&:&:7&IG6%"&"?"?RU"VV$% 'qz#' 7 (CT#J&x1E1EFF#+#4#4#6#6$".w"7,3).9r(.S+'/'A'A$'A'X !%lD!9!>")MM"(LL2Y";;GWWiXXX)/"..../_0 /s%KA K K#A?9K? K KAK+K1KK ;KK E$#I$.FIKFAI9KA I KIK J=&#J K K J=!J=4K5K<J==KKKc$V^8dQhRRRRRR/#rr8)r9s"r:r;rCs$>>.>AD> =>r<c+ "VPVPV\P4RjxL \ WR7#L5i)rNr)rkrrrr+rs&&,r:rUnaryOp._inferAsD 00   $*G*G   "t== s/AAA)r1rrrmr>)rrrrrrr*rrrrErrrrrr,rrrrs@r:rrsm#OM O0  **'' >/@))>*>r<rca]tRtRt$RtRtRtR]R&R]R&R]R&RR lt] R 4t R R lt R t V3Rlt V3RltRtV;t#)WhileiMzClass representing an :class:`ast.While` node. >>> import astroid >>> node = astroid.extract_node(''' while condition(): print("True") ''') >>> node r_rarbr(rc(V^8dQhRRRRRRRR/#rGr8)r9s"r:r;While.__annotate__es2   r<c *WnW nW0nR#r>rJrKs&&&&r:rWhile.postinites    r<c .VPP#rrOrs&r:rWhile.blockstart_tolinenoorr<c V^8dQhRRRR/#rRr8)r9s"r:r;rws<<#rJrs&r:rWhile.get_childrenr[rc# <"VPP4RjxL \SV`4RjxL R#LL5iz1A While node can contain a Yield node in the testNrcrMs&r:r%While._get_yield_nodes_skip_functionsrerOc# <"VPP4RjxL \SV`4RjxL R#LL5irrgrMs&r:r#While._get_yield_nodes_skip_lambdasrirOrjrJr)rrrrrrrrrrrrWrrrrrrs@r:rrMsa 1O1 L, # -""< = ;;r<rca]tRtRtRtR tRtRtRRRRR/RV3RlllltRRR llt ] Pt ] R 4tR tR tV;t#)WithizClass representing an :class:`ast.With` node. >>> import astroid >>> node = astroid.extract_node(''' with open(file_path) as file_: print(file_.read()) ''') >>> node Nrrc 0V^8dQhRRRRRRRRRRRR /#rr8)r9s"r:r;With.__annotate__F% % % %  %  % #%  % r<c `<.Vn.VnRVn\SV`VVVVVR7R#rLNr)rrar rrrs&&&&$$r:r With.__init__sE,:< O"$ 1.2X !!)  r<c(V^8dQhRRRRRRRR/#) r5rz)list[tuple[NodeNG, NodeNG | None]] | NonerarQr rr6rr8)r9s"r:r;rs2//8/"/' /  /r<c :VeWnVeW nW0nR#)zDo some setup after initialisation. :param items: The pairs of context managers and the names they are assigned to. :param body: The contents of the ``with`` block. N)rrar )rrrar s&&&&r:r With.postinits   J  I.r<c JVPR,^,P#)rr)rrrs&r:rWith.blockstart_tolinenos zz"~a )))r<c# "VPFwrVxV'gKVxK VPRjxL R#L5i)zWGet the child nodes below this node. :returns: The children. :rtype: iterable(NodeNG) Nrra)rrvars& r:rWith.get_childrens5 IDJs $99sAAAA)rarr rrrr)rrrrrrrrrrrwith_assigned_stmtsrrrrrrrs@r:rrso (O.(% "& % &*% % N/&22N**  r<rc]tRtRtRtRtR#) AsyncWithiz7Asynchronous ``with`` built with the ``async`` keyword.r8Nrr8r<r:rrsAr<rcJ]tRtRt$RtR tR]R&RRltRtRt R t R t R #) YieldizClass representing an :class:`ast.Yield` node. >>> import astroid >>> node = astroid.extract_node('yield True') >>> node rCrc V^8dQhRRRR/#rr8)r9s"r:r;Yield.__annotate__ rr<c WnR#r>rBrs&&r:rYield.postinit rXr<c# J"VPeVPxR#R#5ir>rBrs&r:rYield.get_childrenrrc# "VxR#5ir>r8rs&r:r%Yield._get_yield_nodes_skip_functionsrrKc# "VxR#5ir>r8rs&r:r#Yield._get_yield_nodes_skip_lambdasrrKrBNrr8r<r:rrs+!O r<rc]tRtRtRtRtR#) YieldFromiz2Class representing an :class:`ast.YieldFrom` node.r8Nrr8r<r:rrsRepresents the unpacking of dicts into dicts using :pep:`448`.r8Nrr8r<r:rrsHr<rcta]tRtRtRtRtRtRRRRR/RV3RlllltRR/R R lltR t RR R llt Rt V;t #)FormattedValuei"a0Class representing an :class:`ast.FormattedValue` node. Represents a :pep:`498` format string. >>> import astroid >>> node = astroid.extract_node('f"Format {type_}"') >>> node >>> node.values [, ] format_specNrrc 0V^8dQhRRRRRRRRRRRR /#rr8)r9s"r:r;FormattedValue.__annotate__2sF- - - -  -  - #-  - r<c L<VVRVn\SV` VVVVVR7R#rr rrrs&&&&$$r:rFormattedValue.__init__2sE, 8  .2 !!)  r<c(V^8dQhRRRRRRRR/#) r5rCr( conversionr{r JoinedStr | Noner6rr8)r9s"r:r;r as4''' ' & '  'r<c *WnW nW0nR#)a Do some setup after initialisation. :param value: The value to be formatted into the string. :param conversion: The type of formatting to be applied to the value. :param format_spec: The formatting to be applied to the value. :type format_spec: JoinedStr or None N)rCrr )rrCrr s&$$$r:rFormattedValue.postinitas  $&r<c# f"VPxVPeVPxR#R#5ir>rCr rs&r:rFormattedValue.get_childrenus,jj    '"" " (rc$V^8dQhRRRRRR/#rr8)r9s"r:r;r {s$  . AD  D r<c + "VPf \R4M VPpRpVP!V3/VBFp\V\4'gV'g\P xRpK7VP P!V3/VBFpV\P Jd\P xR#Tp\V\4'd VP p\WuP 4p\VVPVPVPVPR7xK K R# \\3d\P xRpMi;iK5i)NrFT)rrrr)r rzrVr?rrSrCr9rrrrrr) rrNr format_specsuninferable_already_generatedr rCvalue_to_format formatteds &&, r:rFormattedValue._infer{s4%)$4$4$) rrrrrrr*rrrrrrrs@r:r r "sQ /O#M- "& - &*- - ^' )- '(#  r<r z {Uninferable}ca]tRtRtRtRtRRRRR/RV3RlllltRRR lltR tRR R llt RR Rllt ] RRRll4t ] RRRll4t RtV;t#) JoinedStrizRepresents a list of string expressions to be joined. >>> import astroid >>> node = astroid.extract_node('f"Format {type_}"') >>> node Nrrc 0V^8dQhRRRRRRRRRRRR /#rr8)r9s"r:r;JoinedStr.__annotate__sF" " " "  "  " #"  " r<c @<.Vn\SV` VVVVVR7R#rK)rrrrs&&&&$$r:rJoinedStr.__init__s4,%'  !!)  r<c V^8dQhRRRR/#rr8)r9s"r:r;r#s!!2!d!r<c Ve WnR#R#)z~Do some setup after initialisation. :param value: The string expressions to be joined. :type: list(FormattedValue or Const) Nrrs&&r:rJoinedStr.postinits   K r<c# :"VPRjxL R#L5ir>rrs&r:rJoinedStr.get_childrenrrc$V^8dQhRRRRRR/#rr8)r9s"r:r;r#s$.AD Dr<c+ "VP'dVPV4RjxL R#\R4xR#L5i)Nr)r_infer_with_valuesrzrs&&,r:rJoinedStr._infers2 ;;;..w7 7 7)O 8s'A?Ac$V^8dQhRRRRRR/#rr8)r9s"r:r;r#s$  . AD  D r<c+ 6"RpVPVPV4FrpV\PJ;'g,\ V\ 4;'d\ VP9pV'dV'gRp\PxKnVxKt R#5i)FTN)_infer_from_valuesrrrSr?rzUNINFERABLE_VALUErC)rrNrrrZfaileds&&, r:r-JoinedStr._infer_with_valuess).%// WEH!1!118U+SS0AX^^0S 4481***NFs:BBB1B9 Bc(V^8dQhRRRRRRRR/#) r5r0rrNrOrr r6r r8)r9s"r:r;r#s,$$ $+B$UX$ D$r<c+ "V'gR#\V4^8XdRVP!V^,V3/VBF0p\V\4'dVxK\\4xK2 R#VP!V^,V3/VBFpVP !VR,V3/VBF]pRpWV3FDp\V\4'dV\ VP4, pK7V\, pKF \V4xK_ K R#5i)N:r^NNr)r|_safe_infer_from_noder?rzr2r1rrC)rr0rNrrQprefixsuffixrs&&&, r:r1JoinedStr._infer_from_valuess  u:?11%(GNvNdE**J-.. O //a'LVLF00rGNvN#,D!$..#djj/1 //F - Fm#OMsD Dc(V^8dQhRRRRRRRR/#) r5rQr(rNrOrr r6r r8)r9s"r:r;r# s,###$;#NQ# D#r<c+ "VP!V3/VBRjxL R#L \d\PxR#i;i5ir>)rrrrS)rrQrNrs&&&,r:r7JoinedStr._safe_infer_from_node s; #{{75f5 5 5 #"" " #s1A#!#A#AAAArrr>)rrrrrrrrrrr-rr1r7rrrs@r:r!r!sj"O" "& " &*" " H! $$,##r<r!ca]tRtRtRtRtRtRRRRR/RV3RlllltR R lt] Pt R R lt R Rlt RRltRtV;t#)rizRepresents the assignment from the assignment expression >>> import astroid >>> module = astroid.parse('if a := 1: pass') >>> module.body[0].test TNrrc 0V^8dQhRRRRRRRRRRRR /#rr8)r9s"r:r;NamedExpr.__annotate__%rr<c <<VV\SV`VVVVVR7R#rKrrs&&&&$$r:rNamedExpr.__init__%s6,  < !!)  r<c$V^8dQhRRRRRR/#)r5r"r(rCr6rr8)r9s"r:r;r@Ls!vfr<c WnW nR#r>r9r:s&&&r:rNamedExpr.postinitLr<r<cV^8dQhRR/#r`r8)r9s"r:r;r@Us##y#r<c VP'g \VR7h\VP\\\ 34'dVPP'g\VPR7hVPPP'g!\VPPR7hVPPPP 4#VPP 4#)zThe first parent frame node. A frame node is a :class:`Module`, :class:`FunctionDef`, or :class:`ClassDef`. :returns: The first parent frame node. r])rr"r?rCrrr$rs&r:r$NamedExpr.frameUs{{{$D1 1 dkkIw #F G G;;%%%( <<;;%%,,,( 0B0BCC;;%%,,224 4{{  ""r<cV^8dQhRR/#rZr8)r9s"r:r;r@js##'#r<c VP'g \VR7h\VP\\\ 34'dVPP'g\VPR7hVPPP'g!\VPPR7hVPPPP 4#VPP 4#r\)rr"r?rCrrrrs&r:rNamedExpr.scopejs {{{$D1 1 dkkIw #F G G;;%%%( <<;;%%,,,( 0B0BCC;;%%,,224 4{{  ""r<c$V^8dQhRRRRRR/#)r5rrrXr(r6rr8)r9s"r:r;r@}s! + +c + +D +r<c DVP4PW4R#)aKDefine that the given name is declared in the given statement node. NamedExpr's in Arguments, Keyword or Comprehension are evaluated in their parent's parent scope. So we add to their frame's locals. .. seealso:: :meth:`scope` :param name: The name that is being defined. :param stmt: The statement that defines the given name. N)r$ set_local)rrrXs&&&r:rNNamedExpr.set_local}s t*r<r9r)rrrrrrr&rrrnamed_expr_assigned_stmtsrr$rrNrrrs@r:rrsd*OOH% "& % &*% % N88N#*#& + +r<rcba]tRtRtRtRtR RRRR/RV3RlllltRR ltRR R lltR t V;t #)UnknownizThis node represents a node in a constructed AST where introspection is not possible. Used in the args attribute of FunctionDef nodes where function signature introspection failed, and as a placeholder in ObjectModel. Nrrc 0V^8dQhRRRRRRRRRRRR/#) r5rr(rrrrrr6r8)r9s"r:r;Unknown.__annotate__sF           r<c 0<\SV`VVVVVR7R#rr)rrrrrrrs&&&&$$r:rUnknown.__init__rr<cV^8dQhRR/#)r5r6zLiteral['Unknown']r8)r9s"r:r;rTs)r<c R#)rRr8rs&r:r@ Unknown.qnamesr<cV^8dQhRR/#rMr8)r9s"r:r;rTs5r<c+ 2"\PxR#5i)z4Inference on an Unknown node immediately terminates.N)rrSrs&&,r:rUnknown._inferssr8rr>) rrrrrrrr@rrrrs@r:rRrRs< D    $  "r<rRrdcNa]tRtRtRtRtRtR tRV3RlltR RRllt Rt V;t #) EvaluatedObjectizContains an object that has already been inferred This class is useful to pre-evaluate a particular node, with the resulting class acting as the non-evaluated node. c$V^8dQhRRRRRR/#)r5originalr-rCr,r6rr8)r9s"r:r;EvaluatedObject.__annotate__s$  1 :I  r<c <WnW n\SV` VPPVPP VPP VPPVPPR7R#)rN) r`rCrrrrrrr)rr`rCrs&&&r:rEvaluatedObject.__init__sh4< ?&+   ==''}}//==''}}//==77  r<c$V^8dQhRRRRRR/#)r5rNrOrr r6z(Generator[NodeNG | util.UninferableBase]r8)r9s"r:r;ras$.AD 1r<c+ *"VPxR#5ir>rBrs&&,r:rEvaluatedObject._infersjjr)r`rC)r`rBr>) rrrrrrrr*rrrrrs@r:r^r^s- D#OM  "r<r^cVa]tRtRtRtR tR tR RRRR/RV3RlllltRR ltR t V;t #)MatchizClass representing a :class:`ast.Match` node. >>> import astroid >>> node = astroid.extract_node(''' match x: case 200: ... case _: ... ''') >>> node Nrrc 0V^8dQhRRRRRRRRRRRR /#rr8)r9s"r:r;Match.__annotate__F        #   r<c 8<VV\SV`VVVVVR7R#rrrs&&&&$$r:rMatch.__init__,   !!)  r<c$V^8dQhRRRRRR/#)r5subjectr(caseszlist[MatchCase]r6rr8)r9s"r:r;rjs*   r<c WnW nR#r>rprq)rrprqs&$$r:rMatch.postinits   r<)rqrprs)rqr) rrrrrrrrrrrrs@r:rhrhs= +O) "&  &*  &r<rhc]tRtRtRtRtR#)Patterniz!Base class for all Pattern nodes.r8Nrr8r<r:rvrvs+r<rvcxa]tRtRt$RtRtRtR]R&R]R&R]R&R]R&RR /R V3R llltR R lt Rt V;t #) MatchCasei zClass representing a :class:`ast.match_case` node. >>> import astroid >>> node = astroid.extract_node(''' match x: case 200: ... ''') >>> node.cases[0] rrrrrrNc V^8dQhRRRR/#)r5rrr6rr8)r9s"r:r;MatchCase.__annotate__s   -  4  r<c <<VVV\SV`VRRRRR7R#)Nr^r)rrrs&$r:rMatchCase.__init__s-      r<c(V^8dQhRRRRRRRR/#) r5patternrvguardrrarr6rr8)r9s"r:r;rz*s4        r<c *WnW nW0nR#r>r~rra)rr~rras&$$$r:rMatchCase.postinit*s   r<)rarr~rr) rrrrrrrrrrrrrs@r:rxrx sG 3O( L  $     r<rxcRa]tRtRtRtR tR RRRR/RV3RlllltRR ltR tV;t #) MatchValuei6zClass representing a :class:`ast.MatchValue` node. >>> import astroid >>> node = astroid.extract_node(''' match x: case 200: ... ''') >>> node.cases[0].pattern Nrrc 0V^8dQhRRRRRRRRRRRR /#rr8)r9s"r:r;MatchValue.__annotate__EF        #   r<c 4<V\SV`VVVVVR7R#rrrs&&&&$$r:rMatchValue.__init__E)  !!)  r<c V^8dQhRRRR/#rr8)r9s"r:r;rWsDr<c WnR#r>rBrs&$r:rMatchValue.postinitWrXr<rBr rrrrrrrrrrrs@r:rr6s7 !O "&  &*  $r<rc Na]tRtRtRtR tRRRRRRRRRR/R V3R llltR tV;t#) MatchSingletoni[aClass representing a :class:`ast.MatchSingleton` node. >>> import astroid >>> node = astroid.extract_node(''' match x: case True: ... case False: ... case None: ... ''') >>> node.cases[0].pattern >>> node.cases[1].pattern >>> node.cases[2].pattern rNrrrrc4V^8dQhRRRRRRRRRRRR R R /#) r5rCzLiteral[True, False, None]rrrrrrrr6rr8)r9s"r:r;MatchSingleton.__annotate__rsR  *       #    r<c <<Wn\SV` VVVVVR7R#r)rCrr)rrCrrrrrrs&$$$$$$r:rMatchSingleton.__init__rs+  !!)  r<rBr3rs@r:rr[sP(M "  "&  "&  &* !%   r<rcRa]tRtRtRtR tR RRRR/RV3RlllltRR ltR tV;t #) MatchSequenceia4Class representing a :class:`ast.MatchSequence` node. >>> import astroid >>> node = astroid.extract_node(''' match x: case [1, 2]: ... case (1, 2, *_): ... ''') >>> node.cases[0].pattern >>> node.cases[1].pattern Nrrc 0V^8dQhRRRRRRRRRRRR /#rr8)r9s"r:r;MatchSequence.__annotate__rr<c 4<V\SV`VVVVVR7R#rrrs&&&&$$r:rMatchSequence.__init__rr<c V^8dQhRRRR/#r5patterns list[Pattern]r6rr8)r9s"r:r;r!!M!d!r<c WnR#r>rrrs&$r:rMatchSequence.postinit r<rrrrs@r:rrs7 $O "&  &*  $!!r<rcja]tRtRtRtR tR RRRR/RV3RlllltRR lt]Pt R t V;t #) MatchMappingizClass representing a :class:`ast.MatchMapping` node. >>> import astroid >>> node = astroid.extract_node(''' match x: case {1: "Hello", 2: "World", 3: _, **rest}: ... ''') >>> node.cases[0].pattern Nrrc 0V^8dQhRRRRRRRRRRRR /#rr8)r9s"r:r;MatchMapping.__annotate__rr<c <<VVV\SV`VVVVVR7R#rrrs&&&&$$r:rMatchMapping.__init__s/    !!)  r<c(V^8dQhRRRRRRRR/#) r5keysrrrrestrUr6rr8)r9s"r:r;rs4        r<c *WnW nW0nR#r>rrr)rrrrs&$$$r:rMatchMapping.postinits   r<rr) rrrrrrrrrmatch_mapping_assigned_stmtsrrrrs@r:rrsD 3O "&  &*  ( ;;Nr<rcVa]tRtRtRtR tR tR RRRR/RV3RlllltRR ltR t V;t #) MatchClassia>Class representing a :class:`ast.MatchClass` node. >>> import astroid >>> node = astroid.extract_node(''' match x: case Point2D(0, 0): ... case Point3D(x=0, y=0, z=0): ... ''') >>> node.cases[0].pattern >>> node.cases[1].pattern Nrrc 0V^8dQhRRRRRRRRRRRR /#rr8)r9s"r:r;MatchClass.__annotate__sF        #   r<c @<VVVV\SV`VVVVVR7R#rrrs&&&&$$r:rMatchClass.__init__s2     !!)  r<c ,V^8dQhRRRRRRRRRR /#) r5rr(rr kwd_attrsr7 kwd_patternsr6rr8)r9s"r:r;r s> ) ) ) )  ) $ )  )r<c 6WnW nW0nW@nR#r>)rrrr)rrrrrs&$$$$r:rMatchClass.postinit s "(r<)rrrr)rrr)rr) rrrrrrr*rrrrrs@r:rrs< :O"M "&  &*  * ) )r<rcja]tRtRtRtR tR RRRR/RV3RlllltRR lt]Pt R t V;t #) MatchStarizClass representing a :class:`ast.MatchStar` node. >>> import astroid >>> node = astroid.extract_node(''' match x: case [1, *_]: ... ''') >>> node.cases[0].pattern.patterns[1] Nrrc 0V^8dQhRRRRRRRRRRRR /#rr8)r9s"r:r;MatchStar.__annotate__)rr<c 4<V\SV`VVVVVR7R#rrrs&&&&$$r:rMatchStar.__init__)rr<c V^8dQhRRRR/#)r5rrUr6rr8)r9s"r:r;r;s 1dr<c WnR#r>r)rs&$r:rMatchStar.postinit;rr<r)r) rrrrrrrrrmatch_star_assigned_stmtsrrrrs@r:rrsD  O "&  &*  $88Nr<rcja]tRtRtRtR tR RRRR/RV3RlllltRR lt]Pt R t V;t #) MatchAsiDaClass representing a :class:`ast.MatchAs` node. >>> import astroid >>> node = astroid.extract_node(''' match x: case [1, a]: ... case {'key': b}: ... case Point2D(0, 0) as c: ... case d: ... ''') >>> node.cases[0].pattern.patterns[1] >>> node.cases[1].pattern.patterns[0] >>> node.cases[2].pattern >>> node.cases[3].pattern Nrrc 0V^8dQhRRRRRRRRRRRR /#rr8)r9s"r:r;MatchAs.__annotate___rkr<c 8<VV\SV`VVVVVR7R#rrrs&&&&$$r:rMatchAs.__init___rnr<c$V^8dQhRRRRRR/#)r5r~zPattern | NonerrUr6rr8)r9s"r:r;rrs*    r<c WnW nR#r>r~r)rr~rs&$$r:rMatchAs.postinitrs   r<)rr~rr) rrrrrrrrrmatch_as_assigned_stmtsrrrrs@r:rrDsD0*O "&  &*  &66Nr<rcRa]tRtRtRtR tR RRRR/RV3RlllltRR ltR tV;t #) MatchOrizClass representing a :class:`ast.MatchOr` node. >>> import astroid >>> node = astroid.extract_node(''' match x: case 400 | 401 | 402: ... ''') >>> node.cases[0].pattern Nrrc 0V^8dQhRRRRRRRRRRRR /#rr8)r9s"r:r;MatchOr.__annotate__rr<c 4<V\SV`VVVVVR7R#rrrs&&&&$$r:rMatchOr.__init__rr<c V^8dQhRRRR/#rr8)r9s"r:r;rrr<c WnR#r>rrs&$r:rMatchOr.postinitrr<rrrrs@r:rrs7 $O "&  &*  $!!r<rc^a]tRtRtRtR tR RRRR/RV3RlllltRR ltR R ltR t V;t #) TemplateStrizClass representing an :class:`ast.TemplateStr` node. >>> import astroid >>> node = astroid.extract_node('t"{name} finished {place!s}"') >>> node Nrrc 0V^8dQhRRRRRRRRRRRR /#rr8)r9s"r:r;TemplateStr.__annotate__rr<c 4<V\SV`VVVVVR7R#rrrs&&&&$$r:rTemplateStr.__init__rr<c V^8dQhRRRR/#)r5rrr6rr8)r9s"r:r;rs,4r<c WnR#r>rrs&$r:rTemplateStr.postinits r<cV^8dQhRR/#r5r6zIterator[NodeNG]r8)r9s"r:r;rs.r<c# :"VPRjxL R#L5ir>rrs&r:rTemplateStr.get_childrenrrrrr~rs@r:rrs<"O "&  &*  $r<rcna]tRtRtRtRtRtRRRRR/RV3R lllltRRRR/R R lltR R lt Rt V;t #) Interpolationia!Class representing an :class:`ast.Interpolation` node. >>> import astroid >>> node = astroid.extract_node('t"{name} finished {place!s}"') >>> node >>> node.values[0] >>> node.values[2] r rNrrc 0V^8dQhRRRRRRRRRRRR /#rr8)r9s"r:r;Interpolation.__annotate__sF# # # #  #  # ##  # r<c R<VVVRVn\SV` VVVVVR7R#)Nrrrs&&&&$$r:rInterpolation.__init__sK " 3  .2 !!)  r<c ,V^8dQhRRRRRRRRRR /#) r5rCr(rrr{r rr6rr8)r9s"r:r;rs> ' ' ' '  ' & '  'r<c 6WnW nW0nW@nR#r>)rCrrr )rrCrrr s&$$$$r:rInterpolation.postinits $&r<cV^8dQhRR/#rr8)r9s"r:r;r s##.#r<c# n"VPxVP'dVPxR#R#5ir>rrs&r:rInterpolation.get_children s,jj    "" " s35)rr rrCr)rrrr) rrrrrrr*rrrrrrs@r:rrsV /O)M# "& # &*# # J '  ' )- '##r<r.zdict[type, type[NodeNG]]rAc$V^8dQhRRRRRR/#)r5rCrrQzList | Set | Tupler6rr8)r9s"r:r;r;'s$     2  r<c`.pVF%p\V4pWnVPV4K' V#)zACreate a list of nodes to function as the elements of a new node.)rrr)rCrQelementselement element_nodes&& r:_create_basic_elementsr's6 H$W- " %  Or<c$V^8dQhRRRRRR/#)r5rzMapping[Any, Any]rQrr6zAlist[tuple[SuccessfulInferenceResult, SuccessfulInferenceResult]]r8)r9s"r:r;r;4s$    %) F r<c.pVP4F9wr4\V4pWn\V4pWnVPWV34K; V#)zHCreate a list of node pairs to function as the items of a new dict node.)rrrr)rrQrrrCkey_node value_nodes&& r:_create_dict_itemsr4sRSUHlln  %"5)  ./ % Or<c V^8dQhRRRR/#)r5rCr r6r*r8)r9s"r:r;r;Cs'''!3'r<c\V4p\V\4'dQhV\9d\ 4pWnV#\V,p\V\ \\34'd.V!RR\RRR7pVP\W44V#\V\4'd.V!RR\RRR7pVP\W44V#\V4#)z*Return an astroid node for a python value.Nr)r| issubclassr(rArrrHrrIr)rrrrrz)rC value_typerQinitializer_clsrs& r:rrCs eJ*f--- - "{   +O/D#u#566"!   0AB/4(("!   ,U=> <r<) )rHrIrJrKNr>r)__conditional_annotations__r __future__rrrrorrtypingrcollections.abcrrrrr functoolsrr r r r r r7rrr astroid.basesrr astroid.constrrrastroid.contextrrrastroid.exceptionsrrrrrrrr r!r"r#astroid.interpreterr$astroid.managerr%rr&astroid.nodes.constr'astroid.nodes.node_ngr(astroid.nodes.scoped_nodesr)astroid.typingr*r+r,r- version_infor.typing_extensionsr0r1r2rDrrEBadOperationMessagerGAssignedStmtsPossibleNoderr{AssignedStmtsCallInferBinaryOperationInferLHSr InferUnaryOprrTrvrr~rrrParentAssignNodeABCMetarNoChildrenNode LookupMixInrJr.r5rAAssignTypeNoderCrr}rrK Statementrrr! OperatorNoder rorrreqneltlegtgerrrrrrzrQrSrfrrrrrMultiLineBlockNoderMultiLineWithElseBlockNoderrr ImportNoder r&r4rdrlr|rrHrrrrrrrrr)rfrhrIrrrrrrrrrrr r2r!rrRUNATTACHED_UNKNOWNr^rhrvrxrrrrrrrrrrr@rrr|rDr7floatcomplexr4rArrr)rs@r:r0s  B"  LL%??//0CCGG    .*%-(5w&.// ..& 1 08P8PQ""ST!4 S D      %& o./1  %& ot%7$%>>?A #(::;  %%.&.4FV(6 HBuK00(ckkuvY3  Y3x$  7 79U9U$ NI3; " "K$>$>I3X<KKDD$:NE9((+*F*FE9P[ " "<4>[ ' ')>)>4>n0 **K,A,A0f}  8 8+:O:O} @p K $ $p fw>Vw>tK & & (=(=V6Vt (++(++(++(++  % 6 2    @ f@ FMFM`fK & &fR{));+@+@11h*k***Z% [ ' ')>)>% Py68yxB; BD&' **&'RKT""K$>$> @U@UKT\F**FRs&F)>?DA; / /1F1FA;HK>FK>\FF[ # #FFR*f*ZDK=DKN5{));+@+@5p* ***Z; % %{'<'<)K ! !)X[ " "8-&]F]@-k**-`s8s8ls"+ 0 0+2G2Gs"lb"k44k6K6Kb"JDKMDKN:( **K,A,A:(z2k((2j,;--,` 4 N>k&&N>bB;K 2 2K4I4IB;Je**ePBBF8==I++IyVyx$q#q#hs+ **s+l k(( FN3fJ,K ! !;#A#A,^,f,* ..*Z""J( W( V&!G&!R1;--w1h4)4)n' **G'T:k((':z"!g"!J!&!HE#FE#Z $ 5$J%Iu% 5 U 5' #"  'r<