eiddlmZddlZddlZddlZddlmZmZddlm Z ddlm Z ddl m Z mZmZmZmZmZmZmZmZmZddlmZddlmZdd lmZmZmZmZm Z dd l!m"Z"dd l#m$Z$dd l%m&Z&dd l'm(Z(ddl)m*Z*m+Z+m,Z,ejZdk\rddl m.Z.nddl/m.Z.e rddlm0Z0eddZ1eddZ2eddZ3ededeeddffZ4GddZ5y)) annotationsN) GeneratorIterator)cached_property)singledispatch) TYPE_CHECKINGAnyClassVarLiteralTupleTypeTypeVarUnioncastoverload)util)InferenceContext) AstroidErrorInferenceErrorParentMissingErrorStatementMissingUseInferenceDefault)AstroidManagerAsStringVisitor) OP_PRECEDENCE)Position)InferenceErrorInfoInferenceResultInferFn) )Self)nodes_NodesTNodeNG)bound_NodesT2_NodesT3.ceZdZUdZdZded< dZded< dZded< dZded<dZ d ed < dZ d ed < dZ d ed < d Z ded< d>dZ d? d@dZdAdZdAdZdAdZdBdZdCdZdDdZdCdZdEdZd ddFdZd d dGdZdHdZdIdZdZd Zd!Zd"ZedJd#Z edJd$Z!dJd%Z"dKd&Z#dLd'Z$e% dM dNd(Z&e% dM dOd)Z&e% dM dPd*Z&e% dM dQd+Z& d? dRd,Z&edSd-Z'd.Z(d/Z)d0Z*d1Z+d2Z, d? dTd3Z-d4Z.d5Z/dEd6Z0dEd7Z1dEd8Z2dAd9Z3 dU dAd:Z4d?dVd;Z5d<Z6dEd=Z7y )Wr&zlA 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_inferencecb||_ ||_ ||_ ||_ ||_ d|_yN)lineno col_offsetparent end_linenoend_col_offsetposition)selfr6r7r8r9r:s 7/usr/lib/python3/dist-packages/astroid/nodes/node_ng.py__init__zNodeNG.__init__\sG D$F 1$D, *.  c+2K| t}n|jj||}|j4 |j||fi|D]}|xjdz c_|y||j |j|jf}||jvr|j|Ed{yg}tj}t|jdd|i|D]\}}||k\s|j|jkDr3|jt j"t j"n,|j|||xjdz c_t%||j|<y#t $rY%wxYw7w)aVGet 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 Ncontextr/)r extra_contextgetr3nodes_inferredr lookupname callcontext boundnodeinferredrmax_inferable_values enumerate_infer max_inferredappendr Uninferabletuple)r<rBkwargsresultkeyresultslimitis r=inferz NodeNG.infer~s ?&(G++//g>G  # # / 6d66!F **a/* L !W'')<)O>OP '"" "'', , ,  55";4;;#Iw#I&#IJ (IAvEzg44w7K7KKt//0&&& NN6 "L  " "a ' " (!&g3'   -s66F2F+AF0F1CF FFFFcftfddDrtddxs tddSy)zyGet a name for nice representation. This is either :attr:`name`, :attr:`attrname`, or the empty string. c3:K|]}|jvywr5)r0).0namer<s r= z#NodeNG.repr_name..sQDt4///Qs)r[attrnamer[r])allgetattrr<s`r= repr_namezNodeNG.repr_names4 Q*>> 7ED%3EUOi/ENN5%@KKDQE1XJEab  5 S9_t34 5 MMUG1RWWU^$45 6 7sY.44V<   r?c|j} |j}|rd}nd}|t|j||t |dzS#t$rd}Y:wxYw)Nrz.<%(cname)s.%(rname)s l.%(lineno)s at 0x%(id)x>z$<%(cname)s l.%(lineno)s at 0x%(id)x>)rlrmr6id)rb fromlinenoAttributeErrorrorpr)r<rmr6rvs r=__repr__zNodeNG.__repr__sm  __F EF;F$Z((T(     F s A AActt|d|jjjz}||S)z(Visit this node using the given visitor.visit_)r` __class__rplower)r<visitorfuncs r=acceptz NodeNG.accepts0w4>>+B+B+H+H+J JKDzr?c#K|jD]6}t||}|t|ttfr |Ed{3|8dEd{y77w)z$Get the child nodes below this node.Nr/r0r` isinstancelistrPr<rxattrs r= get_childrenzNodeNG.get_childrens])) E4'D|$u .     s!:AAA AAAc|jdddD]1}t||}|st|ttfr|dcS|cSy)z1An optimized version of list(get_children())[-1].Nrrs r= last_childzNodeNG.last_childsS))$B$/ E4'D$u .BxK  r?c#PK|j}|||j}|yyw)z7Yield parent, grandparent, etc until there are no more.Nr8r<r8s r=node_ancestorszNodeNG.node_ancestorss+ L]]F s!&&cHtfd|jDS)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&K|]}|u ywr5r/)rZr8r<s r=r\z#NodeNG.parent_of..sFf46>Fs)anyrr<nodes` r= parent_ofzNodeNG.parent_ofsF0C0C0EFFFr?futurec|tjdtd|jr t d|S|j s t ||j jS)zThe first parent node, including self, marked as statement node. :raises StatementMissing: If self has no parent attribute. .The future arg will be removed in astroid 4.0.rd stacklevelnodes.Statementtarget)warningswarnDeprecationWarningr+rr8r statementr<rs r=rzNodeNG.statements]   MM@"    )40 0{{"$/ /{{$$&&r?c|tjdtd|j t ||jj |S)a The 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. rrdrrr)rrrr8rframers r=rz NodeNG.frame*sN   MM@"  ;; $D1 1{{   //r?cf|js t||jjS)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)r8rscoperas r=rz NodeNG.scope?s){{$D1 1{{  ""r?cp|jx}s|S|jr|j}|jr|S)zSReturn the root node of the syntax tree. :returns: The root node. rrs r=rootz NodeNG.rootJs6 ++%%Kmm]]Fmm r?c|jD]6}t||}||ur|gcSt|ttfs/||vs4|cSd}t |t |t |fz)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 childrenr0r`rrPrrreprr<childrxnode_or_sequencemsgs r=child_sequencezNodeNG.child_sequenceVs{)) (E&tU3 5(())+eT];--'' (33$u+tDz!::;;r?c|jD]9}t||}||ur||fcSt|ttfs0||vs5||fcSd}t |t |t |fz)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_childzNodeNG.locate_childps)) /E&tU3 ((e|#+eT];--... /33$u+tDz!::;;r?c6|jjS)z|The next sibling statement node. :returns: The next sibling statement node. :rtype: NodeNG or None )r8 next_siblingras r=rzNodeNG.next_siblings {{''))r?c6|jjS)zThe previous sibling statement. :returns: The previous sibling statement node. :rtype: NodeNG or None )r8previous_siblingras r=rzNodeNG.previous_siblings {{++--r?cR|j|jS|jS)zThe first line that this node appears on in the source code. Can also return 0 if the line can not be determined. )r6_fixed_source_lineras r=rzNodeNG.fromlinenos' ;; **, ,{{r?c|j |jS|jsd}n|j}| |jS|jS)zThe last line that this node appears on in the source code. Can also return 0 if the line can not be determined. N)r9r0rrtolineno)r<rs r=rzNodeNG.tolinenosN ?? &?? "##J*J  ?? """"r?c|j}|} |(t|j}|j}|(|xsdS#t$r0|j}|r||j}|j}|r|Y>wxYw)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. r)r6nextr StopIterationr8)r<r|_noder8s r=rzNodeNG._fixed_source_lines {{ ',U//12||,yq  '[[FT\}}T\ 's)A5A98A9c||jfS)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)r<r6s r= block_rangezNodeNG.block_rangest}}$$r?cX|jsJ|jj||y)a$Define 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)r8 set_local)r<r[stmts r=rzNodeNG.set_locals${{{ dD)r?cyr5r/r<klass skip_klasss r=nodes_of_classzNodeNG.nodes_of_class r?cyr5r/rs r=rzNodeNG.nodes_of_classrr?cyr5r/rs r=rzNodeNG.nodes_of_classrr?cyr5r/rs r=rzNodeNG.nodes_of_classrr?c#Kt||r||0|jD]}|j||Ed{y|jD])}t||r|j||Ed{+y7D7 w)a+Get 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)r<rr child_nodes r=rzNodeNG.nodes_of_classs& dE "J  "//1 H %44UJGGG H ++- DJ*j1!00 C C C D H Ds!;BB._repr_trees} NNC C O ;Q?j  MM%( # MMqrC:,C Du:? "Ds$ Bc@|z }|jd|sd}nt|dk(r|d||||}nt|dk(rY|d||||}|s|jdn"|jd|j||d||||xs|}nk|jd|j||d d D]0}||||||jd|j|2|d ||||d }|jd |S) z_Outputs a representation of a sequence that's contained within an AST. [FrArrdz, rk NrT])rNrq) rrRrrrbrokenrrrgs r= _repr_seqz#NodeNG.repr_tree.._repr_seqs) & J MM# Ta#DGVT:uMTa#DGVT:uMMM$'MM%(MM*-#DGVT:uMWQW d# j)!#2Y.EufdJFMM%(MM*-.48VT:uE MM# Mr?c |||vr7|j dt|jdt|zy|j | r| kDr|jdy|dz }| z } r5|jt|jdt|ddn'|jt|jd g} r|j d |j |j |j |j r|j |j|sd}nt|dk(r1|j|d d t||d ||||}n|jd |j||ddD]T}|dk(r |j|d t|||||||jd|j|V|j|dd t||d||||d}|jd|S)z4Outputs a strings representation of an astroid node.z( ()r6r7rrjrNrdocrkT)) rNrorpraddrr1r0r2rqr`)rrRrrrrnrrxr ast_stateidsinclude_linenosrg max_depths r= _repr_nodez$NodeNG.repr_tree.._repr_nodes t| ~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&),fdJ d# j)#CR[.E~ MMUG1+.wtU3VT:uUMM%(MM*-.  A./744fdJPUV MM# Mr?)r^rA)_singledispatchregisterrPrr&setru) r<r r r rgr rrr rRrs `````` @r= repr_treezNodeNG.repr_treersL  #  #   U #   T "  # $ >   V $/ /  %/ b4'wwvr?c"tjS)akDetermine 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 )rrO)r<rBs r= bool_valuezNodeNG.bool_values$r?cptj|jjt tSr5)rrDrrprqras r= op_precedencezNodeNG.op_precedences$  !8!8#m:LMMr?cy)NTr/ras r=op_left_associativezNodeNG.op_left_associativesr?) r6 int | Noner7rr8 NodeNG | Noner9rr:rreturnNoner5)rBInferenceContext | NonerQr rz&Generator[InferenceResult, None, None])rstr)rrrr)rzIterator[NodeNG])rr)rbool)rLiteral[None, True]rr)rrrz@nodes.FunctionDef | nodes.Module | nodes.ClassDef | nodes.Lambda)rznodes.LocalsDictNodeNG)rz nodes.Module)rint)r6r rztuple[int, int])r[rrr&rr).)rz type[_NodesT]r SkipKlassTrIterator[_NodesT])rz$tuple[type[_NodesT], type[_NodesT2]]rr!rz&Iterator[_NodesT] | Iterator[_NodesT2])rz4tuple[type[_NodesT], type[_NodesT2], type[_NodesT3]]rr!r;Iterator[_NodesT] | Iterator[_NodesT2] | Iterator[_NodesT3])rztuple[type[_NodesT], ...]rr!rr")rztype[_NodesT] | tuple[type[_NodesT], type[_NodesT2]] | tuple[type[_NodesT], type[_NodesT2], type[_NodesT3]] | tuple[type[_NodesT], ...]rr!rr#)rzlist[nodes.Assign])rBrrQr rz;Generator[InferenceResult, None, InferenceErrorInfo | None])FFFz rrf)rBr)8rp __module__ __qualname____doc__r+__annotations__r,r-r.r0r1r2r3r>rWrbr}rrrrrrrrrrrrrrrrrrrrrrrrrrrrrLrIrrrrrrrrrr/r?r=r&r&:s0 $)L.(2  #(K'1 %I~%24O.302M,1:5727704-4          #     F267.7AD7 /7r 4 $  #G:>'$040,0 I0* # <4<:*.## &% *"%       "% 3   0   "% C   E   "% (      "&D (DD EDB4 26 . AD D " ' H HT (Nr?)6 __future__rrrsysrcollections.abcrr functoolsrrrtypingrr r r r r rrrrastroidrastroid.contextrastroid.exceptionsrrrrrastroid.managerrastroid.nodes.as_stringrastroid.nodes.constrastroid.nodes.utilsrastroid.typingrrr version_infor#typing_extensionsr$r%r(r)r!r&r/r?r=r7s # /%7   ,+3-(GGw& )8 , :X . :X . 4htH~s/B)CC D \ \ r?