+ i^gZ^RIHt^RIt^RIt^RIHtHt^RIHt^RIH t ^RI H t H t HtHtHtHt^RIHtHt^RIHt^R IHtHtHtHtHt^R IHt^R IH t ^R I!H"t"^R I#H$t$^RI%H&t&H't'H(t(]PRR8d^RI H*t*M^RI+H*t*] 'dF^RI,H-t-]P\]P^,]P`,]Pb,t2]!RRR7t3]!RRR7t4]!RRR7t5R]6R,,]7]6R,R3,,t8!RR4t9R#)) annotationsN) GeneratorIterator)cached_property)singledispatch) TYPE_CHECKINGAnyClassVarTypeVarcastoverload)nodesutil)InferenceContext) AstroidErrorInferenceErrorParentMissingErrorStatementMissingUseInferenceDefault)AstroidManagerAsStringVisitor) OP_PRECEDENCE)Position)InferenceErrorInfoInferenceResultInferFn)Self) _base_nodes_NodesTNodeNG)bound_NodesT2_NodesT3.c]tRt^7t$RtRtR]R&RtR]R&RtR]R&Rt R]R&R_t R]R &R_t R]R &R_t R]R &R t R ]R&RRltR`RRlltRRltRRltRRltRRltRRltRRltRR ltR!R"ltR#R$ltR%R&ltR'R(ltR)R*ltR+tR,tR-tR.t] R/R0l4t!] R1R2l4t"R3R4lt#R5R6lt$R7R8lt%]&RaR9R:ll4t']&RaR;R<ll4t']&RaR=R>ll4t']&RaR?R@ll4t'R`RARBllt'] RCRDl4t(REt)RFt*RGt+RHt,RIt-R`RJRKllt.RLt/RMt0RNROlt1RPRQlt2RRRSlt3RTRUlt4RbRVRWllt5R`RXRYllt6RZR[lt7R\R]lt8R^t9R #)cr!zdA node of the new Abstract Syntax Tree (AST). This is the base class for all Astroid node classes. FzClassVar[bool] is_statementoptional_assign is_function is_lambdazClassVar[tuple[str, ...]]_astroid_fields _other_fields_other_other_fieldsNzInferFn[Self] | None_explicit_inferencec 0V^8dQhRRRRRRRRRRRR /#) linenoz int | None col_offsetparent NodeNG | None end_linenoend_col_offsetreturnNone)formats"7/usr/lib/python3/dist-packages/astroid/nodes/node_ng.py __annotate__NodeNG.__annotate__YsF           #     c ZWnW nW0nW@nWPnRVnR#N)r0r1r2r4r5position)selfr0r1r2r4r5s&&&&$$r:__init__NodeNG.__init__Ys= D$F 1$D, *.  r=c$V^8dQhRRRRRR/#)r/contextInferenceContext | Nonekwargsr r6zGenerator[InferenceResult]r8)r9s"r:r;r<{s$77.7AD7 #7r=c+ h"Vf \4pMVPPW4pVPe<VP!VV3/VBF pV;P^, unVxK" R#WP VPVP3pWAP9dVPV,RjxL R#.p\4Pp\VP!RRV/VB4FwrsWv8gVPVP8d4VP\ P"4\ P"xM2VPV4VxV;P^, unK \%V4VPV&R# \ dEL6i;iL5i)aGet a generator of the inferred values. This is the main entry point to the inference system. .. seealso:: :ref:`inference` If the instance has some explicit inference function set, it will be called instead of the default interface. :returns: The inferred values. :rtype: iterable NrEr8)r extra_contextgetr-nodes_inferredr lookupname callcontext boundnodeinferredrmax_inferable_values enumerate_infer max_inferredappendr Uninferabletuple)rArErGresultkeyresultslimitis&&, r:infer NodeNG.infer{s ?&(G++//>G  # # / "66F **a/* L '')<)O>OP "" "'', , ,  55"4;;#Iw#I&#IJIAzg44w7K7KKt//0&&& NN6 "L  " "a ' "K!&g3'   -s69F28F4A F2?F0CF2 F-)F2,F--F2cV^8dQhRR/#r/r6strr8)r9s"r:r;r<s3r=c a\;QJdV3RlR4F 'dK RM RM!V3RlR44'd#\SRR4;'g\SRR4#R#)ziGet a name for nice representation. This is either :attr:`name`, :attr:`attrname`, or the empty string. c3@<"TFqSP9xK R#5ir?)r*).0namerAs& r: #NodeNG.repr_name..sQ*>>>ED3EUOi/ENN5%@KKDQE1XJEb  S9_t34" MMUG1RWWU^$45 6? U U usY.44V<   r=cV^8dQhRR/#r_r8)r9s"r:r;r<s  # r=c  VP4pVPpV'dRpMRpVR\V4PRVRVR\ V4/,# \d^pLIi;i)rz.<%(cname)s.%(rname)s l.%(lineno)s at 0x%(id)x>z$<%(cname)s l.%(lineno)s at 0x%(id)x>rwrxr0id)rl fromlinenoAttributeErrorr{r|r)rArxr0rs& r:__repr__NodeNG.__repr__su  __F EF;F T$Z(( U f "T(     F s A A('A(c V^8dQhRRRR/#)r/visitorrr6r`r8)r9s"r:r;r<so#r=c |\VRVPPP4,4pV!V4#)z(Visit this node using the given visitor.visit_)rj __class__r|lower)rArfuncs&& r:accept NodeNG.accepts0w4>>+B+B+H+H+J JKDzr=cV^8dQhRR/#r/r6zIterator[NodeNG]r8)r9s"r:r;r<s  . r=c# "VPF@p\W4pVfK\V\\34'd TRjxL K<VxKB RRjxL R#LL5i)z$Get the child nodes below this node.Nr8r*rj isinstancelistrVrArattrs& r: get_childrenNodeNG.get_childrensW))E4'D|$u .. *   s$AA#AA#A!A#!A#cV^8dQhRR/#)r/r6r3r8)r9s"r:r;r<s  M r=c VPRRR1,FAp\W4pV'gK\V\\34'd VR,u#Vu# R#)z1An optimized version of list(get_children())[-1].Nrrs& r: last_childNodeNG.last_childsR))$B$//E4'D$u ..BxK 0r=cV^8dQhRR/#rr8)r9s"r:r;r<s## 0#r=c# R"VPpVeVxVPpKR#5i)z7Yield parent, grandparent, etc until there are no more.N)r2rAr2s& r:node_ancestorsNodeNG.node_ancestorss' L]]F!s%'cV^8dQhRR/#r/r6boolr8)r9s"r:r;r< sGGGr=c a\;QJd-V3RlVP44F 'gK R# R#!V3RlVP444#)zCheck if this node is the parent of the given node. :param node: The node to check if it is the child. :type node: NodeNG :returns: Whether this node is the parent of the given node. c3,<"TF pSVJxK R#5ir?r8)rcr2rAs& r:re#NodeNG.parent_of..sF0Ef46>0EsTF)anyrrAnodesf&r: parent_ofNodeNG.parent_of s@sF0C0C0EFssFsFsF0C0C0EFFFr=cV^8dQhRR/#)r/r6_base_nodes.Statementr8)r9s"r:r;r<s ' '0 'r=c VP'd \RV4#VP'g \VR7hVPP 4#)z}The first parent node, including self, marked as statement node. :raises StatementMissing: If self has no parent attribute. rtarget)r&r r2r statementrks&r:rNodeNG.statementsE    /6 6{{{"$/ /{{$$&&r=cV^8dQhRR/#)r/r6 FrameTyper8)r9s"r:r;r<!s # #y #r=c jVPf \VR7hVPP4#)zThe first parent frame node. A frame node is a :class:`Module`, :class:`FunctionDef`, :class:`ClassDef` or :class:`Lambda`. :returns: The first parent frame node. :raises ParentMissingError: If self has no parent attribute. r)r2rframerks&r:r NodeNG.frame!s, ;; $D1 1{{  ""r=cV^8dQhRR/#)r/r6znodes.LocalsDictNodeNGr8)r9s"r:r;r<.s # #- #r=c rVP'g \VR7hVPP4#)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)r2rscoperks&r:r NodeNG.scope.s+{{{$D1 1{{  ""r=cV^8dQhRR/#)r/r6z nodes.Moduler8)r9s"r:r;r<9s  l r=c VP;p'g%\V\P4'gQhV#VP'dVPpK \V\P4'gQhV#)zCReturn the root node of the syntax tree. :returns: The root node. )r2rrModulers& r:root NodeNG.root9s] ++%%dELL11 11Kmmm]]F&%,,//// r=c VPF@p\W4pW1JdV.u#\V\\34'gK6W9gK>Vu# Rp\ V\ V4\ V43,4h)a'Search for the sequence that contains this child. :param child: The child node to search sequences for. :type child: NodeNG :returns: The sequence containing the given child node. :rtype: iterable(NodeNG) :raises AstroidError: If no sequence could be found that contains the given child. "Could not find %s in %s's childrenr*rjrrVrrreprrAchildrnode_or_sequencemsgs&& r:child_sequenceNodeNG.child_sequenceGsr))E&t3 (())+eT];;-''*33$u+tDz!::;;r=c VPFAp\W4pWJdW!3u#\V\\34'gK6W9gK>W#3u# Rp\ V\ V4\ V43,4h)aFind the field of this node that contains the given child. :param child: The child node to search fields for. :type child: NodeNG :returns: A tuple of the name of the field that contains the child, and the sequence or node that contains the child node. :rtype: tuple(str, iterable(NodeNG) or NodeNG) :raises AstroidError: If no field could be found that contains the given child. rrrs&& r: locate_childNodeNG.locate_childasr))E&t3 (|#+eT];;-..*33$u+tDz!::;;r=c 6VPP4#)zdThe next sibling statement node. :returns: The next sibling statement node. :rtype: NodeNG or None )r2 next_siblingrks&r:rNodeNG.next_sibling~s {{''))r=c 6VPP4#)zgThe previous sibling statement. :returns: The previous sibling statement node. :rtype: NodeNG or None )r2previous_siblingrks&r:rNodeNG.previous_siblings {{++--r=cV^8dQhRR/#r/r6intr8)r9s"r:r;r<sCr=c VVPfVP4#VP#)zsThe first line that this node appears on in the source code. Can also return 0 if the line can not be determined. )r0_fixed_source_linerks&r:rNodeNG.fromlinenos' ;; **, ,{{r=cV^8dQhRR/#rr8)r9s"r:r;r<s####r=c VPe VP#VP'gRpMVP4pVf VP#VP#)zrThe last line that this node appears on in the source code. Can also return 0 if the line can not be determined. N)r4r*rrtolineno)rArs& r:rNodeNG.tolinenosQ ?? &?? "###J*J  ?? """"r=cV^8dQhRR/#rr8)r9s"r:r;r<sCr=c VPpTpVf(\VP44pVPpK+T;'g^# \d6TPpT'dTfTPpTPpK&LKi;i)zAttempt to find the line that this node appears on. We need this method since not all nodes have :attr:`lineno` set. Will return 0 if the line number can not be determined. )r0nextr StopIterationr2)rAr_noder2s& r:rNodeNG._fixed_source_lines {{ ',U//12||yyq  '[[FT\}}  's+AB'BBc V^8dQhRRRR/#)r/r0rr6ztuple[int, int]r8)r9s"r:r;r<s%%#%/%r=c WP3#)zGet 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)rAr0s&&r: block_rangeNodeNG.block_ranges}}$$r=c$V^8dQhRRRRRR/#)r/rdr`stmtr!r6r7r8)r9s"r:r;r<s! * *c * *D *r=c dVP'gQhVPPW4R#)zDefine that the given name is declared in the given statement node. This definition is stored on the parent scope node. .. seealso:: :meth:`scope` :param name: The name that is being defined. :param stmt: The statement that defines the given name. N)r2 set_local)rArdrs&&&r:rNodeNG.set_locals${{{{ d)r=c$V^8dQhRRRRRR/#)r/klassz type[_NodesT] skip_klass SkipKlassTr6Iterator[_NodesT]r8)r9s"r:r;r<s(       r=c R#r?r8rArrs&&&r:nodes_of_classNodeNG.nodes_of_class  r=c$V^8dQhRRRRRR/#)r/rz$tuple[type[_NodesT], type[_NodesT2]]rrr6z&Iterator[_NodesT] | Iterator[_NodesT2]r8)r9s"r:r;r<s(55355 0 5r=c R#r?r8rs&&&r:rrs 25r=c$V^8dQhRRRRRR/#)r/rz4tuple[type[_NodesT], type[_NodesT2], type[_NodesT3]]rrr6;Iterator[_NodesT] | Iterator[_NodesT2] | Iterator[_NodesT3]r8)r9s"r:r;r<s.JJCJJ E Jr=c R#r?r8rs&&&r:rrs GJr=c$V^8dQhRRRRRR/#)r/rztuple[type[_NodesT], ...]rrr6rr8)r9s"r:r;r<s(  (     r=c R#r?r8rs&&&r:rrrr=c$V^8dQhRRRRRR/#)r/rztype[_NodesT] | tuple[type[_NodesT], type[_NodesT2]] | tuple[type[_NodesT], type[_NodesT2], type[_NodesT3]] | tuple[type[_NodesT], ...]rrr6rr8)r9s"r:r;r<s0DD (DD EDr=c# 2"\W4'dVxVf3VP4FpVPW4RjxL K R#VP4F/p\W24'dKVPW4RjxL K1 R#LOL 5i)aGet the nodes (including this one or below) of the given types. :param klass: The types of node to search for. :param skip_klass: The types of node to ignore. This is useful to ignore subclasses of :attr:`klass`. :returns: The node of the given types. N)rrr)rArr child_nodes&&& r:rrs& d " "J  "//1 %44UGGG2 ++-J*11!00C C C. H Ds%ABBABB BBcV^8dQhRR/#)r/r6zlist[nodes.Assign]r8)r9s"r:r;r<s(:r=c .#r?r8rks&r:_assign_nodes_in_scopeNodeNG._assign_nodes_in_scopes r=c# p"VP4FpVP4RjxL K R#L 5ir?)r_get_name_nodes)rArs& r:rNodeNG._get_name_nodess-++-J!113 3 3. 3s '64 6c# &"RRjxL R#L5iNr8r8rks&r: _get_return_nodes_skip_functions'NodeNG._get_return_nodes_skip_functions  c# &"RRjxL R#L5irr8rks&r:_get_yield_nodes_skip_functions&NodeNG._get_yield_nodes_skip_functionsrrc# &"RRjxL R#L5irr8rks&r:_get_yield_nodes_skip_lambdas$NodeNG._get_yield_nodes_skip_lambdas"rrc R#r?r8)rArrds&&&r: _infer_nameNodeNG._infer_name%s r=c$V^8dQhRRRRRR/#)r/rErFrGr r6z;Generator[InferenceResult, None, InferenceErrorInfo | None]r8)r9s"r:r;r<)s$  . AD D r=c \RWR7h)z4We don't know how to resolve a statement by default.z#No inference function for {node!r}.)rrE)r)rArErGs&&,r:rR NodeNG._infer)s  1  r=c 4\VP44#)zoGet a list of the inferred values. .. seealso:: :ref:`inference` :returns: The inferred values. :rtype: list )rr\rks&r:rONodeNG.inferred2sDJJL!!r=c V#)zInstantiate an instance of the defined class. .. note:: On anything other than a :class:`ClassDef` this will return self. :returns: An instance of the defined class. :rtype: object r8rks&r:instantiate_classNodeNG.instantiate_class<s  r=cV^8dQhRR/#rr8)r9s"r:r;r<Hsr=c R#)zCheck if this node inherits from the given type. :param node: The node defining the base to look for. Usually this is a :class:`Name` node. :type node: NodeNG Fr8rs&&r:has_baseNodeNG.has_baseHsr=cV^8dQhRR/#rr8)r9s"r:r;r<Qs$r=c R#)zrWhether this node defines something that is callable. :returns: Whether this defines something that is callable. Fr8rks&r:callableNodeNG.callableQs r=cV^8dQhRR/#rr8)r9s"r:r;r<Xs4r=c R#)Fr8)rArs&&r:eq NodeNG.eqXsr=cV^8dQhRR/#r_r8)r9s"r:r;r<[s''3'r=c "\4!V4#)z.Get the source code that this node represents.rrks&r: as_stringNodeNG.as_string[s &&r=cV^8dQhRR/#r_r8)r9s"r:r;r<_sJJ Jr=c 6aaaaaaa \RV3Rll4o S P\4S P\4RV V3Rll44pS P\4RV VVVVV3Rll4p.p S !W \ 44RP V 4#)arGet a string representation of the AST from this node. :param ids: If true, includes the ids with the node type names. :type ids: bool :param include_linenos: If true, includes the line numbers and column offsets. :type include_linenos: bool :param ast_state: If true, includes information derived from the whole AST like local and global variables. :type ast_state: bool :param indent: A string to use to indent the output string. :type indent: str :param max_depth: If set to a positive integer, won't return nodes deeper than max_depth in the string. :type max_depth: int :param max_width: Attempt to format the output string to stay within this number of characters, but can exceed it under some circumstances. Only positive integer values are valid, the default is 80. :type max_width: int :returns: The string representation of the AST. :rtype: str rhc 8<\P!V\S\V4, ^4R7P R4pVP V^,4TP VR,Uu.uF qcV,NK up4\V4^8g#uupi)zjOutputs a representation of a non-tuple/list, non-node that's contained within an AST, including strings. )rrTrs)r~rmaxr}rrTextend)rrWdone cur_indentdepthrr max_widths&&&&& r: _repr_tree$NodeNG.repr_tree.._repr_trees NNC C O ;Q?j  MM%( # MMrC,,C Du:? "Ds1Bc<VS, pVPR4V'gRpEM\V4^8XdS!V^,WW44pM\V4^8XdjS!V^,WW44pV'gVPR4M"VPR4VPV4S!V^,WW44;'gTpMmVPR4VPV4VRR F/pS!WaW#V4VPR4VPV4K1 S!VR ,WW44RpVPR4V#) zGOutputs a representation of a sequence that's contained within an AST. [Fz, rz NT]r)rTr}) rrWrBrCrDbrokenrrFrqs &&&&& r: _repr_seq#NodeNG.repr_tree.._repr_seqs & J MM# Ta#DGV:MTa#DGV:MMM$'MM%(MM*-#DGV:MWWQW d# j)!#2YEudFMM%(MM*-'48V:E MM# Mr=c <W9d=VPS R\V4P R\V4 2,4R#VP V4S 'dVS 8dVPR4R#V^, pVS , pS 'd6VP\V4P R\V4R R24M'VP\V4P R24.pS 'dVP R4VP VP 4VP VP4S 'dVP VP4V'gRpM\V4^8Xd7VPV^, R 24S!\W^,4WW44pMVPR 4VPV4VR RFUpVR 8XdK VPV R 24S!\W4WW44VPR 4VPV4KW VPVR, R 24S!\WR,4WW44RpVPR4V#)z4Outputs a strings representation of an astroid node.z( (rvrJNdocrzT))r0r1r) rTr{r|raddrAr+r*r,r}rj)rrWrBrCrDryrLrrF ast_stateidsinclude_linenosrq max_depths&&&&& r: _repr_node$NodeNG.repr_tree.._repr_nodes| ~d4j.A.A-B)BtH:VV HHTNUY. e$ QJE & J d!4!4 5SD! DIJ d!4!4 5Q78F 67 MM$,, - MM$.. / d667V!  1o.#D),fJ d# j)#CR[E~ MMUG1+.wt3V:UMM%(MM*-)  A./744fJV MM# Mr=)rhrt)_singledispatchregisterrVrr!setr) rArVrWrUrqrXrErMrYrWrFs &ffffff @r: repr_treeNodeNG.repr_tree_sP  #  #   U #   T "  # $ >   V $/ /  %/ b4'wwvr=cV^8dQhRR/#)r/rErFr8)r9s"r:r;r<s  "9 r=c "\P#)aDetermine the boolean value of this node. The boolean value of a node can have three possible values: * False: For instance, empty data structures, False, empty strings, instances which return explicitly False from the __nonzero__ / __bool__ method. * True: Most of constructs are True by default: classes, functions, modules etc * Uninferable: The inference engine is uncertain of the node's value. :returns: The boolean value of this node. :rtype: bool or Uninferable )rrU)rArEs&&r: bool_valueNodeNG.bool_values$r=cV^8dQhRR/#rr8)r9s"r:r;r<sNNsNr=c r\P!VPP\ \44#r?)rrJrr|r}rks&r: op_precedenceNodeNG.op_precedences$  !8!8#m:LMMr=cV^8dQhRR/#rr8)r9s"r:r;r<sTr=c R#)Tr8rks&r:op_left_associativeNodeNG.op_left_associativesr=)r1r5r4r0r2r@r8r?).)FFFz rP):r| __module__ __qualname____firstlineno____doc__r&__annotations__r'r(r)r*r+r,r-rBr\rlrrrrrrrrrrrrrrrrrrrrrr rrrrrr r#rRrOr+r/r3r7r;r^rbrfrj__static_attributes__r8r=r:r!r!7s $)L.(2 ^ #(K'1 %I~%24O.302M,1:5727704-4  D7r 4 $  #G ' # # <4<:*.## &% *  55 JJ   DB4  " 'JX (Nr=) ): __future__rr~syscollections.abcrr functoolsrrr[typingrr r r r r astroidrrastroid.contextrastroid.exceptionsrrrrrastroid.managerrastroid.nodes.as_stringrastroid.nodes.constrastroid.nodes.utilsrastroid.typingrrr version_infortyping_extensions astroid.nodesr FunctionDefrClassDefLambdarr r#r$r{rVrr!r8r=r:rs # /%7 ,+3-(GGw&)!!ELL05>>AELLPI )8 , :X . :X . DN "U4>3+>%? ? N N r=