yIfiddlmZddlZddlZddlZddlmZmZddlm 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,ej-dkrddl m.Z.nddl/m.Z.e r ddlm0Z0ddl1m2Z2eddZ3eddZ4eddZ5ededeeddffZ6GddZ7dS)) annotationsN) GeneratorIterator)cached_property)singledispatch) TYPE_CHECKINGAnyClassVarLiteralTupleTypeTypeVarUnioncastoverload)util)InferenceContext) AstroidErrorInferenceErrorParentMissingErrorStatementMissingUseInferenceDefault)AstroidManagerAsStringVisitor) OP_PRECEDENCE)Position)InferenceErrorInfoInferenceResultInferFn) )Self)nodes) _base_nodes_NodesTNodeNG)bound_NodesT2_NodesT3.ceZdZUdZdZded< dZded< dZded< dZded<dZ d ed < dZ d ed < dZ d ed < d Z ded<dldZ dmdndZdod!Zdod"Zdod#Zdpd&Zdqd(Zdrd)Zdqd*Zdsd,Zd d-dtd1Zd d-dud3Zdvd5Zdwd7Zd8Zd9Zd:Zd;Zedxd=Z edxd>Z!dxd?Z"dydAZ#dzdDZ$e% d{d|dKZ&e% d{d}dNZ&e% d{d~dQZ&e% d{ddSZ& dmddUZ&eddWZ'dXZ(dYZ)dZZ*d[Z+d\Z, dmdd^Z-d_Z.d`Z/dsdaZ0dsdbZ1dsdcZ2doddZ3 ddodhZ4dmddiZ5djZ6dsdkZ7d S)r'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_inferencelineno int | None col_offsetparent NodeNG | None end_linenoend_col_offsetreturnNonecd||_ ||_ ||_ ||_ ||_ d|_dSN)r5r7r8r:r;position)selfr5r7r8r:r;s I/var/www/piapp/venv/lib/python3.11/site-packages/astroid/nodes/node_ng.py__init__zNodeNG.__init__]sL D$F 1$D, *.   contextInferenceContext | Nonekwargsr &Generator[InferenceResult, None, None]c+K|t}n|j||}|j9 |j||fi|D]}|xjdz c_|VdS#t $rYnwxYw||j|j|jf}||j vr|j |Ed{VdSg}tj }t|j dd|i|D]s\}}||ks|j|jkr/|t jt jVn*|||V|xjdz c_tt%||j |<dS)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 NrEr0)r extra_contextgetr4nodes_inferredr lookupname callcontext boundnodeinferredrmax_inferable_values enumerate_infer max_inferredappendr Uninferabletuple)rArErGresultkeyresultslimitis rBinferz NodeNG.infers ?&((GG+//g>>G  # / 6d6!!F **a/** LLLL&    W')OP '" " "', , , , , , , , F  5";4;#I#Iw#I&#I#IJJ ( (IAvEzzg4w7KKKt/000&&&& NN6 " " "LLL  " "a ' " " "!&gs&A A,+A,strctfddDr"tddptddSdS)zyGet a name for nice representation. This is either :attr:`name`, :attr:`attrname`, or the empty string. c3*K|] }|jvVdSr?)r1).0namerAs rB z#NodeNG.repr_name..s+QQDt4//QQQQQQrD)rcattrnamercre)allgetattrrAs`rB repr_namezNodeNG.repr_namesT QQQQ> 7 7ED%33EUOi/EN5%@@@KKDQQE1XJEabb  5 5 S9_t34444 MMU55RWWU^^55 6 6 6 6sY.44V<<    rDc|} |j}n#t$rd}YnwxYw|rd}nd}|t|j||t |dzS)Nrz.<%(cname)s.%(rname)s l.%(lineno)s at 0x%(id)x>z$<%(cname)s l.%(lineno)s at 0x%(id)x>)rtrur5id)rj fromlinenoAttributeErrorrwrxr)rArur5r~s rB__repr__zNodeNG.__repr__s   _FF   FFF   <EFF;F$ZZ(T((     s  --visitorrcvt|d|jjz}||S)z(Visit this node using the given visitor.visit_)rh __class__rxlower)rArfuncs rBacceptz NodeNG.accepts5w4>+B+H+H+J+J JKKtDzzrDIterator[NodeNG]c#K|jD]>}t||}|t|ttfr |Ed{V:|V?dEd{VdS)z$Get the child nodes below this node.Nr0r1rh isinstancelistrXrArattrs rB get_childrenzNodeNG.get_childrensx)  E4''D|$u ..   rDc|jdddD]>}t||}|st|ttfr |dcS|cSdS)z1An optimized version of list(get_children())[-1].Nrrs rB last_childzNodeNG.last_childsj)$$B$/  E4''D $u .. BxKKKtrDc#:K|j}||V|j}| dSdS)z7Yield parent, grandparent, etc until there are no more.Nr8rAr8s rBnode_ancestorszNodeNG.node_ancestors s7 LLL]F     rDboolc^tfd|DS)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|]}|uV dSr?r0)rbr8rAs rBrdz#NodeNG.parent_of..s'FFf46>FFFFFFrD)anyrrAnodes` rB parent_ofzNodeNG.parent_ofs4FFFF0C0C0E0EFFFFFFrDfuturerLiteral[None, True]_base_nodes.Statementc|tjdtd|jrt d|S|jst ||jS)zThe first parent node, including self, marked as statement node. :raises StatementMissing: If self has no parent attribute. N.The future arg will be removed in astroid 4.0.rl stacklevelrtarget)warningswarnDeprecationWarningr,rr8r statementrArs rBrzNodeNG.statementsy   M@"       7/66 6{ 0"$/// /{$$&&&rD@nodes.FunctionDef | nodes.Module | nodes.ClassDef | nodes.Lambdac|tjdtd|jt ||j|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. Nrrlrrr)rrrr8rframers rBrz NodeNG.frame+s`   M@"     ; $D111 1{   ///rDnodes.LocalsDictNodeNGcb|jst||jS)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)r8rscoperis rBrz NodeNG.scope@s3{ 2$D111 1{  """rD nodes.ModulecF|jx}s|S|jr|j}|j|S)zSReturn the root node of the syntax tree. :returns: The root node. rrs rBrootz NodeNG.rootKs: +% Km #]Fm # rDc|jD]?}t||}||ur|gcSt|ttfr||vr|cS@d}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 childrenr1rhrrXrrreprrAchildrnode_or_sequencemsgs rBchild_sequencezNodeNG.child_sequenceWs) ( (E&tU33 5((())))+eT];; (---''''23$u++tDzz!::;;;rDc|jD]B}t||}||ur||fcSt|ttfr ||vr||fcSCd}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 rB locate_childzNodeNG.locate_childqs) / /E&tU33 (((e|###+eT];; /---.....23$u++tDzz!::;;;rDc4|jS)z|The next sibling statement node. :returns: The next sibling statement node. :rtype: NodeNG or None )r8 next_siblingris rBrzNodeNG.next_siblings {'')))rDc4|jS)zThe previous sibling statement. :returns: The previous sibling statement node. :rtype: NodeNG or None )r8previous_siblingris rBrzNodeNG.previous_siblings {++---rDintcF|j|S|jS)zThe first line that this node appears on in the source code. Can also return 0 if the line can not be determined. )r5_fixed_source_lineris rBrzNodeNG.fromlinenos& ; **,, ,{rDcz|j|jS|jsd}n|}||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)r:r1rrtolineno)rArs rBrzNodeNG.tolinenosL ? &? "# +JJ**J  ? """rDc|j}|} |*t|}|j}|*n-#t$r |j}|r||j}|j}|r|YnwxYw|pdS)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. Nr)r5nextr StopIterationr8)rAr_noder8s rBrzNodeNG._fixed_source_lines { ',U//1122|, ' ' '[F 'T\} 'T\ ' yqs,8'A"!A"tuple[int, int]c||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)rAr5s rB block_rangezNodeNG.block_rangest}$$rDrcstmtcN|jsJ|j||dS)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)rArcrs rBrzNodeNG.set_locals0{ dD)))))rD.klass type[_NodesT] skip_klass SkipKlassTIterator[_NodesT]cdSr?r0rArrs rBnodes_of_classzNodeNG.nodes_of_class  CrD$tuple[type[_NodesT], type[_NodesT2]]&Iterator[_NodesT] | Iterator[_NodesT2]cdSr?r0rs rBrzNodeNG.nodes_of_classs 25rD4tuple[type[_NodesT], type[_NodesT2], type[_NodesT3]];Iterator[_NodesT] | Iterator[_NodesT2] | Iterator[_NodesT3]cdSr?r0rs rBrzNodeNG.nodes_of_classs GJcrDtuple[type[_NodesT], ...]cdSr?r0rs rBrzNodeNG.nodes_of_classrrDtype[_NodesT] | tuple[type[_NodesT], type[_NodesT2]] | tuple[type[_NodesT], type[_NodesT2], type[_NodesT3]] | tuple[type[_NodesT], ...]c#(Kt||r|V|5|D]}|||Ed{VdS|D]/}t||r|||Ed{V0dS)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)rArr child_nodes rBrzNodeNG.nodes_of_classs& dE " " JJJ  "//11 H H %44UJGGGGGGGGGG F++-- D DJ*j11 !00 CC C C C C C C C C D DrDlist[nodes.Assign]cgSr?r0ris rB_assign_nodes_in_scopezNodeNG._assign_nodes_in_scope$s rDc#lK|D]}|Ed{VdSr?)r_get_name_nodes)rArs rBrzNodeNG._get_name_nodes(sR++-- 4 4J!1133 3 3 3 3 3 3 3 3 4 4rDc#KdEd{VdSNr0r0ris rB _get_return_nodes_skip_functionsz'NodeNG._get_return_nodes_skip_functions, rDc#KdEd{VdSrr0ris rB_get_yield_nodes_skip_functionsz&NodeNG._get_yield_nodes_skip_functions/rrDc#KdEd{VdSrr0ris rB_get_yield_nodes_skip_lambdasz$NodeNG._get_yield_nodes_skip_lambdas2rrDcdSr?r0)rArrcs rB _infer_namezNodeNG._infer_name5s rD;Generator[InferenceResult, None, InferenceErrorInfo | None]c &td||)z4We don't know how to resolve a statement by default.z#No inference function for {node!r}.)rrE)r)rArErGs rBrTz NodeNG._infer9s"  1g    rDcDt|S)zGet a list of the inferred values. .. seealso:: :ref:`inference` :returns: The inferred values. :rtype: list )rr^ris rBrQzNodeNG.inferredBsDJJLL!!!rDc|S)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 r0ris rBinstantiate_classzNodeNG.instantiate_classLs  rDcdS)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 Fr0rs rBhas_basezNodeNG.has_baseXs urDcdS)zWhether this node defines something that is callable. :returns: Whether this defines something that is callable. Fr0ris rBcallablezNodeNG.callableas urDcdS)NFr0)rArs rBeqz NodeNG.eqhsurDc0t|S)z.Get the source code that this node represents.rris rB as_stringzNodeNG.as_stringks   &&&rD rrncz tdfd t td fd } td fd }g}  || t d| S)aGet 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 rfrJc Btj|ttz dd}||d|fd|ddDt|dkS)zOutputs a representation of a non-tuple/list, non-node that's contained within an AST, including strings. rJ)rpTrcg|]}|zSr0r0)rbr cur_indents rB z8NodeNG.repr_tree.._repr_tree..sCCC:,CCCrDN)rzr{maxryr|rVextend)rrYdonerdepthr max_widths ` rB _repr_treez$NodeNG.repr_tree.._repr_trees NC C OO ;Q??j  MM%( # # # MMCCCCqrrCCC D D Du::? "rDc|z }|d|sd}n3t|dkr|d||||}n t|dkro|d||||}|s|dn*|d|||d||||p|}n|d|||d d D];}||||||d||<|d ||||d }|d |S) z_Outputs a representation of a sequence that's contained within an AST. [FrJrrlz, rs NrT])rVry) rrYrrrbrokenrrros rB _repr_seqz#NodeNG.repr_tree.._repr_seqs & J MM#    Ta#DGVT:uMMTa#DGVT:uMM.MM$''''MM%(((MM*---#DGVT:uMMWQW d### j)))!#2#Y..EJufdJFFFMM%(((MM*---- 48VT:uEEE MM#   MrDc L||vr?| dt|jdt|zdS|| r| kr|ddS|dz }| z } r<|t|jdt|ddn*|t|jd g} r|d ||j||j r||j|sd}n5t|dkrB||d d t||d ||||}n|d |||ddD]h}|dkr ||d t|||||||d||i||dd t||d||||d}|d|S)z4Outputs a strings representation of an astroid node.z( ()r5r7rrrrNrdocrsT)) rVrwrxraddrr2r1r3ryrh)rrYrrrrvrrr ast_stateidsinclude_linenosro max_depths rB _repr_nodez$NodeNG.repr_tree.._repr_nodest|| Vd4jj.AVVBtHHVVVu HHTNNN UY.. e$$$u QJE & J 9 d!4IIDIIIIJJJJ d!4777888F 8 6777 MM$, - - - MM$. / / / 8 d6777 V!! ooo...#D&),,fdJ d### j)))#CRC[..E~~ MMU+++...JwtU33VT:uUUUMM%(((MM*---- .../// 7444fdJPUVVV MM#   MrD)rfrJ)_singledispatchregisterrXrr'setr}) rAr'r(r&ror)rrr*rYrs `````` @rB repr_treezNodeNG.repr_treeos L  # # # # #  #   U # #   T " "       # " $ # >   V $ $/ / / / / / / / / /  % $/ b 4'''wwvrDctjS)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 )rrW)rArEs rB bool_valuezNodeNG.bool_values $rDcdtj|jjt tSr?)rrLrrxryris rB op_precedencezNodeNG.op_precedence s" !8#m:L:LMMMrDcdS)NTr0ris rBop_left_associativezNodeNG.op_left_associativestrD) r5r6r7r6r8r9r:r6r;r6r<r=r?)rErFrGr r<rH)r<r_)rrr<r_)r<r)r<r9)r<r)rrr<r)rrr<r)r<r)r<r)r<r)r5rr<r)rcr_rr'r<r=).)rrrrr<r)rrrrr<r)rrrrr<r)rrrrr<r)rrrrr<r)r<r)rErFrGr r<r)FFFrrrn)rErF)8rx __module__ __qualname____doc__r,__annotations__r-r.r/r1r2r3r4rCr^rjrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrTrQrrr r r r.r0r2r4r0rDrBr'r';s  $)L((((2  #(K''''1 %I%%%%24O333302M1111:5777777044444     F2677777r    4    $        ####GGGG:>''''''$04000000* # # # #    <<<4<<<:***..._###_# &%%%% * * * *"%    X "%5555X5 "%JJJJXJ "%    X "&DDDDDB_444   26     """   '''' HHHHHT     (NNNrD)8 __future__rrzsysrcollections.abcrr functoolsrrr+typingrr r r r r rrrrastroidrastroid.contextrastroid.exceptionsrrrrrastroid.managerrastroid.nodes.as_stringrastroid.nodes.constrastroid.nodes.utilsrastroid.typingrrr version_infor#typing_extensionsr$ astroid.nodesr%r&r)r*rr'r0rDrBrIs #""""" ////////%%%%%%777777                        ,,,,,,+*****333333------((((((GGGGGGGGGGw&&&&&&*)))))) ')8 , , , 7:X . . . 7:X . . . 4htH~s/B)CC D X X X X X X X X X X rD