Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/pylint/checkers/__pycache__/utils.cpython-39.pyc
Ðазад
a n�h�7 � @ s d Z ddlmZ ddlZddlZddlZddlZddlZddlZddl Z ddl m Z m Z m Z ddlmZmZ ddlmZ ddlmZmZmZ ddlZddlmZmZmZ dd lm Z dd l m Z dd l m Z m!Z! dd l"m#Z#m$Z$ dd l%m&Z&m'Z' e�rddlm(Z( ddl)m*Z* edej+d�Z,eddd�Z-e e-e,gdf Z.ej/ej0ej1ej2fZ3dZ4ddhZ5h d�Z6e7h d��Z8e7h d��Z9dZ:dZ;d Z<d Z=d Z>d Z?d Z@d!ZAd"ZBd#d$d%d&d'd(d)d*�ZCd+d,� eC�D� D �ZEeFeE�ZGe7d-�ZHh d.�ZIe7h d/��ZJG d0d1� d1eK�ZLG d2d3� d3eK�ZMd4d5d6�d7d8�ZNd4d9d6�d:d;�ZOd<d9d6�d=d>�ZPejQ�R� Zd?ZSd4d9d6�d@dA�ZTdBd9dC�dDdE�ZUd4dBd4d9dF�dGdH�ZVd4dBd4dIdF�dJdK�ZWdLd9dM�dNdO�ZX�d�d4dId9dP�dQdR�ZYd4d9d6�dSdT�ZZdUd4d9dV�dWdX�Z[d4d9d6�dYdZ�Z\d4d4d6�d[d\�Z]dUdBd9d]�d^d_�Z^dBd`da�dbdc�Z_G ddde� deeK�Z`G dfdg� dgeK�ZadBdhdi�djdk�ZbdBdldi�dmdn�ZcdBdodi�dpdq�ZddBdrdi�dsdt�ZedBd9du�dvdw�Zfd4dxd6�dydz�Zgd{d|d}�d~d�ZhdBd�du�d�d��Zi�d�d�d�d�dLd��d�d��Zjd�dBd�d��d�d��Zkd�d9d6�d�d��Zld�d�d9d��d�d��Zmd<d9d6�d�d��Znd4dBd9d��d�d��Zod4d9d6�d�d��Zpd4d9d6�d�d��Zqd4d9d6�d�d��ZrdLd9d��d�d��Zsd�d�d9d��d�d��Ztd�d�d6�d�d��Zued�d���d�dUd�d�d��d�d���Zvd4d�d6�d�d��Zwd4d�d6�d�d��Zxd4d9d6�d�d��Zyd�d�d9d��d�d��ZzeKfd4d�d�d��d�dÄZ{d4d�d6�d�dƄZ|eKfd�d�d9dǜd�dɄZ}eKfd4d�d�d��d�d˄Z~d�d9d6�d�d΄ZeKfd4d�d9d��d�dЄZ�ed�d��dUd9d6�d�d҄�Z�d4dBd9dӜd�dՄZ�d4d9d6�d�dׄZ�d4d9dd�dڄZ�d4d9dd�d܄Z�d4d9dd�dބZ�d4d9dd�d�Z�d4d9dd�d�Z�d4d9dd�d�Z�d4d9dd�d�Z�dBd9dC�d�d�Z�d4d9d6�d�d�Z�d4d�d9d�d�d�Z��d�d4d9d9d�d�d�Z�d4d9dd�d�Z�d4d9dd�d��Z�d4d4d9d��d�d��Z�d4d4d9d��d�d��Z�d4d4d9d��d�d��Z�d4d�d6�d��d �Z�ed�d���d�d�d�d�d4�dd9d9�d�d��d�d��Z�e�dd���d�d4�d�d�d ��d �d ��Z�d<d<d9�d ��d �d�Z�dUdUd9�d��d�d�Z��d�dU�dd9�d��d�d�Z�d4d9d6��d�d�Z�d4�dd6��d�d�Z�d<d9d6��d�d�Z�d4d�d6��d �d �Z�d<d9d6��d �d �Z�d4�d d6��d!�d"�Z�d4d9d6��d#�d$�Z�d4d9d6��d%�d&�Z�dUdUd9�d'��d(�d)�Z�ed�d��d4d9d6��d*�d+��Z�d4d9�d,��d-�d.�Z�d4dBd9�d/��d0�d1�Z��d�d4dId9�d2��d3�d4�Z�dUd9d6��d5�d6�Z��d7dBd9�d8��d9�d:�Z�dUd9d6��d;�d<�Z��d=dBd9�d>��d?�d@�Z��dAd�d6��dB�dC�Z��dD�dEd6��dF�dG�Z��dHd�d��dI��dJ�dK�Z��dLd9d6��dM�dN�Z�d4dBd9�dO��dP�dQ�Z�d4dBd9�dO��dR�dS�Z�d<d9d6��dT�dU�Z�dId9d6��dV�dW�Z�dId9d6��dX�dY�Z�dId9d6��dZ�d[�Z�d4d9d6��d\�d]�Z�d4d9d6��d^�d_�Z�d4�d`�da�db��dc�dd�Z�d4�d`�de�db��df�dg�Z�d4d9d6��dh�di�Z�d4�djd9�dk��dl�dm�Z�ed4�dnd9�do��dp�dq��Z��dr�ds�dt��du�dv�Z��dw�dxd6��dy�dz�Z�d4d9d6��d{�d|�Z��dD�dDd9�d}��d~�d�Z��d�dId9�d���d��d��Z��d��d�d6��d��d��Z�dB�d��d���d��d��Z�dBd�d9�d���d��d��Z�d4d9d6��d��d��Z�d�d9d6��d��d��Z�dBdUd9�d���d��d��Z�dBdB�d���d��d��Zǐd�dB�d���d��d��Z�e�d�d���d�d�d��d���d��d���Zɐd��d���d��d��Zʐd=d9d6��d��d��Z�dS (� z7Some functions that may be useful for various checkers.� )� annotationsN)�Callable�Iterable�Iterator)� lru_cache�partial)�Match)� TYPE_CHECKING�Any�TypeVar)�TooManyLevelsError�nodes�util)�InferenceContext)� AstroidError)� ImportNode� Statement)�InferenceResult�SuccessfulInferenceResult)� TYPING_NEVER�TYPING_NORETURN)�_lru_cache_wrapper)� BaseChecker�_NodeT)�bound� _CheckerTr �builtins�abcZ_py_abc> zabc.abstractmethodzabc.abstractpropertyzabc.abstractclassmethodzabc.abstractstaticmethod> ztyping.Protocolztyping_extensions.Protocolz .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__r) r* �__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__Z__cmp__� __matmul__� __rmatmul__� __imatmul__Z__div__)� __setattr__�__get__�__set__r( � __set_name__)�__exit__� __aexit__)� __round__)�__pow__)Nr � � � )r r� )r� r� c C s i | ]\}}|D ] }||�qqS � r� )�.0�params�methods�namer� r� ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/pylint/checkers/utils.py� <dictcomp>� s �r� )&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> FTN> z_sitebuiltins.Quitterz posix._exitznt._exitzsys.exitc @ s e Zd ZdS )�NoSuchArgumentErrorN��__name__� __module__� __qualname__r� r� r� r� r� � s r� c @ s e Zd ZdS )�InferredTypeErrorNr� r� r� r� r� r� � s r� z nodes.NodeNGzIterable[nodes.NodeNG])�node�returnc c s8 t | tjtjf�r.| jD ]}t|�E dH qn| V dS )z9Recursively returns all atoms in nested lists and tuples.N)� isinstancer �Tuple�List�elts�get_all_elements)r� �childr� r� r� r� � s r� �boolc C s& t | dd�dkr"| �� jdkr"dS dS )zDReturn True if the node is referencing the "super" builtin function.r� N�superr TF)�getattr�rootr� �r� r� r� r� �is_super s r� znodes.FunctionDefc C s t | j�dko t| jd tj�S )z@Return true if the given function node only raises an exception.r� r )�len�bodyr� r �Raiser� r� r� r� �is_error s r� )� __builtins__c C s | o| � � jdkS )zHReturns True if the given node is an object from the __builtin__ module.r )r� r� r� r� r� r� �is_builtin_object s r� �str)r� r� c C s | t v p| tv S )zIReturn true if <name> could be considered as a builtin defined by python.)r �SPECIAL_BUILTINS�r� r� r� r� � is_builtin s r� )�var_node�varname�scoper� c C s t | ||�d uS �N)�defnode_in_scope)r� r� r� r� r� r� �is_defined_in_scope! s r� znodes.NodeNG | Nonec C s� t |tj�rt|jD ]\}t |tj�r4||jv r4| S t |tj�r|jD ]&}t |tj�rF|j |krF| S qFq�nDt |t tj f�r�|� tj�D ]}|j |kr�| S q��n t |tj �r�|jD ]8\}}|�| �r� q�|r�t |tj�r�|j |kr�| S q�n�t |tjtjf��r�|j�|��rl|j�| ��rhz"|j�|� |j}t| ||�}W n tj�yb Y n0 |S |S t|dd �|k�r�|S n4t |tj��r�t |j tj��r�|j }|j |k�r�|S d S )Nr� )r� r �Ifr� �Nonlocal�names�Assign�targets� AssignNamer� �COMP_NODE_TYPES�For�nodes_of_class�With�items� parent_of�Lambda� FunctionDef�args� is_argument� default_value�parentr� �astroid� NoDefaultr� � ExceptHandler) r� r� r� r� �targetZass_node�exprZids�defnoder� r� r� r� * sJ r� z nodes.Name)r� r� c C sh | j }| �� D ]�}t| ||�}|du r(q|�� }t|g t�tj�tj�R �r�t|tj�rz| �� }||urzt|tj�rz dS dS |j | j k r� dS |�� D ]8}|j | j kr�q�t|tj tj tj tj tjf�r� dS q�q| �� }|�� }|j} |�rd|j| k�rd|�tj�D ]} | j |k�r dS �q |�tjtjf�D ]"} |dd� | jD �v �r6 dS �q6|�� }q�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). NFTc S s g | ]}|d p|d �qS )r� r r� )r� r� r� r� r� � <listcomp>� � z%is_defined_before.<locals>.<listcomp>)r� �node_ancestorsr� r� r� r� r r� r� �linenor� �Whiler� �Tryr� Z statementZprevious_siblingZ fromlinenor� r� � ImportFrom�Importr� ) r� r� r� r� Z defnode_scopeZvar_node_scopeZ defnode_anc�stmt�_noder� Z assign_nodeZimp_noder� r� r� �is_defined_beforeZ sV � � �� r� )r� r� r� c sV |s � � � }t|tjtjf�rRt�|jjdd� |jj D ��}t � fdd�|D ��S dS )zcReturn true if the given Name node is used in function or lambda default argument's value. c s s | ]}|d ur|V qd S r� r� )r� �dr� r� r� � <genexpr>� r� z&is_default_argument.<locals>.<genexpr>c 3 s( | ] }|� tj�D ]}|� u V qqd S r� �r� r �Name)r� � default_nodeZdefault_name_noder� r� r� r� � s �F) r� r� r r� r� � itertools�chainr� �defaults� kw_defaults�any)r� r� Z all_defaultsr� r� r� �is_default_argument� s � �r� c C sD | � � D ]6}t|tj�r dS |js:t|tjtjtjf�r q@qdS )z6Return true if the name is used in function decorator.TF)r� r� r Z DecoratorsZ is_statementr� �ComprehensionScope�ListComp�r� r� r� r� r� �is_func_decorator� s ��r� znodes.ClassDef)�framer� r� c s( t | tj�sdS t� fdd�| jD ��S )zkReturn whether `frame` is an astroid.Class node with `node` in the subtree of its bases attribute. Fc 3 s | ]}� |� tj�v V qd S r� r� )r� �baser� r� r� r� � r� z#is_ancestor_name.<locals>.<genexpr>)r� r �ClassDefr� �bases)r� r� r� r� r� �is_ancestor_name� s r� c C s t | jtj�o| jj| u S )z@Return True if node is the function being called in a Call node.)r� r� r �Call�funcr� r� r� r� �is_being_called� s r� c C s& | r"t | tjtjtjf�r"| j} q | S )zHReturn the higher parent which is not an AssignName, Tuple or List node.)r� r r� r� r� r� r� r� r� r� � assign_parent� s r� )� class_noder� r� c C s< | � � D ].}|jdkrq||v rt|| tj�r dS qdS )zjReturn True if <name> is a method overridden from an ancestor which is not the base object class. �objectTF)� ancestorsr� r� r r� )r� r� �ancestorr� r� r� �overrides_a_method� s r zVCallable[[AstCallbackMethod[_CheckerT, _NodeT]], AstCallbackMethod[_CheckerT, _NodeT]])�messagesr� c s ddd�� fdd� }|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``. z$AstCallbackMethod[_CheckerT, _NodeT])r� r� c s � | _ | S r� )Z checks_msgs�r� �r r� r� �store_messages� s z2only_required_for_messages.<locals>.store_messagesr� )r r r� r r� �only_required_for_messages� s r c @ s e Zd ZdZdS )�IncompleteFormatStringz:A format string ended in the middle of a format specifier.N)r� r� r� �__doc__r� r� r� r� r � s r c s( e Zd ZdZddd�� fdd� Z� ZS )�UnsupportedFormatCharacterz]A format character in a format string is not one of the supported format characters. �int�None)�indexr� c s t � �|� || _d S r� )r� r- r )�selfr �� __class__r� r� r- � s z#UnsupportedFormatCharacter.__init__)r� r� r� r r- � __classcell__r� r� r r� r � s r z/tuple[set[str], int, dict[str, str], list[str]])� format_stringr� c s� t � }i }g }d}ddd�� fdd� }d}|t� �k �rΈ | }|dk�r�||�\}}d}|d kr�d } ||�\}}|} | dkr�|d kr�| d 7 } n|d kr�| d 8 } ||�\}}qv|d } � | | � }|d v r�||�\}}q�|d kr�|d 7 }||�\}}n|tjv �r||�\}}q�|dk�rb||�\}}|d k�rF|d 7 }||�\}}n |tjv �rb||�\}}�qF|dv �rx||�\}}d} || v�r�t|��|�r�|�|� |||< n |dk�r�|d 7 }|�|� |d 7 }q*||||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 r ztuple[int, str])�ir� c s$ | d7 } | t � �krt�| � | fS )Nr� )r� r )r �r r� r� � next_char s z&parse_format_string.<locals>.next_char�%N�(r� �)z#0- +r" �.ZhlLzdiouxXeEfFgGcrs%a)�setr� �string�digitsr �add�append) r r+ Z key_typesZ pos_types�num_argsr r �char�key�depthZ key_startZkey_end�flagsr� r r� �parse_format_string� sd r" z&tuple[str, Iterable[tuple[bool, str]]]c C s> z t �| �W S ty8 } zt� |�W Y d }~n d }~0 0 d S r� )�_string�formatter_field_name_split� ValueErrorr )r �er� r� r� �split_format_field_namesK s r' zIterable[str | None]c c s� t �� }z\|�| �}|D ]H}tdd� |dd� D ��r8q|d }|d }|V |rt|�E dH qW nX ty� } z@|jd �d�r�dV d V W Y d}~dS t| �|�W Y d}~n d}~0 0 dS ) zyGiven a format string, return an iterator of all the valid format fields. It handles nested fields as well. c s s | ]}|d u V qd S r� r� )r� �itemr� r� r� r� _ r� z(collect_string_fields.<locals>.<genexpr>r� Nr� r zcannot switch from manual� �1) r � Formatter�parse�all�collect_string_fieldsr% r� � startswithr )r � formatterZ parseiterator�resultr� �nested�excr� r� r� r. T s" r. z9tuple[list[tuple[str, list[tuple[bool, str]]]], int, int]c C s� g }d}t � }t| �D ]�}|r:t|��� r:|�t|�� q|r�t|�\}}t|tj�rd|�t|�� z|� |t |�f� W q� t y� } zt � |�W Y d}~q�d}~0 0 q|d7 }q||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� )r r. r� �isdigitr r' r� �numbers�Numberr �listr% r r� )r Zkeyword_argumentsZimplicit_pos_args_cntZexplicit_pos_argsr� ZkeynameZ fielditeratorr& r� r� r� �parse_format_method_stringv s r8 )�attrnamer� c C s* | d dko(| dko(| � d�o&| �d� S )zkReturn True if attribute name is protected (start with _ and some other details), False otherwise. r �_�__)r/ �endswith)r9 r� r� r� �is_attr_protected� s ��r= znodes.ClassDef | Nonec C sP | � � }tjtjtjf}|rLt||�rLt|tj�sL|jdu r@dS |j� � }q|S )z�Return 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`. N) r� r �NodeNGr� � UnboundMethod� BaseInstancer� r� r� )r� �klassZnodes_to_checkr� r� r� �node_frame_class� s ��� � rB zastroid.ClassDefzastroid.ClassDef | None)r� r� c C s | j �� }t|tj�r|S dS )zFReturn the class that is the outer class of given (nested) class_node.N)r� r� r� r� r� )r� Z parent_klassr� r� r� �get_outer_class� s rC zMatch[str] | Nonec C s t �d�}|�| �S )zrCheck that attribute name is private (at least two leading underscores, at most one trailing underscore). z^_{2,10}.*[^_]+_?$)�re�compile�match)r9 �regexr� r� r� �is_attr_private� s rH z nodes.Callz int | Nonez str | None)� call_node�position�keywordr� c C sr |du r|du rt d��|dur@z | j| W S ty> Y n0 |rj| jrj| jD ]}|j|krP|j S qPt�dS )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.)r% r� � IndexError�keywords�arg�valuer� )rI rJ rK rN r� r� r� �get_argument_from_call� s rP znodes.Name | None)rI rK r� c C sP | j D ]D}t|j�}t|tj�r|jD ]"}|d j|kr&|d S q&qdS )a6 Returns the specified argument from a function's kwargs. :param nodes.Call call_node: Node representing a function call to check. :param str keyword: Name of the argument to be extracted. :returns: The node representing the argument, None if the argument is not found. :rtype: nodes.Name r r� N)�kwargs� safe_inferrO r� r �Dictr� )rI rK rN �inferredr( r� r� r� �infer_kwarg_from_call� s rU z nodes.NodeNG | astroid.Instancec C s2 t | d�r| �� ng }tdd� t�| g|�D ��S )zQReturn whether the given class node is subclass of exceptions.Exception. r� c s s& | ] }|j d v o |�� j tkV qdS )> � Exception� BaseExceptionN)r� r� �EXCEPTIONS_MODULE)r� r� r� r� r� r� � s � z&inherit_from_std_ex.<locals>.<genexpr>)�hasattrr� r� r� r� )r� r� r� r� r� �inherit_from_std_ex� s �rZ znodes.ExceptHandlerz9str | type[Exception] | tuple[str | type[Exception], ...])�handler� error_typer� c sF ddd�dd�� t |t�s |f}� fdd�|D �}| js<dS | �|�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. zstr | type[Exception]r� )�errorr� c S s t | t�s| jS | S r� )r� r� r� )r] r� r� r� �stringify_error s z&error_of_type.<locals>.stringify_errorc s h | ] }� |��qS r� r� )r� r] �r^ r� r� � <setcomp> r� z error_of_type.<locals>.<setcomp>F)r� �tuple�typeZcatch)r[ r\ Zexpected_errorsr� r_ r� � error_of_type s rc c C sF | j s dS | j jD ].}zt|�r(W dS W q tjy> Y q0 qdS )z?Detect if the given function node is decorated with a property.FT)� decoratorsr �_is_property_decoratorr� �InferenceError)r� � decoratorr� r� r� �decorated_with_property s rh )r� �kindsr� c G sJ t | tjtjf�sdS | jrF| jjD ] }t |tj�r$|j|v r$ dS q$dS )NFT)r� r� r? r r� rd � Attributer9 )r� ri rg r� r� r� �_is_property_kind+ s rk c C s t | d�S )z-Check if the given node is a property setter.�setter�rk r� r� r� r� �is_property_setter5 s rn c C s t | d�S )z.Check if the given node is a property deleter.�deleterrm r� r� r� r� �is_property_deleter: s rp c C s t | dd�S )zACheck if the given node is either a property setter or a deleter.rl ro rm r� r� r� r� � is_property_setter_or_deleter? s rq )rg r� c C s� | � � D ]�}t|tj�rZ|�� dv r* dS |�� D ]$}|jdkr2|�� jdkr2 dS q2qt|tj�rt |� � �}t |�dkrt|d j tj tjf�rt|d j �}|rt|tjj�rt|jtj�rt|j� S qdS )N> zfunctools.cached_propertyzbuiltins.propertyT�propertyr r� r F)�inferr� r r� �qnamer� r� r� r� r7 Z _get_return_nodes_skip_functionsr� rO r� rj rR r� �objects�Property�functionrh )rg rT r� �returnsr� r� r� re D s. ��� � �re zPnodes.ClassDef | nodes.FunctionDef | astroid.BoundMethod | astroid.UnboundMethodz Iterable[str])r� �qnamesr� c sr | j r| j jng }|D ]V}t|tj�r,|j}z&t� fdd�|�� D ��rPW dS W q tjyj Y qY q0 qdS )zMDetermine if the `func` node has a decorator with the qualified name `qname`.c 3 s6 | ].}t |tjtjf�r|j� v p,|�� � v V qd S r� )r� r r� r� r� rt �r� r �ry r� r� r� l s �z!decorated_with.<locals>.<genexpr>TF) rd r r� r� r� r� rs r� rf )r� ry rd Zdecorator_noder� r{ r� �decorated_with_ s � r| znodes.Decoratorsz)list[nodes.Attribute | nodes.Name | None]c C s g }t | dg �D ]�}d}t|tj�r\t|j�}t|tj�rx|�� dkrx|j�|jj �\}}n t|tj �rx|�|j �\}}|s~q|d }t|t j t j f�s�qt|j�}d|v o�|jdk}d|v o�t |dd�dk} |s�| rt|�}|du s�t|tj�r|�|� q|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 N�typingr �finalr9 )r� r� r rj rR r� �Modulert �lookupr� r� r� r� r� �dictr� �modnamer �UninferableBaser ) r� rd rg Z import_nodesrT r: � import_nodeZ import_namesZis_from_importZ is_importr� r� r� � uninferable_final_decoratorsw s4 �� r� i )�maxsizeznodes.FunctionDef | Nonez dict[str, nodes.FunctionDef])r� �is_abstract_cbr� c C s� |du rt ttd�}i }zt| �� �}W n tjy@ i Y S 0 |D ]�}|�� D ]�}|}t|t j �r�t |�}|s�|j |v rR||j = qRt|t j �s�|j |v r�||j = t|t j �rR||�}|r�|||j < qR|sR|j |v rR||j = qRqF|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. Nr{ )r r| � ABC_METHODS�reversed�mror� Z ResolveError�valuesr� r r� rR r� r� )r� r� �visitedr� r� �objrT �abstractr� r� r� � unimplemented_abstract_methods� s4 r� z&nodes.ExceptHandler | nodes.Try | Nonec C sB | }t jt jf}|r(t|j|�s(|j}q|r>t|j|�r>|jS dS )z>Return the ExceptHandler or the Try node in which the node is.N)r r� r� r� r� )r� �currentZignoresr� r� r� � find_try_except_wrapper_node� s r� znodes.ExceptHandler | Nonec C s: | � � D ],}t|tjj�r dS t|tj�r| S qdS )zJReturn the ExceptHandler in which the node is, without going out of scope.N)r� r� r� Z scoped_nodesZLocalsDictNodeNGr r� )r� r� r� r� r� �!find_except_wrapper_node_in_scope� s r� c C st t | �}|sdS t|tj�r.|jj}|jj}n tj� dd� |jD ��}|j}t dd� |D ��}t |t t f�}|pr|S )z8Check if the given node is from a fallback import block.Fc s s | ] }|j V qd S r� )r� �r� r[ r� r� r� r� s z)is_from_fallback_block.<locals>.<genexpr>c s s | ]}t |tjtjf�V qd S r� )r� r r� r� )r� r� r� r� r� r� s �)r� r� r r� r� r� �handlersr� r� � from_iterabler� �#_except_handlers_ignores_exceptions� ImportError�ModuleNotFoundError)r� �contextZ other_bodyr� Zhas_fallback_importsZignores_import_errorr� r� r� �is_from_fallback_block� s" ���r� z3tuple[type[ImportError], type[ModuleNotFoundError]])r� � exceptionsr� c s" t t|d�� t� fdd�| D ��S )N)r\ c 3 s | ]}� |�V qd S r� r� r� r r� r� r� r� z6_except_handlers_ignores_exceptions.<locals>.<genexpr>)r rc r� )r� r� r� r r� r� s r� ztype[Exception] | strz list[nodes.ExceptHandler] | None)r� � exceptionr� c s, t | �}t|tj�r(� fdd�|jD �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 s g | ]}t |� �r|�qS r� )rc r� �r� r� r� r� + s z*get_exception_handlers.<locals>.<listcomp>)r� r� r r� r� )r� r� r� r� r� r� �get_exception_handlers s �r� zIterator[nodes.With]c c s$ | � � D ]}t|tj�r|V qdS )zFGet all contextlib.with statements in the ancestors of the given node.N)r� r� r r� )r� � with_noder� r� r� � get_contextlib_with_statements1 s r� )�callr� r� c C s� t |t�s|j}| jD ]h}t|�}t |tj�r@|j|kr~ dS qt |tj�r|j D ]*}t|�}t |tj�rR|j|krR dS qRqdS )z7Check if the given node suppresses the given exception.TF) r� r� r� r� rR r r� r� r� r� )r� r� rN rT �eltZ inferred_eltr� r� r� �_suppresses_exception8 s �� r� c c s` t | �D ]R}|jD ]F\}}t|tj�rt|j�}t|tj�r|�� dkrt ||�r|V qqdS )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 r� rR r� r� rt r� )r� r� r� r( r: rT r� r� r� �get_contextlib_suppressorsN s � � r� z nodes.Raisec C s t | �}t|tj�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� r� r� r� �is_node_inside_try_exceptf s r� c C s t | |�}|rdS tt| |��S )z�Check if the node is in a Try which handles the given exception. If the exception is not given, the function is going to look for bare excepts. T)r� r� r� )r� r� Zmanaging_handlersr� r� r� �node_ignores_exceptiont s r� c C s� t | �r dS | �� }|dur8|jdkr8|�� jtv r8dS | �� D ]"}|jdkr@|�� jtv r@ dS q@| �� D ]$}|j�� | u rl|j dd�rl dS qldS )zWReturn true if the given class node should be considered as an abstract class. TN�ABCMeta�ABCF)Zpass_is_abstract) �is_protocol_classZdeclared_metaclassr� r� � ABC_MODULESr� r� r� r� � is_abstract)r� �metar� �methodr� r� r� �class_is_abstract� s r� )rO �attrr� c C s� z| � |�}W n tjy$ Y dS 0 |d }t|tj�r�t|tjtjf�}|d u rXdS t|j tj �r�t dd� |j j D ��r�dS t|j tj �r�dS dS )NFr Tc s s | ]}t |tj�V qd S r� )r� r �Const)r� �nr� r� r� r� � r� z,_supports_protocol_method.<locals>.<genexpr>)r� r� � NotFoundErrorr� r r� � get_node_first_ancestor_of_typer� � NamedExprrO � BaseContainerr- r� r� )rO r� � attributes�firstZthis_assign_parentr� r� r� �_supports_protocol_method� s" �r� c C s t jt jt jt jf}t| |�S r� )r r� �SetComp�DictComp� GeneratorExpr� )r� Zcomprehensionsr� r� r� �is_comprehension� s �r� )rO r� c C s t | t�ot | t�S r� )r� �GETITEM_METHOD� KEYS_METHOD�rO r� r� r� �_supports_mapping_protocol� s ��r� c C s t | t�S r� )r� �CONTAINS_METHODr� r� r� r� �"_supports_membership_test_protocol� s r� c C s t | t�pt | t�S r� )r� � ITER_METHODr� r� r� r� r� � _supports_iteration_protocol� s �r� c C s t | t�S r� )r� � AITER_METHODr� r� r� r� �"_supports_async_iteration_protocol� s r� c C s t | t�S r� )r� r� r� r� r� r� �_supports_getitem_protocol� s r� c C s t | t�S r� )r� �SETITEM_METHODr� r� r� r� �_supports_setitem_protocol� s r� c C s t | t�S r� )r� �DELITEM_METHODr� r� r� r� �_supports_delitem_protocol� s r� c C s< | � � }|�d�}|�d�}|�d�p.|�d�}|p:|p:|S )NZmixinr� r� )�lowerr< r/ )r� �lnameZis_mixinr� Zis_baser� r� r� �_is_abstract_class_name� s r� c C sL | d urHt | tj�r@t| �r dS t| dd �}|d ur@t|�r@dS | j} q dS )NTr� F)r� r r� r� r� r� r� �r� r� r� r� r� �is_inside_abstract_class� s r� z Callable[[nodes.NodeNG], bool])rO �protocol_callbackr� c C s� t | tj�r4t| �sdS | �� }|d ur4||�r4dS t | tj�rdt| �sLdS | �� rXdS || �rddS t | tj�rtdS t | tj j �r�t | j tj�r�t| j �r�| j } || �S dS �NTF) r� r r� �has_known_bases� metaclassr� r@ Zhas_dynamic_getattrr� r� ZProxy�_proxied)rO r� r� r� r� r� �_supports_protocol� s2 � ��r� F)rO � check_asyncr� c C s |r t }nt}t| |�S r� )r� r� r� )rO r� Zprotocol_checkr� r� r� � is_iterable s r� c C s t | t�S r� )r� r� r� r� r� r� � is_mapping s r� c C s t | t�}|pt| �S r� )r� r� r� )rO � supportedr� r� r� �supports_membership_test s r� )rO r� r� c C s8 t | tj�r.t| t�rdS t|�r.t|�r.dS t| t�S )NT) r� r r� r� �CLASS_GETITEM_METHOD� is_postponed_evaluation_enabled�"is_node_in_type_annotation_contextr� r� )rO r� r� r� r� �supports_getitem% s �r� )rO r: r� c C s t | t�S r� )r� r� �rO r: r� r� r� �supports_setitem0 s r� c C s t | t�S r� )r� r� r� r� r� r� �supports_delitem4 s r� c C s t | dd �}t|�r|� S d S )N�pytype)r� �callable)r� r� r� r� r� �_get_python_type_of_node8 s r� )�compare_constants�compare_constructorszInferenceContext | NonezInferenceResult | None)r� r� r� r� r� c C s� t � }z| j|d�}t|�}W n> tjy4 Y dS ty\ } zt|�W Y d}~n d}~0 0 t|tj �sx|� t |�� z�|D ]�}t |�} | |vr� W dS |r�t|t j �r�t|t j �r�|j|jkr� W dS t|t j�r�t|t j�r�t||�r� W dS |r~t|t j�r~t|t j�r~t||�r~ W dS q~W nX tj�y> Y dS t�yT | Y S t�y~ } zt|�W Y d}~n d}~0 0 t|�dk�r�|S dS )a� 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. If compare_constructors is True and if multiple classes are inferred, constructors with different signatures are held ambiguous and return None. �r� Nr� )r rs �nextr� rf rV r r� r r� r r� r r� rO r� � function_arguments_are_ambiguousr� � class_constructors_are_ambiguous� StopIterationr� ) r� r� r� r� Zinferred_typesZ infer_genrO r& rT Z inferred_typer� r� r� rR ? s^ � � � � � ��� � �� rR i zlist[InferenceResult])r� r� r� c C sX zt | j|d��W S tjy* g Y S tyR } zt|�W Y d }~n d }~0 0 d S )Nr� )r7 rs r� rf rV r )r� r� r& r� r� r� � infer_all� s r� )�func1�func2r� c C s� | � � |� � krdS | jj|jjf| jj|jjfg}|D ]�}d |v rFq8t|d �t|d �krd dS t|� D ]l\}}t|tj�r�t|tj�r�|j |j kr� dS qlt|tj �r�t|tj �r�|j |j kr� dS ql dS qlq8dS )NTr r� F) �argnamesr� r� r� r� �zipr� r r� rO r� r� )r� r� Zpairs_of_defaultsZzippable_defaultZdefault1Zdefault2r� r� r� r� � s& � r� )�class1�class2r� c C sb z | � d�d }|� d�d }W n tjy6 Y dS 0 t|tj�sHdS t|tj�sXdS t||�S )Nr- r F)Z local_attrr� r� r� r r� r� )r� r� Z constructor1Z constructor2r� r� r� r� � s r� )rA r� r� c C sj z| j W S ty Y n0 | jD ]<}t||d�}t|tj�rR|| u sRt||d�s"d| _ dS q"d| _ dS )z=Return true if all base classes of a class could be inferred.r� FT)Z_all_bases_known�AttributeErrorr� rR r� r r� r� )rA r� r� r1 r� r� r� r� � s �� �r� c C s4 | d u p2t | tj�r | jd u p2t | tj�o2| jdkS )Nr )r� r r� rO r� r� r� r� r� r� �is_none� s ��r� z SuccessfulInferenceResult | Nonec C st t � }zF| �� D ]8}t|tj�st|�r*q|�|� t|�dkr W dS qW n tj yb Y dS 0 |rp|� � S dS )z�Return 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) r rs r� r r� r� r r� r� rf �pop)r� �typesZvar_typer� r� r� � node_type� s r� c C s� d}t | tj�sdS | jr"| jjng }|D ]�}t |tj�rB|j}nt |tj�r*|}nq*t |tj�r*|jdkrnq*zt|j � � �}W n t j y� Y q*Y n0 t |tj�r*t ||� S q*dS )z>Check if the given function node is a singledispatch function.)zfunctools.singledispatchz singledispatch.singledispatchF�register)r� r r� rd r� r� rj r9 r� r� rs r� rf r| )r� Zsingledispatch_qnamesrd rg r� �func_defr� r� r� �(is_registered_in_singledispatch_function� s& r� c C sb t | tj�r| j}nt | tj�r&| }nd S t |tj�r@|jdkrDd S t|j�}t |tj�s^d S |S )Nr� ) r� r r� r� rj r9 rR r� r� )r� r� r� r� r� r� � find_inferred_fn_from_register s r� c C s> d}| j r| j jng }|D ] }t|�}|rt||� S qdS )zDCheck if the given function node is a singledispatchmethod function.)z functools.singledispatchmethodz#singledispatch.singledispatchmethodF)rd r r� r| )r� Zsingledispatchmethod_qnamesrd rg r� r� r� r� �.is_registered_in_singledispatchmethod_function s r� r c C sn t | dd�rt| jd �S t | dd�r4t| jd �S t | dd�rNt| jd �S t | dd�rht| jd �S | jS )z�Get 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. � finalbodyF����orelser� r� )r� �get_node_last_linenor� r r� r� r� r� r� r� r� r 0 s r c C s | � � }d|jv S )z<Check if the postponed evaluation of annotations is enabled.r )r� Zfuture_imports)r� �moduler� r� r� r� H s r� c C s� | | j }}t|tj�r"|j|kslt|tj�rV|g |j�|j�|j�|j �|j �R v slt|tj �rp|j |krpdS ||j }}t|tj �r dS q dS )z�Check if node is in type annotation context. Check for 'AnnAssign', function 'Arguments', or part of function return type annotation. TFN)r� r� r � AnnAssign� annotation� Argumentsr Zposonlyargs_annotationsZkwonlyargs_annotationsZvarargannotationZkwargannotationr� rx r )r� Z current_nodeZ parent_noder� r� r� r� N s: �� �������� � � r� )r� r� r� c C sb t dd� | |fD ��sdS | �� D ]:}ztj�||�r>W dS W q" tjjyZ Y q"Y q"0 q"dS )z�Check if first node is a subclass of second node. :param child: Node to check for subclass. :param parent: Node to check for superclass. :returns: True if child is derived from parent. False otherwise. c s s | ]}t |tj�V qd S r� )r� r r� )r� r� r� r� r� r� s r� z!is_subclass_of.<locals>.<genexpr>FT)r- r� r� ZhelpersZ is_subtyper� Z_NonDeducibleTypeHierarchy)r� r� r� r� r� r� �is_subclass_ofl s r c C s" t | dd�}t|o t| ddg��S )z�Check 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. rd Nztyping.overload�overload)r� r� r| )r� rd r� r� r� �is_overload_stub s r )�clsr� c C sr t | tj�sdS | �� tv r dS | jD ]F}z(|�� D ]}|�� tv r4 W dS q4W q& tjyj Y q&Y q&0 q&dS )z�Check 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 r� rt �TYPING_PROTOCOLSr� rs r� rf )r r� Zinf_baser� r� r� r� � s r� )r� r� r� c C s& t | tj�o$t | jtj�o$| jj|kS )z6Checks if node is a function call with the given name.)r� r r� r� r� r� r� r� r� r� �is_call_of_name� s � �r )r� r� r� c C sd |p| j }t|tjtjtjtjf�r:| |ju p8|j�| �S t|tj �rP| |j v S t |d�ob|�| �S )z>Returns true if the given node is being tested for truthiness.r� ) r� r� r r� r� �IfExp�Assert�testr� � Comprehension�ifsr r� r� r� r� �is_test_condition� s r c C s" | j dkrdS tdd� | jD ��S )z Test if ClassDef node is Type.rb Tc s s$ | ] }t |tj�o|jd kV qdS )rb N)r� r r� r� )r� �br� r� r� r� � r� z#is_classdef_type.<locals>.<genexpr>)r� r� r� r� r� r� r� �is_classdef_type� s r z!nodes.ClassDef | astroid.Instance)r� � attr_namer� c C sn | j �|dg�d }|r6t|tj�r6t|jtj�r6dS | jD ],}t|�}|r<t|tj �r<t ||�r< dS q<dS )zQTest if attribute is typed annotation in current node or any base nodes. Nr TF) �locals�getr� r r� r� r r� rR r� � is_attribute_typed_annotation)r� r � attributer� rT r� r� r� r � s$ � � � � ��r c C s | j dko| �� j dkS )N�Enum�enum)r� r� r� r� r� r� �is_enum� s r znodes.AssignName)r� � typing_namer� c C s` t | jtj�sdS | jj}t |tj�r,|j}t |tj�rB|j|ksXt |tj �r\|j |kr\dS dS )z�Test 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 � SubscriptrO r� r� rj r9 )r� r r r� r� r� � is_assign_name_annotated_with� s �� ��r z nodes.For | nodes.Comprehensionc C s� t | jtj�r\t | jjtj�r\| jjjdkr\t| jj�}t |tj �sHdS | j� � � d�d S t | jtj tjf�r�t| j�}t |tj �s�dS | j� � S dS )z�Get 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. r+ Nz.keysr )r� �iterr r� r� rj r9 rR r� � BoundMethod� as_string� rpartitionr� rS �r� rT r� r� r� � get_iterating_dictionary_name� s �� � r$ znodes.Subscriptz nodes.Constc C s" t | j�}t|tj�s td��|S )z�Returns 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)rR �slicer� r r� r� r# r� r� r� �get_subscript_const_value s r& r )� importnoder� r� c C sT t | tj�rP| jrP| �� }t |tj�rPz|j|| jd�W S tyN | Y S 0 |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 Zrelative_to_absolute_namer )r' r� r� r� r� r� �get_import_name s � r) znodes.Ifc C sj t | jtj�rF| jj}t |tj�r(|j}t |tj�rf|�� dkrfdS n t | jtj�rf| j�� dv rfdS dS )zoReturn True if IF stmt is a sys.version_info guard. >>> import sys >>> from typing import Literal zsys.version_infoT> zsix.PY2zsix.PY3F) r� r r �Compare�leftr rO rj r! )r� rO r� r� r� � is_sys_guard2 s � � r, )r� r� r� c s. t � �fdd�� �� �tjtjtjf�D ��S )zaCheck if the given variable name is reassigned in the same scope after the current node. c 3 s$ | ] }|j �ko|j� jkV qd S r� )r� r� )r� �a�r� r� r� r� r� M s �z.is_reassigned_after_current.<locals>.<genexpr>)r� r� r� r r� r� r� r. r� r. r� �is_reassigned_after_currentI s ��r/ c s$ t � �fdd�� �� �tj�D ��S )z^Check if the given variable name is deleted in the same scope after the current node. c 3 s6 | ].}|j D ]"}t|d d��ko*|j� jkV q qdS )r� N)r� r� r� )r� Zdel_noder� r. r� r� r� Y s �z+is_deleted_after_current.<locals>.<genexpr>)r� r� r� r �Deleter. r� r. r� �is_deleted_after_currentU s �r1 c C sF t | j�dkoDt| jd tj�oDt| jd jtj�oD| jd jjtkS )zBChecks whether a function body only consists of a single Ellipsis.r� r )r� r� r� r �ExprrO r� �Ellipsisr� r� r� r� �is_function_body_ellipsis` s ���r4 c C s t | tj�o| j S r� )r� r r� r� r� r� r� r� �is_base_containerj s r5 c C s t | tj�o| j S r� )r� r rS r� r� r� r� r� �is_empty_dict_literaln s r6 c C s t | tj�o t | jt�o | j S r� )r� r r� rO r� r� r� r� r� �is_empty_str_literalr s �r7 c C s( t | tj�o&t | jtj�o&t | jjt�S )zIReturns true if a node is a nodes.Return that returns a constant boolean.)r� r �ReturnrO r� r� r� r� r� r� � returns_boolx s � �r9 c C s( t | tj�o&t | jtj�o&t | jjt�S )zIReturns true if a node is a nodes.Assign that returns a constant boolean.)r� r r� rO r� r� r� r� r� r� � assigned_bool� s � �r: z'type[_NodeT] | tuple[type[_NodeT], ...]z _NodeT | None)r� � ancestor_typer� c C s$ | � � D ]}t||�r| S qdS )zIReturn the first parent node that is any of the provided types (or None).N�r� r� )r� r; r� r� r� r� r� � s r� z/tuple[None, None] | tuple[_NodeT, nodes.NodeNG]c C s0 | }| � � D ] }t||�r&||f S |}q 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 Try ancestor. )NNr< )r� r; r� r� r� r� r� �-get_node_first_ancestor_of_type_and_its_child� s r= c C s� | � � D ]�}t|tj�sqt|jtj�r�|jjdkr6q|j�|jj�d }|sT dS |d }t|tj�rx|j dkrx dS t |j�}t|tj �r�|j du r� dS qt|jtj �r|jjdkr�qt |jj�}t|tj�r|jdkr dS qdS )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� rR r� rO rj r9 r� r )r� r� Z lookup_resultZmaybe_import_fromrT �inferred_moduler� r� r� �in_type_checking_block� s8 �� ��r? ztuple[str, ...])r� �names_to_checkr� c C s� t | tj�rbz| �| j�d d }W n ty8 Y dS 0 t |tj�r�|jdko^|�| j�|v S n6t | tj �r�t | j �}t |tj �o�|jdko�| j |v S dS )zkCheck if `node` is a member of the `typing` module and has one of the names from `names_to_check`. r� r Fr} )r� r r� r� r� rL r� r� Z real_namerj rR r� r r9 )r� r@ Z import_fromr> r� r� r� �is_typing_member� s" � ��rA r )r� r� r� c s$ t | tj�o"t� fdd�| jD ��S )zEReturns True if stmt is inside the else branch for a parent For stmt.c 3 s | ]}|� � �p|� kV qd S r� )r� )r� Z else_stmt�r� r� r� r� � s z%in_for_else_branch.<locals>.<genexpr>)r� r r� r� r )r� r� r� rB r� �in_for_else_branch� s �rC z&nodes.AssignName | nodes.BaseContainerz Iterator[str])r� r� c c sJ t | tj�r | jdurF| jV n&t | tj�rF| jD ]}t|�E dH q2dS )zBYield the names of assignment targets, accounting for nested ones.N)r� r r� r� r� r� � find_assigned_names_recursive)r� r� r� r� r� rD � s rD z+nodes.For | nodes.Comprehension | nodes.SetzIterator[bool]c c sn t | tj�rdV nVt | tj�r<| jD ]}t|�E dH q&n.t | tjtjf�rj| jjD ]}t|�E dH qVdS )z6Yield ``True`` if a Starred node is found recursively.TN) r� r �Starred�Setr� �has_starred_node_recursiver� r r )r� r� r� r� r� rG � s rG c C s� zx| � � D ]h}t|tjtjf�r( W dS t|d�s: W dS t|�d��}|j |u rZ W dS t |dd�dur W dS q W dS t j y� Y dS 0 dS )zgReturn whether any inferred value of `node` is hashable. When finding ambiguity, return True. T�igetattrr4 rO NF) rs r� r r� r r� rY r� rH r� r� r� rf )r� rT Zhash_fnr� r� r� � is_hashable s rI )r+ �rightr� c C sj t | tj�rZt |tj�rZz*t| �jt|�jkr4W dS | j} |j}W q tyV Y dS 0 q | �� |�� kS )NF)r� r r r& rO r� r! )r+ rJ r� r� r� �subscript_chain_is_equal s �� rK z#nodes.AssignName | nodes.AssignAttr)r� �sider� c C sv t |tj�r(t | tj�r$| j|jkS dS t |tj�rPt | tj�rP| �� |�� kS t |tj�rrt | tj�rrt | |�S dS )zKDetermine whether the target name-like node is referenced in the side node.F) r� r r� r� r� rj � AssignAttrr! r rK )r� rL r� r� r� � _is_target_name_in_binop_side( s rN z nodes.Assignztuple[bool, str]c C s� t | jtj�sdS | j}| jd }t |tjtjtjf�s<dS t |jtj �r`t |jjt t f�r`dS t |jtj �s|t |j tj �r�dS t||j�r�d|jfS |jtv r�t||j �r�t|j�}t |tj �r�t |jt�r�d|jfS dS dS )zjDetermine if the node is assigning itself (with modifications) to itself. For example: x = 1 + x )Fr) r T)r� rO r �BinOpr� r� rM r r+ r� r� �bytesr� rJ rN �op�COMMUTATIVE_OPERATORSrR r )r� �binopr� Z inferred_leftr� r� r� �is_augmented_assign8 s2 � � � � rT z list[str])�qualified_module_namer� c s$ | � d�� � fdd�tt� ��D �S )z�Split the names of the given module into subparts. For example, _qualified_name_parts('pylint.checkers.ImportsChecker') returns ['pylint', 'pylint.checkers', 'pylint.checkers.ImportsChecker'] r c s" g | ]}d � � d|d � ��qS )r r r� )�joinrz �r� r� r� r� i r� z)_qualified_name_parts.<locals>.<listcomp>)�split�ranger� )rU r� rW r� �_qualified_name_parts` s rZ )rU �ignored_modulesr� c C sF t |�}t| �D ]0}||v r" dS |D ]}t�||�r& dS q&qdS r� )r rZ �fnmatch)rU r[ Zcurrent_module�ignorer� r� r� �is_module_ignoredl s r^ c s" t � tj�o t� fdd�tD ��S )Nc 3 s | ]}� j |u V qd S r� r� )r� rO r� r� r� r� | s z%is_singleton_const.<locals>.<genexpr>)r� r r� r� �SINGLETON_VALUESr� r� r� r� �is_singleton_const{ s �r` c C s t | jtj�s t | jtj�r*t | jtj�r.dS z�| j�� D ]�}t|d�r\|� � t v r\ W dS t |t j �r~t |j t j�r~|j j }t |tj�r:t |tj�r�t | jtj�r:t |jtj�r:t|j� }r:t|d�r:|� � g t�t�R v r: W dS q:W n tt jf�y Y n0 dS )z�Detect call to exit(), quit(), os._exit(), sys.exit(), or functions annotated with `typing.NoReturn` or `typing.Never`. Frt T)r� r� r rj r� r� r� rs rY rt �TERMINATING_FUNCS_QNAMESr� r r� r? r� �AsyncFunctionDef�Awaitrx rR r r r� rf )r� rT Z inferred_funcr� r� r� �is_terminating_func� sT � � �� �� � � � � �� ����rd )r� rA r� c C s, z|� | � W dS tjy& Y dS 0 d S r� )r� r� r� )r� rA r� r� r� � is_class_attr� s re )rQ r� c C s 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 in�in�is not�is) rg rf rk rj ri rh rm rl ro rn r� )rQ r� r� r� �get_inverse_comparator� s � �rp zGnodes.Compare | nodes.Name | nodes.UnaryOp | nodes.BoolOp | nodes.BinOp)� test_noder� c C s� d| � � � �}t| tj�r&| j� � }n�t| tj�rDd| � � � d�}n�t| tj�r�| j}| jd \}}tj tjtjtj tj f}t||�r�d|� � � d�n|� � }t||�r�d|� � � d�n|� � }|� dt |�� d|� �}|S )Nznot znot (r r r � ) r! r� r �UnaryOp�operand�BoolOpr* r+ �opsr� r r� rp )rq �msg�lhsrv �rhsZlower_priority_expressionsr� r� r� �not_condition_as_string� s0 � ����rz i� znodes.LocalsDictNodeNG)rA r� r� c C sb zt | �|��}W n ttfy* Y dS 0 z || }W n tyL Y dS 0 t|tj�r^|S dS )z Get overridden method if any.N)r� Zlocal_attr_ancestorsr� �KeyErrorr� r r� )rA r� r� Z meth_noder� r� r� �overridden_method� s r| r )r� c C s( t ttttttg} | D ] }|�� qdS )z-Clear caches holding references to AST nodes.N)r� rC r� r r| r� rR � cache_clear)Z caches_holding_node_referencesZlrur� r� r� �clear_lru_caches s � r~ c C sd | � � }t|tj�r.|�d�r.|�� �� dkr2dS |j�d�}|du rJdS | j dd� |d j D �v S ) z_Return `True` if `node` is an Enum member (is an item of the `__members__` container). z enum.Enumr F� __members__Nc S s g | ]\}}|j �qS r� r� )r� rO Zname_objr� r� r� r� % r� z"is_enum_member.<locals>.<listcomp>r ) r� r� r r� Z is_subtype_ofr� rt r r r� r� )r� r� �membersr� r� r� �is_enum_member s ��� r� )N)NN)N)F)N)N)N)N)�r � __future__r r# r r\ r� r5 rD r �collections.abcr r r � functoolsr r r r} r r r Zastroid.objectsr� r r r Zastroid.contextr Zastroid.exceptionsr Zastroid.nodes._base_nodesr r Zastroid.typingr r Zpylint.constantsr r r Zpylint.checkersr r> r r ZAstCallbackMethodr� r� r� r� r� rX r� r� � frozensetr rR r� r� Z NEXT_METHODr� r� r� r� r� r� Z_SPECIAL_METHODS_PARAMSr� ZSPECIAL_METHODS_PARAMSr Z PYMETHODSZ SUBSCRIPTABLE_CLASSES_PEP585r_ ra rV r� r� r� r� r� �__dict__�copyr� r� r� r� r� r� r� r� r� r� r� r r r r r" r' r. r8 r= rB rC rH rP rU rZ rc rh rk rn rp rq 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� 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/ r1 r4 r5 r6 r7 r9 r: r� r= r? rA rC rD rG rI rK rN rT rZ r^ r` rd re rp rz r| r~ r� r� r� r� r� �<module> s� �� &@�n��+� 0: L " � 2�4 ���� ! ��(A � � # � ! ( 1
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка