Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/astroid/nodes/__pycache__/node_ng.cpython-39.pyc
Ðазад
a k�h�i � @ s� d dl mZ d dlZd dlZd dlZd dlmZmZ d dlm Z d dlm Z d dl m Z mZmZmZmZmZmZmZ d dlmZ d dlmZ d d lmZmZm Z m Z m Z d d l m Z d d l!m"Z" d d l#m$Z$ d d l%m&Z& d dl'm(Z(m)Z)m*Z* ej+dk�rd dl m,Z, n d dl-m,Z, e �r0d dlm.Z. d dl/m0Z0 eddd�Z1eddd�Z2eddd�Z3ede4d e5e4d df f Z6G dd� d�Z7dS )� )� annotationsN)� Generator�Iterator)�cached_property)�singledispatch)� TYPE_CHECKING�Any�ClassVar�Literal�TypeVar�Union�cast�overload)�util)�InferenceContext)� AstroidError�InferenceError�ParentMissingError�StatementMissing�UseInferenceDefault)�AstroidManager��AsStringVisitor)� OP_PRECEDENCE)�Position)�InferenceErrorInfo�InferenceResult�InferFn)� � )�Self)�nodes)� _base_nodes�_NodesT�NodeNG)�bound�_NodesT2�_NodesT3.c @ s e Zd ZU dZdZded< dZded< dZded< dZded< dZ d ed < dZ d ed < dZ d ed < d Z ded< ddddddd�dd�Z d�dddd�dd�Zd d �d d �Zd d �d d!�Zd d �d"d#�Zd$d d%�d&d'�Zd(d �d)d*�Zdd �d+d,�Zd(d �d-d.�Zd/d �d0d1�Zd d2�d3d4d5�d6d7�Zd d2�d3d8d5�d9d:�Zd;d �d<d=�Zd>d �d?d@�ZdAdB� ZdCdD� Z dEdF� Z dGdH� Z e dId �dJdK��Z e dId �dLdM��Z!dId �dNdO�Z"dIdPdQ�dRdS�Z#d d ddT�dUdV�Z$e%d�dXdYdZd[�d\d]��Z&e%d�d^dYd_d[�d`d]��Z&e%d�dadYdbd[�dcd]��Z&e%d�dddYdZd[�ded]��Z&d�dfdYdbd[�dgd]�Z&e dhd �didj��Z'dkdl� Z(dmdn� Z)dodp� Z*dqdr� Z+dsdt� Z,d�dddud�dvdw�Z-dxdy� Z.dzd{� Z/d/d �d|d}�Z0d/d �d~d�Z1d/d �d�d��Z2d d �d�d��Z3d�d d �d�d��Z4d�dd��d�d��Z5d�d�� Z6d/d �d�d��Z7d S )�r$ zlA node of the new Abstract Syntax Tree (AST). This is the base class for all Astroid node classes. FzClassVar[bool]� is_statement�optional_assign� is_function� is_lambda� zClassVar[tuple[str, ...]]�_astroid_fields� _other_fields�_other_other_fieldsNzInferFn[Self] | None�_explicit_inferencez int | Nonez NodeNG | None�None)�lineno� col_offset�parent� end_lineno�end_col_offset�returnc C s( || _ || _|| _|| _|| _d | _d S �N)r2 r3 r4 r5 r6 �position)�selfr2 r3 r4 r5 r6 r, r, ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/astroid/nodes/node_ng.py�__init__[ s zNodeNG.__init__zInferenceContext | Noner zGenerator[InferenceResult])�context�kwargsr7 c k s, |du rt � }n|j�| |�}| jdurpz4| j| |fi |��D ]}| jd7 _|V q>W dS tyn Y n0 | |j|j|jf}||j v r�|j | E dH dS g }t � j }t | j f d|i|���D ]T\}}||ks�|j|jkr�|�tj� tjV �q|�|� |V | jd7 _q�t|�|j |< dS )aV Get a generator of the inferred values. This is the main entry point to the inference system. .. seealso:: :ref:`inference` If the instance has some explicit inference function set, it will be called instead of the default interface. :returns: The inferred values. :rtype: iterable N� r= )r Z extra_context�getr0 Znodes_inferredr Z lookupnameZ callcontextZ boundnode�inferredr Zmax_inferable_values� enumerate�_inferZ max_inferred�appendr � Uninferable�tuple)r: r= r> �result�key�results�limit�ir, r, r; �infer} s@ �� z NodeNG.infer�str)r7 c s2 t � fdd�dD ��r.t� dd�p,t� dd�S dS )zyGet a name for nice representation. This is either :attr:`name`, :attr:`attrname`, or the empty string. c 3 s | ]}|� j vV qd S r8 )r- )�.0�name�r: r, r; � <genexpr>� � z#NodeNG.repr_name.<locals>.<genexpr>)rO �attrnamerO � rS )�all�getattrrP r, rP r; � repr_name� s zNodeNG.repr_namec C s� | � � }t| �j}|r0d}t|�t|� d }nd}t|�d }g }| j| j D ]~}t| |d�}dt|� | }tj|d|d�� d�} | d g} | dd � D ]} | � d | | � q�|� |� d d � | �� �� qP|||d d | � |�d� S )Nz %(cname)s.%(rname)s(%(fields)s)� z%(cname)s(%(fields)s)r? �Unknown�P )�indent�widthTr � �=rT �, )�cname�rname�fields) rW �type�__name__�lenr. r- rV �pprint�pformat� splitlinesrD �join) r: ra r` �stringZ alignmentrG �field�valuer\ �lines�inner�liner, r, r; �__str__� s* �zNodeNG.__str__c C sT | � � }z | j}W n ty( d}Y n0 |r4d}nd}|t| �j||t| �d� S )Nr z.<%(cname)s.%(rname)s l.%(lineno)s at 0x%(id)x>z$<%(cname)s l.%(lineno)s at 0x%(id)x>)r` ra r2 �id)rW � fromlineno�AttributeErrorrc rd rq )r: ra r2 rj r, r, r; �__repr__� s �zNodeNG.__repr__r )�visitorr7 c C s t |d| jj�� �}|| �S )z(Visit this node using the given visitor.�visit_)rV � __class__rd �lower)r: ru �funcr, r, r; �accept� s z NodeNG.acceptzIterator[NodeNG]c c sN | j D ]8}t| |�}|du r qt|ttf�r8|E dH q|V qdE dH dS )z$Get the child nodes below this node.Nr, �r- rV � isinstance�listrF �r: rk �attrr, r, r; � get_children� s zNodeNG.get_childrenc C sJ | j ddd� D ]4}t| |�}|s$qt|ttf�r>|d S | S dS )z1An optimized version of list(get_children())[-1].N���r{ r~ r, r, r; � last_child� s zNodeNG.last_childc c s | j }|dur |V |j }qdS )z7Yield parent, grandparent, etc until there are no more.N�r4 �r: r4 r, r, r; �node_ancestors s zNodeNG.node_ancestors�boolc s t � fdd�|�� D ��S )z�Check if this node is the parent of the given node. :param node: The node to check if it is the child. :type node: NodeNG :returns: Whether this node is the parent of the given node. c 3 s | ]}� |u V qd S r8 r, )rN r4 rP r, r; rQ rR z#NodeNG.parent_of.<locals>.<genexpr>)�anyr� �r: �noder, rP r; � parent_of s zNodeNG.parent_of��futurezLiteral[None, True]�_base_nodes.Statement)r� r7 c C sB |durt jdtdd� | jr(td| �S | js8t| d��| j�� S )z�The first parent node, including self, marked as statement node. :raises StatementMissing: If self has no parent attribute. N�.The future arg will be removed in astroid 4.0.rX �� stacklevelr� ��target)�warnings�warn�DeprecationWarningr( r r4 r � statement�r: r� r, r, r; r� s � zNodeNG.statementz@nodes.FunctionDef | nodes.Module | nodes.ClassDef | nodes.Lambdac C s: |durt jdtdd� | jdu r,t| d��| jj|d�S )a The first parent frame node. A frame node is a :class:`Module`, :class:`FunctionDef`, :class:`ClassDef` or :class:`Lambda`. :returns: The first parent frame node. :raises ParentMissingError: If self has no parent attribute. Nr� rX r� r� r� )r� r� r� r4 r �framer� r, r, r; r� ) s � z NodeNG.frameznodes.LocalsDictNodeNGc C s | j st| d��| j �� S )z�The first parent node defining a new scope. These can be Module, FunctionDef, ClassDef, Lambda, or GeneratorExp nodes. :returns: The first parent scope node. r� )r4 r �scoperP r, r, r; r� > s z NodeNG.scopez nodes.Modulec C s | j }s| S |j r |j }q|S )zSReturn the root node of the syntax tree. :returns: The root node. r� r� r, r, r; �rootI s z NodeNG.rootc C sf | j D ]>}t| |�}||u r&|g S t|ttf�r||v r| S qd}t|t|�t| �f ��dS )a_ Search for the sequence that contains this child. :param child: The child node to search sequences for. :type child: NodeNG :returns: The sequence containing the given child node. :rtype: iterable(NodeNG) :raises AstroidError: If no sequence could be found that contains the given child. �"Could not find %s in %s's childrenN�r- rV r| rF r} r �repr�r: �childrk Znode_or_sequence�msgr, r, r; �child_sequenceU s �� zNodeNG.child_sequencec C sl | j D ]D}t| |�}||u r(||f S t|ttf�r||v r||f S qd}t|t|�t| �f ��dS )a� Find the field of this node that contains the given child. :param child: The child node to search fields for. :type child: NodeNG :returns: A tuple of the name of the field that contains the child, and the sequence or node that contains the child node. :rtype: tuple(str, iterable(NodeNG) or NodeNG) :raises AstroidError: If no field could be found that contains the given child. r� Nr� r� r, r, r; � locate_childo s ��zNodeNG.locate_childc C s | j �� S )z|The next sibling statement node. :returns: The next sibling statement node. :rtype: NodeNG or None )r4 � next_siblingrP r, r, r; r� � s zNodeNG.next_siblingc C s | j �� S )zThe previous sibling statement. :returns: The previous sibling statement node. :rtype: NodeNG or None )r4 �previous_siblingrP r, r, r; r� � s zNodeNG.previous_sibling�intc C s | j du r| �� S | j S )z�The first line that this node appears on in the source code. Can also return 0 if the line can not be determined. N)r2 �_fixed_source_linerP r, r, r; rr � s zNodeNG.fromlinenoc C s8 | j dur| j S | js d}n| �� }|du r2| jS |jS )z�The last line that this node appears on in the source code. Can also return 0 if the line can not be determined. N)r5 r- r� rr �tolineno)r: r� r, r, r; r� � s zNodeNG.tolinenoc C sf | j }| }z |du r(t|�� �}|j }q W n2 ty\ | j}|rX|du rX|j }|j}q>Y n0 |pddS )z�Attempt to find the line that this node appears on. We need this method since not all nodes have :attr:`lineno` set. Will return 0 if the line number can not be determined. Nr )r2 �nextr� � StopIterationr4 )r: ro �_noder4 r, r, r; r� � s zNodeNG._fixed_source_lineztuple[int, int])r2 r7 c C s || j fS )z�Get a range from the given line number to where this node ends. :param lineno: The line number to start the range at. :returns: The range of line numbers that this node belongs to, starting at the given line number. )r� )r: r2 r, r, r; � block_range� s zNodeNG.block_range)rO �stmtr7 c C s | j s J �| j �||� dS )a$ Define that the given name is declared in the given statement node. This definition is stored on the parent scope node. .. seealso:: :meth:`scope` :param name: The name that is being defined. :param stmt: The statement that defines the given name. N)r4 � set_local)r: rO r� r, r, r; r� � s zNodeNG.set_local.z type[_NodesT]� SkipKlassTzIterator[_NodesT])�klass� skip_klassr7 c C s d S r8 r, �r: r� r� r, r, r; �nodes_of_class� s zNodeNG.nodes_of_classz$tuple[type[_NodesT], type[_NodesT2]]z&Iterator[_NodesT] | Iterator[_NodesT2]c C s d S r8 r, r� r, r, r; r� � s z4tuple[type[_NodesT], type[_NodesT2], type[_NodesT3]]z;Iterator[_NodesT] | Iterator[_NodesT2] | Iterator[_NodesT3]c C s d S r8 r, r� r, r, r; r� � s ztuple[type[_NodesT], ...]c C s d S r8 r, r� r, r, r; r� � s z�type[_NodesT] | tuple[type[_NodesT], type[_NodesT2]] | tuple[type[_NodesT], type[_NodesT2], type[_NodesT3]] | tuple[type[_NodesT], ...]c c sl t | |�r| V |du r<| �� D ]}|�||�E dH q dS | �� D ]"}t ||�rTqD|�||�E dH qDdS )a+ Get the nodes (including this one or below) of the given types. :param klass: The types of node to search for. :param skip_klass: The types of node to ignore. This is useful to ignore subclasses of :attr:`klass`. :returns: The node of the given types. N)r| r� r� )r: r� r� � child_noder, r, r; r� s zlist[nodes.Assign]c C s g S r8 r, rP r, r, r; �_assign_nodes_in_scope" s z NodeNG._assign_nodes_in_scopec c s | � � D ]}|�� E d H qd S r8 )r� �_get_name_nodes)r: r� r, r, r; r� & s zNodeNG._get_name_nodesc c s dE d H d S �Nr, r, rP r, r, r; � _get_return_nodes_skip_functions* s z'NodeNG._get_return_nodes_skip_functionsc c s dE d H d S r� r, rP r, r, r; � _get_yield_nodes_skip_functions- s z&NodeNG._get_yield_nodes_skip_functionsc c s dE d H d S r� r, rP r, r, r; � _get_yield_nodes_skip_lambdas0 s z$NodeNG._get_yield_nodes_skip_lambdasc C s d S r8 r, )r: r� rO r, r, r; � _infer_name3 s zNodeNG._infer_namez;Generator[InferenceResult, None, InferenceErrorInfo | None]c K s t d| |d��dS )z4We don't know how to resolve a statement by default.z#No inference function for {node!r}.)r� r= N)r )r: r= r> r, r, r; rC 7 s �z NodeNG._inferc C s t | �� �S )z�Get a list of the inferred values. .. seealso:: :ref:`inference` :returns: The inferred values. :rtype: list )r} rL rP r, r, r; rA @ s zNodeNG.inferredc C s | S )z�Instantiate an instance of the defined class. .. note:: On anything other than a :class:`ClassDef` this will return self. :returns: An instance of the defined class. :rtype: object r, rP r, r, r; �instantiate_classJ s zNodeNG.instantiate_classc C s dS )z�Check if this node inherits from the given type. :param node: The node defining the base to look for. Usually this is a :class:`Name` node. :type node: NodeNG Fr, r� r, r, r; �has_baseV s zNodeNG.has_basec C s dS )z�Whether this node defines something that is callable. :returns: Whether this defines something that is callable. Fr, rP r, r, r; �callable_ s zNodeNG.callablec C s dS )NFr, )r: rl r, r, r; �eqf s z NodeNG.eqc C s t � | �S )z.Get the source code that this node represents.r rP r, r, r; � as_stringi s zNodeNG.as_string� r rZ c st t d �fdd� �� � �t�� �t�d � �fdd� ��}� �t�d � �����fdd� �}g } � | | t� � d�| �S ) a Get a string representation of the AST from this node. :param ids: If true, includes the ids with the node type names. :type ids: bool :param include_linenos: If true, includes the line numbers and column offsets. :type include_linenos: bool :param ast_state: If true, includes information derived from the whole AST like local and global variables. :type ast_state: bool :param indent: A string to use to indent the output string. :type indent: str :param max_depth: If set to a positive integer, won't return nodes deeper than max_depth in the string. :type max_depth: int :param max_width: Attempt to format the output string to stay within this number of characters, but can exceed it under some circumstances. Only positive integer values are valid, the default is 80. :type max_width: int :returns: The string representation of the AST. :rtype: str rT r? c s\ t j| t�t� � d�d��d�}|�|d � |�� fdd�|dd� D �� t|�dkS )z�Outputs a representation of a non-tuple/list, non-node that's contained within an AST, including strings. r? )r\ Tr c s g | ] }� | �qS r, r, )rN ro �� cur_indentr, r; � <listcomp>� rR z8NodeNG.repr_tree.<locals>._repr_tree.<locals>.<listcomp>N)rf rg �maxre rh rD �extend)r� rG �doner� �depthrm )� max_widthr� r; � _repr_tree� s �� z$NodeNG.repr_tree.<locals>._repr_treec s |�7 }|� d� | s d}n�t| �dkr>� | d ||||�}n�t| �dkr�� | d ||||�}|sn|� d� n|� d� |� |� � | d ||||�p�|}nb|� d� |� |� | d d � D ](}� |||||� |� d� |� |� q�� | d ||||� d }|� d � |S ) z_Outputs a representation of a sequence that's contained within an AST. �[Fr? r rX z, r_ � Nr� T�])rD re )r� rG r� r� r� �brokenr� )r� r[ r, r; � _repr_seq� s. z#NodeNG.repr_tree.<locals>._repr_seqc s� | |v r0|� �dt| �j� dt| �� � � dS |�| � �rT|�krT|� d� dS |d7 }|�7 }�r�|� t| �j� dt| �d�d�� n|� t| �j� d �� g }�r�|�d � |�| j� |�| j� �r�|�| j� |s�d}n�t |�dk�r$|� |d � d �� � t | |d �||||�}n�|� d � |� |� |dd� D ]N}|dk�rV�qD|� |� d �� � t | |�||||� |� d� |� |� �qD|� |d � d �� � t | |d �||||� d}|� d� |S )z4Outputs a strings representation of an astroid node.z<Recursion on z with id=Fz...r? z<0x�xz>( �()r2 r3 r r^ r� Nr� �docr_ T�)) rD rc rd rq �addr� r. r- r/ re rV )r� rG r� r� r� rb r� rk )r� � ast_state�ids�include_linenosr[ � max_depthr, r; � _repr_node� sT � $ � z$NodeNG.repr_tree.<locals>._repr_node)rT r? )rT r? )rT r? )�_singledispatch�registerrF r} r$ �setri ) r: r� r� r� r[ r� r� r� r� rG r, )r� r� r� r� r[ r� r� r; � repr_treem s & 1zNodeNG.repr_tree)r= c C s t jS )ak Determine the boolean value of this node. The boolean value of a node can have three possible values: * False: For instance, empty data structures, False, empty strings, instances which return explicitly False from the __nonzero__ / __bool__ method. * True: Most of constructs are True by default: classes, functions, modules etc * Uninferable: The inference engine is uncertain of the node's value. :returns: The boolean value of this node. :rtype: bool or Uninferable )r rE )r: r= r, r, r; � bool_value� s zNodeNG.bool_valuec C s t �| jjtt ��S r8 )r r@ rw rd re rP r, r, r; � op_precedence s zNodeNG.op_precedencec C s dS )NTr, rP r, r, r; �op_left_associative s zNodeNG.op_left_associative)N).).).).)N)N)FFFr� r rZ )N)8rd � __module__� __qualname__�__doc__r( �__annotations__r) r* r+ r- r. r/ r0 r< rL rW rp rt rz r� r� r� r� r� r� r� r� r� r� r� r� r rr r� r� r� r� r r� r� r� r� r� r� r� rC rA r� r� r� r� r� r� r� r� r� r, r, r, r; r$ 9 s� � # �9 � � � � � �! � � )8� __future__r rf �sysr� �collections.abcr r � functoolsr r r� �typingr r r r r r r r Zastroidr Zastroid.contextr Zastroid.exceptionsr r r r r Zastroid.managerr Zastroid.nodes.as_stringr Zastroid.nodes.constr Zastroid.nodes.utilsr Zastroid.typingr r r � version_infor �typing_extensionsr! Z astroid.nodesr" r# r& r' rc rF r� r$ r, r, r, r; �<module> s4 (
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка