Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/astroid/nodes/__pycache__/_base_nodes.cpython-39.pyc
Ðазад
a k�h�] � @ s d Z ddlmZ ddlZddlmZmZmZ ddlm Z m Z m Z ddl m Z mZmZmZmZ ddlmZmZmZ ddlmZ dd lmZmZmZ dd l m Z m Z dd l m Z dd l!m"Z" dd l#m$Z$ e �rddl%m&Z& ee$ee$ eej'ej(f e$ee$ eege)e ee$ f Z*G dd� de"�Z+G dd� de"�Z,G dd� de"�Z-G dd� de"�Z.G dd� de.�Z/G dd� de-e,e+�Z0G dd � d e"�Z1G d d � d e1�Z2G d d � d e"�Z3d!d"�d#d$�Z4d!d"�d%d&�Z5d'd(d)d*d+d,d-d.d/d0d1d2d3d4� Z6d5d6� e6�7� D �Z8d7d6� e6�7� D �Z9G d8d9� d9e"�Z:dS ):zThis module contains some base nodes that can be inherited for the different nodes. Previously these were called Mixin nodes. � )� annotationsN)�Callable� Generator�Iterator)�cached_property� lru_cache�partial)� TYPE_CHECKING�Any�ClassVar�Optional�Union)�bases�nodes�util)� PY310_PLUS)� CallContext�InferenceContext�bind_context_to_node)�AttributeInferenceError�InferenceError)� dunder_lookup)�NodeNG)�InferenceResult)�LocalsDictNodeNGc @ s$ e Zd ZdZdZdd� Zdd� ZdS )� StatementzpStatement node adding a few attributes. NOTE: This class is part of the public API of 'astroid.nodes'. Tc C s> | j �| �}|�| �}z||d W S ty8 Y dS 0 dS )z|The next sibling statement node. :returns: The next sibling statement node. :rtype: NodeNG or None � N)�parent�child_sequence�index� IndexError��self�stmtsr � r$ ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/astroid/nodes/_base_nodes.py� next_sibling: s zStatement.next_siblingc C s. | j �| �}|�| �}|dkr*||d S dS )zThe previous sibling statement. :returns: The previous sibling statement node. :rtype: NodeNG or None r N)r r r r! r$ r$ r% �previous_siblingG s zStatement.previous_siblingN)�__name__� __module__� __qualname__�__doc__Z is_statementr& r' r$ r$ r$ r% r 1 s r c @ s e Zd ZdZdd�dd�ZdS )�NoChildrenNodez1Base nodes for nodes with no children, e.g. Pass.zIterator[NodeNG]��returnc c s dE d H d S )Nr$ r$ �r" r$ r$ r% � get_childrenW s zNoChildrenNode.get_childrenN)r( r) r* r+ r0 r$ r$ r$ r% r, T s r, c @ s& e Zd ZdZdd�dd�Zdd� ZdS ) �FilterStmtsBaseNodez6Base node for statement filtering and assignment type.�Statement | None��mystmtc C s | � � |u r|gdfS |dfS )zAMethod used in _filter_stmts to get statements and trigger break.TF�Z statement)r" �_�node�_stmtsr4 r$ r$ r% �_get_filtered_stmts^ s z'FilterStmtsBaseNode._get_filtered_stmtsc C s | S �Nr$ r/ r$ r$ r% � assign_typef s z FilterStmtsBaseNode.assign_typeN)r( r) r* r+ r9 r; r$ r$ r$ r% r1 [ s r1 c @ s& e Zd ZdZdd� Zdd�dd�ZdS ) �AssignTypeNodez8Base node for nodes that can 'assign' such as AnnAssign.c C s | S r: r$ r/ r$ r$ r% r; m s zAssignTypeNode.assign_typer2 r3 c C s. | |u r|dfS | � � |u r&|gdfS |dfS )z Method used in filter_stmts.TFr5 )r" Z lookup_noder7 r8 r4 r$ r$ r% r9 p s z"AssignTypeNode._get_filtered_stmtsN)r( r) r* r+ r; r9 r$ r$ r$ r% r< j s r< c @ s e Zd ZdZdd� ZdS )�ParentAssignNodezGBase node for nodes whose assign_type is determined by the parent node.c C s | j �� S r: )r r; r/ r$ r$ r% r; ~ s z ParentAssignNode.assign_typeN)r( r) r* r+ r; r$ r$ r$ r% r= { s r= c @ sL e Zd ZU dZded< ded< dd� Zddd d �d d �Zd d d�dd�ZdS )� ImportNodez$Base node for From and Import Nodes.z str | None�modnamez list[tuple[str, str | None]]�namesc C s |S r: r$ )r" �frame�namer$ r$ r% � _infer_name� s zImportNode._infer_nameNz nodes.Module)r? r. c C s` | � � }t| dd�}|du r"| j}|r>|�||�|jkr>d}nd}|j||t|oV|dk�|d�S )zGReturn the ast for a module whose name is <modname> imported by <self>.�levelNFTr )rD Z relative_only� use_cache)�root�getattrr? Zrelative_to_absolute_namerB � import_module�bool)r" r? ZmymodulerD rE r$ r$ r% �do_import_module� s ���zImportNode.do_import_module�str)�asnamer. c C sZ | j D ]@\}}|dkr | S |s6|�dd�d }|}||kr| S qtd| |d��dS )zGet name from 'as' name.�*�.r r z:Could not find original name for {attribute} in {target!r})�target� attributeN)r@ �splitr )r" rL rB Z_asnamer$ r$ r% � real_name� s �zImportNode.real_name)N)r( r) r* r+ �__annotations__rC rJ rR r$ r$ r$ r% r> � s r> c @ sT e Zd ZU dZdZded< edd� �Zdd� Zd d � Z d d � Z ed d�dd��Z dS )�MultiLineBlockNodea( Base node for multi-line blocks, e.g. For and FunctionDef. Note that this does not apply to every node with a `body` field. For instance, an If node has a multi-line body, but the body of an IfExpr is not multi-line, and hence cannot contain Return nodes, Assign nodes, etc. r$ zClassVar[tuple[str, ...]]�_multi_line_block_fieldsc s t � fdd�� jD ��S )Nc 3 s | ]}t � |�V qd S r: )rG )�.0�fieldr/ r$ r% � <genexpr>� � z8MultiLineBlockNode._multi_line_blocks.<locals>.<genexpr>)�tuplerU r/ r$ r/ r% �_multi_line_blocks� s z%MultiLineBlockNode._multi_line_blocksc c s0 | j D ]$}|D ]}|jrq|�� E d H qqd S r: )r[ � is_function� _get_return_nodes_skip_functions�r" �block� child_noder$ r$ r% r] � s z3MultiLineBlockNode._get_return_nodes_skip_functionsc c s0 | j D ]$}|D ]}|jrq|�� E d H qqd S r: )r[ r\ � _get_yield_nodes_skip_functionsr^ r$ r$ r% ra � s z2MultiLineBlockNode._get_yield_nodes_skip_functionsc c s0 | j D ]$}|D ]}|jrq|�� E d H qqd S r: )r[ Z is_lambda� _get_yield_nodes_skip_lambdasr^ r$ r$ r% rb � s z0MultiLineBlockNode._get_yield_nodes_skip_lambdaszlist[nodes.Assign]r- c C s dd� | j D �}ttj�|��S )Nc s s | ]}|D ] }|j V q qd S r: )�_assign_nodes_in_scope)rV r_ r` r$ r$ r% rX � s �z<MultiLineBlockNode._assign_nodes_in_scope.<locals>.<genexpr>)r[ �list� itertools�chain� from_iterable)r" Zchildren_assign_nodesr$ r$ r% rc � s �z)MultiLineBlockNode._assign_nodes_in_scopeN) r( r) r* r+ rU rS r r[ r] ra rb rc r$ r$ r$ r% rT � s rT c @ s2 e Zd ZdZedd� �Zd ddddd �d d �ZdS ) �MultiLineWithElseBlockNodez>Base node for multi-line blocks that can have else statements.c C s | j S r: )�linenor/ r$ r$ r% �blockstart_tolineno� s z.MultiLineWithElseBlockNode.blockstart_tolinenoN�intzlist[nodes.NodeNG]z int | Noneztuple[int, int])ri �orelse�lastr. c C sR || j kr||fS |rD||d j kr2||d jfS ||d j d fS ||pN| jfS )z_Handle block line numbers range for try/finally, for, if and while statements. r ���r )Z fromlinenoZtolineno)r" ri rl rm r$ r$ r% �_elsed_block_range� s z-MultiLineWithElseBlockNode._elsed_block_range)N)r( r) r* r+ r rj ro r$ r$ r$ r% rh � s �rh c @ s, e Zd ZdZeddd�dd��Zdd� Zd S ) � LookupMixInz+Mixin to look up a name in the right scope.rK z%tuple[LocalsDictNodeNG, list[NodeNG]])rB r. c C s | � � �| |�S )a# Lookup where the given variable is assigned. The lookup starts from self's scope. If self is not a frame itself and the name is found in the inner frame locals, statements will be filtered to remove ignorable statements according to self's location. :param name: The name of the variable to find assignments for. :returns: The 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). )�scopeZ scope_lookup)r" rB r$ r$ r% �lookup s zLookupMixIn.lookupc C s" | � |�\}}t� }t�|||�S )a Lookup the inferred values of the given variable. :param name: The variable name to find values for. :type name: str :returns: The inferred values of the statements returned from :meth:`lookup`. :rtype: iterable )rr r r Z _infer_stmts)r" rB rA r# �contextr$ r$ r% �ilookup s zLookupMixIn.ilookupN)r( r) r* r+ r rr rt r$ r$ r$ r% rp s rp rK r- c C s d| dd � S )N�__r� r$ �rB r$ r$ r% �_reflected_name& s rx c C s d| dd � S )NZ__irv r$ rw r$ r$ r% �_augmented_name* s ry �__add__�__sub__� __truediv__� __floordiv__�__mul__�__pow__�__mod__�__and__�__or__�__xor__� __lshift__� __rshift__� __matmul__) �+�-�/z//rM z**�%�&�|�^z<<z>>�@c C s i | ]\}}|t |��qS r$ )rx �rV �key�valuer$ r$ r% � <dictcomp>> s r� c C s i | ]\}}|d t |��qS )�=)ry r� r$ r$ r% r� A s c @ s< e Zd Zeddddd�dd��Zedd �d d ��Zed d ddd�dd��Zedddddddd�dd��Zed7dddddddd �d d ��Zed8dddddddd �d d ��Z ed!d!dd"�d#d$��Z ed%d&� �Z edd �d'd(��Z edd)ddd)ddd*d+�d,d-��Z edd)ddd)ddd*d.�d/d0��Zeddddd1d2d3�d4d5��Zd6S )9� OperatorNodezZCallable[[InferenceContext | None], Generator[InferenceResult | util.BadOperationMessage]]zInferenceContext | Nonez type[util.BadOperationMessage]zGenerator[InferenceResult])�infer_callablers �errorr. c c s, | |�D ] }t ||�r tjV q|V qd S r: )� isinstancer � Uninferable)r� rs r� �resultr$ r$ r% �_filter_operation_errorsG s z%OperatorNode._filter_operation_errorsrI r- c C s t | tj�o| jtu S )z0Check if the given const node is NotImplemented.)r� r �Constr� �NotImplemented)�constr$ r$ r% �_is_not_implementedY s z OperatorNode._is_not_implementedz nodes.Constz nodes.NodeNGr z)tuple[util.UninferableBase | nodes.Const])�instance�otherrs r. c s2 t |tj�r`tj|jv r tjfS � fdd�|jD �}tdd� |D ��rZtdd� |D ��}q�d}n�t |tj�r�i }|j D ]`}t� |d � �}t |tj �s�tjf S t� |d � �}t |tj �s�tjf S |j ||j < qvn t |tj �r�|j }ntjfS zt� | j | �fW S tttf�y, tjf Y S 0 dS ) z�Infer the result of '"string" % ...'. TODO: Instead of returning Uninferable we should rely on the call to '%' to see if the result is actually uninferable. c s g | ]}t �|� ��qS r$ )r � safe_infer�rV �i�rs r$ r% � <listcomp>j rY zCOperatorNode._infer_old_style_string_formatting.<locals>.<listcomp>c s s | ]}t |tj�V qd S r: )r� r r� r� r$ r$ r% rX k rY zBOperatorNode._infer_old_style_string_formatting.<locals>.<genexpr>c s s | ] }|j V qd S r: )r� r� r$ r$ r% rX l rY Nr r )r� r �Tupler r� �elts�allrZ �Dict�itemsr� r� r� Z const_factory� TypeError�KeyError� ValueError)r� r� rs Zinferred_positional�values�pairr� r� r$ r� r% �"_infer_old_style_string_formatting^ s0 z/OperatorNode._infer_old_style_string_formattingr z nodes.AugAssign | nodes.BinOprK )r� �opnode�opr� rs � method_namer. c C s� t �| |�}t|| �}|d }||j_t| tj�rXt| jt �rX|dkrXt t � | ||��S zt |j|d��}W n2 ty� } zt||d�| �W Y d} ~ n d} ~ 0 0 t|tj�r�t�t| tjtjtjtjtjf�s�t�| �|||||�S )z8Invoke binary operation inference on the given instance.r r� r� )r7 rs N)r rr r � callcontextZcalleer� r r� r� rK �iterr� r� �nextZinfer� StopIterationr r �UninferableBaser� �List�ClassDefr �InstanceZinfer_binary_op) r� r� r� r� rs r� �methods�method�inferred�er$ r$ r% �_invoke_binop_inference� s6 � ����$ �z$OperatorNode._invoke_binop_inferenceFznodes.AugAssignz#partial[Generator[InferenceResult]])r� r� r� r� rs �reverser. c C s t | }ttj| |||||d�S )z<Get an inference callable for an augmented binary operation.�r� r� r� r� rs r� )�AUGMENTED_OP_METHODr r� r� �r� r� r� r� rs r� r� r$ r$ r% �_aug_op� s �zOperatorNode._aug_opc C s. |rt | }nt| }ttj| |||||d�S )z�Get an inference callable for a normal binary operation. If *reverse* is True, then the reflected method will be used instead. r� )�REFLECTED_BIN_OP_METHOD� BIN_OP_METHODr r� r� r� r$ r$ r% �_bin_op� s �zOperatorNode._bin_opz.bases.UnionType | nodes.ClassDef | nodes.Const)�left�rightr. c c s t �| |�V dS )z>Create a new UnionType instance for binary or, e.g. int | str.N)r � UnionType)r� r� r$ r$ r% �_bin_op_or_union_type� s z"OperatorNode._bin_op_or_union_typec c s4 ||fD ]&}| � � }t|gd�|_d|_|V qdS )z�Get contexts for binary operations. This will return two inference contexts, the first one for x.__op__(y), the other one for y.__rop__(x), where only the arguments are inversed. )�argsN)�cloner r� Z boundnode)rs r� r� �argZ new_contextr$ r$ r% �_get_binop_contexts� s z OperatorNode._get_binop_contextsc C s | � � |� � kS )z$Check if type1 is the same as type2.)Zqname)Ztype1Ztype2r$ r$ r% � _same_type� s zOperatorNode._same_typezInferenceResult | Nonez)list[partial[Generator[InferenceResult]]])r� � left_type� aug_opnoder� � right_typers �reverse_contextr. c C s ddl m} |j�d�}|j} t�||�rPt�| || ||�t�| ||||�g} n�|�||�r�t�| || ||�t�| ||||�g} n~|� ||�r�t�| || ||�tj|||| |dd�t�| ||||�g} n8t�| || ||�t�| ||||�tj|||| |dd�g} | S )a� Get the flow for augmented binary operations. The rules are a bit messy: * if left and right have the same type, then left.__augop__(right) is first tried and then left.__op__(right). * if left and right are unrelated typewise, then left.__augop__(right) is tried, then left.__op__(right) is tried and then right.__rop__(left) is tried. * if left is a subtype of right, then left.__augop__(right) is tried and then left.__op__(right). * if left is a supertype of right, then left.__augop__(right) is tried, then right.__rop__(left) and then left.__op__(right) r ��helpersr� T�r� ) �astroidr� r� �stripr� r� r� r� � is_subtype� is_supertype) r� r� r� r� r� rs r� r� Zbin_opZaug_opr� r$ r$ r% � _get_aug_flow� s2 � � �� ��zOperatorNode._get_aug_flow)r� r� � binary_opnoder� r� rs r� r. c C s8 ddl m} |j}t�||�r4t�| ||||�g} n�|�||�rVt�| ||||�g} n^|�||�r�tj|||| |dd�t�| ||||�g} n(t�| ||||�tj|||| |dd�g} t�r4|dk�r4t | t j t j f�s�t | t j��r4| jdu �r4t |t j t j f��s t |t j��r4|jdu �r4| �ttj| |�g� | S )ax Get the flow for binary operations. The rules are a bit messy: * if left and right have the same type, then only one method will be called, left.__op__(right) * if left and right are unrelated typewise, then first left.__op__(right) is tried and if this does not exist or returns NotImplemented, then right.__rop__(left) is tried. * if left is a subtype of right, then only left.__op__(right) is tried. * if left is a supertype of right, then right.__rop__(left) is first tried and then left.__op__(right) r r� Tr� r� N)r� r� r� r� r� r� r� r� r r� r r� r r� r� r� �extendr r� ) r� r� r� r� r� rs r� r� r� r� r$ r$ r% �_get_binop_flow0 sF �� ����� �� � � �z OperatorNode._get_binop_flow�GetFlowFactoryz;Generator[InferenceResult | util.BadBinaryOperationMessage])r� r� r� rs � flow_factoryr. c c s2 ddl m} t�|| |�\}}|�| �}|�|�}|| ||||||�} | D ]�} zt| � �} W nF tyr Y qJY qJ ty� Y qJY qJ ty� t j V Y dS 0 t dd� | D ��r�t j V dS t t tj| ��r�qJtdd� | D ��} | �r | t| �k�r t j V dS | E dH dS qJt �||j|�V dS )z�Infer a binary operation between a left operand and a right operand. This is used by both normal binary operations and augmented binary operations, the only difference is the flow factory used. r r� Nc s s | ]}t |tj�V qd S r: )r� r r� �rV r� r$ r$ r% rX � rY z7OperatorNode._infer_binary_operation.<locals>.<genexpr>c s s | ]}t �|�rd V qdS )r N)r� r� r� r$ r$ r% rX � s )r� r� r� r� Z object_typerd �AttributeErrorr r r r� �anyr� �mapr� �sum�lenZBadBinaryOperationMessager� ) r� r� r� rs r� r� r� r� r� r� r� �results�not_implementedr$ r$ r% �_infer_binary_operationo sB � � � z$OperatorNode._infer_binary_operationN)F)F)r( r) r* � staticmethodr� r� r� r� r� r� r� r� r� r� r� r� r$ r$ r$ r% r� F s4 $ & � � 8 >r� );r+ � __future__r re �collections.abcr r r � functoolsr r r �typingr r r r r r� r r r Z astroid.constr Zastroid.contextr r r Zastroid.exceptionsr r Zastroid.interpreterr Zastroid.nodes.node_ngr Zastroid.typingr Zastroid.nodes.node_classesr � AugAssign�BinOprd r� r r, r1 r< r= r> rT rh rp rx ry r� r� r� r� r� r$ r$ r$ r% �<module> st � ��#>."���
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка