Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/jedi/inference/__pycache__/syntax_tree.cpython-39.pyc
Ðазад
a j�hߍ � @ s� d Z ddlZddlZddlmZ ddlmZ ddlmZ ddlm Z m Z m Z m Z m Z ddlmZ ddlmZ dd lmZ dd lmZ dd lmZ dd lmZ dd lmZmZ ddlmZ ddlmZm Z ddlm Z ddl m Z m Z m!Z!m"Z"m#Z# ddl$m%Z% ddl&m'Z' ddl(m)Z) ddl*m+Z+ ddl,m-Z- ddl.m/Z/ ddl0m1Z1 ddl2m3Z3 ddd d d d d d!d"d#d$d%d&d'� Z4d(d)� e4�5� D �Z6d*d+� Z7d,d-� Z8d.d/� Z9e'e d0�d1d2� �Z:ej;e7d3d4� ��Z<d5d6� Z=d7d8� Z>e7d[d9d:��Z?ej;d\d;d<��Z@d=d>� ZAe d?d@� �ZBdAdB� ZCdCdD� ZDdEdF� ZEdGdH� ZFdIdJ� ZGdKdL� ZHdMdN� ZIdOdP� ZJe3�K� dQdR� �ZLe'� dSdT� �ZMdUdV� ZNG dWdX� dXe �ZOdYdZ� ZPdS )]z& Functions inferring the syntax tree. � N)�tree)�debug)� parser_utils)�ValueSet� NO_VALUES�ContextualizedNode�iterator_to_value_set�iterate_values)� LazyTreeValue)�compiled)� recursion)�analysis)�imports)� arguments)� ClassValue� FunctionValue)�iterable)�ListModification�DictModification)� TreeInstance)� is_string� is_literal� is_number�get_names_of_node�is_big_annoying_library)�COMPARISON_OPERATORS)� inference_state_method_cache)� VersionInfo)� annotation)�TreeNameDefinition)�CompForContext�� Decoratee)�plugin_manager�__add__�__sub__�__mul__� __matmul__� __truediv__� __floordiv__�__mod__�__pow__� __lshift__� __rshift__�__and__�__or__�__xor__) �+�-�*�@�/z//�%�**z<<z>>�&�|�^c C s" i | ]\}}|d |dd� �qS )�__r� N� )�.0�k�vr= r= ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/jedi/inference/syntax_tree.py� <dictcomp>2 s rB c s � fdd�}|S )a{ This is for now the way how we limit type inference going wild. There are other ways to ensure recursion limits as well. This is mostly necessary because of instance (self) access that can be quite tricky to limit. I'm still not sure this is the way to go, but it looks okay for now and we can still go anther way in the future. Tests are there. ~ dave c s� | j }| j}zZ|j| d7 < d}| jd u rD| �� |ju rD|d9 }|j| |krdt�d|� tW S W n t y� d|j|< Y n0 � | g|�R i |��S )N� i, �d z+In value %s there were too many inferences.) � tree_node�inference_stateZinferred_element_counts�parent_context� get_value�builtins_moduler �warningr �KeyError)�context�args�kwargs�nrF �maximum��funcr= rA �wrapper@ s � z$_limit_value_infers.<locals>.wrapperr= )rR rS r= rQ rA �_limit_value_infers7 s rT c s t | t�rt| |�S |}|d urD|j}|jdv r2qDt�|�rd }qDq| j�|�}|d u �r�|�r�|jdk�r�| j j �r�|j d }i g}|j |j k�r�t|�}t|�}dd� |D �� t� fdd�|D ���r�|D ]�}| j �| |�} t| �dk�rzt|�t| � dk�r t�d |� i g} �q�t|�} g }| D ]J} t| �} t| �D ]*\} }|�� | | < t| g�| | |j< �q@|| 7 }�q,q�|D ]}| ||j< �q~q�t|�dk�r�t}|D ]B}| �||�� |t| |�O }W d � n1 �s�0 Y �q�|S t| |�S n|�r t| |�S t| |�S d S ) N)�if_stmt�for_stmtrU rC c S s g | ] }|j �qS r= ��value)r> �er= r= rA � <listcomp>u � z infer_node.<locals>.<listcomp>c 3 s | ]}|j � v V qd S �NrW )r> �i�Zstr_element_namesr= rA � <genexpr>v r[ z infer_node.<locals>.<genexpr>� z,Too many options for if branch inference %s.) � isinstancer � _infer_node�parent�typer Zis_scope�predefined_names�getrF Z is_analysis�children� start_pos�end_posr �any�infer�lenr �dbg�list� enumerate�copyr rX r �predefine_names�_infer_node_if_inferred)rL �elementrU �predefined_if_name_dictZ if_stmt_testZ name_dictsZif_namesZ element_namesZif_nameZ definitionsZoriginal_name_dictsZ definitionZnew_name_dictsr] Z name_dict�resultr= r^ rA � infer_nodeX sd �� 2 rv c C s< |}|dur2|j }| j�|�}|durt| |�S qt| |�S )zA TODO This function is temporary: Merge with infer_node. N)rc re rf rb �_infer_node_cached)rL rs rc rt r= r= rA rr � s rr )�defaultc C s t | |�S r\ )rb )rL rs r= r= rA rw � s rw c C s� t �d||j| � | j}|j}|dv r0t| |�S |dkrJtt�| |�g�S |dkr\t | |�S |dv �r|j d }|j dd � }d}|jd kr�|j d kr�d }|� d�}| � |�}t|�D ]B\}} | d kr�| � ||d �} t| || | �} � q�t| || �}q�|�r |�� �� S |S |d v �r.tt�|| |�g�S |dv �rl| � |j d �}|j d d� D ]} t|| �}�qV|S |dk�r�| � |j d �| � |j d �B S |dk�r�|j dk�r�|j} tdt|j �| f ��tt�|d�g�S |dk�r t| |j d �}|j dd d� D ]} |j| | d�}�q|S |dk�r8| � |j d �S |dk�rXt � | |j d �� � S |dk�r�t |j ��r�|j d jdk�r�|j d j d }| � |��d �� � }|�� S t!S |d k�r�| � |j d �S t"| |�S d S ) Nzinfer_node %s@%s in %s)�name�number�string�atom�strings�keyword�fstring�lambdef� expr_stmt)�power� atom_exprr rC Fr~ �awaitTr7 )Ztestlist_star_exprZtestlist)Znot_test�factor����test�operatorz...z unhandled operator %s in %s �EllipsisZ dotted_namer< )� name_contextZ eval_input� annassignZ yield_exprZ yield_arg�__iter__�namedexpr_test)#r rm rh rF rd � infer_atomr r � from_context�infer_expr_stmtrg rX �poprv ro �_infer_comparison� infer_trailer� py__await__�py__stop_iteration_returnsr �SequenceLiteralValue� infer_factorrc �AssertionError�reprr �builtin_from_name�py__getattribute__r �infer_annotation�execute_annotationrl �execute_with_valuesr � infer_or_test)rL rs rF �typZ first_childrg Z had_await� value_setr] �trailer�rightr� �originZ next_name� generatorsr= r= rA rb � s� � � � rb c C s� |j d d� \}}|dkr d }|dkrJ|j \}}}|�t| |�t| |��S t�d||� |dkrn|j| |d�S |dks�J d| ��t�| j | ||�}|� |�S d S ) Nr< �)�[zinfer_trailer: %s in %s�.)r� Z name_or_str�(ztrailer_op is actually %s) rg Zget_item�_infer_subscript_listr r rm r� r Z TreeArgumentsrF �execute)rL Z atom_valuesr� Z trailer_op�node�_rM r= r= rA r� s$ ��r� c s� | j }� jdkr|t�� ddd�p"� }|jdkrNt� fdd�|�� D ��s\� }n|jdkr\� }|j}t� �rnd}| j� |d�S � jd krƈ j d v r�t t � |� j �g�S � j d kr�t S d s�J d � ���n�t� tj�r�|j�� j �}t t �||�g�S � jdk�r@t| � jd �}� jdd� D ] }t| |�}t| |d|�}�q |S � jdk�rVt �|�S � j}|d dk�r�t|�dk�s�|d jdk�r�t|d j�dk�s�| �|d �S z|d jd } W n ttf�y� Y nT0 | dk�rz|d jd } W n t�y Y n0 | jdv �r(t t� || � �g�S |d } z | j} W n t�yR g } Y n0 |d dk�r�| dk�s�d| v �s�d| v �r�t� || � �} nt� || � �} t | g�S dS ) z� Basically to process ``atom`` nodes. The parser sometimes doesn't generate the node (because it has just one child). In that case an atom might be a name or a literal as well. ry r� r� rU c 3 s, | ]$}|j � j ko |jk n V qd S r\ )rh ri )r> rO �r| r= rA r_ % r[ z infer_atom.<locals>.<genexpr>N��positionr~ )�False�True�None�yieldFzCannot infer the keyword %sr} r rC r1 r r� r< Z testlist_comp�:� )�comp_for� sync_comp_for�{�}r7 ) rF rd r �search_ancestorrj Zget_test_nodesrh �_is_annotation_namer� rX r r r� r ra �LiteralZcompiled_subprocessZsafe_literal_eval�create_simple_objectr� rg r� Zget_string_value_setrl rv � IndexError�AttributeErrorr Zcomprehension_from_atomZDictLiteralValuer� ) rL r| �state�stmtr� r{ r� r� �cr� Z array_nodeZ array_node_c� new_valuer= r� rA r� sx �� � "�r� c C s| t �| j|��Z}|rZ|d ur@t�| ||�}|r@|W d � S t| ||�W d � S W d � n1 sn0 Y tS r\ )r Zexecution_allowedrF r Z"find_type_from_comment_hint_assign�_infer_expr_stmtr )rL r� � seek_name�allowedZpep0484_valuesr= r= rA r� o s �8r� c s� dd� }t �d||� |�� }� �|��|r@t� |�}t|���t|�� d�}||�\}�|dvoj|jdk}|sv|�r�|j dd�d j } � j | |j d �} |rć ��fd d ��t �fd d�| D ���n�t�|�} | j dd� | _ t�|d�} | du�r�| jdk�r���r�t�| ��r�| �� } t� | �}t|�� �|��}|D ]`}| jd j |�� i}� �| |��( � �|�}t� | | |�} W d � n1 �s�0 Y �q:| �nt� | | ���t �d�� �S )aD The starting point of the completion. A statement always owns a call list, which are the calls, that a statement does. In case multiple names are defined in the statement, `seek_name` returns the result for this name. expr_stmt: testlist_star_expr (annassign | augassign (yield_expr|testlist) | ('=' (yield_expr|testlist_star_expr))*) annassign: ':' test ['=' test] augassign: ('+=' | '-=' | '*=' | '@=' | '/=' | '%=' | '&=' | '|=' | '^=' | '<<=' | '>>=' | '**=' | '//=') :param stmt: A `tree.ExprStmt`. c S s` | j d }|jdvrdS |j d }|jdks:t|j �dkr>dS |j d }|j d dk|j d fS ) Nr )r� r� )FNry r< r� r� rC )rg rd rl )r� r� ry r� r= r= rA � check_setitem� s z'_infer_expr_stmt.<locals>.check_setitemzinfer_expr_stmt %s (%s)N)�=Nr� T)�include_setitemr r� c s: t � ��}| jdkr t| �|�S | jdkr6t| �|�S | S )N�dictrn )� ContextualizedSubscriptListNode� array_typer r )r@ r� )rL � subscriptlistr� r= rA �to_mod� s z _infer_expr_stmt.<locals>.to_modc 3 s | ]}� |�V qd S r\ r= )r> r@ )r� r= rA r_ � r[ z#_infer_expr_stmt.<locals>.<genexpr>r� rV rC zinfer_expr_stmt result %s)r rm Zget_rhsrv r �check_tuple_assignments�nextZyield_operatorsrd Zget_defined_namesrX r� rh r rp r r� r Zfor_stmt_defines_one_nameZ get_testlistr rn rk �iteraterg rq r� )rL r� r� r� �rhsrO Zfirst_operatorZ is_setitemZ is_annassignry � left_valuesr� rV r� �cn�ordered� lazy_value�dct�tr= )rL r� r� r� rA r� } sD � 2 r� c C s� t |j�}| �t|��}|D ]�}t|�}|jdkrHd�dd� |jD ��}|dv r�tdd� |D ��}|dhkr�|dkr�| �|�}q�|d hkr�|dkr�| �|�}q t| ||| �|��}q t� d |� |S ) NZcomp_op� c s s | ] }|j V qd S r\ rW �r> r� r= r= rA r_ � r[ z infer_or_test.<locals>.<genexpr>)�and�orc s s | ]}|� � V qd S r\ )� py__bool__)r> �leftr= r= rA r_ � r[ Tr� Fzinfer_or_test types %s) �iterrg rv r� rd �join�setr� r rm )rL Zor_test�iterator�typesr� r� Z left_boolsr= r= rA r� � s& � r� c c sz | D ]p}|dkr$t |�rt|�� V q|dkrn|�� }|du rZt|jj�d��� ��� V qtt � |j| �V q|V qdS )z6 Calculates `+`, `-`, `~` and `not` prefixes. r2 �notN�bool) r �negater� rn rF rI r� r� r� r r� )r� r� rX �br= r= rA r� � s r� c C sF t }|D ]8}t|�r2t�| |jj�}||�� O }q|t|g�O }q|S r\ )r r r r� ry � string_namer� r )rF ru Z new_resultr� �clsr= r= rA �_literals_to_types� s r� c s� � j �t�t�r�}n t�j�}|r(�sB|p.t�p4tB }t�|�S |dkrrtdd� t�|��D ��rrt � |�f�S t |�t �� dkr�t�|�B �S t � � ���fdd�|D ��S d S )Nr9 c s s | ]}|� � p|�� V qd S r\ )�is_class� is_compiled)r> rX r= r= rA r_ s �z$_infer_comparison.<locals>.<genexpr>� c 3 s( | ] }�D ]}t �� |�|�V q qd S r\ )�_infer_comparison_part)r> r� r� �rL r� � right_valuesr� r= rA r_ s �) rF ra �strrX r r� �all� itertools�chainr � from_setsrl )rL r� r� r� Z operator_strru r= r� rA r� s ��r� c C s� t �| ddd�}|d u r dS |jdv rT|j}|d ur�|j| j koL|jk S S nP|jdkr�|j}t|�dkr�|d jdkr�|d j| j ko�|d jk S S dS )N�param�funcdefr� F)r� r� rC r� )r r� rd r rh ri rg rl )ry Zancestor�annr� r= r= rA r� % s &r� c C s | j dkS )Nrn �r� rW r= r= rA �_is_list5 s r� c C s | j dkS )N�tupler� rW r= r= rA � _is_tuple9 s r� c C s t �| t|��S r\ )r r� r� )rF �bool_r= r= rA �_bool_to_value= s r� c C sx t | tj�sd S g }| �� D ]V}t |t�s0 d S |j}|jdkrF d S z|�t|j �� W q t yp Y d S 0 q |S )Nrz ) ra r r� Z py__iter__r �datard �append�intrX � ValueError)rX �numbersr� r� r= r= rA �_get_tuple_intsA s r c C s� t |�}t |�}t|t�r |}n t|j�}|dkrrt|tj�sFt|�rPt|g�S t|tj�sdt|�rnt|g�S �n�|dkr�|r�|s�t|�r�t|�r�|�||�S t |�r�t |�s�t |�r�t |�r�tt� | ||f�g�S �n |dkr�|r�|r�|�||�S � n�|dk�r t|g�S |t v �r�|� � �rB|� � �rB|�||�}|�r�|S n�|dv �r|t | } | ||�} |dv | k�r|tt| | �g�S t|t��r�t|�} | d u�r�tjj | | jjt| ��} tt| | �g�S tt| d�t| d�g�S |d v �r�| j�d ��� S d d � } |d v �rB||k�rB| |��sB| |��sBd}t�|d||||f � |�� �sV|�� �rZt S t | }|�|�}|�r�|� |�}|�r�|S |�s�t | }|�|�}|� |�}|�r�|S t||g�}t �!d||� |S )Nr3 r1 r2 r6 )�isz!=�==zis not)r r TF)�inznot inr� c S s t | t�o| jjdv S )z4Checks if a Jedi object is either a float or an int.)r �float)ra r ry r� )�objr= r= rA �check� s �z%_infer_comparison_part.<locals>.check)r1 r2 z7TypeError: unsupported operand type(s) for +: %s and %sztype-error-operationz Used operator %s resulting in %s)"r ra r� rX r �Sequencer r Zexecute_operationr� r� Z MergedArrayr r� r� r r r �access� environment� version_infor� rI r� r� r �addr� r �operator_to_magic_methodr� � reverse_operator_to_magic_methodr rm )rF rL r� r� r� Zl_is_numZr_is_numZ str_operatorru Z operationr� r Z bool_resultr �message� method_nameZ magic_methodsZreverse_method_namer= r= rA r� R s� �� �� � r� c C s* t }|�� j}|d ur�|�� �|jg �}d}|D ]�}|j}|jdkr0|jd jdkr0t � |�|jk} |jd } | r0d}| jd jdkr�| jd j|jkr�|j r�|j }|t � ||jd jd ��� O }q0|r�|S g } |jddd�} | d u �r`|j} | jdk�r@|�|�} | �� �rt S t| �� �}|�|j�}t�d d � |D ��S | jd v�r`|�|�} t| |�S | j}|d k�r�t �|| |�} | �r�| S |d k�r�t �|| |�} | �r�| S |dv �r z|j| |j } W nR t�y t|| jd �}t |� � || jjdkd�}t ||�}t ||�} Y n0 �n|dk�r8t || |�} n�|d k�r�|�!| �"|��}| jjdk�r~|�#d�}|�$� }|�%� �&� S |�#d�}|�$� S |d v �r�t'�(||�} n~|dv �r�t)|| �} nh|dk�r�|�!|�*� �*� �}|�$� } nB|dk�r�t } n2|dk�rt } n"|dk�rt!|| �} n t+d| ��| S )NFr� rC r� Try )Zimport_name_alwaysr� Z global_stmtc s s | ]}|� � V qd S r\ )rk )r> ry r= r= rA r_ � r[ z&tree_name_to_values.<locals>.<genexpr>)Z import_from� import_namerV Z with_stmt)rV r� r� r� Z async_stmt)Zcontextualized_node�is_async� __aenter__� __enter__)r� �classdefZtry_stmtr� Zdel_stmtr� zShould not happen. type: %s),r Zget_root_contextrE Zget_used_namesrf rX rc rd rg r Zget_parent_scoperG r r� r� Zget_definitionZcreate_contextZ is_moduler� Z get_filtersr r� r� Z find_type_from_comment_hint_forZ find_type_from_comment_hint_withre rK r r rk r r� r� rv Zget_test_node_from_namer� r� r� r� r Z infer_import�_apply_decoratorsZget_previous_siblingr )rF rL Z tree_namer� Z module_node�namesZfound_annotationry r� Z correct_scopeZ ann_assignr� r� r� �filterr� r� Z for_typesrO Zvalue_managersZ enter_methods�coro� exceptionsr= r= rA �tree_name_to_values� s� ���� � r c s� |j dkr t| j| |d�� n t�| |�� t� g� }}t| �rB|S t|�� �D �]}t j d||dd� t � � �� | � |j d �}|j dd� }|r�t�d |�}||_t| ||�}t|�s�|jd d �}|d kr�t �d ||� |W d � S |�t�|g��}t|��s.t �d|� |W d � S W d � n1 �sD0 Y t j d|dd� qN||k�r�t� fdd�|D ��S |S )z� Returns the function, that should to be executed in the end. This is also the places where the decorators are processed. r )rG rE zdecorator: %s %sZMAGENTA)�colorrC r< r� r� F)Zinclude_prefixz @runtime z decorator not found: %s on %sNz)not possible to resolve wrappers found %szdecorator end %sc s g | ]}t |� ��qS r= r! r� �Zdecoratee_valuer= rA rZ G r[ z%_apply_decorators.<locals>.<listcomp>)rd r rF r r� r r �reversedZget_decoratorsr rm Zincrease_indent_cmrv rg r Z PythonNoderc r� rl �get_coderJ r� r ZValuesArguments) rL r� �initial�values�decZ dec_valuesZ trailer_nodesr� �coder= r! rA r s@ � 6 r c C s� d}| � � D ]x\}}t| j|�}|�|�}t|t�r<t S d}||kr|z t|�}W n tyn t Y S 0 ||j 7 }q@|� � }q |S )z( Checks if tuples are assigned. Nr ) Zassignment_indexesr rG r� ra �slicer r� � StopIteration�maxrk )ry r� r� �indexr� r� Ziteratedr] r= r= rA r� K s r� c @ s e Zd Zdd� ZdS )r� c C s t | j| j�S r\ )r� rL r� )�selfr= r= rA rk g s z%ContextualizedSubscriptListNode.inferN)�__name__� __module__� __qualname__rk r= r= r= rA r� f s r� c C s� |dkr t t�| ddd�g�S |jdkr�|jd dks�g }|jD ]P}|dkr\|s�|�d� q@|jdkr�t|j�dkr�|�|jd � q@|�|� q@|dgd t|� 7 }t tj| g|�R � g�S |jd kr�t t�| j| |�g�S | � |�S ) z, Handles slices in subscript nodes. r� NZ subscriptr r� Zsliceopr< rC r� r� ) r r �Slicerd rg r rl r� rF rv )rL r+ ru �elr= r= rA r� k s" r� )N)N)Q�__doc__rp r� Z parso.pythonr Zjedir r Zjedi.inference.base_valuer r r r r Zjedi.inference.lazy_valuer Zjedi.inferencer r r r r Zjedi.inference.valuer r r Z#jedi.inference.value.dynamic_arraysr r r Zjedi.inference.helpersr r r r r Z jedi.inference.compiled.accessr Zjedi.inference.cacher Z!jedi.inference.gradual.stub_valuer Zjedi.inference.gradualr Zjedi.inference.namesr Zjedi.inference.contextr Z jedi.inference.value.decoratorr" Z jedi.pluginsr# r �itemsr rT rv rr rw Zincrease_indentrb r� r� r� r� r� r� r� r� r� r� r� r� r r� Zdecorater r r� r� r� r= r= r= rA �<module> s� ��!H NU M ] i 1
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка