s+ QQDt4//QQQQQQrC )re attrnamere rg )allgetattrr@ s `rA
_repr_namezNodeNG._repr_name sT QQQQ> 7 7ED%((EUOi/EN5%@@@KKDQQE1XJE abb
5
5 S9_t 34444 MMU55RWWU^^55 6 6 6 6 sY.44V<<
rC c | }|rd}nd}|t | j || j t | dz S )Nz.<%(cname)s.%(rname)s l.%(lineno)s at 0x%(id)x>z$<%(cname)s l.%(lineno)s at 0x%(id)x>)ru rv r7 id)rl rx ry
fromlinenor )r@ rv r~ s rA __repr__zNodeNG.__repr__ sY !! <EFF;F$ZZ(oT((
rC c v t |d| j j z } || S )z(Visit this node using the given visitor.visit_)rj __class__ry lower)r@ visitorfuncs rA acceptz
NodeNG.accept s5 w4>+B+H+H+J+J JKKtDzzrC Iterator[NodeNG]c # K | j D ]>}t | | }|t |t t f r |E d{V :|V ?dE d{V dS )z$Get the child nodes below this node.Nr0 r1 rj
isinstancerL rY r@ r attrs rA get_childrenzNodeNG.get_children sx ) E4''D|$u
..
rC c | j ddd D ]>}t | | }|st |t t f r
|d c S |c S dS )z1An optimized version of list(get_children())[-1].Nr r s rA
last_childzNodeNG.last_child
sj )$$B$/ E4''D
$u
..
BxKKKtrC c # : K | j }||V |j }|
dS dS )z7Yield parent, grandparent, etc until there are no more.N)r: )r@ r: s rA node_ancestorszNodeNG.node_ancestors s7 LLL]F rC boolc ^ t fd| D S )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.
c 3 K | ]}|u V d S rc r0 )rd r: r@ s rA rf z#NodeNG.parent_of..$ s' FFf46>FFFFFFrC )anyr r@ nodes ` rA parent_ofzNodeNG.parent_of s4 FFFF0C0C0E0EFFFFFFrC .futurer nodes.Statement | nodes.Modulec d S rc r0 r@ r s rA statementzNodeNG.statement& rC
Literal[True]nodes.Statementc d S rc r0 r s rA r zNodeNG.statement* r rC Literal[None, True]c | j rt d| S | j s@|rt | t j dt d t | d | j | S )aP The first parent node, including self, marked as statement node.
TODO: Deprecate the future parameter and only raise StatementMissing and return
nodes.Statement
:raises AttributeError: If self has no parent attribute
:raises StatementMissing: If self has no parent attribute and future is True
r targetzIn astroid 3.0.0 NodeNG.statement() will return either a nodes.Statement or raise a StatementMissing exception. AttributeError will no longer be raised. This behaviour can already be triggered by passing 'future=True' to a statement() call.rn
stacklevel! object has no attribute 'parent'r ) r, r r: r warningswarnDeprecationWarningAttributeErrorr r s rA r zNodeNG.statement. s 1)400 0{ M
4&d3333 MB #
!D!K!K!KLL L{$$F$333rC @nodes.FunctionDef | nodes.Module | nodes.ClassDef | nodes.Lambdac | j @|rt | t j dt d t | d | j | S )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.
Nr zIn astroid 3.0.0 NodeNG.frame() will return either a Frame node, or raise ParentMissingError. AttributeError will no longer be raised. This behaviour can already be triggered by passing 'future=True' to a frame() call.rn r r r )r: r r r r r framer s rA r z NodeNG.frameI s} ;
6(5555 M> #
!D!K!K!KLL L{ ///rC nodes.LocalsDictNodeNGc b | j st | | j S )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 )r: r scoperk s rA r z NodeNG.scopeb s3 { 2$D111 1{ """rC nodes.Modulec F | j r| j S | S )zSReturn the root node of the syntax tree.
:returns: The root node.
)r: rootrk s rA r z NodeNG.rootm s'
; &;##%% % rC c | j D ]?}t | | }||u r|gc S t |t t f r||v r|c S @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 childrenr1 rj r rY rL r reprr@ childr node_or_sequencemsgs rA child_sequencezNodeNG.child_sequencev s ) ( (E &tU 3 3 5((()))) +eT];;
( ---''''23$u++tDzz!::;;;rC c | j D ]B}t | | }||u r||fc S t |t t f r
||v r||fc S Cd}t |t
| t
| fz )a Find 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.
r r r s rA locate_childzNodeNG.locate_child s ) / /E &tU 3 3 ((( e|###+eT];;
/ --- .....23$u++tDzz!::;;;rC c 4 | j S )z|The next sibling statement node.
:returns: The next sibling statement node.
:rtype: NodeNG or None
)r: next_siblingrk s rA r zNodeNG.next_sibling s {'')))rC c 4 | j S )zThe previous sibling statement.
:returns: The previous sibling statement node.
:rtype: NodeNG or None
)r: previous_siblingrk s rA r zNodeNG.previous_sibling s {++---rC c F | j | S | j S )zz8NodeNG.repr_tree.._repr_tree.. s CCC:,CCCrC N)rz r{ maxrN r| rW extend)r r^ doner depthr max_widths ` rA
_repr_treez$NodeNG.repr_tree.._repr_tree s
NC C
OO ;Q ? ? j
MM%( # # # MMCCCCqrrCCC D D Du::? "rC c |z
}| d | sd}n3t | dk r | d |||| }n t | dk ro | d |||| }|s| d n*| 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.
[FrI r rn z, rt
Nr T])rW rN ) r r^ r r r brokenr r rp s rA _repr_seqz#NodeNG.repr_tree.._repr_seq s
& J MM#
Ta #DGVT:uMMTa #DGVT:uMM .MM$''''MM%(((MM*---#DGVT:uMMWQW
d###
j))) !#2#Y . .E JufdJFFFMM%(((MM*----
48VT:uEEE MM# MrC c L | |v r?| dt | j dt | z dS | |
r |
k r| d dS |dz
}| z
}
r<| t | j dt | dd n*| t | j d g } r| d
| | j | | j r| | j |sd}n5t | dk rB| |d d t | |d |||| }n| d
| | |dd D ]h}|dk r | | d t | | |||| | d | | i| |d d t | |d |||| d}| d |S )z4Outputs a strings representation of an astroid node.z(
()r7 r9 r rs r Nr docrt T)) rW rx ry r addr r2 r1 r3 rN rj )r r^ r r r rw r r r ast_stateidsinclude_linenosrp max_depths rA
_repr_nodez$NodeNG.repr_tree.._repr_node s t||
Vd4jj.A V VBtHH V VV u HHTNNN
UY . .
e$$$ u QJE & J
9
d!4 I ID I I I IJJJJ
d!4 7 7 7888F
8
6777 MM$, - - - MM$. / / /
8
d 6777
V!!
ooo...#D&),,fdJ
d###
j))) #CRC[ . .E ~~ MMU+++... JwtU 3 3VT:uUUUMM%(((MM*----
. . .///
7444fdJPUVVV MM# MrC )rh rI )_singledispatchregisterrY rL r' setr} ) r@ r$ r% r# rp r& r r r' r^ r s `````` @rA repr_treezNodeNG.repr_tree s
L
# # # # #
#
U # # T " "
# "
$ # >
V $ $/ / / / / / / / / /
% $/ b
4'''wwv rC c t j S )ak Determine 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
)r rX )r@ rD s rA
bool_valuezNodeNG.bool_value s
$ rC c d t j | j j t t S rc )r rK r ry rN rk s rA
op_precedencezNodeNG.op_precedence( s" !8#m:L:LMMMrC c dS )NTr0 rk s rA op_left_associativezNodeNG.op_left_associative, s trC )NNN) r7 r8 r9 r8 r: r; r5 r8 r6 r8 r< r= rc )rD rE rF r r< rG )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< r8 )re 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 )r r r r r< r )rD rE rF r r< r )FFFr r ro )rD rE )r< r )9ry
__module__ __qualname____doc__r, __annotations__r- r. r/ r1 r2 r3 r4 rB r_ rl r r r r r r r r r r r r r r r r r$ r r r r r r r cachedr r r r r rO rS r r r r r
r+ r- r/ r1 r0 rC rA r' r' ; s]
$)L((((2 #(K''''1 %I%%%% 24O3333 02M1111:5777777*..... "!% $ - "&%)- - - - - - ` 268 8 8 8 8t
4
# # # #G G G G *- X X 044 4 4 4 4 48 040 0 0 0 0 02 # # # # < < <4< < <:* * *. . . _ # # # _ # $
%
%
% * * * * "% X "% X "% X "% X "& D D D D DB 4 4 4
26
" " "
' ' ' '
H H H H H T (N N N rC )8
__future__r rz sysr collections.abcr r functoolsr r( typingr r r r
r r r
r r astroidr r astroid.contextr astroid.exceptionsr r r r r astroid.managerr astroid.nodes.as_stringr astroid.nodes.constr astroid.nodes.utilsr astroid.typingr r r r version_infor# typing_extensionsr$ astroid.decoratorsr% r& r) r* r r' r0 rC rA rG s
# " " " " "
/ / / / / / / / 7 7 7 7 7 7
% $ $ $ $ $ $ $ , , , , , , + * * * * * 3 3 3 3 3 3 - - - - - - ( ( ( ( ( ( G G G G G G G G G G v ))))))v )))))))DDDDDD ')8
,
,
, 7:X . . . 7:X . . .
4h tH~s/B)CC
D
s s s s s s s s s s rC