PwX d Z ddlmZ ddlZddlZddlZddlZddlZddlZddl Z ddl
m Z ddl m
Z
mZ ddlmZmZ ddlmZ ddlmZmZmZmZ ddlZddlZdd lmZm Z m Z dd
l m Z dd l m!Z! dd l"m#Z# dd
l$m%Z%m&Z& er ddlm'Z' ddl(m)Z) ede j* Z+ edd Z,ee,e+gdf Z-e j. e j/ e j0 e j1 fZ2dZ3ddhZ4h dZ5 e6h d Z7 e6h d Z8dZ9dZ:d Z;d Zd Z?d!Z@d"ZAd#d$d%d&d'd(d)d*ZBd+ eBC D ZD eEeD ZF e6d, ZGh d-ZH e6h d. ZI G d/ d0eJ ZK G d1 d2eJ ZLd&d7ZMd'd9ZNd&d:ZOd(d<ZPejQ R Zd=ZSd&d>ZTd)dAZUd*dEZVd+dGZWd,dIZXd-d.dJZYd&dKZZd/dNZ[d&dOZ\d0dPZ]d1dRZ^d2dUZ_d2dVZ` G dW dXeJ Za G dY dZeJ Zbd3d]Zcd4d_Zdd5daZed6dcZfd7deZgd8dgZhd9djZid:dlZj d;ddzZmd(d{Znd?d}Zod&d~Zpd&dZqd&dZrd@dZsdAdZtdBdZu ed d-dCd ZvdDdZwdDdZxd&dZydEdZzeJfdFdZ{dGdZ|eJfdHdZ}eJfdIdZ~dJdZeJfdKdZdLdZdMdZd&dZdNdZdNdZdNdZdNdZdNdZdNdZdNdZd)dZd&dZdOdZdPdQdZdNdZdNdZdRdZdSdZdSdZdTdZ ed d-dddUdĄ Z edŬ d-dVdDŽ Z d-dWdɄZd&dʄZdXd̄Zd(d̈́ZdYdτZd(dЄZdZd҄Zd&dӄZd[dԄZd&dՄZd\dZ ed d&dل Zd]dۄZd^d܄Z d-d_d݄ZdLdބZd`dZdLdZdadZdbdZdcdZdddZdedZdedZd&dZd&dZdfdZdfdZd(dZdgdZdgdZdgdZd&dZd&dZdhdZdidZd&dZdjdZ e dkd Zdld ZdmdZd&dZdndZdodZdpdZÐd&dZĐdqd ZŐdrd ZƐdsd Zǐdtd ZȐdud#Zɐdvd%ZdS (w z7Some functions that may be useful for various checkers. ) annotationsN)deque)IterableIterator) lru_cachepartial)Match)
TYPE_CHECKINGAnyCallableTypeVar)TooManyLevelsErrornodesutil)InferenceContext) AstroidError)
ImportNode)InferenceResultSuccessfulInferenceResult)_lru_cache_wrapper) BaseChecker_NodeT)bound _CheckerTr builtinsabc_py_abc> abc.abstractmethodabc.abstractpropertyabc.abstractclassmethodabc.abstractstaticmethod> .Protocoltyping.Protocoltyping_extensions.Protocol> *&+^|__iter__ __aiter____next__ __getitem____class_getitem__ __setitem__ __delitem__ __contains__keys)__new____init____call____init_subclass__)$__del____repr____str__ __bytes____hash____bool____dir____len____length_hint__r* __reversed____neg____pos____abs__
__invert__ __complex____int__ __float__ __index__ __trunc__ __floor____ceil__ __enter__
__aenter____getnewargs_ex____getnewargs__ __getstate__
__reduce____copy__ __unicode__ __nonzero__ __await__r+ __anext__
__fspath____subclasses__)>
__format____lt____le____eq____ne____gt____ge__ __getattr____getattribute__ __delattr__
__delete____instancecheck____subclasscheck__r- __missing__r0 r1 __add____sub____mul__ __truediv__ __floordiv__
__rfloordiv____mod__
__divmod__
__lshift__
__rshift____and____xor____or____radd____rsub____rmul__ __rtruediv____rmod__ __rdivmod____rpow__ __rlshift__ __rrshift____rand____rxor____ror____iadd____isub____imul__ __itruediv__
__ifloordiv____imod__ __ilshift__ __irshift____iand____ixor____ior____ipow__ __setstate__
__reduce_ex__ __deepcopy____cmp__
__matmul__ __rmatmul__ __imatmul____div__) __setattr____get____set__r/ __set_name__)__exit__ __aexit__) __round__)__pow__)Nr )r r )r r c $ i | ]
\ }}|D ]}||S r ).0paramsmethodsnames g/builddir/build/BUILD/cloudlinux-venv-1.0.10/venv/lib/python3.11/site-packages/pylint/checkers/utils.py
r sE
& )&zbuiltins.tuplez
builtins.listz
builtins.dictz builtins.setzbuiltins.frozensetz
builtins.typezcollections.dequezcollections.defaultdictzcollections.OrderedDictzcollections.Counterzcollections.ChainMapz_collections_abc.Awaitablez_collections_abc.Coroutinez _collections_abc.AsyncIterablez _collections_abc.AsyncIteratorz _collections_abc.AsyncGeneratorz_collections_abc.Iterablez_collections_abc.Iteratorz_collections_abc.Generatorz_collections_abc.Reversiblez_collections_abc.Containerz_collections_abc.Collectionz_collections_abc.Callablez_collections_abc.Setz_collections_abc.MutableSetz_collections_abc.Mappingz _collections_abc.MutableMappingz_collections_abc.Sequencez _collections_abc.MutableSequencez_collections_abc.ByteStringz _collections_abc.MappingViewz_collections_abc.KeysViewz_collections_abc.ItemsViewz_collections_abc.ValuesViewz!contextlib.AbstractContextManagerz&contextlib.AbstractAsyncContextManagerz
re.Patternzre.Match> FNT> nt._exitsys.exit posix._exit_sitebuiltins.Quitterc e Zd ZdS )NoSuchArgumentErrorN__name__
__module__ __qualname__r r r r r Dr r c e Zd ZdS )InferredTypeErrorNr r r r r r r r r node nodes.NodeNGreturnboolc t j dt d t d | D S )z1Return whether the given node is inside a lambda.zutils.is_inside_lambda will be removed in favour of calling utils.get_node_first_ancestor_of_type(x, nodes.Lambda) in pylint 3.0r
stacklevelc 3 J K | ] }t |t j V d S N)
isinstancer Lambda)r parents r z#is_inside_lambda.. s. TTFz&%,//TTTTTTr )warningswarnDeprecationWarninganynode_ancestorsr s r is_inside_lambdar sR M O TTd>Q>Q>S>STTT T TTr Iterable[nodes.NodeNG]c # K t | t j t j f r!| j D ]}t | E d{V dS | V dS )z9Recursively returns all atoms in nested lists and tuples.N)r r TupleListeltsget_all_elements)r childs r r r sp $ej122 Y / /E'.. . . . . . . . . / /
r c n t | dd dk r | j dk rdS dS )zDReturn True if the node is referencing the "super" builtin function.r Nsuperr TF)getattrrootr r s r is_superr s8 tVT""g--$))++2Bj2P2Pt 5r nodes.FunctionDefc | t | j dk o$t | j d t j S )z@Return true if the given function node only raises an exception.r r )lenbodyr r Raiser s r is_errorr s, ty>>Q H:dilEK#H#HHr ) __builtins__c @ | o | j dk S )zHReturns True if the given node is an object from the __builtin__ module.r )r r r s r is_builtin_objectr " s 2DIIKK$
22r r strc & | t v p| t v S )zIReturn true if could be considered as a builtin defined by python.)r SPECIAL_BUILTINS)r s r
is_builtinr ' s 8 7t'7 77r var_nodevarnamescopec ( t | || d uS r )defnode_in_scope)r r r s r is_defined_in_scoper , s
Hgu 5 5T AAr nodes.NodeNG | Nonec t |t j r|j D ]x}t |t j r
||j v r|c S t |t j r5|j D ]-}t |t j r|j |k r|c c S .ynt |t t j f r3| t j D ]}|j |k r|c S nvt |t j
rQ|j D ]G\ }}| | r n,|r)t |t j r|j |k r|c S Hn t |t j t j f r|j | rf|j | rJ |j | |j }t- | || }|S # t. j $ r Y nw xY w|S t3 |dd |k r|S nMt |t j r3t |j t j r|j }|j |k r|S d S )Nr )r r Ifr NonlocalnamesAssigntargets
AssignNamer COMP_NODE_TYPESFornodes_of_classWithitems parent_ofr FunctionDefargs is_argument
default_valuer r astroid NoDefaultr
ExceptHandler) r r r r targetass_nodeexpridsdefnodes r r r 5 s
%"" ' J & &D$//
Gtz4I4I $ --
& "l & &F!&%*:;; & w@V@V %
&
EOUY7 8 8 ,,U-=>> H}'' (
E5: & & ID#~~h''
z#u'788
SX=P=P
EEL%*;< = = : ! !' * *
z##H--
##J,,W555 !LE .x% H HG #N ( D L 5&$ ' '7 2 2L 3 E5. / / ej%"2 3 3 zH}'' 4s 72G+ +G=<G=
nodes.Namec H | j }| D ]1}t | || }|| }t |t
t j fz rRt |t j r5| }||ur t |t j r dS dS |j | j k r dS | D ]i}|j | j k rt |t j
t j t j t j
t j t j f r dS j3| d }| }|j } |r|j | k r| t j D ]}
|
j |k r dS | t j t j f D ]} |d | j D v r dS | }|r |j | k dS )aR Check if the given variable node is defined before.
Verify that the variable node is defined by a parent node
(e.g. if or with) earlier than `var_node`, or is defined by a
(list, set, dict, or generator comprehension, lambda)
or in a previous sibling node on the same line
(statement_defining ; statement_using).
NFTfuturec . g | ]}|d p|d S )r r r )r r s r
z%is_defined_before.. s% III$47-d1gIIIr )r r r r r r r r r linenor Whiler TryExcept
TryFinallyr statementprevious_sibling
fromlinenor r
ImportFromImportr ) r r r r
defnode_scopevar_node_scope defnode_ancstmt_noder assign_nodeimp_nodes r is_defined_beforer e sP mG))++ "8Wf== ?
m_ %F G G -):;;
!!) !1!1! 66:"E$5< <6 !5544 >HO + +44"1133 K!X_44IKJO$'
ttt
T * *D ! ! # #E
_F
)E$.. //0@AA K 7**tt + ,,e.> -MNN HII(.IIIIItt J&&(( )E$.. 5r c |s }t |t j t j f rNt j |j j d |j j D }t fd|D S dS )zcReturn true if the given Name node is used in function or lambda
default argument's value.
c 3 K | ]}||V d S r r )r ds r r z&is_default_argument.. s" !U!Uq}!}}}}!U!Ur c 3 d K | ]*}| t j D ]}|u V +d S r r r Name)r default_nodedefault_name_noder s r r z&is_default_argument.. sc
%1%@%@%L%L
"
%
r F) r r r r r itertoolschainr defaults kw_defaultsr )r r all_defaultss ` r is_default_argumentr& s
%%+U\:;;
J !U!UUZ-C!U!U!U
,
5r c | D ]Y}t |t j r dS |j s1t |t j t j t j f r nZdS )z6Return true if the name is used in function decorator.TF)r r r
Decorators is_statementr ComprehensionScopeListCompr r s r is_func_decoratorr- s %%'' fe . / / 44 * (
#
#
E 5r framenodes.ClassDefc | t | t j sdS t fd| j D S )zkReturn whether `frame` is an astroid.Class node with `node` in the
subtree of its bases attribute.
Fc 3 Z K | ]%}| t j v V &d S r r )r baser s r r z#is_ancestor_name.. s8 OO4tt**5:666OOOOOOr )r r ClassDefr bases)r. r s `r is_ancestor_namer5 sC eU^ , , u OOOO5;OOO O OOr c \ t | j t j o
| j j | u S )z@Return True if node is the function being called in a Call node.)r r r Callfuncr s r is_being_calledr9 s% dk5: . . K4;3Ct3KKr c | rkt | t j t j t j f r:| j } | r1t | t j t j t j f :| S )zHReturn the higher parent which is not an AssignName, Tuple or List node.)r r r r r r r s r
assign_parentr; s^
:dU%5u{EJ$OPP { :dU%5u{EJ$OPP Kr
class_nodec | D ]5}|j dk r||v r#t || t j r dS 6dS )zjReturn True if is a method overridden from an ancestor
which is not the base object class.
objectTF) ancestorsr r r r )r< r ancestors r overrides_a_methodrA s] ((** =H $ $ 8
8D>5;L M M 44 5r messagesVCallable[[AstCallbackMethod[_CheckerT, _NodeT]], AstCallbackMethod[_CheckerT, _NodeT]]c d fd }|S )a Decorator to store messages that are handled by a checker method as an
attribute of the function object.
This information is used by ``ASTWalker`` to decide whether to call the decorated
method or not. If none of the messages is enabled, the method will be skipped.
Therefore, the list of messages must be well maintained at all times!
This decorator only has an effect on ``visit_*`` and ``leave_*`` methods
of a class inheriting from ``BaseChecker``.
r8 $AstCallbackMethod[_CheckerT, _NodeT]r c | _ | S r ) checks_msgs)r8 rB s r store_messagesz2only_required_for_messages..store_messages s $ r )r8 rE r rE r )rB rH s ` r only_required_for_messagesrI s) r c L t j dt d t | S )zKept for backwards compatibility, deprecated.
Use only_required_for_messages instead, which conveys the intent of the decorator much clearer.
zhutils.check_messages will be removed in favour of calling utils.only_required_for_messages in pylint 3.0r r )r r r rI )rB s r check_messagesrK s5
M 9 &x 00r c e Zd ZdZdS )IncompleteFormatStringz:A format string ended in the middle of a format specifier.N)r r r __doc__r r r rM rM s DDDDr rM c $ e Zd ZdZd fd Z xZS )UnsupportedFormatCharacterz]A format character in a format string is not one of the supported
format characters.
indexintr Nonec X t | || _ d S r )r r4 rQ )selfrQ __class__s r r4 z#UnsupportedFormatCharacter.__init__ s&
r )rQ rR r rS )r r r rN r4
__classcell__)rV s @r rP rP sG r rP
format_string/tuple[set[str], int, dict[str, str], list[str]]c t }i }g }d}d fd }d}|t k r | }|dk r~ || \ }}d}|d k rRd
} || \ }}|}
| dk r+|d k r| d
z
} n |d k r| d
z } || \ }}| dk +|d
z
} |
| }|d v r || \ }}|d v |d
k r|d
z
} || \ }}n*|t j v r || \ }}|t j v |dk rR || \ }}|d
k r|d
z
} || \ }}n*|t j v r || \ }}|t j v |dv r || \ }}d} || vrt | |r| | |||< n |dk r|d
z
}| | |d
z
}|t k ||||fS )a) Parses a format string, returning a tuple (keys, num_args).
Where 'keys' is the set of mapping keys in the format string, and 'num_args' is the number
of arguments required by the format string. Raises IncompleteFormatString or
UnsupportedFormatCharacter if a parse error occurs.
r irR r tuple[int, str]c V | dz
} | t k rt | | fS )Nr )r rM )r[ rX s r next_charz&parse_format_string..next_char+ s5 Q M"" " "( (=#$$r %N(r )z#0- +r% .hlLzdiouxXeEfFgGcrs%a)r[ rR r r\ )setr stringdigitsrP addappend)
rX r2 key_types pos_typesnum_argsr^ r[ charkeydepth key_startkey_endflagss
` r parse_format_stringrr s 55DIIH% % % % % %
A
c-
Q 3;; illGAtCs{{#)A,,4 qjjs{{
'illGAt qjj a%#Ig$56 '//#)A,,4 '// s{{A
#)A,,44fm++ 'illGAt fm++ s{{#)A,,43;; MH 'illGAtt &-//"+)A,,4 &-// u}}#)A,,4'E5 0333
'
!% #A
&&& Qg c-
h 9i //r &tuple[str, Iterable[tuple[bool, str]]]c n t j | S # t $ r}t |d }~ww xY wr )_stringformatter_field_name_split
ValueErrorrM )rX es r split_format_field_namesry i sE .1-@@@ . . .$&&A-.s
4/4Iterable[str | None]c # K t j } | | }|D ]O}t d |dd D r$|d }|d }|V |rt | E d{V PdS # t
$ rC}|j d d rdV dV Y d}~dS t | |d}~ww xY w) zyGiven a format string, return an iterator
of all the valid format fields.
It handles nested fields as well.
c 3 K | ]}|d u V d S r r )r items r r z(collect_string_fields..} s& 77D44<777777r r Nr r zcannot switch from manual 1) re Formatterparseallcollect_string_fieldsrw r
startswithrM )rX formatter
parseiteratorresultr nestedexcs r r r r s" ""I=!
66
# 9 9F77F122J77777
!9DAYFJJJ
90888888888 9 9 = = = 8A; ! !"= > > HHHIII FFFFF$]33< =s A'B
C
(C8CC
9tuple[list[tuple[str, list[tuple[bool, str]]]], int, int]c 2 g }d}t }t | D ]}|rDt | r#| t | H|rt | \ }}t
|t j r"| t | | |t | f # t $ r}t |d}~ww xY w|dz
}||t | fS )ag Parses a PEP 3101 format string, returning a tuple of
(keyword_arguments, implicit_pos_args_cnt, explicit_pos_args).
keyword_arguments is the set of mapping keys in the format string, implicit_pos_args_cnt
is the number of arguments required by the format string and
explicit_pos_args is the number of arguments passed with the position.
r Nr )rd r r isdigitrg ry r numbersNumberrh listrw rM r )rX keyword_argumentsimplicit_pos_args_cntexplicit_pos_argsr keyname
fielditeratorrx s r parse_format_method_stringr s4 %m44 ' ' 'CII%%'' ' ! !#d)) , , , ,
'%=d%C%C "G]'7>22
4!%%c'll333
6!(('4
3F3F)GHHHH
6
6
6,..A5
6
"Q & ! ! 3S9J5K5K KKs ;$C
C>*C99C>attrnamec | | d dk o0| dk o*| d o| d S )zkReturn True if attribute name is protected (start with _ and some other
details), False otherwise.
r ___)r endswith)r s r is_attr_protectedr sO
s H O H$$T**Fx/@/@/F/F Gr nodes.ClassDef | Nonec p | d }t j t j t j f}|rzt
|| rjt
|t j sP|j dS |j d }|r*t
|| rt
|t j P|S )zReturn the class that is wrapping the given node.
The function returns a class for a method node (or a staticmethod or a
classmethod), otherwise it returns `None`.
Tr N) r. r NodeNGr
UnboundMethod BaseInstancer r3 r )r klassnodes_to_checks r node_frame_classr s
JJdJ # #E
N 0 un - -0 5%.110
< 4 ""$"// 0 un - -0 5%.110 Lr astroid.ClassDefastroid.ClassDef | Nonec t | j d }t |t j r|ndS )zFReturn the class that is the outer class of given (nested) class_node.Tr N)r r. r r r3 )r< parent_klasss r get_outer_classr s7 $**$*77L%lG4DEE O<<4Or Match[str] | Nonec T t j d }| | S )zrCheck that attribute name is private (at least two leading underscores,
at most one trailing underscore).
z^_{2,10}.*[^_]+_?$)recompilematch)r regexs r is_attr_privater s&
J+ , ,E ;;x r call_node
nodes.Callposition
int | Nonekeyword
str | Nonec ||t d | | j | S # t $ r Y nw xY w|r%| j r | j D ]}|j |k r |j c S t )a Returns the specified argument from a function call.
:param nodes.Call call_node: Node representing a function call to check.
:param int position: position of the argument.
:param str keyword: the keyword of the argument.
:returns: The node representing the argument, None if the argument is not found.
:rtype: nodes.Name
:raises ValueError: if both position and keyword are None.
:raises NoSuchArgumentError: if no argument at the provided position or with
the provided keyword.
Nz2Must specify at least one of: position or keyword.)rw r
IndexErrorkeywordsargvaluer )r r r r s r get_argument_from_callr s GOMNNN >(+ + D !9% ! % ! !Cw'!!y " s $
11 nodes.NodeNG | astroid.Instancec t | d r| ng }t d t j | g| D S )zQReturn whether the given class node is subclass of
exceptions.Exception.
r? c 3 l K | ]/}|j d v o!| j t k V 0dS )> Exception
BaseExceptionN)r r EXCEPTIONS_MODULE)r r@ s r r z&inherit_from_std_ex.. sY
77 6 MMOO $5 5 r )hasattrr? r r! r" )r r? s r inherit_from_std_exr se %,D+$>$>F BI " :: r handlernodes.ExceptHandler
error_type9str | type[Exception] | tuple[str | type[Exception], ...]c ddt |t s|f}fd|D }| j sdS | | S ) am Check if the given exception handler catches
the given error_type.
The *handler* parameter is a node, representing an ExceptHandler node.
The *error_type* can be an exception, such as AttributeError,
the name of an exception, or it can be a tuple of errors.
The function will return True if the handler catches any of the
given errors.
errorstr | type[Exception]r r c > t | t s| j S | S r )r r r )r s r stringify_errorz&error_of_type..stringify_error s! %%% "> ! r c & h | ]
} | S r r )r r r s r z error_of_type..# s# FFF%u--FFFr F)r r r r )r tupletypecatch)r r expected_errorsr s @r
error_of_typer sl
j% ( ( # ]
FFFF:FFFO < u == ) ))r c | j sdS | j j D ]*} t | r dS # t j $ r Y 'w xY wdS )z?Detect if the given function node is decorated with a property.FT)
decoratorsr _is_property_decoratorr InferenceError)r decorators r decorated_with_propertyr ) sn ? u_* %i00
tt
% D 5s ,>>kindsc t | t j t j f sdS | j r5| j j D ](}t |t j r |j |v r dS )dS )NFT)r r r r r r Attributer )r r r s r _is_property_kindr 6 sq dW 2E4E F G G u . I)U_55
):LPU:U:Utt 5r c " t | d S )z-Check if the given node is a property setter.setterr r s r is_property_setterr @ s T8 , ,,r c " t | d S )z.Check if the given node is a property deleter.deleterr r s r is_property_deleterr E s T9 - --r c $ t | dd S )zACheck if the given node is either a property setter or a deleter.r r r r s r is_property_setter_or_deleterr J s T8Y 7 77r r c | D ]i}t |t j r]| dv r dS | D ].}|j dk r!| j dk r dS /zt |t j rt |
}t | dk rt |d j t j
t j f rpt |d j }|rTt |t j j r5t |j t j rt) |j c S kdS )N> builtins.propertyfunctools.cached_propertyTpropertyr r r F)inferr r r3 qnamer? r r r r _get_return_nodes_skip_functionsr r r r
safe_inferr objectsPropertyfunctionr )r inferredr@ returnss r r r O s{ OO%% F F h / / F~~ #UUUtt $ . . 0 0
=J..8==??3G:3U3U 444
%"3
4
4 F +/99;;+ +G 7||q Z
5:u"?& & &gaj&677 F"8W_-EFFF #8#4e6GHHF
383DEEEEE 5r r8 Pnodes.ClassDef | nodes.FunctionDef | astroid.BoundMethod | astroid.UnboundMethodqnames
Iterable[str]c
| j r | j j ng }|D ]i}t |t j r|j } t fd| D r dS U# t j $ r Y fw xY wdS )zMDetermine if the `func` node has a decorator with the qualified name `qname`.c 3 K | ]?}|t |t j |j v p| v V @d S r )r r UninferableBaser r )r r[ r s r r z!decorated_with..w s[ =At7K)L)L= & 7AGGII$7 === r TF) r r r r7 r8 r r r r )r8 r r decorator_nodes ` r decorated_withr j s +//A &&rJ$ nej 1 1 1 + 0N '--//
tt
% H 5s -A..B ?B nodes.Decorators)list[nodes.Attribute | nodes.Name | None]c g }t | dg D ]v}d}t |t j rnt |j }t |t j r?| dk r'|j |j j \ }}n7t |t j
r | |j \ }}|s|d }t |t j t j
f st |j }d|v o
|j dk }d|v ot |dd dk } |s| r@t | }|t |t" j r| | x|S )a Return a list of uninferable `typing.final` decorators in `node`.
This function is used to determine if the `typing.final` decorator is used
with an unsupported Python version; the decorator cannot be inferred when
using a Python version lower than 3.8.
r Ntypingr finalr )r r r r r r Moduler lookupr r r r r dictr modnamer r rh )
r r r import_nodesr r import_node import_namesis_from_import is_imports
r uninferable_final_decoratorsr
s J T7B// $- $- FJ i 1 1 ?!).11H(EL11
Mhnn6F6F(6R6R"+."7"7 8K"L"L< 5:
.
. ? ' . .y~ > >OA|
"1o +8J'KLL K -.. "\1V{7Jh7V - 7 z44
4
4 -Y -!),,H :h8L#M#M !!),,, r i )maxsizeis_abstract_cb dict[str, nodes.FunctionDef]c N |t t t }i } t | }n# t
j $ r i cY S w xY w|D ]}| D ]}|}t |t j
rNt | }|s|j |v r||j = At |t j
s|j |v r||j = t |t j
r+ || }|r |||j < |s|j |v r||j = |S )aX Get the unimplemented abstract methods for the given *node*.
A method can be considered abstract if the callback *is_abstract_cb*
returns a ``True`` value. The check defaults to verifying that
a method is decorated with abstract methods.
It will return a dictionary of abstract method
names and their inferred objects.
N)r )r r ABC_METHODSreversedmror ResolveErrorvaluesr r r r r r )r r visitedr r@ objr abstracts r unimplemented_abstract_methodsr sk DDD,.Gtxxzz"" * *??$$ * *CH#u /00
.%c??
x7** #CH - !(E,=>> .x7** #CH -(E$566
* *>(33 *(0GCH%%! *ch'&9&9 )9 *: Ns !A AA,nodes.ExceptHandler | nodes.TryExcept | Nonec | }t j t j f}|r3t |j | s |j }|rt |j | |r t |j | r|j S dS )zDReturn the ExceptHandler or the TryExcept node in which the node is.N)r r r
r r )r currentignoress r find_try_except_wrapper_noder s G"EO4G
!*W^W== !. !*W^W== ! :gng66 ~ 4r c | D ]B}t |t j j r dS t |t
j r|c S CdS )zJReturn the ExceptHandler in which the node is, without going out of scope.N)r r r scoped_nodesLocalsDictNodeNGr r )r r s r !find_except_wrapper_node_in_scoper sh &&(( gw 3 D E E
44 gu 2 3 3 NNN 4r c j t | }|sdS t |t j r|j j }|j j }n5t j d |j D }|j }t d |D }t |t t f }|p|S )z8Check if the given node is from a fallback import block.Fc 3 $ K | ] }|j V d S r )r )r r s r r z)is_from_fallback_block.. s5 3
3
$GL3
3
3
3
3
3
r c 3 b K | ]*}t |t j t j f V +d S r )r r r r )r r s r r z)is_from_fallback_block.. sJ ;!15< @AA r )r r r r r r handlersr! r"
from_iterabler #_except_handlers_ignores_exceptions ImportErrorModuleNotFoundError)r context
other_bodyr$ has_fallback_importsignores_import_errors r is_from_fallback_blockr- s *400G u'5.// $ ^(
>* _22 3
3
(/(83
3
3
# % ?; 34 7#77r r$
exceptions3tuple[type[ImportError], type[ModuleNotFoundError]]c f t t | t fd| D S )N)r c 3 . K | ]} | V d S r r )r r r8 s r r z6_except_handlers_ignores_exceptions..% s+ 55ttG}}555555r )r r r )r$ r. r8 s @r r& r& s: =Z 8 8 8D 5555H555 5 55r exceptiontype[Exception] | str list[nodes.ExceptHandler] | Nonec t | }t |t j rfd|j D S g S )aZ Return the collections of handlers handling the exception in arguments.
Args:
node (nodes.NodeNG): A node that is potentially wrapped in a try except.
exception (builtin.Exception or str): exception or name of the exception.
Returns:
list: the collection of handlers that are handling the exception or None.
c 4 g | ]}t | |S r )r )r r r2 s r r z*get_exception_handlers..6 s8
}Wi7X7X
r )r r r r
r$ )r r2 r) s ` r get_exception_handlersr7 ( s[ +400G'5?++
#*#3
Ir Iterator[nodes.With]c # t K | D ] }t |t j r|V !dS )zFGet all contextlib.with statements in the ancestors of the given node.N)r r r r )r with_nodes r get_contextlib_with_statementsr; < sI ((** i , , OOO r callc z t |t s|j }| j D ]}t | }t |t
j r|j |k r dS :t |t
j rB|j D ]:}t | }t |t
j r|j |k r dS ;dS )z7Check if the given node suppresses the given exception.TF)
r r r r r r r3 r r r )r< r2 r r elt inferred_elts r _suppresses_exceptionr@ C s i % % ' & y c?? h / /
} ))tt *
%+
.
. }
)# |U^<< $)Y66 444 5r c # 0 K t | D ]}|j D ]y\ }}t |t j rZt |j }t |t j r,| dk rt || r|V zdS )a> Return the contextlib suppressors handling the exception.
Args:
node (nodes.NodeNG): A node that is potentially wrapped in a contextlib.suppress.
exception (builtin.Exception): exception or name of the exception.
Yields:
nodes.With: A with node that is suppressing the exception.
zcontextlib.suppressN)
r; r r r r7 r r8 r3 r r@ )r r2 r: r} r r s r get_contextlib_suppressorsrB Y s 4D99 ( ( ( (GD!$
++
(%di00 x 88( ((,AAA,T9== ( ' ( ( (r nodes.Raisec T t | }t |t j S )a
Check if the node is directly under a Try/Except statement
(but not under an ExceptHandler!).
Args:
node (nodes.Raise): the node raising the exception.
Returns:
bool: True if the node is inside a try/except statement, False otherwise.
)r r r r
)r r) s r is_node_inside_try_exceptrE q s# +400G gu / //r c d t | | }|rdS t t | | S )zCheck if the node is in a TryExcept which handles the given exception.
If the exception is not given, the function is going to look for bare
excepts.
T)r7 r rB )r r2 managing_handlerss r node_ignores_exceptionrH s: /tY?? t )$ :: ; ;;r c t | rdS | }|-|j dk r"| j t v rdS | D ]0}|j dk r#| j t v r dS 1| D ]8}|j d | u r| d r dS 9dS )zWReturn true if the given class node should be considered as an abstract
class.
TNABCMetaABCr F)pass_is_abstract)
is_protocol_classdeclared_metaclassr r ABC_MODULESr? r r r. is_abstract)r metar@ methods r class_is_abstractrS s
t " " $ $D 9 ! !diikk&6+&E&E4NN$$ =E ! !hmmoo&:k&I&I44,,.. = d + +t 3 3!!5!99
tt 5r r attrc | | }n# t j $ r Y dS w xY w|d }t |t j rt
|t j t j f }|dS t |j t j
r%t d |j j D rdS t |j t j
rdS dS )NFr Tc 3 J K | ] }t |t j V d S r )r r Const)r ns r r z,_supports_protocol_method.. s. UU!:a--UUUUUUr )r r
NotFoundErrorr r r get_node_first_ancestor_of_typer NamedExprr
BaseContainerr r rW )r rT
attributesfirstthis_assign_parents r _supports_protocol_methodr` s ]]4((
uu
qME %)** < EL%/2
%4 (.0C D D UU7I7O7TUUUUU
u (. < < 5 4s ++c ~ t j t j t j t j f}t | | S r )r r+ SetCompDictComp GeneratorExpr )r comprehensionss r is_comprehensionrf s0
N dN + ++r c V t | t ot | t S r )r` GETITEM_METHOD KEYS_METHODr s r _supports_mapping_protocolrk s+ $
~ 8
#E;
7
78r c , t | t S r )r` CONTAINS_METHODrj s r "_supports_membership_test_protocolrn s $UO < < t | t j r4t | sdS | }|
|| rdS t | t
j r4t | sdS | rdS || rdS t | t j rdS t | t
j j
rEt | j t
j r&t | j r| j } || S dS NTF) r r r3 has_known_bases metaclassr r has_dynamic_getattrr* r4 Proxy_proxied)r r rQ s r _supports_protocolr s2 % (( u%% 4 &&
t%-.. u%% 4 $ $ & & 4 U # # 4%122 t 5'--..( u~w'; < <(
EN + +(
''' 5r F check_asyncc D |rt }nt }t | | S r )rt rq r )r r protocol_checks r is_iterabler s& 6;5 e^ 4 44r c , t | t S r )r rk rj s r
is_mappingr & e%? @ @@r c N t | t }|pt | S r )r rn r )r supporteds r supports_membership_testr * s% "5*LMMI * E***r c t | t j r7t | t rdS t | rt
| rdS t | t S )NT) r r r3 r` CLASS_GETITEM_METHOD is_postponed_evaluation_enabled"is_node_in_type_annotation_contextr rv r r s r supports_getitemr / sk % (( $U,@ A A 4 *4 0 0 5W 6
6
4 e%? @ @@r r c , t | t S r )r rz r r s r supports_setitemr : r r c , t | t S r )r r} r s r supports_delitemr > r r c Z t | dd }t | r
| S d S )Npytype)r callable)r r s r _get_python_type_of_noder B s3 '.tXt'D'DF vxx 4r )compare_constantsr) InferenceContext | Noner InferenceResult | Nonec t } | | }t | }n+# t j $ r Y dS t
$ r
}t |d}~ww xY wt |t j s"|
t | |D ]}t | }||vr dS |rGt |t j
r-t |t j
r|j |j k r dS t |t j ri|j j ]t |t j rC|j j 7t# |j j t# |j j k r dS n8# t j $ r Y dS t$ $ r |cY S t
$ r
}t |d}~ww xY wt# | dk r|ndS )aI Return the inferred value for the given node.
Return None if inference failed or if there is some ambiguity (more than
one node has been inferred of different types).
If compare_constants is True and if multiple constants are inferred,
unequal inferred values are also considered ambiguous and return None.
r) Nr )rd r nextr r r r r r r rg r r rW r r r r
StopIteration) r r) r inferred_types infer_genr rx r
inferred_types r r r I s '*eeN"JJwJ// Y ! tt " " "!" eT 1 2 2 <3E::;;;"! H 4X > >M N22tt!
x55
uek22
Nek11tt8U%677
M&2 ue&788 3JO/
*++s5:?/C/CCCtt% & ! tt " " "!"''1,,55$6sS %6 A A AA F 8AF BF F F; F;% F;.F66F;i list[InferenceResult]c t | | S # t j $ r g cY S t $ r
}t
|d }~ww xY w)Nr )r r r r r r )r r) rx s r infer_allr sh "DJJwJ//000 ! " " "!"s "% A AA Ar c | j S # t $ r Y nw xY w| j D ]L}t || }t |t
j r|| u st || s
d| _ dS Md| _ dS )z=Return true if all base classes of a class could be inferred.r FT)_all_bases_knownAttributeErrorr4 r r r r3 r )r r) r2 r s r r r s
%%
D'22265>22 "67;;; &+E "55
"E 4s
c | d u pGt | t j o| j d u p$t | t j o
| j dk S )NrS )r r rW r r r r s r is_noner sP B tU[ ) ) @djD.@ B tUZ ( ( @TY&-@r SuccessfulInferenceResult | Nonec V t } | D ]W}t |t j st | r,| | t | dk r dS Xn# t j $ r Y dS w xY w|r|
ndS )zReturn the inferred type for `node`.
If there is more than one possible type, or if inferred type is Uninferable or None,
return None
r N) rd r r r r r rg r r r pop)r typesvar_types r node_typer s -0EEE
H(D$899
WX=N=N
IIh 5zzA~~tt ! tt )599;;;T)s A)A= ;A= =BBc d}t | t j sdS | j r | j j ng }|D ]}t |t j r|j }n t |t j r|}nBt |t j r |j dk rh t |j
}n# t j $ r Y w xY wt |t j rt || c S dS )z>Check if the given function node is a singledispatch function.)zfunctools.singledispatchz singledispatch.singledispatchFregister)r r r r r7 r8 r r r r r r r r )r singledispatch_qnamesr r r8 func_defs r (is_registered_in_singledispatch_functionr s,
dE - . . u*./A &&rJ C C i , , >DD
5?
3
3 DD $00 DMZ4O4O DIOO - -..HH% H h 1 2 2 C!(,ABB B B B C 5s &CCCnodes.FunctionDef | Nonec 6 t | t j r| j }n t | t j r| }nd S t |t j r |j dk rd S t
|j }t |t j sd S |S )Nr ) r r r7 r8 r r r r r )r r8 r s r find_inferred_fn_from_registerr s $
## y D%/ * * t dEO , ,
0K0Kt$)$$H h 1 2 2 t Or c d}| j r | j j ng }|D ]%}t | }|rt || c S &dS )zDCheck if the given function node is a singledispatchmethod function.)z functools.singledispatchmethodz#singledispatch.singledispatchmethodF)r r r r )r singledispatchmethod_qnamesr r r s r .is_registered_in_singledispatchmethod_functionr sm #
+//A &&rJ I I 1)<< I!(,GHH H H H I 5r rR c h t | dd rt | j d S t | dd rt | j d S t | dd rt | j d S t | dd rt | j d S | j S )zGet the last lineno of the given node.
For a simple statement this will just be node.lineno,
but for a node that has child statements (e.g. a method) this will be the lineno of the last
child statement recursively.
finalbodyForelser$ r )r get_node_last_linenor r r$ r r r s r r r s t[%(( 8#DN2$6777 tXu%% 5#DKO444tZ'' 7#DM"$5666tVU## 3#DIbM222 ;r c < | }d|j v S )z.a s. LLDz$//LLLLLLr FT)r r? r helpers
is_subtyper. _NonDeducibleTypeHierarchy)r r r@ s r is_subclass_ofr Z s LLUFOLLL L L uOO%% ))(F;;
tt
!< H 5s AA0/A0c f t | dd }t |ot | ddg S )zCheck if a node is a function stub decorated with typing.overload.
:param node: Node to check.
:returns: True if node is an overload function stub. False otherwise.
r Nztyping.overloadoverload)r r r )r r s r is_overload_stubr m s8 |T22J
T~d5F
4S T T U UUr clsc $ t | t j sdS | t v rdS | j D ]N} | D ]!}| t v r dS ":# t j $ r Y Kw xY wdS )zCheck if the given node represents a protocol class.
:param cls: The node to check
:returns: True if the node is or inherits from typing.Protocol directly, false otherwise.
FT) r r r3 r TYPING_PROTOCOLSr4 r r r )r r2 inf_bases r rM rM x s c5> * * u yy{{&&&t JJLL
>>##'777 444 8
% H 5s 2A;9A;;B
B
c t | t j o.t | j t j o| j j |k S )z6Checks if node is a function call with the given name.)r r r7 r8 r r r s r is_call_of_namer s? 4$$ # ty%* - - # INd "r c b |p| j }t |t j t j t j t j f r#| |j u p|j | S t |t j r | |j
v S t |d o| | S )z>Returns true if the given node is being tested for truthiness.r ) r r r r r IfExpAsserttestr
Comprehensionifsr r, s r is_test_conditionr s
"t{F&5;%+u|LMM Bv{"Afk&;&;D&A&AA&%-.. "vz!! 66 * * Ev/?/?/E/EEr c X | j dk rdS t d | j D S )z Test if ClassDef node is Type.r Tc 3 ` K | ])}t |t j o
|j d k V *dS )r N)r r r r )r bs r r z#is_classdef_type.. s: RR!z!UZ((=QVv-=RRRRRRr )r r r4 r s r is_classdef_typer s3 yFt RRtzRRR R RRr !nodes.ClassDef | astroid.Instance attr_namec T | j |dg d }|r;t |t j r!t |j t j rdS | j D ]@}t | }|r-t |t j rt || r dS AdS )zQTest if attribute is typed annotation in current node
or any base nodes.
Nr TF) localsgetr r r r r r4 r r3 is_attribute_typed_annotation)r r attributer2 r s r r r s D62215I y%"2 3 3
y' 9 9
t
d## 8U^44 .h BB
44 5r c R | j dk o | j dk S )NEnumenum)r r r s r is_enumr s$ 9 =499;;#3v#==r nodes.AssignName typing_namec : t | j t j sdS | j j }t |t j r|j }t |t j r |j |k s%t |t j r
|j
|k rdS dS )zTest if AssignName node has `typing_name` annotation.
Especially useful to check for `typing._SpecialForm` instances
like: `Union`, `Optional`, `Literal`, `ClassVar`, `Final`.
FT) r r r r r Subscriptr r r r r )r r r s r is_assign_name_annotated_withr s dk5? 3 3 u'J*eo.. & %
:uz** O{ * * j%/ 2 2
+ ; . .t 5r nodes.For | nodes.Comprehensionc l t | j t j rt | j j t j r|| j j j dk rgt | j j }t |t j sdS | j
d d S t | j t j t j f rIt | j }t |t j
sdS | j
S dS )zGet the name of the dictionary which keys are being iterated over on
a ``nodes.For`` or ``nodes.Comprehension`` node.
If the iterating object is not either the keys method of a dictionary
or a dictionary itself, this returns None.
r2 Nz.keysr )r iterr r7 r8 r r r r BoundMethod as_string
rpartitionr Dictr r s r get_iterating_dictionary_namer s 49ej))< ty~u 7 7<
IN #v - - din--(G$788 4y""$$//88;; $)ej%/ :;; % di(((EJ// 4y""$$$ 4r nodes.Subscript nodes.Constc t | j }t |t j st d |S )zReturns the value 'subscript.slice' of a Subscript node.
:param node: Subscript Node to extract value from
:returns: Const Node containing subscript value
:raises InferredTypeError: if the subscript node cannot be inferred as a Const
z3Subscript.slice cannot be inferred as a nodes.Const)r slicer r rW r r s r get_subscript_const_valuer s< $*%%H h , , W UVVV Or
importnoder r c t | t j rd| j r]| }t |t j r/ | || j S # t $ r |cY S w xY w|S )a Get a prepared module name from the given import node.
In the case of relative imports, this will return the
absolute qualified module name, which might be useful
for debugging. Otherwise, the initial module name
is returned unchanged.
:param importnode: node representing import statement.
:param modname: module name from import statement.
:returns: absolute qualified module name of the module
used in import.
)level)r r r r r r relative_to_absolute_namer )r r r s r get_import_namer s *e .// J4D dEL ) )
55:#3 6 &
Ns A- - A<;A<nodes.Ifc t | j t j ra| j j }t |t j r|j }t |t j r| dk rdS dS )zReturn True if IF stmt is a sys.version_info guard.
>>> import sys
>>> if sys.version_info > (3, 8):
>>> from typing import Literal
>>> else:
>>> from typing_extensions import Literal
zsys.version_infoTF) r r r Compareleftr r r r )r r s r is_sys_guardr$ sr $)U]++ eU_ - - KE ueo . . !!%7774 5r c t j dt d t | j t
j t
j f o+| j d S )zReturn True if IF stmt is a typing guard.
>>> from typing import TYPE_CHECKING
>>> if TYPE_CHECKING:
>>> from xyz import a
PThis method will be removed in pylint 3.0; use in_type_checking_block() instead.r r r
)
r r r r r r r r r r r s r is_typing_guardr' 6 sn
MZ
EJ0 :
)
(
(
9
9:r c t j dt d t | j t
j ot | j S )zHReturn True if node is part for guarded `typing.TYPE_CHECKING` if block.r& r r )r r r r r r r r' r s r &is_node_in_typing_guarded_import_blockr) G sI MZ
dk58 , , M 1M1MMr c t j dt d t | j t
j o't | j pt | j S )zmReturn True if node is part for guarded if block.
I.e. `sys.version_info` or `typing.TYPE_CHECKING`
r& r r ) r r r r r r r r$ r' r s r is_node_in_guarded_import_blockr+ Q s_
MZ
dk58 , , T[!!A_T[%A%Ar c t fd t j t j t j f D S )zaCheck if the given variable name is reassigned in the same scope after the
current node.
c 3 N K | ] }|j k o|j j k V d S r )r r )r ar r s r r z.is_reassigned_after_current..d sL
'4ah 4 r )r r r r r r3 r r r s ``r is_reassigned_after_currentr0 ` sm ,,
u~u/@ A
r c t fd t j D S )z^Check if the given variable name is deleted in the same scope after the current
node.
c 3 v K | ]3}|j D ])}t |d d k o|j j k V *4dS )r N)r r r )r del_noder r r s r r z+is_deleted_after_current..p sp &
%%0PV]T[5P r )r r r r Deleter/ s ``r is_deleted_after_currentr5 l s[
33ELAA r c t | j dk ont | j d t j oIt | j d j t j o | j d j j t k S )zBChecks whether a function body only consists of a single Ellipsis.r r )r r r r Exprr rW Ellipsisr s r is_function_body_ellipsisr9 w sk DI! 1 ty|UZ 0 0 1 ty|)5; 7 7 1
IaL $ 0 r c F t | t j o| j S r )r r r\ r r s r is_base_containerr; s dE / 0 0 B]Br c F t | t j o| j S r )r r r r r s r is_empty_dict_literalr= s dEJ ' ' :
N:r c z t | t j o!t | j t o| j S r )r r rW r r r s r is_empty_str_literalr? s0 4%%X*TZ*E*EXdj.r c t | t j o=t | j t j o t | j j t
S )zIReturns true if a node is a nodes.Return that returns a constant boolean.)r r Returnr rW r r s r returns_boolrB E 4 && / tz5; / / / tz' . .r c t | t j o=t | j t j o t | j j t
S )zIReturns true if a node is a nodes.Assign that returns a constant boolean.)r r r r rW r r s r
assigned_boolrE rC r
ancestor_type'type[_NodeT] | tuple[type[_NodeT], ...]
_NodeT | Nonec \ | D ]}t || r|c S dS )zIReturn the first parent node that is any of the provided types (or None).Nr r )r rF r@ s r rZ rZ sD '')) h
. . OOO 4r /tuple[None, None] | tuple[_NodeT, nodes.NodeNG]c h | }| D ]}t || r||fc S |}dS )a Modified version of get_node_first_ancestor_of_type to also return the
descendant visited directly before reaching the sought ancestor.
Useful for extracting whether a statement is guarded by a try, except, or finally
when searching for a TryFinally ancestor.
NNrJ )r rF r r@ s r -get_node_first_ancestor_of_type_and_its_childrN sS
E'')) h
. . % e$ $ $ $ :r c | D ]Z}t |t j s t |j t j r|j j dk rN|j |j j d }|s dS |d }t |t j r|j dk r dS t |j }t |t j r |j du r dS t |j t j
rS|j j dk rt |j j }t |t j r|j dk r dS \dS )z4Check if a node is guarded by a TYPE_CHECKING guard.r
r Fr r T)r r r r r r r r r r r rW r r r r r )r r@
lookup_resultmaybe_import_fromr inferred_modules r in_type_checking_blockrS sb '')) (EH-- hmUZ 0 0 }!_44 $M 0 0 1C D DQ GM
uu -a 0 ,e.>??
%-99tt!(-00H(EK00
X^u5L5Ltt
u
7
7 }% 88 ( ); < . sL 1 1;D D!!6Y$%61 1 1 1 1 1r )r r r r r )r r s `r in_for_else_branchr^ sR fei ( ( S 1 1 1 1HN
1 1 1 . . r r &nodes.AssignName | nodes.BaseContainer
Iterator[str]c # K t | t j r| j | j V dS dS t | t j r | j D ]}t
| E d{V dS dS )zBYield the names of assignment targets, accounting for nested ones.N)r r r r r\ r find_assigned_names_recursive)r r> s r rb rb s &%*++ : ; "+ # " FE / 0 0 :; : :C4S99 9 9 9 9 9 9 9 9: : : :r +nodes.For | nodes.Comprehension | nodes.SetIterator[bool]c # X K t | t j rdV dS t | t j r!| j D ]}t | E d{V dS t | t j t j f r$| j j D ]}t | E d{V dS dS )z6Yield ``True`` if a Starred node is found recursively.TN) r r StarredSetr has_starred_node_recursiver r r )r r> s r rh rh
s $
&& 7
D%) $ $ 79 7 7C1#66 6 6 6 6 6 6 6 6 7 7 D59e&9: ; ; 79> 7 7C1#66 6 6 6 6 6 6 6 67 7 7 7r c ^ | D ]}t |t j t j f r dS t
|d s dS t | d }|j |u r dS t |dd dS dS # t j $ r Y dS w xY w)zgReturn whether any inferred value of `node` is hashable.
When finding ambiguity, return True.
Tigetattrr; r NF)
r r r r3 r r r r rj r r r r )r r hash_fns r is_hashablerl s
H(U^T5I$JKK
tt8Z00
tt8,,Z8899G~))ttw..:tt ;u ! tts) =B B ,B B B B,+B,#nodes.AssignName | nodes.AssignAttrsidec N t |t j r,t | t j r| j |j k S dS t |t j rDt | t j r*| | k S dS )zKDetermine whether the target name-like node is referenced in the side node.F)r r r r r r
AssignAttrr )r rn s r _is_target_name_in_binop_siderq . s $
## fe . / / ,;$)+ +u$(( 6Z@P-Q-Q 6 !!T^^%5%555 5r nodes.Assigntuple[bool, str]c t | j t j sdS | j }| j d }t |t j t j f sdS t |j t j r(t |j j t t f rdS t |j t j s t |j t j rdS t ||j r d|j fS |j t v rht ||j rSt! |j }t |t j r#t |j t" r d|j fS dS dS )zjDetermine if the node is assigning itself (with modifications) to itself.
For example: x = 1 + x
)Fr~ r T)r r r BinOpr r rp r# rW r bytesr7 rightrq opCOMMUTATIVE_OPERATORSr rR )r binopr
inferred_lefts r is_augmented_assignr| ; s]
dj%+ . . y JE
\!_F fu /1A B C C y %*ek** z
3,0 0 y %*ej)) Z UZ-P-P y$VUZ88 UX~ ))) )&%+ > > * #5:..
mU[ 1 1 "j 7
7
" > !y 9r r nodes.Moduleignored_modulesc J t | }| j }| }|D ]u}||v s||v r dS t j || r dS t | d }d}|r*| }|s|}n|d| z
}||v r dS |*vdS )NTrb r~ F)rd r r fnmatchr splitpopleft)r r~ module_name module_qnameignorepartscurrent_moduleparts r is_module_ignoredr c s /**O+K<<>>L! ? * *k_.L.L44 ?< 0 0 44 k'',,-- ==??D!
-!% *d**, 00tt 5r c x t t j o t fdt D S )Nc 3 * K | ]
}j |u V d S r rj )r r r s r r z%is_singleton_const.. s; 1 1 %
e1 1 1 1 1 1r )r r rW r SINGLETON_VALUESr s `r is_singleton_constr sN dEK ( ( S 1 1 1 1)91 1 1 . . r c t | j t j s t | j t j r t | j t j rdS | j D ]0}t |d r | t v r dS 1n # t t j
f$ r Y nw xY wdS )z9Detect call to exit(), quit(), os._exit(), or sys.exit().Fr T)r r8 r r r r r r r r TERMINATING_FUNCS_QNAMESr r r r s r is_terminating_funcr s
ty%/ 2 2DIuz22 dk5< 0 0
u
)) H'**
NN$$(@@@tt
71 2
5s !AB, *B, ,CCc ^ | | dS # t j $ r Y dS w xY wr )r r rY )r r s r
is_class_attrr sC
dt uus ,,c 0 d}t |t j r|j j k }t |t j t j f r t fd|j D }t |t j r t fd|j
D }t |t j t j f r |j k }t |t j
r6|j o.t |j t j o|j j k }t |t j r t fd|j D }|p,t fd| D S )z>Searches for a tree node that defines the given variable name.Fc 3 0 K | ]}|d k V dS )r Nr )r node_namer s r r z is_defined.. s, Q Q ! 4 Q Q Q Q Q Qr c 3 z K | ]5}t |d t j o|d j k V 6dS )r N)r r r r )r r} r s r r z is_defined.. sX
tAw 0 1 1 Jd1gld6J
r c 3 h K | ],}t fd t | D V -dS )c 3 K | ]r}t |t j o.t |j t j o|j j k p$t |t j o
|j k V sd S r )r r rf r r r )r r> r s r r z'is_defined... s
#3
66 3 &sy%2B C C3 INd 2P
#3(899Nch$>N
r N)r r )r r r s r r z is_defined.. ss
,F33
r c 3 8 K | ]}t | V d S r )
is_defined)r r r s r r z is_defined.. s> $ $$)
4 $ $ $ $ $ $r )r r r[ r r r r r r r r r3 r r r r r r get_children)r r is_defined_so_fars ` r r r s $(( 5 K , 4$ u'7899 R Q Q Q Qdj Q Q Q Q Q$
##
$ ):;<< . I -$((
J
)4;(899
) D( $ %%
,
$ $ $ $-1->->-@-@$ $ $ ! ! r rx c ( ddddddddd d
d
| S ) a
Returns the inverse comparator given a comparator.
E.g. when given "==", returns "!="
:param str op: the comparator to look up.
:returns: The inverse of the comparator in string format
:raises KeyError: if input is not recognized as a comparator
!===>=<=><not ininis notis)
r r r r r r r r r r r )rx s r get_inverse_comparatorr s;
r test_nodeGnodes.Compare | nodes.Name | nodes.UnaryOp | nodes.BoolOp | nodes.BinOpc d| }t | t j r| j }n,t | t j rd| d}nt | t j r| j }| j d \ }}t j t j t j t j
t j f}t || rd| dn| }t || rd| dn| }| dt | d| }|S )Nznot znot (ra r r` )
r r r UnaryOpoperandBoolOpr" r# opsr r r[ r )r msglhsr rhslower_priority_expressionss r not_condition_as_stringr sl )$$&&
(
(C)U]++ ; ))++ Iu| , , ;.i))++... Iu} - - ;n =#S L M L K O &
" # 9::
! "
" " " " # 9::
! "
" " " "
::-c22::S:: Jr rS c ddl m} t t t | t
t g}|D ]}| dS )z-Clear caches holding references to AST nodes.r )overridden_methodN)pylint.checkers.variablesr r^ r r r r cache_clear)r caches_holding_node_referenceslrus r clear_lru_cachesr sa <;;;;; &
E" . 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 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 )rB r r rC )rX r r rY )rX r r rs )rX r r rz )rX r r r )r r r r )r r r r )r< r r r )r r r r rM )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 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 r2 r3 r r4 )r r r r8 )r< r r2 r3 r r )r r r2 r3 r r8 )r rC r r )r r r2 r3 r r )r r/ r r )r r rT r r r )r r r r )r r r r r r )F)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 r )r r/ r) r r r )r r r r )r r r r )r r r rR )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 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 rF rG r rH )r r rF rG r rK )r r rT rU r r )r r r rZ r r )r r_ r r` )r rc r rd )r rm rn r r r )r rr r rs )r r} r~ r r r )r r r r )r r r r/ r r )r r r r r r )rx r r r )r r r r )r rS )rN
__future__r r r r! r r re r collectionsr collections.abcr r functoolsr r r r r
r r r
ru astroid.objectsr r r r astroid.contextr astroid.exceptionsr astroid.nodes._base_nodesr astroid.typingr r r pylint.checkersr r r r AstCallbackMethodr+ rb rc rd r r rO r frozensetr ry rp rs NEXT_METHODrh r ry r| rm ri _SPECIAL_METHODS_PARAMSr SPECIAL_METHODS_PARAMSrd PYMETHODSr r r r r r r r r r __dict__copyr r r r r r r& r- r5 r9 r; rA rI rK rM rP rr ry r r r r r r r r r r r r r r r r r
r r r r- r& r7 r; r@ rB rE rH rS r` rf rk rn rq rt rv rz 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 rM r r r r r r r r r r$ r' r) r+ r0 r5 r9 r; r= r? rB rE rZ rN rS rY r^ rb rh rl rq r| r r r r r r r r r r r r s
> = " " " " " "
. . . . . . . . ( ( ( ( ( ( ( ( 8 8 8 8 8 8 8 8 8 8 8 8 3 3 3 3 3 3 3 3 3 3 , , , , , , + + + + + + 0 0 0 0 0 0 E E E E E E E E ,,,,,,,++++++ . . . GK} 5 5 5 i 0$ 67
N M N i 9BBB " ";";";<< * C%L?@ L Wl l \ 288::
C& ' ' (y') ) V '&& $9DDD
) U U U U I I I I
! ! # #$ 3 3 3 3
8 8 8 8
B B B B- - - -`7 7 7 7t & "P P P PL L L L
01 1 1 1&E E E E EY E E E I0 I0 I0 I0X. . . . = = = =DL L L L: 2P P P P! ! ! ! OS < * * * *6
- - - -
. . . .
8 8 8 8
6 0/ / / /d 4>B1 1 1 1 1h
8 8 8 826 6 6 6 > > > * 8 2 ,: : : :"N N N N C C C C; ; ; ; " B 2
: : : : 7 7 7 7 ,
% % % %P D , , , , ,^
0 @ r