Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/astroid/nodes/scoped_nodes/__pycache__/scoped_nodes.cpython-39.pyc
Ðазад
a k�h�� � @ s� d Z ddlmZ ddlZddlZddlZddlZddlmZm Z m Z m Z ddl m Z mZ ddlmZmZmZmZmZmZ ddlmZmZmZ ddlmZm Z m Z m Z dd l m Z m!Z!m"Z"m#Z#m$Z$m%Z%m&Z&m'Z'm(Z(m)Z) dd l*m+Z+ dd l,m-Z-m.Z.m/Z/ dd l0m1Z1 dd l2m3Z3m4Z4m5Z5m6Z6m7Z7m8Z8m9Z9 ddl:m;Z;m<Z< ddl=m>Z> ddl?m@Z@ ddlAmBZBmCZCmDZDmEZE e�r�ddlmFZFmGZG ddlHmIZI dZJeKddh�ZLeKh d��ZMed�ZNdd� ZOdd d �d d �ZPdd d!dd"�d#d$�ZQd%d&� ZRG d'd(� d(e<�ZSG d)d*� d*e;�ZTG d+d,� d,e;�ZUG d-d.� d.e;�ZVG d/d0� d0e;�ZWd1d2� ZXG d3d4� d4e7jYe<�ZZG d5d6� d6e7j[e7jYe7j\e<�Z]G d7d8� d8e]�Z^dEd d9d!d:d;�d<d=�Z_dFd d9d!d>d?�d@dA�Z`dBdC� ZaG dDd � d e7jYe<e7j\�ZbdS )Gz� This module contains the classes for "scoped" node, i.e. which are opening a new local scope in the language definition : Module, ClassDef, FunctionDef (and Lambda, GeneratorExp, DictComp and SetComp to some extent). � )� annotationsN)� Generator�Iterable�Iterator�Sequence)�cached_property� lru_cache)� TYPE_CHECKING�Any�ClassVar�Literal�NoReturn�TypeVar)�bases� protocols�util)� CallContext�InferenceContext�bind_context_to_node� copy_context) �AstroidBuildingError�AstroidTypeError�AttributeInferenceError�DuplicateBasesError�InconsistentMroError�InferenceError�MroError�ParentMissingError�StatementMissing�TooManyLevelsError)�lookup)� ClassModel� FunctionModel� ModuleModel)�AstroidManager)� Arguments�Const�NodeNG�Unknown� _base_nodes� const_factory� node_classes)�ComprehensionScope�LocalsDictNodeNG)�builtin_lookup)�Position)� InferBinaryOp�InferenceErrorInfo�InferenceResult�SuccessfulInferenceResult)�nodes�objects)� LookupMixIn)�__iter__� __getitem__� Exception� BaseException> �builtins.staticmethod�builtins.classmethod� staticmethod� classmethod�_Tc C s� g }dd� | D �} | s|S | D ]2}|d }| D ] }||dd� v r.d} q q. qRq |sft d| ||d��|�|� | D ]}|d |krt|d= qtqdS )z�Merges MROs in *sequences* to a single MRO using the C3 algorithm. Adapted from http://www.python.org/download/releases/2.3/mro/. c S s g | ] }|r|�qS � r@ )�.0�sr@ r@ ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/astroid/nodes/scoped_nodes/scoped_nodes.py� <listcomp>T � z _c3_merge.<locals>.<listcomp>r � NzTCannot create a consistent method resolution order for MROs {mros} of class {cls!r}.��messageZmros�cls�context)r �append)� sequencesrI rJ �result�s1� candidate�s2�seqr@ r@ rC � _c3_mergeL s. � rR zlist[list[ClassDef]]�None)rL �returnc C s� | dd� }| d }t |�D ] \}}|�� dkr |} q>q dS t |�D ](\}}||krXqFtdd� |D ��rF qtqFdS |�|� |�|� dS )a� A class can inherit from typing.Generic directly, as base, and as base of bases. The merged MRO must however only contain the last entry. To prepare for _c3_merge, remove some typing.Generic entries from sequences if multiple are present. This method will check if Generic is in inferred_bases and also part of bases_mro. If true, remove it from inferred_bases as well as its entry the bases_mro. Format sequences: [[self]] + bases_mro + [inferred_bases] rF ����typing.GenericNc s s | ]}|� � d kV qdS )rV N��qname�rA �baser@ r@ rC � <genexpr>� rE z+clean_typing_generic_mro.<locals>.<genexpr>)� enumeraterX �any�pop)rL � bases_mro�inferred_bases�irZ Zposition_in_inferred_basesrQ r@ r@ rC �clean_typing_generic_mror s rb �ClassDef�InferenceContext | None)rL rI rJ rT c C sN | D ]D}t � }|D ]4}|j|�� f}||v r<td| ||d��|�|� qq| S )Nz,Duplicates found in MROs {mros} for {cls!r}.rG )�set�linenorX r �add)rL rI rJ �sequence�seen�nodeZlineno_and_qnamer@ r@ rC �clean_duplicates_mro� s �rk c C sF t | t�rB| jdkr t�| |�S | jdkr.| S | jdkrBt�| �S | S )Nr> �propertyr= )� isinstance� FunctionDef�typer � BoundMethodZ UnboundMethod)�n�klassr@ r@ rC �function_to_method� s rs c s� e Zd ZU dZdZded< dZded< dZded < e� Z h d �Z d ed < d Z dZ daddddddd�� fdd� Z dd�ddd�dd �Zd d � Zd d � Zd!d"d#�d$d%�Zdbd'dd!d(d)�d*d+�Zd,d-�d.d/�Zdd-�d0d1�Zdcd2d3�d4d5�Zdddd2d6d7�d8d9�Zdd-�d:d;�Zdd<�d=d>d?�d@dA�ZdBdC� ZdDdE� ZdZdd-�dFdG�Z dedddHdd dI�dJdK�Z ddHddL�dMdN�Z dOdP� Z dQdR� Z dfd2ddS�dTdU�Z!dVdW� Z"dd<�dXd=dXdY�dZd[�Z#dgd2d\d]d^�d_d`�Z$� Z%S )h�Modulez�Class representing an :class:`ast.Module` node. >>> import astroid >>> node = astroid.extract_node('import astroid') >>> node <Import l.1 at 0x7f23b2e4e5c0> >>> node.parent <Module l.0 at 0x7f23b2e4eda0> )�doc_node�body� Const | Noneru Nzstr | bytes | None� file_bytesz str | None� file_encoding> �__file__�__path__� __package__�__name__�__doc__zClassVar[set[str]]� scope_attrs)�name�file�path�package� pure_python�future_imports)�locals�globalsFT�strzSequence[str] | None�boolrS )r� r� r� r� r� rT c sV || _ || _|| _|| _|| _| i | _| _g | _t� | _ t � j dd dd d d� d S )Nr )rf �parent� col_offset� end_lineno�end_col_offset) r� r� r� r� r� r� r� rv re r� �super�__init__)�selfr� r� r� r� r� �� __class__r@ rC r� � s �zModule.__init__)ru zlist[node_classes.NodeNG]�rv ru c C s || _ || _d S �Nr� )r� rv ru r@ r@ rC �postinit s zModule.postinitc C s4 | j d urt�| j �S | jd ur0t| jd�}|S d S )N�rb)rx �io�BytesIOr� �open)r� �streamr@ r@ rC � _get_stream s zModule._get_streamc C s | � � S )zaGet a stream to the underlying file or bytes. :type: file or io.BytesIO or None )r� �r� r@ r@ rC r� # s z Module.stream�int�tuple[int, int]�rf rT c C s | j | jfS )z�Get a range from where this node starts to where this node ends. :param lineno: Unused. :returns: The range of line numbers that this node belongs to. �� fromlineno�tolineno�r� rf r@ r@ rC � block_range* s zModule.block_ranger r6 z2tuple[LocalsDictNodeNG, list[node_classes.NodeNG]]�rj r� �offsetrT c C sN || j v r@|| jvr@z| | �|�fW S ty> | g f Y S 0 | �|||�S )a� Lookup where the given variable is assigned. :param node: The node to look for assignments up to. Any assignments after the given node are ignored. :param name: The name of the variable to find assignments for. :param offset: The line offset to filter statements up to. :returns: This scope node and the list of assignments associated to the given name according to the scope where it has been found (locals, globals or builtin). )r r� �getattrr � _scope_lookup)r� rj r� r� r@ r@ rC � scope_lookup3 s zModule.scope_lookupzLiteral['builtins.module']�rT c C s dS )�eGet the name of the type that this node represents. :returns: The name of the type. zbuiltins.moduler@ r� r@ r@ rC �pytypeJ s z Module.pytypec C s dS )�jA human readable type of this node. :returns: The type of this node. :rtype: str rt r@ r� r@ r@ rC � display_typeQ s zModule.display_typerd �rJ c C s� |st | ||d��g }|| jv }|| jv rX|sX|sX| j�|�g}|dkr�|�td�� nh|sl|rl| j| }nT| jr�z| j|dd�g}W n8 tt fy� } z t | ||d�|�W Y d }~n d }~0 0 dd� |D �}|r�|S t | ||d��d S )N��target� attributerJ r} �__main__T)� relative_onlyc S s g | ]}t |tj�s|�qS r@ )rm r+ ZDelName�rA rq r@ r@ rC rD o rE z"Module.getattr.<locals>.<listcomp>) r r� �special_attributesr rK r* r� � import_moduler � SyntaxError)r� r� rJ Z ignore_localsrM Zname_in_locals�excr@ r@ rC r� Y s. ��zModule.getattr�Iterator[InferenceResult]�r� rJ rT c C sh t |�}||_ztj| �||�|| d�W S tyb } z"tt|�| ||d�|�W Y d}~n d}~0 0 dS )��Infer the possible values of the given variable. :param name: The name of the variable to infer. :returns: The inferred possible values. ��framer� N)r � lookupnamer � _infer_stmtsr� r r r� �r� r� rJ �errorr@ r@ rC �igetattrt s ��zModule.igetattrc C s | j duo| j �d�S )z�Check if this module has been build from a .py file. If so, the module contains a complete representation, including the code. :returns: Whether the module has been built from a .py file. Nz.py)r� �endswithr� r@ r@ rC � fully_defined� s zModule.fully_defined��future�Literal[None, True]r )r� rT c C s& |durt jdtdd� t| d��dS )z�The first parent node, including self, marked as statement node. When called on a :class:`Module` this raises a StatementMissing. Nz.The future arg will be removed in astroid 4.0.� )� stacklevel�r� )�warnings�warn�DeprecationWarningr �r� r� r@ r@ rC � statement� s �zModule.statementc C s dS )zThe previous sibling statement. :returns: The previous sibling statement node. :rtype: NodeNG or None Nr@ r� r@ r@ rC �previous_sibling� s zModule.previous_siblingc C s dS )z|The next sibling statement node. :returns: The next sibling statement node. :rtype: NodeNG or None Nr@ r� r@ r@ rC � next_sibling� s zModule.next_siblingc C s | j S )zWhether :pep:`328` absolute import behaviour has been enabled. :returns: Whether :pep:`328` has been enabled. )�_absolute_import_activatedr� r@ r@ rC �absolute_import_activated� s z Module.absolute_import_activated� int | None)�modnamer� �level� use_cacherT c C sb |r|du rd}| � ||�}zt� j||d�W S tyP |rB� ||krL� Y n0 t� j||d�S )ax Get the ast for a given module as if imported from this module. :param modname: The name of the module to "import". :param relative_only: Whether to only consider relative imports. :param level: The level of relative import. :param use_cache: Whether to use the astroid_cache of modules. :returns: The imported module ast. Nr )r� )�relative_to_absolute_namer$ Zast_from_module_namer )r� r� r� r� r� Z absmodnamer@ r@ rC r� � s � zModule.import_module)r� r� rT c C s | � � r|du r|S |r�| jr:|d }| j�d|�d }np| jr�tj�tj�| jd �d �s�tj�tj�| jd �d |�d�d �r�|d }d}n| j�d|�d }|r�| j� d�|k r�t || jd��n | jr�| j}n| j�dd�d }|�r |s�|S |� d|� �S |S ) a� Get the absolute module name for a relative import. The relative import can be implicit or explicit. :param modname: The module name to convert. :param level: The level of relative import. :returns: The absolute module name. :raises TooManyLevelsError: When the relative import refers to a module too far above this one. NrF �.r z /__init__.py�/� )r� r� ) r� r� r� �rsplitr� �os�exists�dirname�split�countr )r� r� r� � package_namer@ r@ rC r� � s6 � �"��z Module.relative_to_absolute_namec C s2 dd� | � � D �}z | d }W n ty4 | Y S 0 zt|�� �}W n. ttfy` | Y S tyt | Y S 0 g }zt|�� �}W n ttfy� | Y S 0 t|t j t j f�s�|S dd�dd�}|j D ]\}||�r�|� |j� q�zt|�� �}W n ttf�y Y q�Y n0 ||�r�|� |j� q�|S )a The list of imported names when this module is 'wildcard imported'. It doesn't include the '__builtins__' name which is added by the current CPython implementation of wildcard imports. :returns: The list of imported names. :rtype: list(str) c S s g | ]}|� d �s|�qS ��_�� startswith�rA r� r@ r@ rC rD rE z0Module.wildcard_import_names.<locals>.<listcomp>�__all__r� r� c S s t | tj�ot | jt�S r� )rm r+ r& �valuer� )rj r@ r@ rC � str_const/ s z/Module.wildcard_import_names.<locals>.str_const)�keys�KeyError�nextZassigned_stmtsr � StopIteration�AttributeError�inferrm r+ �Tuple�List�eltsrK r� )r� �defaultZ all_values�explicit�inferredr� rj Z inferred_noder@ r@ rC �wildcard_import_names s: z Module.wildcard_import_namesc C s dd� | � � D �S )z�The list of the names that are publicly available in this module. :returns: The list of public names. :rtype: list(str) c S s g | ]}|� d �s|�qS r� r� r� r@ r@ rC rD D rE z'Module.public_names.<locals>.<listcomp>)r� r� r@ r@ rC � public_names> s zModule.public_names�rJ rT c C s dS )z�Determine the boolean value of this node. :returns: The boolean value of this node. For a :class:`Module` this is always ``True``. Tr@ �r� rJ r@ r@ rC � bool_valueF s zModule.bool_valuec c s | j E d H d S r� �rv r� r@ r@ rC � get_childrenN s zModule.get_childrenr? �r� r� rT c C s | S �z�The node's frame node. A frame node is a :class:`Module`, :class:`FunctionDef`, :class:`ClassDef` or :class:`Lambda`. :returns: The node itself. r@ r� r@ r@ rC r� Q s z Module.framer zGenerator[Module]�rJ �kwargsrT c k s | V d S r� r@ �r� rJ r r@ r@ rC �_infer[ s z Module._infer)NNFT)r )NF)N)FNT)N)N)&r} � __module__� __qualname__r~ �_astroid_fields�__annotations__rx ry r# r� r � _other_fields�_other_other_fieldsr� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r � __classcell__r@ r@ r� rC rt � sZ � -� � � � �&02 �rt c sn e Zd ZU dZdZdZded< ddddddd �� fd d � Zdd dd �dd�Zdddd�dd�Z dd� Z � Z S )� GeneratorExpz�Class representing an :class:`ast.GeneratorExp` node. >>> import astroid >>> node = astroid.extract_node('(thing for thing in things if thing)') >>> node <GeneratorExp l.1 at 0x7f23b2e4e400> ��elt� generators�r� r' r r� r� rS �rf r� r� r� r� rT c s& i | _ g | _t� j|||||d� d S �N�rf r� r� r� r� �r� r r� r� �r� rf r� r� r� r� r� r@ rC r� o s �zGeneratorExp.__init__�list[nodes.Comprehension]�r r rT c C s || _ || _d S r� r �r� r r r@ r@ rC r� � s zGeneratorExp.postinitNrd � Literal[True]r� c C s dS )z�Determine the boolean value of this node. :returns: The boolean value of this node. For a :class:`GeneratorExp` this is always ``True``. Tr@ r� r@ r@ rC r� � s zGeneratorExp.bool_valuec c s | j V | jE d H d S r� r r� r@ r@ rC r� � s zGeneratorExp.get_children)N� r} r r r~ r r r r� r� r� r� r r@ r@ r� rC r a s r c sv e Zd ZU dZdZdZded< ded< dddddd d �� fd d � Zddd d d�dd�Zddd�dd�Z dd� Z � Z S )�DictCompz�Class representing an :class:`ast.DictComp` node. >>> import astroid >>> node = astroid.extract_node('{k:v for k, v in things if k > v}') >>> node <DictComp l.1 at 0x7f23b2e41d68> ��keyr� r r r' r r� r� r� rS r c s i | _ t� j|||||d� d S r )r� r� r� r r� r@ rC r� � s �zDictComp.__init__r )r r� r rT c C s || _ || _|| _d S r� r )r� r r� r r@ r@ rC r� � s zDictComp.postinitNrd r� c C s t jS )z�Determine the boolean value of this node. :returns: The boolean value of this node. For a :class:`DictComp` this is always :class:`Uninferable`. :rtype: Uninferable �r � Uninferabler� r@ r@ rC r� � s zDictComp.bool_valuec c s | j V | jV | jE d H d S r� r r� r@ r@ rC r� � s zDictComp.get_children)Nr r@ r@ r� rC r � s r c sl e Zd ZU dZdZdZded< ddddddd �� fd d � Zdd dd �dd�Zddd�dd�Z dd� Z � Z S )�SetCompz�Class representing an :class:`ast.SetComp` node. >>> import astroid >>> node = astroid.extract_node('{thing for thing in things if thing}') >>> node <SetComp l.1 at 0x7f23b2e41898> r r r' r r� r� rS r c s& i | _ g | _t� j|||||d� d S r r r r� r@ rC r� � s �zSetComp.__init__r r c C s || _ || _d S r� r r r@ r@ rC r� � s zSetComp.postinitNrd r� c C s t jS )z�Determine the boolean value of this node. :returns: The boolean value of this node. For a :class:`SetComp` this is always :class:`Uninferable`. :rtype: Uninferable r r� r@ r@ rC r� � s zSetComp.bool_valuec c s | j V | jE d H d S r� r r� r@ r@ rC r� s zSetComp.get_children)Nr r@ r@ r� rC r � s r c sj e Zd ZU dZdZdZded< ddddddd �� fd d � Zdd d�d d�Zddd�dd�Z dd� Z � Z S )�ListCompz�Class representing an :class:`ast.ListComp` node. >>> import astroid >>> node = astroid.extract_node('[thing for thing in things if thing]') >>> node <ListComp l.1 at 0x7f23b2e418d0> r r r' r r� r� rS r c s& i | _ g | _t� j|||||d� d S r r r r� r@ rC r� s �zListComp.__init__r c C s || _ || _d S r� r r r@ r@ rC r� 2 s zListComp.postinitNrd r� c C s t jS )z�Determine the boolean value of this node. :returns: The boolean value of this node. For a :class:`ListComp` this is always :class:`Uninferable`. :rtype: Uninferable r r� r@ r@ rC r� 6 s zListComp.bool_valuec c s | j V | jE d H d S r� r r� r@ r@ rC r� ? s zListComp.get_children)Nr r@ r@ r� rC r! s r! c C s� t | t�sdS | jsdS zt| �| j�d�}W n tyB Y dS 0 t |tj�rV|j}t |t �r||� d�rndS |� d�r|dS t |t�r�|j s�dS |j j D ]^}t |t j�r�|jtv r�|j S t |t j�r�t |jt j�r�|jjdkr�|jtv r�|j S q�dS )z_Detect decorator call chaining and see if the end result is a static or a classmethod. Nr< r> r; r= �builtins)rm rn r� r� �infer_call_resultr r �Instance�_proxiedrc � is_subtype_of� decoratorsr4 r+ �Namer� �BUILTIN_DESCRIPTORS� Attribute�expr�attrname)rj rM � decoratorr@ r@ rC �_infer_decorator_callchainE s@ � � �� r. c s\ e Zd ZU dZdZded< dZded< dZdZe � Z d ed < d ed < d d�dd�Z e dd�dd��Z ddd ddd�� fdd� Zd d dd�dd �Zd d�d d �Zd d�d!d"�Zd#d�d$d%�Zd&d�d'd(�ZdLd*d+d,d-�d.d/�ZdMd1d dd2d3�d4d5�ZdNd+d#d6�d7d8�Zd9d:� Zd)d;�d<d=d<d>�d?d@�ZdOd d+dAdB�dCdD�ZdPd+dEdFdG�dHdI�ZdJdK� Z� Z S )Q�Lambdaz�Class representing an :class:`ast.Lambda` node. >>> import astroid >>> node = astroid.extract_node('lambda arg: arg + 1') >>> node <Lambda.<lambda> l.1 at 0x7f23b2e41518> ��argsrv zClassVar[tuple[str, ...]]r r r z<lambda>Tr% r1 r' rv z Literal[0]r� c C s dS )Nr r@ r� r@ r@ rC �implicit_parameters� s zLambda.implicit_parametersz Literal['method', 'function']c C s8 | j jr4| j jd jdkr4| jr4t| j�� t�r4dS dS )zuWhether this is a method or function. :returns: 'method' if this is a method, 'function' otherwise. r r� �method�function)r1 � argumentsr� r� rm �scoperc r� r@ r@ rC ro � s z Lambda.typer� r� )rf r� r� r� r� c s& i | _ i | _t� j|||||d� d S r )r� �instance_attrsr� r� r r� r@ rC r� � s �zLambda.__init__rS )r1 rv rT c C s || _ || _d S r� r0 )r� r1 rv r@ r@ rC r� � s zLambda.postinit�7Literal['builtins.instancemethod', 'builtins.function']c C s d| j v rdS dS �r� r3 zbuiltins.instancemethodzbuiltins.function�ro r� r@ r@ rC r� � s z Lambda.pytyper� c C s d| j v rdS dS �r� r3 ZMethod�Functionr: r� r@ r@ rC r� � s zLambda.display_typer c C s dS )z�Whether this node defines something that is callable. :returns: Whether this defines something that is callable For a :class:`Lambda` this is always ``True``. Tr@ r� r@ r@ rC �callable� s zLambda.callable� list[str]c C s$ | j jr dd� | j jD �}ng }|S )� Get the names of each of the arguments, including that of the collections of variable-length arguments ("args", "kwargs", etc.), as well as positional-only and keyword-only arguments. :returns: The names of the arguments. :rtype: list(str) c S s g | ] }|j �qS r@ �r� �rA r r@ r@ rC rD � rE z#Lambda.argnames.<locals>.<listcomp>�r1 r5 �r� �namesr@ r@ rC �argnames� s zLambda.argnamesN� SuccessfulInferenceResult | Nonerd r� ��callerrJ rT c C s | j �|�S )�,Infer what the function returns when called.)rv r� )r� rH rJ r@ r@ rC r# � s zLambda.infer_call_resultr r6 z%tuple[LocalsDictNodeNG, list[NodeNG]]r� c C sZ | j jr|| j jv s(| j jrH|| j jv rH| js8t| d��| j�� }d}n| }|�|||�S )a� Lookup where the given names is assigned. :param node: The node to look for assignments up to. Any assignments after the given node are ignored. :param name: The name to find assignments for. :param offset: The line offset to filter statements up to. :returns: This scope node and the list of assignments associated to the given name according to the scope where it has been found (locals, globals or builtin). r� rU )r1 �defaults� kw_defaultsr� r r� r� �r� rj r� r� r� r@ r@ rC r� � s � � zLambda.scope_lookupr� c C s dS )z�Determine the boolean value of this node. :returns: The boolean value of this node. For a :class:`Lambda` this is always ``True``. Tr@ r� r@ r@ rC r� � s zLambda.bool_valuec c s | j V | jV d S r� r0 r� r@ r@ rC r� s zLambda.get_childrenr� r? r� r� c C s | S r r@ r� r@ r@ rC r� s z Lambda.frame� list[NodeNG]r� c C s^ |st | ||d��g }|| jv r*| j| }|| jv rF|�| j�|�� |rN|S t | |d��d S �Nr� )r� r� �r r7 r� rK r �r� r� rJ Z found_attrsr@ r@ rC r� s zLambda.getattrr zGenerator[Lambda]r c k s | V d S r� r@ r r@ r@ rC r s z Lambda._inferc c s | j �� E dH dS )z3A Lambda node can contain a Yield node in the body.N)rv � _get_yield_nodes_skip_functionsr� r@ r@ rC rQ " s z&Lambda._get_yield_nodes_skip_functions)N)r )N)N)N) r} r r r~ r r r r� Z is_lambdar" r� r2 rl ro r� r� r� r� r= rE r# r� r� r� r� r� r rQ r r@ r@ r� rC r/ j s: � � � �r/ c s. e Zd ZU dZdZdZdZded< ded< d ed < d ZdZ dZ dZ d Z d Z dZdZe� Zdddddddd�� fdd� Zdkdddd�d dddddd�d d �Zed d �d d!��Zd"d �d#d$�Zdd �d%d&�Zd'd �d(d)�Zd*d �d+d,�Zdldd-dd.�d/d0�Zedd �d1d2��Zedd �d3d4��Z ed5d6� �Z d7d �d8d9�Z dd:d;�d<d=�Z dmdd-d>d.�d?d@�Z dAd �dBdC�Z!dnd-dDdE�dFdG�Z"dAd �dHdI�Z#dodAd �dKdL�Z$dAd �dMdN�Z%dpd-dOdPdQ�dRdS�Z&dqd-dT�dUdV�Z'drdWd-d>dX�dYdZ�Z(dsd-dAdE�d[d\�Z)d]d^� Z*dtd`dddadb�dcdd�Z+dde�dfdgdfdh�didj�Z,� Z-S )urn z�Class representing an :class:`ast.FunctionDef`. >>> import astroid >>> node = astroid.extract_node(''' ... def my_func(arg): ... return arg + 1 ... ''') >>> node <FunctionDef.my_func l.2 at 0x7f23b2e71e10> )r' r1 �returns� type_paramsru rv r� N� node_classes.Decorators | Noner' rw ru r% r1 T)r� �position)r� �_type�type_comment_returns�type_comment_argsz <functiondef>r� r� r' r� rS �r� rf r� r� r� r� rT c sZ || _ i | _g | _g | _i | _t� j|||||d� |rVt|t�sV|� � }|� || � d S r ) r� r� rv rS r7 r� r� rm r( r� � set_local)r� r� rf r� r� r� r� r� r� r@ rC r� n s ��zFunctionDef.__init__�rU ru rS rM �Position | None�Alist[nodes.TypeVar | nodes.ParamSpec | nodes.TypeVarTuple] | None)r1 rv r' rU ru rS c C s> || _ || _|| _|| _|| _|| _|| _|| _| p6g | _dS )a� Do some setup after initialisation. :param args: The arguments that the function takes. :param body: The contents of the function body. :param decorators: The decorators that are applied to this method or function. :params type_comment_returns: The return type annotation passed via a type comment. :params type_comment_args: The args type annotation passed via a type comment. :params position: Position of function keyword(s) and name. :param doc_node: The doc node associated with this node. :param type_params: The type_params associated with this node. N) r1 rv r' rR rW rX rU ru rS ) r� r1 rv r' rR rW rX rU ru rS r@ r@ rC r� � s "zFunctionDef.postinitzlist[node_classes.Call]r� c C s� | j rt| j �� }t�s g S g }|jD ]�}t|jtj�r(t|jjtj �r(|j D ]h}t|tj �sbqP|j | j krpqPz|| j }W n t y� Y qPY qP0 t|t�rP|�� |krP|�|j� qPq(|S )a The extra decorators that this function can have. Additional decorators are considered when they are used as assignments, as in ``method = staticmethod(method)``. The property will return all the callables that are used for decoration. )r� rm r� rc �_assign_nodes_in_scoper� r+ �Call�funcr( �targets� AssignNamer� r� rn rK )r� r� r' ZassignZ assign_node�methr@ r@ rC �extra_decorators� s, � � �z FunctionDef.extra_decoratorsr8 c C s d| j v rdS dS r9 r: r� r@ r@ rC r� � s zFunctionDef.pytypec C s d| j v rdS dS r; r: r� r@ r@ rC r� � s zFunctionDef.display_typer c C s dS )NTr@ r� r@ r@ rC r= � s zFunctionDef.callabler> c C s$ | j jr dd� | j jD �}ng }|S )r? c S s g | ] }|j �qS r@ r@ rA r@ r@ rC rD rE z(FunctionDef.argnames.<locals>.<listcomp>rB rC r@ r@ rC rE � s zFunctionDef.argnamesrd r� c C s^ |st | ||d��g }|| jv r*| j| }|| jv rF|�| j�|�� |rN|S t | |d��d S rN rO rP r@ r@ rC r� s zFunctionDef.getattrc C s� | j D ] }|jjtv r|jj S q| js4t| d��| j�� }d}t|t�rz| jdkrZdS | jdkrhdS | jdkrvdS d}| j s�|S | j j D �]`}t|t j �r�|jtv r�|j S t|t j �r�t|jt j �r�|jjdkr�|jtv r�|j S t|t j��rDzt|j�� �}W n ttf�y( Y q�Y n0 t|�}|d u�rD| S z�|�� D ]�}t|�}|d u�rr| W S t|t��s��qN|�� D ]F}t|t��s��q�|�d ��r� W dS |�d ��r� W d S �q��qNW q� t�y� Y q�0 q�|S ) ztThe function type for this node. Possible values are: method, function, staticmethod, classmethod. r� r4 �__new__r> �__init_subclass__�__class_getitem__r3 r" Nr< r; r= )rd r` r� r) r� r r� rm rc r' r4 r+ r( r* r+ r, r_ r� r� r r� r. � ancestorsr& ) r� r- r� � type_namerj �currentrV r� Zancestorr@ r@ rC ro sn � � �� zFunctionDef.typec C s6 | j pd}| jdur.|tdd� | jjD ��7 }|p4dS )z�The first line that this node appears on in the source code. Can also return 0 if the line can not be determined. r Nc s s" | ]}|j |jpd d V qdS )r rF N)r� rf �rA rj r@ r@ rC r[ n s z)FunctionDef.fromlineno.<locals>.<genexpr>)rf r' �sumr4 r� r@ r@ rC r� d s � zFunctionDef.fromlinenoc C s | j jS )�PThe line on which the beginning of this block ends. :type: int )r1 r� r� r@ r@ rC �blockstart_tolinenot s z FunctionDef.blockstart_tolinenoz Literal[0, 1]c C s | � � r dS dS )NrF r )�is_boundr� r@ r@ rC r2 | s z FunctionDef.implicit_parametersr� r� c C s | j | jfS �z�Get a range from the given line number to where this node ends. :param lineno: Unused. :returns: The range of line numbers that this node belongs to, r� r� r@ r@ rC r� s zFunctionDef.block_ranger� c C sZ zt j| �||�|| d�W S tyT } z"tt|�| ||d�|�W Y d}~n d}~0 0 dS )zCInferred getattr, which returns an iterator of inferred statements.r� r� N)r r� r� r r r� r� r@ r@ rC r� � s ��zFunctionDef.igetattrr� c C s$ | j dko"| jduo"t| j�� t�S )zfCheck if this function node represents a method. :returns: Whether this is a method. r4 N)ro r� rm r� rc r� r@ r@ rC � is_method� s ��zFunctionDef.is_methodzset[str]r� c C st t � }g }| jdur || jj7 }|| j7 }|D ]@}z$|j|d�D ]}|�|�� � q@W q. tyl Y q.Y q.0 q.|S )z�Get the qualified names of each of the decorators on this function. :param context: An inference context that can be passed to inference functions :returns: The names of the decorators. Nr� )re r' r4 rd r� rg rX r )r� rJ rM ZdecoratornodesZdecnodeZinfnoder@ r@ rC �decoratornames� s zFunctionDef.decoratornamesc C s | j dv S )z�Check if the function is bound to an instance or class. :returns: Whether the function is bound to an instance or class. > r3 r> r: r� r@ r@ rC ro � s zFunctionDef.is_boundFc C s� | j rV| j jD ]F}zt|�� �}W n ttfy< Y qY n0 |r|�� dv r dS q| jD ]:}t|t j �r�|rv dS |� � r� dS |o�t|t j � S |r�dS dS )a� Check if the method is abstract. A method is considered abstract if any of the following is true: * The only statement is 'raise NotImplementedError' * The only statement is 'raise <SomeException>' and any_raise_is_abstract is True * The only statement is 'pass' and pass_is_abstract is True * The method is annotated with abc.astractproperty/abc.abstractmethod :returns: Whether the method is abstract. > zabc.abstractmethodzabc.abstractpropertyTF) r' r4 r� r� r r� rX rv rm r+ �RaiseZraises_not_implemented�Pass)r� �pass_is_abstract�any_raise_is_abstractrj r� � child_noder@ r@ rC � is_abstract� s$ zFunctionDef.is_abstractc C s$ t | �� �}t | �� �}t||@ �S )zhCheck if this is a generator function. :returns: Whether this is a generator function. )re Z _get_yield_nodes_skip_lambdasrQ r� )r� Zyields_without_lambdasZyields_without_functionsr@ r@ rC � is_generator� s zFunctionDef.is_generatorr zCGenerator[objects.Property | FunctionDef, None, InferenceErrorInfo]r c + s� ddl m� | jr t�| �s.| V t| |d�S | js>t| d��| j�� }| j |j v opt � fdd�|j | j D ��}t | jt jt jf�r�d}� j| | j | j|s�| jnd | jd�}|r�| j|_|jg | j| jd � |V t| |d�S ) Nr �r5 �rj rJ r� c 3 s | ]}t |� j�V qd S r� )rm �Property)rA �valrz r@ rC r[ � s z%FunctionDef._infer.<locals>.<genexpr>T)r4 r� rf r� r� )rv r1 ru )�astroidr5 r' r � _is_propertyr1 r� r r� r� r� r] rm r+ �Try�Ifr| rf r� r� r1 ru )r� rJ r Z parent_frameZ!property_already_in_parent_localsZ prop_funcr@ rz rC r � s6 � � �zFunctionDef._inferr� c c s` | � tj�D ]N}|jdu r:t�d�}||_|j|_|V q |�� | kr |jj|d�E dH q dS )z�Infer what the function yields when called :returns: What the function yields :rtype: iterable(NodeNG or Uninferable) or None Nr� ) Znodes_of_classr+ �Yieldr� r& r� rf r6 r� )r� rJ Zyield_�constr@ r@ rC �infer_yield_result s z FunctionDef.infer_yield_resultrF rG c # sJ | � � r6t| t�rtj}ntj}|| � d�}|V dS | jdk�r�|du�r�| jj�r�t| jj�dk�r�| jj du�r�t|jt �r�|jjdus�J �t |jjd � � �d�}n8t|jt �r�t |jd � � �d�}ntdt|j�� ���t|t��r�z � fdd�|jdd� D �}W n> t�yN } z$t|jdd� � d �|�W Y d}~n d}~0 0 td dddd| d �}d |_|jd d� |D �g d|d� |V dS | �� } t | d�} | �s�| j�r�| jd d d��r�tjV n t�d�V dS td��t � | f| �D ]T} | j du �rt�d�V n4z| j � � �E dH W n t�y@ tjV Y n0 �q�dS )rI )Zgenerator_initial_contextN�with_metaclassrF r z0caller.args was neither Arguments nor list; got c s2 g | ]*}t d d� |j� r � �� n� d�D ���qS )c s s& | ] }t |t�r|jd u s|V qd S r� �rm r& r� �rA �br@ r@ rC r[ H s �z;FunctionDef.infer_call_result.<locals>.<listcomp>.<genexpr>r� )r� r� �clone)rA �argr� r@ rC rD F s ���z1FunctionDef.infer_call_result.<locals>.<listcomp>r{ �temporary_class)r� rf r� r� r� r� Tc S s g | ]}t |tj�s|�qS r@ �rm r �UninferableBaserY r@ r@ rC rD ] s �)r rv r' � metaclass)ru rv z0The function does not have any return statements) ry rm �AsyncFunctionDefr �AsyncGeneratorr r� r1 �len�varargr% r� r� �list� TypeErrorro rc r� r �hider� Z _get_return_nodes_skip_functionsrv rx r r r+ r& � itertools�chainr� ) r� rH rJ Z generator_clsrM r� � class_bases�e� new_classrR Z first_returnZ returnnoder@ r� rC r# s� ���� � � � .��� z FunctionDef.infer_call_resultc C s dS )z�Determine the boolean value of this node. :returns: The boolean value of this node. For a :class:`FunctionDef` this is always ``True``. Tr@ r� r@ r@ rC r� ~ s zFunctionDef.bool_valuec c sH | j d ur| j V | jV | jd ur,| jV | jE d H | jE d H d S r� )r' r1 rR rS rv r� r@ r@ rC r� � s zFunctionDef.get_childrenr r6 �+tuple[LocalsDictNodeNG, list[nodes.NodeNG]]r� c C s� |dkr,| j r,t| j �� }t�r,| |gfS | jjr@|| jjv sT| jjrt|| jjv rt| j sdt| d��| j �� }d}n| }|�|||�S )z(Lookup where the given name is assigned.r� r� rU ) r� rm r� rc r1 rJ rK r r� rL r@ r@ rC r� � s � � zFunctionDef.scope_lookupr� r? r� r� c C s | S r r@ r� r@ r@ rC r� � s zFunctionDef.frame)NNNN)N)N)N)TF)N)N)N)N)r ).r} r r r~ r Z_multi_line_block_fieldsrR r Z is_functionZtype_annotationrX rW r r rV r� r" r� r� r� r rd r� r� r= rE r� ro r� rn r2 r� r� rq rr ro rx ry r r� r# r� r� r� r� r r@ r@ r� rC rn ' sv ) � � ,' �H � $ �( �^ �rn c @ s e Zd ZdZdS )r� a� Class representing an :class:`ast.FunctionDef` node. A :class:`AsyncFunctionDef` is an asynchronous function created with the `async` keyword. >>> import astroid >>> node = astroid.extract_node(''' async def func(things): async for thing in things: print(thing) ''') >>> node <AsyncFunctionDef.func l.2 at 0x7f23b2e416d8> >>> node.body[0] <AsyncFor l.3 at 0x7f23b2e417b8> N)r} r r r~ r@ r@ r@ rC r� � s r� zset[str] | Noner� )rr ri rJ rT c C s� | j dkrdS |du r t� }| jD ]�}z�|j|d�D ]x}|�� }||v rJq4|�|� t|tj�rj W dS || u rtq4t|t�s�q4|j dkr� W dS t |||d�r4 W dS q4W q" t y� Y q"Y q"0 q"dS )z>Return if the given class can be used as a metaclass. ro TNr� Fr� ) r� re r r� rX rg rm r$ rc rV � _is_metaclassr )rr ri rJ rZ �baseobjZ baseobj_namer@ r@ rC r� � s0 r� z*Literal['class', 'exception', 'metaclass'])rr rh rJ rT c C s� | j dur| j S t| |d�r$d| _ n�| j�d�r8d| _ nv|du rFt� }| �� }||v r`d| _ dS |�|� | jdd�D ]6}t||�}|dkrv|dkr�| j dkr�qv|j | _ q�qv| j du r�d| _ | j S ) z]return a ClassDef node type to differ metaclass and exception from 'regular' classes Nr� r� r9 � exception�classF)�recurs) rV r� r� r� re rX rg rh � _class_typero )rr rh rJ � klass_namerZ r� r@ r@ rC r� � s. r� c C s: | � � }|dur6t|t�s6|jdu r*d}q|j� � }q|S )z�Get the class that wraps the given node. We consider that a class wraps a node if the class is a parent for the said node. :returns: The class that wraps the given node :rtype: ClassDef or None N)r� rm rc r� )rj rr r@ r@ rC �get_wrapping_class s r� c s` e Zd ZU dZdZdZe� ZdZde d< dZ de d< dZ dZ e ed d �Zd Zd ZdZd e d< dddddddd�� fdd� ZejZde d< dd�dd �Zd d � Zd�dddd �d d!d"d dd#d$d%d&dd'� d(d)�Zd�d*d+�d,d-�ZdZe ed.d �Ze d/d0� �Z dd1d2�d3d4�Z d5d�d6d7�Z dd�d8d9�Z d:d�d;d<�Z!d�d*d:d=�d>d?�Z"d@dA� Z#d�dBd*dCdD�dEdF�Z$d�dHdddIdJ�dKdL�Z%e dMdN� �Z&d�d:d*dPdQ�dRdS�Z'd�d*d+�dTdU�Z(d�d*d+�dVdW�Z)d:d�dXdY�Z*d�d*d+�dZd[�Z+d�d*d+�d\d]�Z,d^d�d_d`�Z-d�dd*d:dadb�dcdd�Z.e/dedf�dgdh� �Z0didj� Z1d�dd*d:dCdb�dkdl�Z2d�d*d:d=�dmdn�Z3d�d*d+�dodp�Z4dqdr� Z5dsdt� Z6dudv� Z7d�d*dBd=�dwdx�Z8d�dyd*dBdz�d{d|�Z9d�d*dBd=�d}d~�Z:dd�� Z;d�d�� Z<d�d�� Z=e d�d�� �Z>d�d�� Z?d�d*d+�d�d��Z@d�d*d+�d�d��ZAd�d*d�d=�d�d��ZBd�d*d�d=�d�d��ZCd�d�� ZDe d�d�� �ZEdd��d�d�d�d��d�d��ZFd�d*d�dPd��d�d��ZG� ZHS )�rc a Class representing an :class:`ast.ClassDef` node. >>> import astroid >>> node = astroid.extract_node(''' class Thing: def my_meth(self, arg): return arg + self.offset ''') >>> node <ClassDef.Thing l.2 at 0x7f23b2e9e748> )r' r �keywordsru rv rS Nz1Literal['class', 'exception', 'metaclass'] | NonerV z NodeNG | None� _metaclassFz\The class type for this node. Possible values are: class, metaclass, exception. :type: str)�doc)r� � is_dataclassrU )r� � _newstylez bool | Noner� r� r� r' r� rS rY c s� i | _ i | _g | _g | _g | _|| _d | _d | _d| _g | _ t � j |||||d� |rpt |t �sp|�� �|| � | �� D ]\}}| �||� qxd S )NFr )r7 r� r� r rv r� r' ru r� rS r� r� rm r( r� rZ �implicit_localsZadd_local_node) r� r� rf r� r� r� r� Z local_namerj r� r@ rC r� ^ s, ��zClassDef.__init__z!ClassVar[InferBinaryOp[ClassDef]]�infer_binary_opz Literal[1]r� c C s dS )NrF r@ r� r@ r@ rC r2 � s z ClassDef.implicit_parametersc C s. d| j jff}|d| j jfd| j jff7 }|S )z�Get implicitly defined class definition locals. :returns: the the name and Const pair for each local :rtype: tuple(tuple(str, node_classes.Const), ...) r r r )r� Zattr___module__Zattr___qualname__Zattr___annotations__)r� Zlocals_r@ r@ rC r� � s �zClassDef.implicit_localsr[ z list[SuccessfulInferenceResult]rM rT z!list[node_classes.Keyword] | Noner\ rw r] ) r rv r' �newstyler� r� rU ru rS rT c C sF |d ur|| _ || _|| _|| _|| _|| _|| _|| _| p>g | _d S r� ) r� r rv r' r� r� rU ru rS ) r� r rv r' r� r� r� rU ru rS r@ r@ rC r� � s zClassDef.postinitrd r� c C s� |d u rt � }| jd ur | jS | jd|d�D ]}|�|�r,d| _ qFq,| �� }|d urlt|t�rl|�|�| _| jd u r|d| _| jS )NF�r� rJ T)r r� rh �_newstyle_impl�declared_metaclassrm rc )r� rJ rZ rr r@ r@ rC r� � s zClassDef._newstyle_implz=Whether this is a new style class or not :type: bool or Nonec C s | j r| j d jS | jS )rm rU )r r� r� r� r@ r@ rC rn � s z ClassDef.blockstart_tolinenor� r� c C s | j | jfS rp r� r� r@ r@ rC r� � s zClassDef.block_rangez-Literal['builtins.type', 'builtins.classobj']c C s | j r dS dS )r� � builtins.typezbuiltins.classobj)r� r� r@ r@ rC r� � s zClassDef.pytypec C s dS )r� �Classr@ r� r@ r@ rC r� � s zClassDef.display_typer� c C s dS )z�Whether this node defines something that is callable. :returns: Whether this defines something that is callable. For a :class:`ClassDef` this is always ``True``. Tr@ r� r@ r@ rC r= s zClassDef.callabler� c s. | � � � krdS t� fdd�| j|d�D ��S )z�Whether this class is a subtype of the given type. :param type_name: The name of the type of check against. :type type_name: str :returns: Whether this class is a subtype of the given type. Tc 3 s | ]}|� � � kV qd S r� rW )rA Zanc�ri r@ rC r[ rE z)ClassDef.is_subtype_of.<locals>.<genexpr>r� )rX r] rh )r� ri rJ r@ r� rC r& s zClassDef.is_subtype_ofc C s� zt |jd �|��}W n8 tyP } z t|jd |d�|�W Y d }~n d }~0 0 t|tj�rrt|jt �rr|j}nt j S t |ddddt � d�}zt |jd �|��}W n8 ty� } z t|jd |d�|�W Y d }~n d }~0 0 t|tjtjf��r<g }|�� D ]2} t | j|d�d �} | �r |�tj| | d�� �q ||_nt j S zt |jd �|��} W n ttf�yv d } Y n0 | �r�t| tj��r�| jD ]4\} } t| tj��r�t| jt ��r�| g|j| j< �q�|j|_|S )Nr r{ r rF r� )�originalr� r� )r� r1 r� r� r rm r+ r& r� r� r r rc r( r� r� �iteredrK ZEvaluatedObjectr �Dict�itemsr� r� )r� rH rJ � name_noder� r� rM r� r rZ r� �members�attrr� r@ r@ rC �_infer_type_call sR *�� * � zClassDef._infer_type_callrF r� rG c c s� | � d|�r0t|j�dkr0| �||�}|V dS d}z2| j|d�}|durdd|jv rdt|�d|��}W n tt fy| Y n0 |r�|� � dkr�t || �}||j _ |�||�E dH n | �� V dS )z+infer what a class is returning when calledr� � Nr� �__call__zbuiltins.type.__call__)r& r� r1 r� r� r� r� r� r r� rX r � callcontext�calleer# �instantiate_class)r� rH rJ rM Z dunder_callr� r@ r@ rC r# O s" zClassDef.infer_call_resultr r6 r� r� c sj t � jtj�o|t� jv }t� �fdd��jD ��s8|rX�jsHt�d���j� � }d}n�}|� � ||�S )a� Lookup where the given name is assigned. :param node: The node to look for assignments up to. Any assignments after the given node are ignored. :param name: The name to find assignments for. :param offset: The line offset to filter statements up to. :returns: This scope node and the list of assignments associated to the given name according to the scope where it has been found (locals, globals or builtin). c 3 s( | ] }� |kp |� � �o �j V qd S r� )Z parent_ofrS rY �rj r� r@ rC r[ � s �z(ClassDef.scope_lookup.<locals>.<genexpr>r� rU ) rm r� r+ Z Decoratorsr$ Zbuiltins_moduler] r r r� r� )r� rj r� r� Zlookup_upper_framer� r@ r� rC r� p s ���� zClassDef.scope_lookupc C s dd� | j D �S )z�The names of the parent classes Names are given in the order they appear in the class definition. :type: list(str) c S s g | ] }|� � �qS r@ )� as_string)rA Zbnoder@ r@ rC rD � rE z&ClassDef.basenames.<locals>.<listcomp>�r r� r@ r@ rC � basenames� s zClassDef.basenamesTzGenerator[ClassDef])r� rJ rT c c s0 | h}|du rt � }| js<| �� dkr<td�d d V dS | jD ]�}|�� �� z�|�|�D ]�}t|t�s�t|tj�r\|j }nq\|j s�||v r�q\|� |� |V |s�q\|j d|d�D ]*}|| u r� q\||v r�q�|� |� |V q�q\W n$ t �y Y W d � qBY n0 W d � qB1 �s 0 Y qBdS )z�Iterate over the base classes in prefixed depth first order. :param recurs: Whether to recurse or return direct ancestors only. :returns: The base classes N�builtins.object�objectrF r Tr� )r r rX r. Z restore_pathr� rm rc r$ r% r� rg rh r )r� r� rJ �yielded�stmtr� Zgrandpar@ r@ rC rh � s< zClassDef.ancestorsc c sR z| � |�dd� }W n ty4 | j|d�}Y n0 |D ]}||v r:|V q:dS )z�Iterate over the parents that define the given name. :param name: The name to find definitions for. :type name: str :returns: The parents that define the given name. :rtype: iterable(NodeNG) rF Nr� )�mror rh )r� r� rJ rh r~ r@ r@ rC �local_attr_ancestors� s z ClassDef.local_attr_ancestorsc c s& | j |d�D ]}||jv r |V q dS )a Iterate over the parents that define the given name as an attribute. :param name: The name to find definitions for. :type name: str :returns: The parents that define the given name as an instance attribute. :rtype: iterable(NodeNG) r� N)rh r7 )r� r� rJ r~ r@ r@ rC �instance_attr_ancestors� s z ClassDef.instance_attr_ancestorsc C s || j v S )z�Whether this class directly inherits from the given node. :param node: The node to check for. :type node: NodeNG :returns: Whether this class directly inherits from the given node. r� )r� rj r@ r@ rC �has_base s zClassDef.has_basec C sb g }|| j v r| j | }n t| �||�d�}|r:|j | }dd� |D �}|rP|S t| ||d��dS )ah Get the list of assign nodes associated to the given name. Assignments are looked for in both this class and in parents. :returns: The list of assignments to the given name. :rtype: list(NodeNG) :raises AttributeInferenceError: If no attribute with this name can be found in this class or parent classes. Nc S s g | ]}t |tj�s|�qS r@ �rm r+ ZDelAttrr� r@ r@ rC rD rE z'ClassDef.local_attr.<locals>.<listcomp>r� )r� r� r� r )r� r� rJ rM � class_noder@ r@ rC � local_attr s zClassDef.local_attrc C sZ t | j�|g ��}| �||�D ]}||j| 7 }q dd� |D �}|rH|S t| ||d��dS )ak Get the list of nodes associated to the given attribute name. Assignments are looked for in both this class and in parents. :returns: The list of assignments to the given name. :rtype: list(NodeNG) :raises AttributeInferenceError: If no attribute with this name can be found in this class or parent classes. c S s g | ]}t |tj�s|�qS r@ r� r� r@ r@ rC rD 2 rE z*ClassDef.instance_attr.<locals>.<listcomp>r� N)r� r7 �getr� r )r� r� rJ �valuesr� r@ r@ rC � instance_attr! s zClassDef.instance_attrzbases.Instancec C sP ddl m} z&tdd� | �� D ��r0|�| �W S W n tyD Y n0 t�| �S )z�Get an :class:`Instance` of the :class:`ClassDef` node. :returns: An :class:`Instance` of the :class:`ClassDef` node r rz c s s | ]}|j tv V qd S r� )r� �EXCEPTION_BASE_CLASSES)rA rI r@ r@ rC r[ ? rE z-ClassDef.instantiate_class.<locals>.<genexpr>)r~ r5 r] r� ZExceptionInstancer r r$ )r� r5 r@ r@ rC r� 7 s zClassDef.instantiate_classzlist[InferenceResult])r� rJ � class_contextrT c C s� |st | ||d��t| j�|g ��}| jd|d�D ]}||j�|g �7 }q2|| jv r~|r~|s~| j�|�g}|dkrz||7 }|S |r�|| �||�7 }|�� D ]>}t |t j �r�|� � }t |t j �r�|jdu r�|�|�|�� q�|s�t | ||d��|S )a� Get an attribute from this class, using Python's attribute semantic. This method doesn't look in the :attr:`instance_attrs` dictionary since it is done by an :class:`Instance` proxy at inference time. It may return an :class:`Uninferable` object if the attribute has not been found, but a ``__getattr__`` or ``__getattribute__`` method is defined. If ``class_context`` is given, then it is considered that the attribute is accessed from a class context, e.g. ClassDef.attribute, otherwise it might have been accessed from an instance as well. If ``class_context`` is used in that case, then a lookup in the implicit metaclass and the explicit metaclass will be done. :param name: The attribute to look for. :param class_context: Whether the attribute can be accessed statically. :returns: The attribute. :raises AttributeInferenceError: If the attribute cannot be inferred. r� Tr� � __bases__N)r r� r� r� rh r� r �_metaclass_lookup_attribute�copyrm r+ rb r� � AnnAssignr� r^ �index) r� r� rJ r� r� Z classnoderM r� r� r@ r@ rC r� F s( zClassDef.getattri )�maxsizec C sf t � }| �� }t|�}| j|d�}||fD ]6}|r*|| kr*t|t�r*| �|||�}|�t |�� q*|S )zASearch the given name in the implicit and the explicit metaclass.r� )re �implicit_metaclassr r� rm rc � _get_attribute_from_metaclass�update)r� r� rJ �attrsZ implicit_metar� rI Zcls_attributesr@ r@ rC r� � s z$ClassDef._metaclass_lookup_attributec c s� ddl m} z|j||dd�}W n ty4 Y d S 0 tj|||d�D ]p}t|t�s\|V qFt||j�rp|V qF|j dkr�t |�p�| }t� ||�V qF|j dkr�|V qFt� || �V qFd S )Nr rz T)rJ r� r� r> r= ) r~ r5 r� r r r� rm rn r| ro r� rp )r� rI r� rJ r5 r� r� r� r@ r@ rC r� � s$ z&ClassDef._get_attribute_from_metaclassc # s\ ddl m} t|�}||_| j|d�}�z�| j|||d�}t|�dkr~|d |dd� }}|j�� � |g� fdd�|D � }d d� |D ��d}�D ]D} | j |d�} | D ]&} | t j u r�q�| � d �d d kr�| }q�|r� q�q��r��d ���fd d�|D �}t j||| d�D ]�} t| tj��sbt| t j��rbz| j�d|� W n t�yV | V Y n 0 t j V n�t| |j��r�| j} |�s�|j�s�|�s�t| jj| d�|_| j| |d�E dH n2|�r�| j�� |u �r�| j| |d�E dH n| V n t | | �V �q W n^ t�yV } zD|� d��s,| � |��r,t j V nt t | �| ||d�| �W Y d} ~ n d} ~ 0 0 dS )r� r rz r� )r� rF Nc s$ g | ] }|j r|j �� � kr|�qS r@ )r� r6 �rA r� )� first_scoper@ rC rD � s �z%ClassDef.igetattr.<locals>.<listcomp>c S s g | ]}t |t�r|�qS r@ )rm rn r� r@ r@ rC rD � rE r� rU �setterc s* g | ]"}|� vs"|�u s"t �|�r|�qS r@ )r r )rA �a)� functions� last_functionr@ rC rD � s �r� �__get__�r1 r� )rH rJ �__r� )!r~ r5 r r� r� r� r� r� r6 rr r r r� r r� rm r+ r& r$ r% r r| r4 r� r r1 r5 r# rs r� �has_dynamic_getattrr r� )r� r� rJ r� r5 r� � attributesZ first_attrr� r4 Z dec_namesZdec_namer� r� r@ )r� r� r� rC r� � sz � �� ��� ��zClassDef.igetattrc C sh dd� }z|| � d|�d �W S tyb z | � d|�d }||�W Y S ty\ Y n0 Y n0 dS )a0 Check if the class has a custom __getattr__ or __getattribute__. If any such method is found and it is not from builtins, nor from an extension module, then the function will return True. :returns: Whether the class has a custom __getattr__ or __getattribute__. c S s | � � }|jdko t|dd �S )Nr" r� )�rootr� r� )rj r� r@ r@ rC �_valid_getattr s z4ClassDef.has_dynamic_getattr.<locals>._valid_getattr� __getattr__r �__getattribute__F)r� r )r� rJ r� Z getattributer@ r@ rC r� s z ClassDef.has_dynamic_getattrc C s zt | d|d�}W nn ty� } zVt| t�r^z| �d�}W ql tyZ t| |d�|�Y ql0 nt| |d�|�W Y d}~n d}~0 0 |d }t|| �}t|g|d�|_zt |� | |�t j �W S t y� t|tj�r�| �� dkr�| Y S � Y n t�y t j Y S 0 dS ) aA Return the inference of a subscript. This is basically looking up the method in the metaclass and calling it. :returns: The inferred value of a subscript to this class. :rtype: NodeNG :raises AstroidTypeError: If this class does not define a ``__getitem__`` method. r8 r� rg r{ Nr r� r� )r r rm rc r� r r r r� r� r# r r r� r+ Z EmptyNoder� r )r� r� rJ �methodsr� r3 Z new_contextr@ r@ rC �getitem' s. $ � �zClassDef.getitemc c sN i }t �t| f�| �� �D ].}|�� D ] }|j|v r6q&d||j< |V q&qdS )z�Iterate over all of the method defined in this class and its parents. :returns: The methods defined on the class. :rtype: iterable(FunctionDef) N)r� r� �iterrh � mymethodsr� )r� �doner~ rc r@ r@ rC r� [ s zClassDef.methodsc c s" | � � D ]}t|t�r|V qdS )z�Iterate over all of the method defined in this class only. :returns: The methods defined on the class. :rtype: iterable(FunctionDef) N)r� rm rn )r� �memberr@ r@ rC r� i s zClassDef.mymethodsc C s | j rtd�d d S dS )a< Get the implicit metaclass of the current class. For newstyle classes, this will return an instance of builtins.type. For oldstyle classes, it will simply return None, since there's no implicit metaclass there. :returns: The metaclass. :rtype: builtins.type or None ro rF r N)r� r. r� r@ r@ rC r� s s zClassDef.implicit_metaclassc C s� | j D ]P}z8|j|d�D ]&}t|t�r|jr|j| _d| _ q@qW q tyT Y q0 q| jr�z tdd� | jj|d�D ��W S tt fy� Y dS 0 dS )a� Return the explicit declared metaclass for the current class. An explicit declared metaclass is defined either by passing the ``metaclass`` keyword argument in the class definition line (Python 3) or (Python 2) by having a ``__metaclass__`` class attribute, or if there are no explicit bases but there is a global ``__metaclass__`` variable. :returns: The metaclass of this class, or None if one could not be found. r� Tc s s | ]}t |tj�s|V qd S r� r� rk r@ r@ rC r[ � s �z.ClassDef.declared_metaclass.<locals>.<genexpr>N) r r� rm rc r� r� �_metaclass_hackr r� r� )r� rJ rZ r� r@ r@ rC r� � s" � zClassDef.declared_metaclasszset[ClassDef] | None)ri rJ rT c C s` |d u rt � }|�| � | j|d�}|d u r\| j|d�D ]"}||vr8|�|�}|d ur8 q\q8|S )Nr� )re rg r� rh �_find_metaclass)r� ri rJ rr r� r@ r@ rC r� � s zClassDef._find_metaclassc C s | j |d�S )z�Get the metaclass of this class. If this class does not define explicitly a metaclass, then the first defined metaclass in ancestors will be used instead. :returns: The metaclass of this class. r� )r� r� r@ r@ rC r� � s zClassDef.metaclassc C s | j S r� )r� r� r@ r@ rC �has_metaclass_hack� s zClassDef.has_metaclass_hackc c s d| j vrdS | �d�D �] }tD ]0}z|�|� W qVW q" tyP Y q"Y q"0 q"qt|tj�rp|jr|V qt |d�s|qt|tj �r�dd� |j D �}n|� � }t|t j�r�q|s�| S |D ]X}z:|�� D ],}t|tj�r�t|jt�s�q�|js�q�|V q�W q� t�y Y q�Y q�0 q�qdS )z+Return an iterator with the inferred slots.� __slots__Nr� c S s g | ] }|d �qS )r r@ )rA �itemr@ r@ rC rD � rE z$ClassDef._islots.<locals>.<listcomp>)r� r� � ITER_METHODSr� r rm r+ r& r� �hasattrr� r� r� r r� r� r� r )r� �slotsrc r� r r� r@ r@ rC �_islots� sL � � zClassDef._islotsc C s~ | j std��| �� }z t|�}W nP tyr } z8|jr\|jd dvr\|jd W Y d }~S W Y d }~d S d }~0 0 |g|�S )N�8The concept of slots is undefined for old-style classes.r )r� N)r� �NotImplementedErrorr� r� r� r1 )r� r� �firstr� r@ r@ rC �_slots� s � zClassDef._slotsc C s� ddd�dd�}| j s td��z | �� }W n. tyX } ztd�|�W Y d}~n d}~0 0 t||��}td d � |D ��s|dS tt|�d d � d �S )aY Get all the slots for this node. :returns: The names of slots for this class. If the class doesn't define any slot, through the ``__slots__`` variable, then this function will return a None. Also, it will return None in the case the slots were not inferred. :rtype: list(str) or None �list[ClassDef]z$Iterator[node_classes.NodeNG | None])r� rT c s sZ | D ]P}|� � dkrqz |�� }W n ty8 Y qY n0 |d urN|E d H qd V qd S )Nr� )rX r� r� )r� rI Z cls_slotsr@ r@ rC � grouped_slots s z*ClassDef._all_slots.<locals>.grouped_slotsr� z)Cannot get slots while parsing mro fails.Nc s s | ]}|d uV qd S r� r@ )rA �slotr@ r@ rC r[ 2 rE z&ClassDef._all_slots.<locals>.<genexpr>c S s | j S r� )r� )r� r@ r@ rC �<lambda>5 rE z%ClassDef._all_slots.<locals>.<lambda>)r )r� r� r� r r� �all�sortedre )r� r r� r� r� r@ r@ rC � _all_slots s" � �� zClassDef._all_slotsc C s | j S r� )r r� r@ r@ rC r� 7 s zClassDef.slotsc c s� |d u rt � }| js6| �� dkr6td�d d V d S | jD ]z}z"tdd� |j|�� d�D ��}W n ttfy| Y q<Y n0 t |tj �r�|j }t |t �s�q<|j s�|V q<|jE d H q<d S )Nr� r� rF r c s s& | ] }t |t�r|jd u s|V qd S r� r� r� r@ r@ rC r[ Q s �z+ClassDef._inferred_bases.<locals>.<genexpr>r� )r r rX r. r� r� r� r r� rm r$ r% rc r� )r� rJ r� r� r@ r@ rC �_inferred_bases: s& � zClassDef._inferred_basesc C s� | � � dkr| gS t| j|d��}g }|D ]V}|| u r8q*z|j|d�}|�|� W q* ty~ t|j|d��}|�|� Y q*0 q*| gg|�|�}t|| |�}t|� t || |�S )Nr� r� ) rX r� r � _compute_mrorK r� rh rk rb rR )r� rJ r` r_ rZ r� rh Z unmerged_mror@ r@ rC r a s" zClassDef._compute_mror� c C s | j |d�S )a* Get the method resolution order, using C3 linearization. :returns: The list of ancestors, sorted by the mro. :rtype: list(NodeNG) :raises DuplicateBasesError: Duplicate bases in the same class base :raises InconsistentMroError: A class' MRO is inconsistent r� )r r� r@ r@ rC r� | s z ClassDef.mror c C s dS )z�Determine the boolean value of this node. :returns: The boolean value of this node. For a :class:`ClassDef` this is always ``True``. Tr@ r� r@ r@ rC r� � s zClassDef.bool_valuec c sP | j d ur| j V | jE d H | jd ur4| jE d H | jE d H | jE d H d S r� )r' r r� rS rv r� r@ r@ rC r� � s zClassDef.get_childrenc C s dd� | j D �}ttj�|��S )Nc s s | ] }|j V qd S r� )r^ )rA rw r@ r@ rC r[ � s z2ClassDef._assign_nodes_in_scope.<locals>.<genexpr>)rv r� r� r� � from_iterable)r� Zchildren_assign_nodesr@ r@ rC r^ � s �z ClassDef._assign_nodes_in_scoper� r? r� r� c C s | S r r@ r� r@ r@ rC r� � s zClassDef.framer r c k s | V d S r� r@ r r@ r@ rC r � s zClassDef._infer)NNN)N)N)N)r )TN)N)N)N)N)NT)NT)N)N)N)NN)N)N)N)N)N)N)Ir} r r r~ r r' r! r� rV r r� r� r� rl r� ro r r r� r� r Z instance_class_infer_binary_opr� r2 r� r� r� r� r rn r� r� r� r= r& r� r# r� r� rh r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r r r� r� r� r^ r� r r r@ r@ r� rC rc ' s� � 9� � �$� : �" �5 �. �; �c4 �& � � 3 ,' �)NN)NN)cr~ � __future__r r� r� r� r� �collections.abcr r r r � functoolsr r �typingr r r r r r r~ r r r Zastroid.contextr r r r Zastroid.exceptionsr r r r r r r r r r Z!astroid.interpreter.dunder_lookupr Z astroid.interpreter.objectmodelr! r" r# Zastroid.managerr$ Z astroid.nodesr% r& r' r( r) r* r+ Z astroid.nodes.scoped_nodes.mixinr, r- Z astroid.nodes.scoped_nodes.utilsr. Zastroid.nodes.utilsr/ Zastroid.typingr0 r1 r2 r3 r4 r5 Zastroid.nodes._base_nodesr6 r� � frozensetr� r) r? rR rb rk rs rt r r r r! r. ZFilterStmtsBaseNoder/ ZMultiLineBlockNodeZ Statementrn r� r� r� r� rc r@ r@ r@ rC �<module> s� 0 $ �&$ /7<89% > � �& �& �
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка