Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/pylint/checkers/__pycache__/variables.cpython-39.pyc
Ðазад
a n�h � @ s U d Z ddlmZ ddlZddlZddlZddlZddlZddlZddlm Z ddl m Z m Z m Z ddlmZ ddlmZ ddlmZmZmZ ddlZddlZdd lmZmZmZmZ dd l m Z dd l m Z dd l m!Z!m"Z" dd l#m$Z$m%Z%m&Z&m'Z'm(Z( ddl)m*Z*m+Z+ ddl,m-Z-m.Z.m/Z/m0Z0 ddl1m2Z2 e�r@ddl3m4Z4 e�5d�Z6dZ7e�5d�Z8ddiZ9dZ:dZ;e<h d��Z=ej>j?ej>j@ej>jAejjBjCfZDejEejFejGejHejIejJejKfZLG dd� de�ZMd d d d �d d!�ZNd"d#d d$�d%d&�ZOd'd(d(d)d*�d+d,�ZPd-d d.d/�d0d1�ZQd2d3d4�d5d6�ZRd d(d)d7�d8d9�ZSd:d;d)d<�d=d>�ZTd?d;d@�dAdB�ZUd'd)dC�dDdE�ZVdFdGd)dH�dIdJ�ZWdKdLdMdNdOdPdQdRdSdTdUdVdWdXdYdZd[d\d]d^d_d`dagifdbdcddd`degifdfdgdhdidjdk�ZXdleYdm< G dndo� doe�ZZG dpdq� dq�Z[G drds� dse!�Z\dtdudv�dwdx�Z]dS )yz#Variables checkers for Python code.� )� annotationsN)� defaultdict)� Generator�Iterable�Iterator)�Enum)�cached_property)� TYPE_CHECKING�Any� NamedTuple)�bases� extract_node�nodes�util)� _base_nodes)�InferenceResult)� BaseChecker�utils)�in_type_checking_block�is_module_ignored� is_postponed_evaluation_enabled� is_sys_guard�overridden_method)� TYPING_NEVER�TYPING_NORETURN)� CONTROL_FLOW�HIGH� INFERENCE�INFERENCE_FAILURE)�MessageDefinitionTuple)�PyLinterz^_{2}[a-z]+_{2}$� __future__z_.*|^ignored_|^unused_Z_py_abc�abczbuiltins.range�typing>5 � ValuesView�Tuple�KeysView�Text� Collection�SupportsComplexr � ItemsView� SupportsRound�Counter�ContextManager�Optionalr �Callable� Coroutine� DefaultDictr �AsyncGenerator�AsyncContextManager� Awaitable�Pattern� SupportsFloat�Hashable�Generic�MutableMapping�TypeVar� SupportsBytes�BinaryIO�ClassVar� ByteString�List�Set�MutableSequence�Sequence�Mapping� FrozenSet� MutableSetr �Type� AbstractSet�AnyStr�Deque� SupportsAbs� MappingView�Dict� SupportsIntr � AsyncIterable� Reversible�Sized�Union� Container� AsyncIteratorc @ s e Zd ZdZdZdZdS )�VariableVisitConsumerActionz�Reported by _check_consumer() and its sub-methods to determine the subsequent action to take in _undefined_and_used_before_checker(). Continue -> continue loop to next consumer Return -> return and thereby break the loop r � N)�__name__� __module__� __qualname__�__doc__�CONTINUE�RETURN� r\ r\ ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/pylint/checkers/variables.pyrT � s rT �nodes.ImportFrom�strz bool | None��stmt�name�returnc C s\ z| � | j�}W n tjy& Y dS 0 |j�|g �D ] }t|tj�r6|jt kr6 dS q6dS )z9Check if the name is a future import from another module.NT) �do_import_module�modname�astroid�AstroidBuildingError�locals�get� isinstancer � ImportFrom�FUTURE)ra rb �moduleZ local_noder\ r\ r] �_is_from_future_import� s rn � nodes.Assignr )�node�inferredrc c C s� d}t |t�r@t | tj�r&| j�� }nt | tj�r<| j�� }|S |�� j }| �� j |kr�| j |j krvd|�� � d�}q�|j r�d|j � �}n|j r�d|j � d|� �}|S )z~Return extra information to add to the message for unpacking-non-sequence and unbalanced-tuple/dict-unpacking errors. � �'zdefined at line z of ) rj � DICT_TYPESr �Assign�value� as_string�For�iter�rootrb �lineno)rp rq �moreZinferred_moduler\ r\ r] �_get_unpacking_extra_info� s r} � nodes.Name�nodes.LocalsDictNodeNG�bool)rp �frame�defframerc c C s d }}|r |j r |j �� }|r0|j r0|j �� }t|tj�rZ||urZ|t�| tj�u rZdS t|tj�r�|�|�r|| j |j k S t| j tjtj f�s�dS g }|p�||fD ]@}|}|r�t|tjtj f�s�|� |� q�|j r�|j �� }q�q�q�q�t t|��dkr�dS |j |j k S )a� Detect that the given frames share a global scope. Two frames share a global scope when neither of them are hidden under a function scope, as well as any parent scope of them, until the root scope. In this case, depending from something defined later on will only work if guarded by a nested function definition. Example: class A: # B has the same global scope as `C`, leading to a NameError. # Return True to indicate a shared scope. class B(C): ... class C: ... Whereas this does not lead to a NameError: class A: def guard(): # Return False to indicate no scope sharing. class B(C): ... class C: ... NFrU )�parent�scoperj r �ClassDefr � get_node_first_ancestor_of_type� FunctionDef� parent_ofr{ � Arguments�Module�append�len�set)rp r� r� Z def_scoper� Z break_scopesZ current_scope� parent_scoper\ r\ r] �_detect_global_scope� s< ��� r� � nodes.ImportzGenerator[InferenceResult])rp rb rc c C s t j�� }||_| j|dd�S )NF)�asname)rf �contextZInferenceContextZ lookupname�infer)rp rb r� r\ r\ r] �_infer_name_module� s r� � dict[str, list[nodes.NodeNG]]z(list[tuple[str, _base_nodes.ImportNode]]�� not_consumedrc c C s� i }| � � D ]�\}}tdd� |D ��r(q |D ]�}t|tjtjf�sDq,|jD ]b}d}|d }|dkrh|}n0d}|�|�r�|�d�dkr�d }|s�||v r�|}|rJ||vrJ|||< qJq,q t |� � d d � d �S ) a Try to fix imports with multiple dots, by returning a dictionary with the import names expanded. The function unflattens root imports, like 'xml' (when we have both 'xml.etree' and 'xml.sax'), to 'xml.etree' and 'xml.sax' respectively. c s s* | ]"}t |tj�o t |�� tj�V qd S �N)rj r � AssignName� assign_type� AugAssign��.0ra r\ r\ r] � <genexpr> s � z#_fix_dot_imports.<locals>.<genexpr>Nr �*F�.���Tc S s | d j S �NrU )� fromlineno)�ar\ r\ r] �<lambda>- � z"_fix_dot_imports.<locals>.<lambda>)�key) �items�anyrj r rk �Import�names� startswith�find�sorted) r� r� rb �stmtsra �importsZ second_nameZimport_module_nameZname_matches_dotted_importr\ r\ r] �_fix_dot_imports s2 � � � r� )rb r� rc c C sr | t |�tj��v rdS |�tjtjf�}|D ]>}|jD ]2\}}|rV|| krj dS q8|r8|| kr8 dS q8q.dS )z�Detect imports in the frame, with the required *name*. Such imports can be considered assignments if they are not globals. Returns True if an import for the given name was found. FT)�_flattened_scope_names�nodes_of_classr �Globalr� rk r� )rb r� r� Z import_node� import_name� import_aliasr\ r\ r] �_find_frame_imports0 s r� z%nodes.Global | _base_nodes.ImportNode�set[str])ra � global_namesrc c C s6 | j D ]*\}}|r"||v r0 dS q||v r dS qdS )NTF)r� )ra r� r� r� r\ r\ r] �_import_name_is_globalF s r� z'Iterator[nodes.Global | nodes.Nonlocal])�iteratorrc c C s dd� | D �}t tj�|��S )Nc s s | ]}t |j�V qd S r� )r� r� r� r\ r\ r] r� W r� z)_flattened_scope_names.<locals>.<genexpr>)r� � itertools�chain� from_iterable)r� �valuesr\ r\ r] r� T s r� )� name_noderc c s6 � � � }|�tj�}t� fdd�|D ��p4t� j|�S )zEChecks if name_node has corresponding assign statement in same scope.c 3 s | ]}|j � j kV qd S r� �rb )r� r� �r� r\ r] r� _ r� z$_assigned_locally.<locals>.<genexpr>)r� r� r r� r� r� rb )r� Zname_node_scopeZ assign_stmtsr\ r� r] �_assigned_locally[ s �r� � nodes.NodeNG�nodes.FunctionDef)ra r� rc c C sf t jt jt jt jf}|jt j|d�D ]<}t�|j �}t� |�r$t |dd �dkr$| j |j k r$ dS q$dS )N)Z skip_klassrb rh TF) r r� r� r� rk r� �Callr � safe_infer�funcZis_builtin_object�getattrr{ )ra r� Z skip_nodes�callrq r\ r\ r] �_has_locals_call_after_noded s � �� r� )z#Using variable %r before assignment�used-before-assignmentaf Emitted when a local variable is accessed before its assignment took place. Assignments in try blocks are assumed not to have occurred when evaluating associated except/finally blocks. Assignments in except blocks are assumed not to have occurred when evaluating statements outside the block, except when the associated try block contains a return statement.)zUndefined variable %r�undefined-variablez,Used when an undefined variable is accessed.)z%Undefined variable name %r in __all__�undefined-all-variablez>Used when an undefined variable name is referenced in __all__.)z7Invalid object %r in __all__, must contain only strings�invalid-all-objectz;Used when an invalid (non-string) object occurs in __all__.)z1Invalid format for __all__, must be tuple or list�invalid-all-formatz(Used when __all__ has an invalid format.)z,Possibly using variable %r before assignment� possibly-used-before-assignmentzqEmitted when a local variable is accessed before its assignment took place in both branches of an if/else switch.)zNo name %r in module %r�no-name-in-modulez-Used when a name cannot be found in a module.)z0Global variable %r undefined at the module level�global-variable-undefinedzsUsed when a variable is defined through the "global" statement but the variable is not defined in the module scope.)z-Using global for %r but no assignment is done� global-variable-not-assignedz�When a variable defined in the global scope is modified in an inner scope, the 'global' keyword is required in the inner scope only if there is an assignment operation done in the inner scope.)zUsing the global statement�global-statementz�Used when you use the "global" statement to update a global variable. Pylint discourages its usage. That doesn't mean you cannot use it!)z.Using the global statement at the module level�global-at-module-levelzTUsed when you use the "global" statement at the module level since it has no effect.)z Unused %s� unused-importz5Used when an imported module or variable is not used.)zUnused variable %r�unused-variablez-Used when a variable is defined but not used.)zUnused argument %r�unused-argumentz4Used when a function or method argument is not used.)z.Unused import(s) %s from wildcard import of %s�unused-wildcard-importz]Used when an imported module or variable is not used from a `'from X import *'` style import.)z-Redefining name %r from outer scope (line %s)�redefined-outer-namezUUsed when a variable's name hides a name defined in an outer scope or except handler.)zRedefining built-in %r�redefined-builtinz5Used when a variable or function override a built-in.)z)Using possibly undefined loop variable %r�undefined-loop-variablez�Used when a loop variable (i.e. defined by a for loop or a list comprehension or a generator expression) is used outside the loop.ziPossible unbalanced tuple unpacking with sequence %s: left side has %d label%s, right side has %d value%s�unbalanced-tuple-unpackingz>Used when there is an unbalanced tuple unpacking in assignmentZ old_names)ZE0632z old-unbalanced-tuple-unpackingz%Attempting to unpack a non-sequence%s�unpacking-non-sequencezKUsed when something which is not a sequence is used in an unpack assignment)ZW0633zold-unpacking-non-sequence)z Cell variable %s defined in loop�cell-var-from-loopz�A variable used in a closure is defined in a loop. This will result in all closures using the same value for the closed-over variable.)zPossibly unused variable %r�possibly-unused-variablez�Used when a variable is defined but might not be used. The possibility comes from the fact that locals() might be used, which could consume or not the said variable)z"Invalid assignment to %s in method�self-cls-assignmentzKInvalid assignment to self or cls in instance or class method respectively.)z!Invalid index for iterable length�potential-index-errorzREmitted when an index used on an iterable goes beyond the length of that iterable.)z_Possible unbalanced dict unpacking with %s: left side has %d label%s, right side has %d value%s�unbalanced-dict-unpackingzIUsed when there is an unbalanced dict unpacking in assignment or for loop)ZE0601ZE0602ZE0603ZE0604ZE0605ZE0606ZE0611ZW0601ZW0602ZW0603ZW0604ZW0611ZW0612ZW0613ZW0614ZW0621ZW0622ZW0631ZW0632ZE0633ZW0640ZW0641ZW0642ZE0643ZW0644z!dict[str, MessageDefinitionTuple]�MSGSc @ s2 e Zd ZU dZded< ded< ded< ded< d S ) � ScopeConsumerz)Store nodes and their consumption states.r� � to_consume�consumed�$defaultdict[str, list[nodes.NodeNG]]�consumed_uncertainr_ � scope_typeN)rV rW rX rY �__annotations__r\ r\ r\ r] r� s r� c @ s� e Zd ZdZdddd�dd�Zdd�d d �Zd d�d d �Zedd�dd��Zedd�dd��Z edd�dd��Z edd�dd��Z dddd�dd�Z d d d �d d �Z ddd!d"�d#d$�Zdd%d!d&�d'd(�Zdddd)�d*d+�Zedd,d!d-�d.d/��Zeddd0dd1�d2d3��Zeddd!d"�d4d5��Zeddd!d"�d6d7��Zedd8d!d9�d:d;��Zed0d<d!d=�d>d?��Zedd0dd@�dAdB��Zedd0dddC�dDdE��ZdFS )G� NamesConsumerzQA simple class to handle consumed, to consume and scope type info of node locals.r� r_ �None)rp r� rc c C s8 t t�|j�i t�t�|�| _|| _t� | _ t� | _ d S r� ) r� �copyrh � collectionsr �list�_atomicrp r� � names_under_always_false_test�#names_defined_under_one_branch_only)�selfrp r� r\ r\ r] �__init__ s �zNamesConsumer.__init__�rc c C s� dd� | j j�� D �}dd� | j j�� D �}dd� | j j�� D �}d�|�}d�|�}d�|�}d|� d|� d|� d | j j� d � S ) Nc S s g | ]\}}|� d |� ��qS �z->r\ �r� �k�vr\ r\ r] � <listcomp>$ r� z*NamesConsumer.__repr__.<locals>.<listcomp>c S s g | ]\}}|� d |� ��qS r� r\ r� r\ r\ r] r� % r� c S s g | ]\}}|� d |� ��qS r� r\ r� r\ r\ r] r� & s �, z to_consume : z consumed : z consumed_uncertain: z scope_type : � )r� r� r� r� r� �joinr� )r� Z _to_consumesZ _consumedZ_consumed_uncertainZ to_consumesr� r� r\ r\ r] �__repr__# s" � ����zNamesConsumer.__repr__z Iterator[Any]c C s t | j�S r� )ry r� �r� r\ r\ r] �__iter__3 s zNamesConsumer.__iter__r� c C s | j jS r� )r� r� r r\ r\ r] r� 6 s zNamesConsumer.to_consumec C s | j jS r� )r� r� r r\ r\ r] r� : s zNamesConsumer.consumedr� c C s | j jS )a� Retrieves nodes filtered out by get_next_to_consume() that may not have executed. These include nodes such as statements in except blocks, or statements in try blocks (when evaluating their corresponding except and finally blocks). Checkers that want to treat the statements as executed (e.g. for unused-variable) may need to add them back. )r� r� r r\ r\ r] r� > s z NamesConsumer.consumed_uncertainc C s | j jS r� )r� r� r r\ r\ r] r� J s zNamesConsumer.scope_type�list[nodes.NodeNG])rb �consumed_nodesrc c s> � fdd�| j | D �}� | j|< |r2|| j |< n| j |= dS )z�Mark the given nodes as consumed for the name. If all of the nodes for the name were consumed, delete the name from the to_consume dictionary c s g | ]}|t � �vr|�qS r\ )r� �r� �n�r r\ r] r� T r� z2NamesConsumer.mark_as_consumed.<locals>.<listcomp>N)r� r� )r� rb r Z unconsumedr\ r r] �mark_as_consumedN s z NamesConsumer.mark_as_consumedr~ �list[nodes.NodeNG] | None�rp rc c s� � j }� j}| j�|�}� �� }|rht|tj�rh||d jkrh|d jjd }t|tj �rh|j |krhd}|r�t|tj �r�|j � kr�|j |v r�d}t � fdd�� �� �� D ��r�|S t�� �r�|S |rև fdd�|D �}|�r| �|� �}| j� j |7 < t|���fdd�|D �}|�rX| �|� |�}| j� j |7 < t|���fdd�|D �}|�r�| �|||�}| j� j |7 < t|���fd d�|D �}|�r�| �||�}| j� j |7 < t|���fd d�|D �}|S ) aG Return a list of the nodes that define `node` from this scope. If it is uncertain whether a node will be consumed, such as for statements in except blocks, add it to self.consumed_uncertain instead of returning it. Return None to indicate a special case that needs to be handled by the caller. r Nc 3 s& | ] }t |tj�o � j|jv V qd S r� �rj r �Nonlocalrb r� �r� �child�rp r\ r] r� { s �z4NamesConsumer.get_next_to_consume.<locals>.<genexpr>c s. g | ]&}t |�� tj�r&|�� �� �r|�qS r\ )rj � statementr � ExceptHandlerr� r r r\ r] r� � s �z5NamesConsumer.get_next_to_consume.<locals>.<listcomp>c s g | ]}|� vr|�qS r\ r\ r ��uncertain_nodes_setr\ r] r� � r� c s g | ]}|� vr|�qS r\ r\ r r r\ r] r� � r� c s g | ]}|� vr|�qS r\ r\ r r r\ r] r� � r� c s g | ]}|� vr|�qS r\ r\ r r r\ r] r� � r� )rb r� r� ri r rj r ru �targetsr� rx ry �targetr� r� � get_children�VariablesChecker�%_comprehension_between_frame_and_node�_uncertain_nodes_if_testsr� r� �!_uncertain_nodes_in_except_blocks�=_uncertain_nodes_in_try_blocks_when_evaluating_finally_blocks�<_uncertain_nodes_in_try_blocks_when_evaluating_except_blocks)r� rp rb � parent_node� found_nodes�node_statement�lhs�uncertain_nodesr\ )rp r r] �get_next_to_consume\ s� � � � ��� ��� � � �����z!NamesConsumer.get_next_to_consumer� )rb rp rc c s� t |tj�rb|}|jr2tdd� |�tj�D �d�}|r<|jng }t�� |�p`t � fdd�|D ��S t |tj tj tj f�r�t�� |�S t |tj �s�dS t|�tjtj��r�dS t�� |�r�dS t |jtj�r�|jjn|j}t�|�}d}d}|D ]>} t | tj��sd}q�| j} |�p | tk�o | }|�o*| }q�|�rT|�rT| j�� � | �� |j �S | �� |j �} | �� |j �} | | A �r�| j �� � n� | j v �r�| j � � � | �o�| S )zyReturn True if there is a path under this `if_node` that is inferred to define `name`, raise, or return. c s s | ] }|V qd S r� r\ r r\ r\ r] r� � r� zINamesConsumer._inferred_to_define_name_raise_or_return.<locals>.<genexpr>Nc 3 s | ]}t �� |�V qd S r� �r� �)_defines_name_raises_or_returns_recursive�r� �handlerr� r\ r] r� � s �FT) rj r �Try� finalbody�nextr� �handlersr� r$ �all�Withrx �While�Ifr� �Break�Continue� _defines_name_raises_or_returns�test� NamedExprrv r � infer_all�Const�NotImplementedr� �add�_branch_handles_name�orelse�bodyr� �remove) r� rb rp Ztry_except_noder* r2 � all_inferredZonly_search_ifZonly_search_elserq �valZif_branch_handlesZelse_branch_handlesr\ r� r] �(_inferred_to_define_name_raise_or_return� sX �� �� z6NamesConsumer._inferred_to_define_name_raise_or_returnzIterable[nodes.NodeNG])rb r: rc c s t � �fdd�|D ��S )Nc 3 sD | ]<}t �� |�p:t|tjtjtjtjtjf�o:�� � |�V qd S r� ) r� r1 rj r r. r' r, rx r- r> )r� Z if_body_stmt�rb r� r\ r] r� � s � �� z5NamesConsumer._branch_handles_name.<locals>.<genexpr>)r� )r� rb r: r\ r? r] r8 � s �z"NamesConsumer._branch_handles_name)r rp rc c s� g }|D ]�}t |tj�r |j}n t |tjtjf�r� j}nq� fdd�|�� D �}|sXq|d }t � tj�r~� �� |�� ur~q|�� �r�q|d }t � � |�r�q| � ||�r�q|� |� q|S )z�Identify nodes of uncertain execution because they are defined under if tests. Don't identify a node if there is a path that is inferred to define the name, raise, or return (e.g. any executed if/elif/else branch). c s& g | ] }t |tj�r|�� �s|�qS r\ )rj r r. r� r r r\ r] r� s �z;NamesConsumer._uncertain_nodes_if_tests.<locals>.<listcomp>r r� ) rj r r� rb r� rk �node_ancestorsr� r� r� �_node_guarded_by_same_testr> r� ) r� r rp r! � other_noderb Zall_ifZ closest_ifZouter_ifr\ r r] r s6 � �� z'NamesConsumer._uncertain_nodes_if_testsznodes.If)rp �other_ifrc c C s� |j �� }t�|j �}| �� D ]�}t|tj�s0q |j �� |krD dS t|j tj�rTq t�|j �}t |�t |�kr t dd� g |�|�R D ��r�q dd� |D �dd� |D �kr�q dS q dS )a3 Identify if `node` is guarded by an equivalent test as `other_if`. Two tests are equivalent if their string representations are identical or if their inferred values consist only of constants and those constants are identical, and the if test guarding `node` is not a Name. Tc s s | ]}t |tj� V qd S r� )rj r r5 �r� r2 r\ r\ r] r� K s �z;NamesConsumer._node_guarded_by_same_test.<locals>.<genexpr>c S s h | ] }|j �qS r\ �rv rD r\ r\ r] � <setcomp>P r� z;NamesConsumer._node_guarded_by_same_test.<locals>.<setcomp>F) r2 rw r r4 r@ rj r r. �Namer� r� )rp rC Zother_if_test_as_stringZother_if_test_all_inferred�ancestorr< r\ r\ r] rA 8 s* ��z(NamesConsumer._node_guarded_by_same_test�_base_nodes.Statement)r rp r rc c sf g }| D �]V}|� � }t�|tj�}|s*q|�� �r6q|j}tdd� |jD ��}tdd� |j D ��} tdd� |j D ��} tdd� |j D ��} | r�t |jtj tj f�r�|j�|�r�q|s�| s�| �rFt |jtj �r�||jjv r�|j�|�r�|�|� nTt |jtj ��r*||jj v �r*|j�|��r*|�|� n t� fdd�|jD ���rFqt�� |��rVq|�|� q|S )z}Return any nodes in ``found_nodes`` that should be treated as uncertain because they are in an except block. c s s | ]}t |tj�V qd S r� �rj r �Return)r� Z try_statementr\ r\ r] r� o s �zBNamesConsumer._uncertain_nodes_in_except_blocks.<locals>.<genexpr>c s s | ]}t |tj�V qd S r� rJ �r� Zelse_statementr\ r\ r] r� s s �c s s4 | ],}t |tj�o*t |jtj�o*t�|j�V qd S r� )rj r �Exprrv r� r �is_terminating_funcrL r\ r\ r] r� w s � �c s s | ]}t |tj�V qd S r� )rj r r0 rL r\ r\ r] r� } s �c 3 s | ]}t �� j|�V qd S r� )r� r$ rb r% r r\ r] r� � s ��)r r r� r r r� r� r� r: r9 rj rx r- r' r( r� r+ r* r� � _check_loop_finishes_via_except) r rp r r! rB �other_node_statement�closest_except_handlerZclosest_try_exceptZtry_block_returnsZelse_block_returnsZelse_block_exitsZelse_block_continuesr\ r r] r X sj � ������ � � � � � � � � z/NamesConsumer._uncertain_nodes_in_except_blocksc s� t |tjtjtjtjf�r dS t |tj�rjt |jtj�rjt � |j�rHdS t |jj tj �rj|jj j dkrjdS t |tj�r�|jr�t |jtj�r�|jj � kr�dS t |tj�r�|jD ]D}t �|�D ]4}t |tj�r�|j}t |tj�r�|j � kr� dS q�q�t |tj��r$t� fdd�|�tj�D ���r$dS t |tjtjf��rVt� fdd�|jD ���rVdS t |tj ��r�t� fdd�|j D ���r�dS t |tj tj f��r�|j � k�r�dS t |tj ��r�|j �r�|j j � k�r�dS dS )NT� assert_neverc 3 s | ]}|j j� kV qd S r� )r rb )r� Zchild_named_exprr� r\ r] r� � s �z@NamesConsumer._defines_name_raises_or_returns.<locals>.<genexpr>c 3 s@ | ]8}|d r|d � kp6|d � kp6|d � � d �V qdS )rU r r� N)r� )r� Z node_namer� r\ r] r� � s � �c 3 s, | ]$}t |d tj�o"|d j� kV qdS )rU N�rj r r� rb �r� �itemr� r\ r] r� � s �F)!rj r �Raise�AssertrK r0 rM rv r� r rN r� rG rb � AnnAssignr r� ru r Zget_all_elements�Starredr. r� r� r3 r� rk r� r, r� r� r� r )rb rp r �eltr\ r� r] r1 � sb � � �� � � � � � �� �z-NamesConsumer._defines_name_raises_or_returnsc sz |� � D ]l}t�� |�r dS t|tjtjf�rPt� fdd�|� � D ��rP dS t|tj�r|j st� � |�r dS qdS )zaReturn True if some child of `node` defines the name `name`, raises, or returns. Tc 3 s | ]}t �� |�V qd S r� )r� r1 )r� Z nested_stmtr� r\ r] r� � s �zJNamesConsumer._defines_name_raises_or_returns_recursive.<locals>.<genexpr>F) r r� r1 rj r r. r, r� r' r( r$ )rb rp ra r\ r� r] r$ � s � �� �z7NamesConsumer._defines_name_raises_or_returns_recursive� nodes.Try)rp �other_node_try_exceptrc c s� |j s dS t�� tjtjf�}|du r*dS t� fdd�|j D ��sFdS |j D ]}t|tj�rL|} qjqLdS dddd�d d �}|||�s�|� � D ]$}t|tjtjf�r�|||�r� q�q�dS |j D ]}t � ||�r� q�q�d S dS ) aL Check for a specific control flow scenario. Described in https://github.com/pylint-dev/pylint/issues/5683. A scenario where the only non-break exit from a loop consists of the very except handler we are examining, such that code in the `else` branch of the loop can depend on it being assigned. Example: for _ in range(3): try: do_something() except: name = 1 <-- only non-break exit from loop else: break else: print(name) FNc 3 s | ]}|� u p|� � �V qd S r� �r� rL r r\ r] r� s �z@NamesConsumer._check_loop_finishes_via_except.<locals>.<genexpr>r[ znodes.For | nodes.Whiler� )r\ �looprc c s t � fdd�|jD ��S )zAReturn True if `other_node_try_except` is a descendant of `loop`.c 3 s | ]}|� u p|� � �V qd S r� r] )r� Zloop_body_statement�r\ r\ r] r� ' s �z[NamesConsumer._check_loop_finishes_via_except.<locals>._try_in_loop_body.<locals>.<genexpr>)r� r: )r\ r^ r\ r_ r] �_try_in_loop_body# s �zHNamesConsumer._check_loop_finishes_via_except.<locals>._try_in_loop_bodyT) r9 r r� r rx r- r� rj r/ r@ r: r� �+_recursive_search_for_continue_before_break)rp r\ Z closest_loopZinner_else_statement� break_stmtr` rH Z loop_stmtr\ r r] rO � s: � � �z-NamesConsumer._check_loop_finishes_via_exceptz nodes.Break)ra rb rc c C sT | |u r dS t | tj�r dS | �� D ]*}t | tjtjf�r<q$t�||�r$ dS q$dS )z�Return True if any Continue node can be found in descendants of `stmt` before encountering `break_stmt`, ignoring any nested loops. FT)rj r r0 r rx r- r� ra )ra rb r r\ r\ r] ra @ s �z9NamesConsumer._recursive_search_for_continue_before_break)r r rc c s� g }t �|tj�� � du r |S | D ]d}|�� }|� u r8q"t �|tj�\�}�du rTq"|�jvr`q"t� �fdd��j D ��s|q"|� |� q"|S )z�Return any nodes in ``found_nodes`` that should be treated as uncertain. Nodes are uncertain when they are in a try block and the ``node_statement`` being evaluated is in one of its except handlers. Nc 3 s$ | ] }� �j v p|� �� v V qd S r� )r* r@ )r� Z&other_node_try_ancestor_except_handler�rQ Zother_node_try_ancestorr\ r] r� y s � �z]NamesConsumer._uncertain_nodes_in_try_blocks_when_evaluating_except_blocks.<locals>.<genexpr>) r r� r r r �-get_node_first_ancestor_of_type_and_its_childr' r: r� r* r� )r r r! rB rP Z%other_node_try_ancestor_visited_childr\ rc r] r T s: ������ zJNamesConsumer._uncertain_nodes_in_try_blocks_when_evaluating_except_blocks)r r rb rc c s� g }t �|tj�\� }� d u r"|S |� jvr0|S | D ]�}|�� }t �|tj�\}}|d u r\q4||jvrhq4|� ur�t� fdd�|jD ��s�q4|jr�t �fdd�|jD ��r�q4|� |� q4|S )Nc 3 s | ]}|� u p|� � �V qd S r� r] )r� Zother_node_final_statement)� closest_try_finally_ancestorr\ r] r� � s ��z^NamesConsumer._uncertain_nodes_in_try_blocks_when_evaluating_finally_blocks.<locals>.<genexpr>c 3 s | ]}t �� |�V qd S r� r# r% r� r\ r] r� � s �) r rd r r' r( r r: r� r* r+ r� ) r r rb r! Z%child_of_closest_try_finally_ancestorrB rP Z other_node_try_finally_ancestorZ(child_of_other_node_try_finally_ancestorr\ )re rb r] r � sT ��������� �� � zKNamesConsumer._uncertain_nodes_in_try_blocks_when_evaluating_finally_blocksN)rV rW rX rY r� r r �propertyr� r� r� r� r r" r> r8 r � staticmethodrA r r1 r$ rO ra r r r\ r\ r\ r] r� sB ]?/ P5H/r� c s� e Zd ZdZdZeZdddddd�fd d d d d d�fdddddd�fdddddd�fdddddd�fded d dd�fd d ddd d�fd dddd d�ffZd!d"d#�� fd$d%� Z e � d&�d'd"d(�d)d*��Z d'd"d(�d+d,�Z d-d"d(�d.d/�Ze � d0d1d2d3d4d5d6d7�d-d"d(�d8d9��Zd:d"d(�d;d<�Zd:d"d(�d=d>�Zd?d"d(�d@dA�Zd?d"dB�dCdD�ZdEd"d(�dFdG�ZdEd"dB�dHdI�ZdJd"d(�dKdL�ZdJd"dB�dMdN�ZdOd"d(�dPdQ�ZdOd"dB�dRdS�ZdTd"d(�dUdV�ZdTd"d(�dWdX�ZeZ eZ e � dYdZd[d\d2�d]d"d(�d^d_��Z d`d"d(�dadb�Z dcd"d(�ddde�Z dfd"d(�dgdh�Z!e � di�djd"d(�dkdl��Z"e � di�djd"d(�dmdn��Z#dodpd"dq�drds�Z$dodtdududv�dwdx�Z%dodpdydtdzd{d|�d}d~�Z&dpdtd"d�d�d��Z'dpd�d�d��d�d��Z(e � d��d�d"d(�d�d���Z)e � d��d�d"d(�d�d���Z*e � d�d�d�d��d�d"d(�d�d���Z+d�d"d(�d�d��Z,d�d"dB�d�d��Z-d�d"d(�d�d��Z.d�d"d(�d�d��Z/d�d"d(�d�d��Z0e1dud��d�d���Z2e1d�d��d�d���Z3e1dud��d�d���Z4e5dpdpdud��d�d���Z6e5dpdpdud��d�d���Z7e5dodpd�d�dydydzdud�d�� d�d���Z8e5d�dud��d�d���Z9dzdud��d�d��Z:e5dod�dud��d�d���Z;e5dod:d�d{d��d�d���Z<e5d�d�dud��d�dÄ�Z=e5dpdud(�d�dń�Z>dpdud(�d�dDŽZ?d�d"d(�d�dʄZ@dzdTdpd�d�d�d"d̜d�d΄ZAdpdzd�dМd�d҄ZBdzdTdpd�d�d"dԜd�dքZCdod"d(�d�dZDdpdudٜd�dۄZEdzdud��d�d݄ZFe5dodud(�d�d߄�ZGdpd"d�d�d�ZHd�d"d(�d�d�ZId�d"d(�d�d�ZJd�d�d�d"d�d�d�ZKe5dpd�d�d�d��ZLe5dpd�d(�d�d��ZMdpd�d�d�dzd"d�d�d��ZNdpdzd"d��d�d��ZOd�d-d�d�d��d�d��ZPd-d�d"d���d �d�ZQ�dd"�d��d�d�ZRd�d"�d��d�d�ZS�dd"d(��d �d �ZTd:�d�d �d ��d �d�ZU�dd"d(��d�d�ZV�dd�d��d�d�ZW�d�dd"�d��d�d�ZXe � d0d6��dd"d(��d�d ��ZY� ZZS ( r a BaseChecker for variables. Checks for * unused variables / imports * undefined variables * redefinition of variable from builtins or from an outer scope or except handler * use of variable before assignment * __all__ consistency * self/cls assignment � variablesz init-importFZynz<y or n>zBTells whether we should check for unused import in __init__ files.)�default�type�metavar�helpzdummy-variables-rgxz;_+$|(_[a-zA-Z0-9_]*[a-zA-Z0-9]+?$)|dummy|^ignored_|^unused_�regexpz<regexp>zYA regular expression matching the name of dummy variables (i.e. expected to not be used).zadditional-builtinsr\ �csvz<comma separated list>z�List of additional names supposed to be defined in builtins. Remember that you should avoid defining new builtins when possible.� callbacks)Zcb_�_cbz <callbacks>z|List of strings which can identify a callback function by name. A callback name must start or end with one of those strings.zredefining-builtins-modules)z six.movesz past.builtinszfuture.builtins�builtins�iozQList of qualified module names which can have objects that can redefine builtins.zignored-argument-namesz:Argument names that match this expression will be ignored.z allow-global-unused-variablesTzGTells whether unused global variables should be treated as a violation.zallowed-redefined-builtinsz(List of names allowed to shadow builtinsr r� ��linterrc c s. t � �|� g | _g | _g | _i | _d| _d S �NF)�superr� � _to_consume�_type_annotation_names�_except_handler_names_queue� _evaluated_type_checking_scopes� _postponed_evaluation_enabled)r� rt �� __class__r\ r] r� ) s ��zVariablesChecker.__init__r� z nodes.Forr c C s$ t |jtj�sd S |jj}t�|j�}t |t�s4d S | � |�}|sFd S t |t j j �r�t |�dkrvtdd� |D ��rvd S tdd� |D ��r�d S t |tj�r�t |jtj�r�t |�dkr�d S nhtdd� |D ��}|D ]P}| �|�}|o�|t |�k}t |�|kr�|s�t||�} | �||||| � �q q�d S )N� c s s | ]}t |j�d kV qdS )r~ N)r� �elts)r� �xr\ r\ r] r� M r� z-VariablesChecker.visit_for.<locals>.<genexpr>c s s | ]}t |tj�V qd S r� �rj r rY �r� r r\ r\ r] r� R r� c s s | ]}t |tj�V qd S r� r� r� r\ r\ r] r� ^ s )rj r r r% r r r� ry rt �_nodes_to_unpackrf �objects� DictItemsr� r+ r� rL rG �_get_value_lengthr} � _report_unbalanced_unpacking) r� rp r rq r� Zis_starred_targetsrv Z value_lengthZis_valid_star_unpack�detailsr\ r\ r] � visit_for6 s@ � � �zVariablesChecker.visit_forc C s | � |� d S r� �� _store_type_annotation_names�r� rp r\ r\ r] � leave_form s zVariablesChecker.leave_forz nodes.Modulec C sf t |d�g| _t|�| _|j�� D ]>\}}t�|�r"| �|d �s"|dkrLq"| j d||d d� q"dS )zoVisit module : update consumption analysis variable checks globals doesn't overrides builtins. rm r rY r� ��argsrp N) r� rw r r{ rh r� r � is_builtin� _should_ignore_redefined_builtin� add_message)r� rp rb r� r\ r\ r] � visit_modulep s z VariablesChecker.visit_moduler� r� r� r� r� r� r� r� c C sp t | j�dksJ �| �|� | j�� j}d|jv r>| �||� | �|� | jj j s\|j r\dS | � |� g | _ dS )z Leave module: check globals.rU �__all__N)r� rw �_check_metaclasses�popr� rh � _check_all�_check_globalsrt �configZ init_import�package�_check_importsrx )r� rp r� r\ r\ r] � leave_module} s z VariablesChecker.leave_moduleznodes.ClassDefc C s | j �t|d�� dS )z2Visit class: update consumption analysis variable.�classN�rw r� r� r� r\ r\ r] �visit_classdef� s z VariablesChecker.visit_classdefc C s� |� tj�D ]p}t|jtj�r t|jjtj�r t|jjjtj�r |jjj}| j D ]*}|j |j v rP|� |j |j |j � q qPq | j � � dS )z2Leave class: update consumption analysis variable.N)r� r rG rj r� r� r� � Attribute�exprrw rb r� r r� )r� rp r� Zhidden_name_node�consumerr\ r\ r] �leave_classdef� s ��� �z VariablesChecker.leave_classdefz nodes.Lambdac C s | j �t|d�� dS )z3Visit lambda: update consumption analysis variable.�lambdaNr� r� r\ r\ r] � visit_lambda� s z VariablesChecker.visit_lambda)�_rc c C s | j �� dS )z3Leave lambda: update consumption analysis variable.N�rw r� �r� r� r\ r\ r] � leave_lambda� s z VariablesChecker.leave_lambdaznodes.GeneratorExpc C s | j �t|d�� dS )z4Visit genexpr: update consumption analysis variable.� comprehensionNr� r� r\ r\ r] �visit_generatorexp� s z#VariablesChecker.visit_generatorexpc C s | j �� dS )z4Leave genexpr: update consumption analysis variable.Nr� r� r\ r\ r] �leave_generatorexp� s z#VariablesChecker.leave_generatorexpznodes.DictCompc C s | j �t|d�� dS )z5Visit dictcomp: update consumption analysis variable.r� Nr� r� r\ r\ r] �visit_dictcomp� s z VariablesChecker.visit_dictcompc C s | j �� dS )z5Leave dictcomp: update consumption analysis variable.Nr� r� r\ r\ r] �leave_dictcomp� s z VariablesChecker.leave_dictcompz nodes.SetCompc C s | j �t|d�� dS )z4Visit setcomp: update consumption analysis variable.r� Nr� r� r\ r\ r] � visit_setcomp� s z VariablesChecker.visit_setcompc C s | j �� dS )z4Leave setcomp: update consumption analysis variable.Nr� r� r\ r\ r] � leave_setcomp� s z VariablesChecker.leave_setcompr� c C s | j �t|d�� | j�d�s.| j�d�s.dS |�� j}|�� D ]�\}}||v r�t|t j �s�|| d }t|t j �r�|j t kr�q@tdd� || D ��r�q@|| d }t|t j�r�t|jt j�r�q@|j}| �||�s�| jd||f|d� q@t�|�r@| �|�s@| �|�s@| jd||d� q@dS ) zFVisit function: update consumption analysis variable and check locals.�functionr� r� Nr c s s | ]}t |�V qd S r� )r )r� � definitionr\ r\ r] r� � s z5VariablesChecker.visit_functiondef.<locals>.<genexpr>r� )rw r� r� rt �is_message_enabledrz �globalsr� rj r r� rk re rl r� r� r� r r� �_is_name_ignoredr� r r� �_allowed_redefined_builtinr� )r� rp �globsrb ra r� Z global_node�liner\ r\ r] �visit_functiondef� sH � � ��� � ����z"VariablesChecker.visit_functiondefc C s | � |� |jr | �|j� |jr8|jD ]}| �|� q(| j�� j}| j�d�sl| j�d�sl| j�d�sldS t � |�rzdS |� � }|r�|� � r�dS t |�tj��}t |�tj��}t� }|�tj�D ],}|jD ] } t �| j�D ]} |�| � q�q�q�|�� D ] \} } | �| || d |||� q�dS )z5Leave function: check function's locals are consumed.r� r� r� Nr )r� Ztype_comment_returns�_store_type_annotation_node�type_comment_argsrw r� r� rt r� r Zis_error� is_methodZ is_abstractr� r� r r� r r� �ComprehensionScope� generatorsZ find_assigned_names_recursiver r7 r� �_check_is_unused) r� rp Zargument_annotationr� r� r� �nonlocal_names�comprehension_target_names�comprehension_scope� generatorrb r� r\ r\ r] �leave_functiondef sF � � � �z"VariablesChecker.leave_functiondefr� r� r� r� z nodes.Globalc C s` |� � }t|tj�r(| jd|td� dS |�� }d}|�� j}|j D � ]�}z|� |�}W n t j yp g }Y n0 t dd� |�|d�D �� }t�||�s�t�||�s�|r�| jd||td � d }qD|D ]b} t| tj�r�| j|jv r�| jd ||d � qD| � � |u �r qDt| tjtjf�r�| j|u r� qDq�|rD| jd ||td � d }qD|�r\| jd|td� dS )z0Check names imported exists in the global scope.r� �rp � confidenceNTc s s | ]}t |tjtjf�V qd S r� )rj r r� rk )r� �localr\ r\ r] r� Q s �z0VariablesChecker.visit_global.<locals>.<genexpr>r\ r� �r� rp r� Fr� r� r� r� )r� rj r r� r� r rz r� rh r� r� rf � NotFoundErrorr� ri r Zis_reassigned_after_currentZis_deleted_after_currentr� rb Zspecial_attributesr� r� r� ) r� rp r� rm Zdefault_messageZlocals_rb Z assign_nodesZ not_defined_locally_by_importZanoder\ r\ r] � visit_global9 sj � � ��� � ����z VariablesChecker.visit_globalznodes.AssignNamec C s t |�� tj�r| �|� d S r� )rj r� r r� � visit_namer� r\ r\ r] �visit_assignname� s z!VariablesChecker.visit_assignnamez nodes.DelNamec C s | � |� d S r� )r� r� r\ r\ r] � visit_delname� s z VariablesChecker.visit_delnamez-nodes.Name | nodes.AssignName | nodes.DelNamec C sD |� � }|jdu r*|�� j�d�r&J �dS | �||� | �|� dS )z�Don't add the 'utils.only_required_for_messages' decorator here! It's important that all 'Name' nodes are visited, otherwise the 'NamesConsumers' won't be correct. Nz.py)r r� rz �file�endswith�"_undefined_and_used_before_checker� _loopvar_name)r� rp ra r\ r\ r] r� � s zVariablesChecker.visit_namer� znodes.ExceptHandlerc C sh |j rt|j tj�sd S | jD ]2\}}|j j |j kr | jd|j |jf|d� qRq | j�||j f� d S )Nr� r� )rb rj r r� ry r� r� r� )r� rp Z outer_exceptZouter_except_assign_namer\ r\ r] �visit_excepthandler� s �z$VariablesChecker.visit_excepthandlerc C s& |j rt|j tj�sd S | j�� d S r� )rb rj r r� ry r� r� r\ r\ r] �leave_excepthandler� s z$VariablesChecker.leave_excepthandlerr~ r� )rp ra rc c C s |� � }t| j�d }| j| j}t|dd�D ]v}| j| }| �||||k�rPq.| �|||||�\}} | r�| |j|j 7 } |� |j| � |t j u r�q.|t j u r. d S q.|jt jjv �st�|j��s|j| jjjv �s|jdkr�tdd� |�� D ���st�|t��s| jd|j|d� d S )NrU r� r} c s s" | ]}t |tj�r|�� V qd S r� )rj r r� r� �r� �ir\ r\ r] r� � s �zFVariablesChecker._undefined_and_used_before_checker.<locals>.<genexpr>r� r� )r� r� rw r� �range�_should_node_be_skipped�_check_consumerr� rb r rT rZ r[ r r� � scope_attrsr r� rt r� �additional_builtinsr� r@ �node_ignores_exception� NameErrorr� ) r� rp ra r� � start_index�base_scope_typer� �current_consumer�action�nodes_to_consumer\ r\ r] r� � s@ � � ����� � z3VariablesChecker._undefined_and_used_before_checkerr� r� )rp r� �is_start_indexrc c s� |j dkrlt�|j� �s&|sH| �� �rHt� fdd�|jjD ��rDdS dS t� jt j �r�t� jjt j �r�dS nV|j dkr�| � � |j�r�t� fdd�|jjD ��r�dS dS |j dkr�t� � |j�r�dS dS ) z�Tests a consumer and node for various conditions in which the node shouldn't be checked for the undefined-variable and used-before-assignment checks. r� c 3 s | ]}� j |j j kV qd S r� r� �r� �paramr r\ r] r� � s z;VariablesChecker._should_node_be_skipped.<locals>.<genexpr>FTr� c 3 s | ]}� j |j j kV qd S r� r� r� r r\ r] r� � r� r� )r� r �is_ancestor_namerp �_ignore_class_scoper� � type_paramsrj r� r �Keywordr� � _defined_in_function_definition�is_default_argument)r� rp r� r� r\ r r] r� � s4 �� � ���z(VariablesChecker._should_node_be_skippedr r_ z=tuple[VariableVisitConsumerAction, list[nodes.NodeNG] | None])rp ra r� r� r� rc c C s� |j |jv r8t�|j�s$t|tj�s8| �|� t j dfS |� |�}|du rTt j dfS |s�| � ||� |j|j }| �||�}t j |fS | �|� t�|d �}|�� } | �� } || u o�| �|�o�t| tj�o�|j | j k} | �rt�|tj��rt�|��r|�� j�� | u�rt j dfS | �|||| || || �\} } }|�rFt j dfS | �r�t�|��s�t � || d��s�| |u �o�t|tj tj f�}| �s�|�s�| �s�t| tj ��rt�!|t"��s�| j#�r�t|tj$tj%tj&f��r�|j |�'� j(v �s�|�r�t j |gfS t j dfS n�|dk�rf| j#�r(t|tj$tj%f��s�t|tj$��rFt�|tj%��s�| j)d|j |t*d� t j |fS nH|dk�r�t|tj��r�|j |j(v �r�|j+| j+k�r�| j)d|j |t*d� n�| �,|j ��s| �-|| ��r|�� j(�.|j ��r�| j)d|j |t*d� n| j)d|j |t*d� t j |fS t| tj��r<|| j/v�r<| �0|| |�S t|tj1��r�t|jtj2��r�| �3||j��r�| j)d|j |t4d� t j |fS t j |fS )z>Checks a consumer for conditions that should trigger messages.Nr )r� r� r� r� r� )5rb r� r Zis_func_decoratorrp rj r r� �_check_late_binding_closurerT r[ r" rZ � _report_unfound_name_definitionr� �-_filter_type_checking_import_from_consumptionZ assign_parentr r� r� r� r� �Lambdar� r� r� �_is_variable_violationZis_defined_beforerf Z are_exclusiveZDelNamer� �Deleter� r� r{ rX r� r� rz rh r� r r� � _is_builtin�_is_only_type_assignmentri r� � _is_first_level_self_referencer3 �IfExp�_is_never_evaluatedr )r� rp ra r� r� r� r r� �defnode�defstmtr� �is_recursive_klass�maybe_before_assign�annotation_return�use_outer_definitionZdefined_by_stmtr\ r\ r] r� s � �� � � �� ��� �� �� � ���� ����� � �� � �� � � ��� � � ��� z VariablesChecker._check_consumer)rp r� rc c C s� | j rt�|�rdS | �|j�r$dS | �|�r2dS |j| jv rV|�� | j|j v rVdS t}|j|j v rlt }n|j|j v r|t }|j|j v r�d}nd}| j||j||d� dS )zqReports used-before-assignment when all name definition nodes get filtered out by NamesConsumer. Nr� r� r� )r{ r �"is_node_in_type_annotation_contextr� rb �#_is_variable_annotation_in_functionrz r� r r� r r� r r� r� )r� rp r� r� �msgr\ r\ r] r� � s8 �� �� �z0VariablesChecker._report_unfound_name_definitionr )rp r� rc c sR t dd� |D �d�� � r<| �|�s<| j�|jg ��|�� � � fdd�|D �}|S )zsDo not consume type-checking import node as used-before-assignment may invoke in different scopes. c s s, | ]$}t |tjtjf�rt|�r|V qd S r� )rj r r� rk r r r\ r\ r] r� s �zQVariablesChecker._filter_type_checking_import_from_consumption.<locals>.<genexpr>Nc s g | ]}|� kr|�qS r\ r\ r �Ztype_checking_importr\ r] r� r� zRVariablesChecker._filter_type_checking_import_from_consumption.<locals>.<listcomp>)r) r� rz � setdefaultrb r� r� )r� rp r� r\ r� r] r� � s �� �z>VariablesChecker._filter_type_checking_import_from_consumptionr� r� c C s� | j st�|�rdS t|�r dS t|jtj�r<t|j�r<dS |j D ]f\}}|� d�}zt t ||d ��}W n t jy� Y qBY n0 t|tj�s�qB| �|||dd� � qBdS )�!Check modules attribute accesses.Nr� r rU )�_analyse_fallback_blocksr �is_from_fallback_blockr rj r� r r. r r� �splitr) r� rf Z ResolveErrorr� �_check_module_attrs)r� rp rb r� �partsrm r\ r\ r] � visit_import s z VariablesChecker.visit_importr^ c C s� | j st�|�rdS t|�r dS t|jtj�r<t|j�r<dS |j � d�}z|� |d �}W n t j yp Y dS 0 | �|||dd� �}|s�dS |jD ]&\}}|dkr�q�| �|||� d�� q�dS )r Nr� r rU r� )r r r r rj r� r r. r re r rd rf rg r r� )r� rp Z name_partsrm rb r� r\ r\ r] �visit_importfrom, s$ z!VariablesChecker.visit_importfromr� r� r� Zunbalanced_dict_unpackingro c C s� | � |� t|jd tjtjf�s&dS |jd �� }tdd� |D ��rJdS z&t� |j �}|durn| � |||� W n t j y� Y dS 0 dS )z�Check unbalanced tuple unpacking for assignments and unpacking non-sequences as well as in case self/cls get assigned. r Nc s s | ]}t |tj�V qd S r� r� r� r\ r\ r] r� X r� z0VariablesChecker.visit_assign.<locals>.<genexpr>)�_check_self_cls_assignrj r r r% r? �iteredr� r r� rv �_check_unpackingrf �InferenceError)r� rp r rq r\ r\ r] � visit_assignG s z VariablesChecker.visit_assignznodes.ListCompc C s | j �t|d�� dS )z5Visit listcomp: update consumption analysis variable.r� Nr� r� r\ r\ r] �visit_listcompc s z VariablesChecker.visit_listcompc C s | j �� dS )z5Leave listcomp: update consumption analysis variable.Nr� r� r\ r\ r] �leave_listcompg s z VariablesChecker.leave_listcompc C s | � |� d S r� r� r� r\ r\ r] � leave_assignl s z VariablesChecker.leave_assignz nodes.Withc C s | � |� d S r� r� r� r\ r\ r] � leave_witho s zVariablesChecker.leave_withznodes.Argumentsc C s |j D ]}| �|� qd S r� )r� r� )r� rp � annotationr\ r\ r] �visit_argumentsr s z VariablesChecker.visit_argumentsr� c C s t | jjj�S r� )r� rt r� Zanalyse_fallback_blocksr r\ r\ r] r w s z)VariablesChecker._analyse_fallback_blocksz Iterable[str]c C s | j jjS r� )rt r� Zignored_modulesr r\ r\ r] �_ignored_modules{ s z!VariablesChecker._ignored_modulesc C s t | jjj�S r� )r� rt r� Z allow_global_unused_variablesr r\ r\ r] � _allow_global_unused_variables s z/VariablesChecker._allow_global_unused_variables)rp r� rc c C s� d}t |tj�r�| �� |u r�| |jjv p�| |jjv p�| |jjv p�| |jju p�| |jj u p�|j� | �p�|j rv|j � | �p�|j o�| |j u p�|j � | �}|S ru ) rj r r� r r� r Zposonlyargs_annotationsZkwonlyargs_annotationsZvarargannotationZkwargannotationr� � decorators�returns)rp r� �%in_annotation_or_default_or_decoratorr\ r\ r] r� � s& � � � � �� �z0VariablesChecker._defined_in_function_definitionc C s� | }| j }|dur�||u r dS t|tj�r8||jur8dS t|tj�rR||jurRdS t|tj�rv|jrr||jd u svdS |}|j }q dS )z�Return True if node within a lambda/comprehension body (or similar) and thus should not have access to class attributes in frame. NFTr ) r� rj r r� r� � Comprehensionry r� r� )rp r� r r� r\ r\ r] � _in_lambda_or_comprehension_body� s$ � �z1VariablesChecker._in_lambda_or_comprehension_bodyrI ztuple[bool, bool, bool]) rp r� ra r� r� r� r� r� rc c s| d}d} d} ||ur"t �||�}n�|jd u rN�j|jv sHt��j�d r�d}n�t|tj�sjt�� � tj �opt ��} | s�|� � � �j�d r�d}||ko�t� tj� } n(�j|jv r�t�fdd�|�� D �� }|dk�r,t|tj��r,�j|jv �r,t� tj��o$�� jv �o$|j�j d j|jk }�nFt|tj��r"t|tj��r"�|ju �r|�|j��r�d} |jj|jv �r�|j�j d } | jd u�o�| j|jk}nd}n\t|�� � } �rt| tj��rt |�� � }�rtdd� |D ���r|d | u �rd} d}t�jtj��rr|j|jk}�nP|�r0d}�nB|�o@|j|jk}|�rr|j|jk�rrt|tj��r�||u �r�|����r�� |j v �s�||u�r�d}n�t|t ��r�t � |��r�||u �r�|����r�||u �r�d}n�t� tj!��rT||u �rT|�|��rT||u �rT� j�jk�r � j"�j"k �s,� j�jk �rT� j#�u �pPt� fd d���� D ��}n t|tj��rr� |j v �rrd}|| | fS ) NTFrU c 3 s& | ] }t |tj�o � j|jv V qd S r� r r r r\ r] r� � s �z:VariablesChecker._is_variable_violation.<locals>.<genexpr>r� r c s s | ]}t |tj�V qd S r� )rj r r� �r� rH r\ r\ r] r� s �r� c 3 s | ]}|� j u V qd S r� rE �r� Zanc)r� r\ r] r� P s )$r� r� rb r� rf Zbuiltin_lookuprj r r� r� r� r� rz �lookupr rh r� r r� r� �defaultsr� r r� r{ r) r@ r� �tupler� �NODES_WITH_VALUE_ATTRr � _maybe_used_and_assigned_at_oncer3 � col_offsetrv )rp r� ra r� r� r� r� r� r� r� r� Z forbid_lookupr� Zdefframe_parentZframe_ancestorsr\ )r� rp r] r� � s� �� �� � � � � ���� �� ���� �� ����� ����� ����� � � �� ��z'VariablesChecker._is_variable_violation)r� rc c C s� t | tj�r tdd� | jD ��S t | tj�r0dS t | tj�r@dS t | jtj�rdtdd� | jj D ��S | j}t |tj�rzdS t |tj �r�t |j tj�r�dS t |tj �r�tdd� |j D ��r�dS t |tj�s�dS tdd� |jtjd�D ��S ) zeCheck if `defstmt` has the potential to use and assign a name in the same statement. c s s | ] }|j V qd S r� )�guard)r� �caser\ r\ r] r� c r� zDVariablesChecker._maybe_used_and_assigned_at_once.<locals>.<genexpr>Tc s s4 | ],}t |g t�tj�tj�R �rt�|�V qd S r� )rj r r r� �Matchr r! �r� rZ r\ r\ r] r� i s �c s s. | ]&}t |d tj�p$t |d tj�V qdS )r rU N�rj r r� rT r\ r\ r] r� s s �Fc s sT | ]L}t d d� |jD ��pJt dd� |jD ��pJt|jtj�oJt|jjtj�V qdS )c s s | ]}t |jtj�V qd S r� )rj rv r r� )r� �kwargr\ r\ r] r� { r� zNVariablesChecker._maybe_used_and_assigned_at_once.<locals>.<genexpr>.<genexpr>c s s | ]}t |tj�V qd S r� r' )r� �argr\ r\ r] r� | r� N) r� �keywordsr� rj r� r r� r� r� )r� r� r\ r\ r] r� z s ��)�klass)rj r r% r� Zcasesr� � TypeAliasrv � BaseContainerr r� r: rL r� r� r� )r� rv r\ r\ r] r! ] s0 � � �z1VariablesChecker._maybe_used_and_assigned_at_once)rb rc c C s || j jjv pt�|�S r� )rt r� r� r r� �r� rb r\ r\ r] r� � s z VariablesChecker._is_builtin)rp r� rc c s& t |tj�r|jrdS |�� }� �� }� }||jdhv�r"|�� }|�tj�D ]P}||u r\qNt � fdd�|�tj �D ��rNt � fdd�|�tj �D ��rN dS qN|j � � jg �}|D ]d�||kr҈j� jkr� �qt �jtj�r�jjr�t �jtj��rt �fdd�� �� D ��s� dS q�|j}q*dS )z>Check if variable only gets assigned a type and never a value.FNc 3 s | ]}� j |jv V qd S r� )rb r� )r� �nlr r\ r] r� � s �z<VariablesChecker._is_only_type_assignment.<locals>.<genexpr>c 3 s | ]}� j |j kV qd S r� r� )r� �anr r\ r] r� � s �c 3 s | ]}|� j ju V qd S r� )r� rv r )�ref_noder\ r] r� � s T)rj r rX rv r� r� r� r� r� r� r r� rh ri rb r{ r3 r@ )rp r� Z defstmt_frameZ node_framer� r� Z inner_funcZ local_refsr\ )rp r1 r] r� � sF � �� �� � �� z)VariablesChecker._is_only_type_assignment)rp r� r rc c C sx | � � j|krn| �� | � � krnt�| �rFt�| �s<tjdfS tjdfS t | jt j �rnt | jjt j �rntjdfS tj|fS )z�Check if a first level method's annotation or default values refers to its own class, and return a consumer action. N) r� r� r r r� r rT rZ r[ rj r r� r� )rp r� r r\ r\ r] r� � s � z/VariablesChecker._is_first_level_self_referenceznodes.NamedExprz nodes.IfExp)r� �defnode_parentrc c C sL t �|j�}t|tj�rH|jdu r0| |jkr0dS |jdu rH| |jkrHdS dS )z`Check if a NamedExpr is inside a side of if ... else that never gets evaluated. TF) r r� r2 rj r r5 rv r9 r: )r� r2 Z inferred_testr\ r\ r] r� � s z$VariablesChecker._is_never_evaluatedc C s t �| tj�}|o t �|tj�S r� )r r� r rX r� )rp Z is_annotationr\ r\ r] r� � s ��z4VariablesChecker._is_variable_annotation_in_functionc C sn |j }|�� �� }| �||�}t�||�}|s2|r@|j�� j}n|j}t|t j �sV|oj| � ||� oj||v S )a Return True if the node is in a local class scope, as an assignment. Detect if we are in a local class scope, as an assignment. For example, the following is fair game. class A: b = 1 c = lambda b=b: b * b class B: tp = 1 def func(self, arg: tp): ... class C: tp = 2 def func(self, arg=tp): ... class C: class Tp: pass class D(Tp): ... ) rb r r� r� r r� r� rh rj r r� r )r� rp rb r� r Zin_ancestor_listZ frame_localsr\ r\ r] r� � s � ��z$VariablesChecker._ignore_class_scopez astroid.Namec s� dd� |� |j�d D �}|�� � t� tjtjf�rNt� fdd�|D ��rNd S |r�|d j|d � � krx|d j� |�s�|d j s�t|d jtj �s�|d � � � |�r�g }n |d d� }t|dd � �D ]Z\}}z|| � � }W n tjjy� Y q�Y n0 |� |��rt�||��sq�|�|� q�|}t|�dk�r:d S |d �� }t|tjtjtjf��rp|� � |� � u�std S t|tj��s�| jd|j|d� d S |jD ]�}t|tj tj tj tj f��r� d S t|tj ��r�t|j!tj"��r�t�#|j!j$�} t| tj��r�| j%�r�t�#| j%�} t| tj��r@| �&� h t'�t(�d �v �r@ d S t| t)j*��r�| �&� d k�r� d S �q�t�+|tj,�} | �r�t�+| tj�} | �r�t�+| tj-�} | d u �r�n"| j�� � u �r�|j| j.v �r�d S ztt/|j0�1� �}t|tj*��r<|�&� d k�r<|j0}t|j0tj2��r|j0j3}t|tj"��r<|j4�r<t/|j4d �1� �}W n( tj5�yf | jd|j|d� Y n�0 t|tj*��r�|�&� t6k�r�d S tj7tj8tj9tj:tj;j<f}t||��s�| jd|j|d� d S t=|d t=|d g ��}|�s�| jd|j|d� d S ) Nc S s g | ]}t |d �r|�qS )r� )�hasattr)r� �sr\ r\ r] r� r� z2VariablesChecker._loopvar_name.<locals>.<listcomp>rU c 3 s | ]}|� � �� �V qd S r� )r� r� )r� Zasmt�r� r\ r] r� s z1VariablesChecker._loopvar_name.<locals>.<genexpr>r r� r� ztyping._SpecialFormzbuiltins.enumerater r� )>r rb r� rj r r� r� r� r� rz r� Z is_statementr� r � enumeraterf � exceptionsZParentMissingErrorr Zin_for_else_branchr� r� r� rx r � GeneratorExpr� r9 rK rV r/ r0 rM rv r� r� r� r �qnamer r r �Instancer� r3 r� rh r) ry r� r� r: r� r � BUILTIN_RANGEr? r% rL r@ r� rD r� )r� rp ZastmtsZ_astmtsr� ra Zastmt_statementZassignZ else_stmtZ inferred_funcZinferred_returnZ maybe_walrusZmaybe_comprehensionr� rq Z likely_call� sequences�elementsr\ r5 r] r� s� � ����� � � �� �� �� ����� � � �� � � � � � �� z VariablesChecker._loopvar_namer� )rb rp ra r� r� r� rc c s� | � |� �rd S t|tj�rP� dkrPt|jd �dkrPt|jd d tj�rPd S t|tjtjtj f�rx|rxt ||�rxd S � |v r�d S � | j v r�d S |� � }� |v r�|j dkr�d}|j�� D ] } t| d�o�| j dk}|r� q�q�|r�d S | �� ||||� �n�|j�r.t|jtjtjtjtjf��r.� |v �r.d S d } } t|tjtj f��r�t|j�dk�rvt� fdd �|jD �d �} n |jd } | �r�| \} } | �p�| � t||�� ��r�d } n�t|tj��r�| d u�r�| � d | � �}n d � � �}| jd ||d� d S t|tj ��rH| d u�r$| � d|j� d| � �}n� � d|j� �}| jd ||d� d S d} t|tj��rf|j �rfd S t � |��rvd S t|jtj ��r�t � fdd �|j�!tj"�D ���r�d S | j| � |d� d S )Nr} rU r �__new__Frb r� c 3 s | ]}� |v r|V qd S r� r\ )r� r� r� r\ r] r� � r� z4VariablesChecker._check_is_unused.<locals>.<genexpr>r� � imported as �import r� r� � imported from � as r� c 3 s | ]}|j � kV qd S r� r� r r� r\ r] r� s )#r� rj r r� r� rh r� r� r� rk r� rx �argnamesrb r� r r3 �_check_unused_argumentsru rX r% rx r� r) r� r� r� re r r �is_overload_stubr r� r� rG )r� rb rp ra r� r� r� rC Z is_init_defr r9 r� Z import_namesZ message_namer� r\ r� r] r� � s� ���� � � � z!VariablesChecker._check_is_unusedz&re.Pattern[str] | re.Match[str] | Noner` c C sN | j jj}t|tj�r$t|jtj�s0t|tj�r<| j jj}n|}|oL|� |�S r� ) rt r� �dummy_variables_rgxrj r r� r� r� Zignored_argument_names�match)r� ra rb Zauthorized_rgx�regexr\ r\ r] r� s � � � z!VariablesChecker._is_name_ignoredz list[str])rb rp ra rC r� rc c s � � � }� j�� }|r6t|tj�r6t�|�r0tnt }nt }|r�� j dkrX||d krXd S t |� j �} | d ur||| �� v r|d S � j tjv r�� j dvr�d S t� fdd�| jjjD ��r�d S t�� �r�d S t�� �r�d S t�|�r�d S ||v r�d S | jd|||d� d S )Nrg r )r� r> c 3 s& | ] }� j �|�p � j �|�V qd S r� )rb r� r� )r� �cbr r\ r] r� B s �z;VariablesChecker._check_unused_arguments.<locals>.<genexpr>r� r� )r� r� r� rj r r� r Zhas_known_basesr r r rj r rb rC Z PYMETHODSr� rt r� ro Z(is_registered_in_singledispatch_functionrE Zis_protocol_classr� ) r� rb rp ra rC r� r� r+ r� Z overriddenr\ r r] rD # s6 � � z(VariablesChecker._check_unused_argumentsc C s | j �d�sdS |�� }t�||�r.|j�� }t|tjtj f�rL|j |j v rPdS |� |j �\}}|rn|� |�srdS t�|�r�| jd||j d� nn|d }|}|r�t|tj�s�||u r�q�|j}q�|r�|� |�r�t�|�s�|jr�t|�� tj�s�| jd||j d� dS )a: Check whether node is a cell var that is assigned within a containing loop. Special cases where we don't care about the error: 1. When the node's function is immediately called, e.g. (lambda: i)() 2. When the node's function is returned from within the loop, e.g. return lambda: i r� N�rp r� r )rt r� r� r r� r� rj r r� r� rb rh r r� �is_comprehensionr� rx Zis_being_calledr rK )r� rp Z node_scopeZ assign_scoper� Zassignment_nodeZ maybe_forr\ r\ r] r� X s@ � � �����z,VariablesChecker._check_late_binding_closure)ra rc c C s t |tj�sdS |j| jjjv S ru )rj r rk re rt r� Zredefining_builtins_modules)r� ra r\ r\ r] r� � s z1VariablesChecker._should_ignore_redefined_builtinc C s || j jjv S r� )rt r� Zallowed_redefined_builtinsr. r\ r\ r] r� � s z+VariablesChecker._allowed_redefined_builtinc C s$ t �| tj�}|duo"| �� �|�S )z]Return True if a ComprehensionScope intervenes between `node` and its frame. N)r r� r r� r� r� )rp Zclosest_comprehension_scoper\ r\ r] r � s ��z6VariablesChecker._comprehension_between_frame_and_node)�type_annotationrc c C s� t |tj�r | j�|j� dS t |tj�r:| �|j� dS t |tj �sJdS t |j tj�r�t |j jtj�r�|j jjt kr�| j�t � dS | j� dd� |� tj�D �� dS )z?Given a type annotation, store all the name nodes it refers to.Nc s s | ] }|j V qd S r� r� )r� r r\ r\ r] r� � s z?VariablesChecker._store_type_annotation_node.<locals>.<genexpr>)rj r rG rx r� rb r� r� r� � Subscriptrv � TYPING_MODULE�extendr� )r� rL r\ r\ r] r� � s& �� � �z,VariablesChecker._store_type_annotation_nodez%nodes.For | nodes.Assign | nodes.Withc C s |j }|sd S | �|j � d S r� )rL r� )r� rp rL r\ r\ r] r� � s z-VariablesChecker._store_type_annotation_namesc C s� t � }|jD ]@}t|tj�r*|�|j� q t|tj�r |�dd� |j D �� q |� � }|� � j ort dd� |j D ��}|r�|� � j � � }t|tj�r�|�� r�d|�� vs�dS |�� }|s�dS |d }||v r�| jd||fd� dS ) z'Check that self/cls don't get assigned.c s s | ]}t |tj�r|jV qd S r� rS r& r\ r\ r] r� � s z:VariablesChecker._check_self_cls_assign.<locals>.<genexpr>c s s | ]}t |tj�r|V qd S r� )rj r r r r\ r\ r] r� � s zbuiltins.staticmethodNr r� rJ )r� r rj r r� r7 rb r% �updater r� r� r� r: r� r� ZdecoratornamesrC r� )r� rp Z assign_namesr r� Znonlocals_with_same_nameZargument_namesZ self_cls_namer\ r\ r] r � s6 � � �� �z'VariablesChecker._check_self_cls_assignr )rq rp r rc c C s� t �|�rdS t �|�r dS t|tj�r,dS t|jtj�r\t|j tj �r\|j j |jj kr\dS | � |�}t||�}|dur�t|�t|�kr�| �|||t|�|� nt �|�s�| �||� dS )zRCheck for unbalanced tuple unpacking and unpacking non sequences. N)r Zis_inside_abstract_classrK rj r �UninferableBaser� r r� rv rG rb �varargr� r} r� r� Z is_iterable� _report_unpacking_non_sequence)r� rq rp r r� r� r\ r\ r] r � s, � �� � z!VariablesChecker._check_unpacking�int)� value_noderc c C s� t �| �}|d urt|�S t| tj�r@t| jttf�r@t| j�S t| tj �r�| j j pVd}| j j j| j j j }tt�|| ��}|S dS r� )r r� r� rj r r5 rv r_ �bytesrM �slice�step�upper�lowerrT �math�ceil)rU Zvalue_subnodesrX Z splice_rangeZ splice_lengthr\ r\ r] r� � s � z"VariablesChecker._get_value_lengthr c C s\ t | tjtjtjgt�R �r$| �� S t | tj�rXt dd� | � � D ��rXdd� | � � D �S dS )z/Return the list of values of the `Assign` node.c s s | ]}|� � d kV qdS )ztyping.NamedTupleN)r9 r r\ r\ r] r� s z4VariablesChecker._nodes_to_unpack.<locals>.<genexpr>c S s g | ]}t |tj�r|�qS r\ )rj r r� r� r\ r\ r] r� r� z5VariablesChecker._nodes_to_unpack.<locals>.<listcomp>N) rj r r% r? r@ rt r rf r: r� Z ancestorsr� r r\ r\ r] r� s �z!VariablesChecker._nodes_to_unpack)rp rq r � values_countr� rc c C sV |t |�t |�dkrdnd||dkr(dndf}t|t�r<dnd}| j|||td� d S )NrU rr r4 r� r� )rp r� r� )r� rj rt r� r )r� rp rq r r] r� r� �symbolr\ r\ r] r� s � ��z-VariablesChecker._report_unbalanced_unpacking)rp r� rc c C s, |r|� d�sd|� �}| jd||d� d S )N� r� rJ )r� r� )r� rp r� r\ r\ r] rS 0 s z/VariablesChecker._report_unpacking_non_sequencez_base_nodes.ImportNodeznodes.Module | None)rp rm � module_namesrc c C s |r�|� d�}|dkr d}q�z<|�|�d }t|tj�sVt|�� �}t|tj�sVW dS W q tjy� t |� � � d|� �| j �r�Y dS | j d||j f|d� Y dS tjy� Y dS 0 q |r�|r�|j nd}| j d|d�|�|fd� dS t|tj�� r�|S dS )z�Check that module_names (list of string) are accessible through the given module, if the latest access name corresponds to a module, return it. r �__dict__Nr� r� r� rJ )r� r� rj r r� r) r� rf r� r r9 r r� rb r r� )r� rp rm r` rb re r\ r\ r] r 5 s: � �z$VariablesChecker._check_module_attrsr� )rp r� rc c C s� zt |�d��}W n tjy( Y d S 0 t|tj�r:d S |�� dvrj|j|j }}| j d|||d� d S t |dd�D �]0}zt |� � �}W n tjy� Y qvY n0 t|tj�r�qv|j s�qvt|tj�r�t|jt�s�| j d|�� |d� qv|j}||v �r||= qv||jvrv|j�s(| j d |f|d� qvtj�|j�d }tj�|�d krv|jd | } ztj� | � d �� W qv t �y� | j d |f|d� Y qv t �y� Y qv0 qvd S ) Nr� > z builtins.listzbuiltins.tupler� )r� r" rp r r\ r� r� r� r r� r� ) r) Zigetattrrf r rj r rQ �pytypeZtolinenor" r� r� r� r� r r5 rv r_ rw rh r� �os�path�splitextr� �basenamerb ZmodutilsZfile_from_modpathr � ImportError� SyntaxError) r� rp r� �assignedr� �colrZ Zelt_namerf rb r\ r\ r] r� ^ sX � �� zVariablesChecker._check_allzdict[str, nodes.NodeNG]r� c C sF | j r d S |�� D ].\}}|D ] }t|�r,q | jd|f|d� q qd S )Nr� r� )r r� r r� )r� r� rb Znode_lstrp r\ r\ r] r� � s z VariablesChecker._check_globalsc C sN t |�}t� }t�t�}|D �]�\}}|jD �]�}|d }} | dkrJ|}|d } ||v r\q,||| fvrjq,|�|� | | jv p�| | jv } | o�| jj j o�| jj j � | �} t |t j�s�t |t j��r(|j�s(t |t j�r�t�| �r�q,| s,| r�q,| d u r�d| � �} n| � d| � �} t|��s�| jd| |d� q,t |t j�r,|jtkr,t�| ��rLq,t||��rZq,| s,| �rfq,| dk�r�||j|f �|� q,| d u �r�| � d|j� �} n| � d|j� d | � �} t|�s,| jd| |d� q,q |�� D ]h\}}t|�dk�r�|d }n*d �d d � |d d � D ��� d|d � �}| jd||d f|d d� �q�| `d S )Nr r� rU r@ r? r� r� rA rB r� c s s | ] }|V qd S r� r\ r� r\ r\ r] r� � r� z2VariablesChecker._check_imports.<locals>.<genexpr>r� z and r� ) r� r� r� r r� r� r7 rx rt r� rF rG rj r r� rk re � SPECIAL_OBJ�searchr r� rl rn r� r� r� r� rw )r� r� Z local_names�checkedZunused_wildcard_importsrb ra r� Z real_nameZ imported_nameZas_nameZis_type_annotation_importZis_dummy_importr� rm Z unused_list� arg_stringr\ r\ r] r� � s| � ��� ��� (�� z VariablesChecker._check_importsz nodes.Module | nodes.FunctionDefc C sN g }|� � D ]"}t|tj�r |�| �||�� q |D ]\}}|�|d� q4dS )z,Update consumption analysis for metaclasses.N)r rj r r� rO �_check_classdef_metaclassesr� )r� rp r� � child_node� scope_localsrb r\ r\ r] r� � s z#VariablesChecker._check_metaclassesz/list[tuple[dict[str, list[nodes.NodeNG]], str]])r+ r rc c C s� |j s g S g }|�� }d}t|j tj�r2|j j}nrt|j tj�rl|j jrl|j j}t|tj�sd|j}qP|j}n8t|j tj�r�t|j j tj�r�|j j j}n|r�|� � j}d}t � ||�}|�rB| j d d d� D ]D\}} } } |� |g �} | D ]&} | j|jkr�|�||f� d} q�q�q�|j� |g �} | D ] } | j|jk�r"d} �qB�q"|�s�|�s�|tjjv �s�t�|��s�|| jjjv �s�| jd||fd� |S )Nrr Fr� Tr� rJ )Z _metaclass� metaclassrj r rG rb r� r� r� r� rz �METACLASS_NAME_TRANSFORMSri rw r{ r� rh r� r� r r� rt r� r� r� )r� r+ r r� rr rb �attr�foundrq r� r Z found_nodeZnodes_in_parent_scopeZfound_node_parentr\ r\ r] ro sZ � �� �� � z,VariablesChecker._check_classdef_metaclassesznodes.Subscriptc C s t �|j�}| �||� d S r� )r r� rW � _check_potential_index_error�r� rp �inferred_slicer\ r\ r] �visit_subscript< s z VariablesChecker.visit_subscriptznodes.Tuple | nodes.List)�iterablerc c C sZ d}|j D ]J}t|tj�s$|d7 }q t�|j�}t|tj�rL|t|j �7 }q |d7 }q |S )Nr rU ) r rj r rY r r� rv r- r� )r� rz �lengthrZ �unpackedr\ r\ r] �_inferred_iterable_lengthA s z*VariablesChecker._inferred_iterable_lengthznodes.NodeNG | None)rp rx rc c C s^ t |tj�rt |jt�s dS t |jtjtjf�rZ| �|j�|jd k rV| jd|t d� dS dS )z,Check for the potential-index-error message.NrU r� r� ) rj r r5 rv rT r% r? r} r� r rw r\ r\ r] rv N s ��z-VariablesChecker._check_potential_index_errorz nodes.Constc C s� |� � dkrdS t�|�s dS |j}t|tj�r6|j}t|tj�rht|� � d�}|durht� |d�rhdS zt |j �}| � |� W n$ ty� Y n tjy� Y n0 dS )z�Take note of names that appear inside string literal type annotations unless the string is a parameter to `typing.Literal` or `typing.Annotation`. z builtins.strN)� Annotated�Literal)rb r r� r� rj r r% rM r) r Zis_typing_memberr rv r� � ValueErrorrf ZAstroidSyntaxError)r� rp r� �originr r\ r\ r] � visit_consta s( � z VariablesChecker.visit_const)[rV rW rX rY rb r� Zmsgs�IGNORED_ARGUMENT_NAMES�optionsr� r Zonly_required_for_messagesr� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� Zvisit_asyncfunctiondefZleave_asyncfunctiondefr� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r r rg r� r r� r! r� r� r� r� r� r� r� r� r� rD r� r� r� r r� r� r r r� r� r� rS r r� r� r� r� ro ry r} rv r� � __classcell__r\ r\ r| r] r � sx �� �� �� �� ���� �� ���X �4 � 1.�A00 J'� '&9 ) g52 ! )8 Y 6 �r r r� rs c C s | � t| �� d S r� )Zregister_checkerr )rt r\ r\ r] �register� s r� )^rY r! r r� r� r� r[ rc �rer �collections.abcr r r �enumr � functoolsr r# r r r rf Zastroid.exceptionsr r r r Z astroid.nodesr Zastroid.typingr Zpylint.checkersr r Zpylint.checkers.utilsr r r r r Zpylint.constantsr r Zpylint.interfacesr r r r Z pylint.typingr Z pylint.lintr �compilerk rl r� rs r; rN � frozensetZ TYPING_NAMESr� Z DictValuesZDictKeysr� Z node_classesrL rt ru rX r� rM rK r% r, r rT rn r} r� r� r� r� r� r� r� r� r� r� r� r� r r� r\ r\ r\ r] �<module> s� �;�� L. ��� � 0 R
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0.01 |
proxy
|
phpinfo
|
ÐаÑтройка