Format: application/x-python-code
1 o
2
3 �hߍ � @ s� d Z ddlZddlZddlmZ ddlmZ ddlmZ ddlm Z m
4 Z
5 m Z m Z m
6 Z
7 ddlmZ ddlmZ dd lmZ dd
8 lmZ dd lmZ dd lmZ dd
9 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'�
10 Z4d(d)� e4�5� D �Z6d*d+� Z7d,d-� Z8d.d/� Z9e'e
11 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&
12 Functions inferring the syntax tree.
13 � N)�tree)�debug)� parser_utils)�ValueSet� NO_VALUES�ContextualizedNode�iterator_to_value_set�iterate_values)�
14 LazyTreeValue)�compiled)� recursion)�analysis)�imports)� arguments)�
15 ClassValue�
16 FunctionValue)�iterable)�ListModification�DictModification)� TreeInstance)� is_string�
17 is_literal� is_number�get_names_of_node�is_big_annoying_library)�COMPARISON_OPERATORS)� inference_state_method_cache)� VersionInfo)�
18 annotation)�TreeNameDefinition)�CompForContext�� Decoratee)�plugin_manager�__add__�__sub__�__mul__�
19 __matmul__� __truediv__� __floordiv__�__mod__�__pow__�
20 __lshift__�
21 __rshift__�__and__�__or__�__xor__)
22 �+�-�*�@�/z//�%�**z<<z>>�&�|�^c C s" i | ]
23 \}}|d |dd� �qS )�__r� N� )�.0�k�vr= r= �Pc:\Users\shubh\Videos\agent\nova\Lib\site-packages\jedi/inference/syntax_tree.py�
24 <dictcomp>2 s �rB c s � fdd�}|S )a{
25 This is for now the way how we limit type inference going wild. There are
26 other ways to ensure recursion limits as well. This is mostly necessary
27 because of instance (self) access that can be quite tricky to limit.
28
29 I'm still not sure this is the way to go, but it looks okay for now and we
30 can still go anther way in the future. Tests are there. ~ dave
31 c s� | j }| j}z-|j| d7 < d}| jd u r"| �� |ju r"|d9 }|j| |kr2t�d|� tW S W n t yA d|j|< Y nw � | g|�R i |��S )N� i, �d z+In value %s there were too many inferences.)
32 � tree_node�inference_stateZinferred_element_counts�parent_context� get_value�builtins_moduler �warningr �KeyError)�context�args�kwargs�nrF �maximum��funcr= rA �wrapper@ s
33 � �z$_limit_value_infers.<locals>.wrapperr= )rR rS r= rQ rA �_limit_value_infers7 s rT c s� t | t�r
34 t| |�S |}|d ur%|j}|jdv rn t�|�r!d }n|d us| j�|�}|d u r�|r�|jdkr�| j j
35 r�|j d }i g}|j |j
36 kr�t|�}t|�}dd� |D �� t� fdd�|D ��r�|D ][}| j �| |�} t| �dkr�t|�t| � dkr�t�d |� i g} n8t|�}
37 g }| D ]#} t|
38 �} t| �D ]\}
39 }|�� | |
40 < t| g�| |
41 |j< q�|| 7 }q�qd|D ]}| ||j< q�qdt|�dkr�t}|D ] }| �||�� |t| |�O }W d � n1 s�w Y q�|S t| |�S |r�t| |�S t| |�S )
42 N)�if_stmt�for_stmtrU rC c S s g | ]}|j �qS r= ��value)r> �er= r= rA �
43 <listcomp>u s z infer_node.<locals>.<listcomp>c 3 s � | ]}|j � v V qd S �NrW )r> �i�Zstr_element_namesr= rA � <genexpr>v s � z infer_node.<locals>.<genexpr>� z,Too many options for if branch inference %s.) �
44 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
45 name_dictsZif_namesZ
46 element_namesZif_nameZ definitionsZoriginal_name_dictsZ
47 definitionZnew_name_dictsr\ Z name_dict�resultr= r] rA �
48 infer_nodeX sh
49
50
51
52 �
53
54 � � ��
55
56
57 ru c C sB |}|dur |j }| j�|�}|durt| |�S |dust| |�S )zA
58 TODO This function is temporary: Merge with infer_node.
59 N)rb rd re ra �_infer_node_cached)rL rr rb rs r= r= rA rq � s
60 �
61 rq )�defaultc C s
62 t | |�S r[ )ra )rL rr r= r= rA rv � s
63 rv c C s� t �d||j| � | j}|j}|dv rt| |�S |dkr%tt�| |�g�S |dkr.t | |�S |dv r�|j
64 d }|j
65 dd � }d}|jd krQ|j d
66 krQd }|� d�}| �
67 |�}t|�D ] \}} | d krt| �
68 ||d �}
69 t| || |
70 �} nt| || �}qZ|r�|�� �� S |S |d
71 v r�tt�|| |�g�S |dv r�| �
72 |j
73 d �}|j
74 d d� D ]} t|| �}q�|S |dkr�| �
75 |j
76 d �| �
77 |j
78 d �B S |dkr�|j dkr�|j} tdt|j �| f ��tt�|d�g�S |dk�rt| |j
79 d �}|j
80 dd d� D ] }
81 |j|
82 | d�}q�|S |dk�r| �
83 |j
84 d �S |dk�r"t � | |j
85 d �� � S |dk�rNt |j
86 ��rL|j
87 d jdk�rL|j
88 d j
89 d }| �
90 |��d �� � }|�� S t!S |d k�r[| �
91 |j
92 d �S t"| |�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
93 eval_input� annassignZ
94 yield_exprZ yield_arg�__iter__�namedexpr_test)#r rl rg rF rc �
95 infer_atomr r � from_context�infer_expr_stmtrf rX �popru rn �_infer_comparison�
96 infer_trailer� py__await__�py__stop_iteration_returnsr �SequenceLiteralValue� infer_factorrb �AssertionError�reprr �builtin_from_name�py__getattribute__r �infer_annotation�execute_annotationrk �execute_with_valuesr �
97 infer_or_test)rL rr rF �typZ first_childrf Z had_await� value_setr\ �trailer�rightr� �originZ next_name�
98 generatorsr= r= rA ra � s�
99
100
101
102
103 � �
104
105
106
107 �
108
109 �
110
111 ra c C s� |j d d� \}}|dkrd }|dkr%|j \}}}|�t| |�t| |��S t�d||� |dkr7|j| |d�S |dksAJ d| ��t�| j | ||�}|�
112 |�S ) Nr< �)�[zinfer_trailer: %s in %s�.)r� Z name_or_str�(ztrailer_op is actually %s) rf Zget_item�_infer_subscript_listr r rl r� r Z
113 TreeArgumentsrF �execute)rL Z atom_valuesr� Z
114 trailer_op�node�_rM r= r= rA r� s$ ��
115 r� c
116 s� | j }� jdkr>t�� ddd�p� }|jdkr't� fdd�|�� D ��s&� }n|jdkr.� }|j}t� �r7d}| j� |d�S � jd kr_� j d
117 v rRt
118 t � |� j �g�S � j d krYt
119 S J d
120 � ��t� tj�ru|j�� j �}t
121 t �||�g�S � jdkr�t| � jd �}� jdd� D ]}t| |�}t| |d|�}q�|S � jdkr�t �|�S � j}|d dkr�t|�dks�|d jdkr�t|d j�dks�| �|d �S z |d jd } W n ttfy� Y n(w | dkr�z |d jd } W n ty� Y nw | jdv �rt
122 t� || � �g�S |d }
123 z|
124 j} W n t�y g } Y nw |d dk�r:|
125 dk�s2d| v �s2d| v �r:t� || � �} nt� || � �} t
126 | g�S ) z�
127 Basically to process ``atom`` nodes. The parser sometimes doesn't
128 generate the node (because it has just one child). In that case an atom
129 might be a name or a literal as well.
130 rx r� r rU c 3 s. � | ]}|j � j ko|jk n V qd S r[ )rg rh )r> rO �r{ r= rA r^ % s �, z infer_atom.<locals>.<genexpr>N��positionr} )�False�True�None�yieldFzCannot infer the keyword %sr| r rC r1 r~ r� r< Z
131 testlist_comp�:� )�comp_for�
132 sync_comp_for�{�}r7 ) rF rc r �search_ancestorri Zget_test_nodesrg �_is_annotation_namer� rX r r r� r r` �LiteralZcompiled_subprocessZsafe_literal_eval�create_simple_objectr� rf r� Zget_string_value_setrk ru �
133 IndexError�AttributeErrorr Zcomprehension_from_atomZDictLiteralValuer� )
134 rL r{ �state�stmtr� rz r� r� �cr� Z
135 array_nodeZ array_node_c� new_valuer= r� rA r� sz
136
137 �
138
139
140
141
142
143
144
145 � � �
146 �"
147
148 r� c C s~ t �| j|��.}|r-|d ur t�| ||�}|r |W d � S t| ||�W d � S W d � tS 1 s8w 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 ��
149 �
150 � � r� c s� dd� }t �d||� |�� }� �|��|r t� |�}t|���t|�� d�}||�\}�|dvo5|jdk}|s:|r�|j dd�d j
151 } � j | |j d
152 �}
153 |ra� ��fd d ��t
154 �fd
155 d�|
156 D ���npt�|�} | j
157 dd� | _
158 t�|d�} | dur�| jdkrʈr�t�| �r�| �� }
159 t� |
160 �}t|�� �|��}|D ].}| jd j
161 |�� i}� �| |�� � �|�}t� |
162 | |�}
163 W d � n1 s�w Y q�|
164 �nt� |
165 | ���t �d�� �S )aD
166 The starting point of the completion. A statement always owns a call
167 list, which are the calls, that a statement does. In case multiple
168 names are defined in the statement, `seek_name` returns the result for
169 this name.
170
171 expr_stmt: testlist_star_expr (annassign | augassign (yield_expr|testlist) |
172 ('=' (yield_expr|testlist_star_expr))*)
173 annassign: ':' test ['=' test]
174 augassign: ('+=' | '-=' | '*=' | '@=' | '/=' | '%=' | '&=' | '|=' | '^=' |
175 '<<=' | '>>=' | '**=' | '//=')
176
177 :param stmt: A `tree.ExprStmt`.
178 c S s` | j d }|jdvr dS |j d }|jdks t|j �dkr dS |j d }|j d dk|j d fS ) Nr )r� r� )FNrx r< r� r� rC )rf rc rk )r� r� rx r� r= r= rA �
179 check_setitem� s
180
181
182
183 z'_infer_expr_stmt.<locals>.check_setitemzinfer_expr_stmt %s (%s)N)�=Nr� T)�include_setitemr r� c s: t � ��}| jdkrt| �|�S | jdkrt| �|�S | S )N�dictrm )� ContextualizedSubscriptListNode�
184 array_typer r )r@ r� )rL �
185 subscriptlistr� r= rA �to_mod� s
186
187
188 z _infer_expr_stmt.<locals>.to_modc 3 s � | ]}� |�V qd S r[ r= )r> r@ )r� r= rA r^ � � � z#_infer_expr_stmt.<locals>.<genexpr>r� rV rC zinfer_expr_stmt result %s)r rl Zget_rhsru r �check_tuple_assignments�nextZyield_operatorsrc Zget_defined_namesrX r� rg r ro r r� r Zfor_stmt_defines_one_nameZ get_testlistr rm rj �iteraterf rp r� )rL r� r� r� �rhsrO Zfirst_operatorZ
189 is_setitemZ is_annassignrx � left_valuesr� rV r� �cnZordered�
190 lazy_value�dct�tr= )rL r� r� r� rA r� } sH
191
192
193
194
195 �
196
197 �� r� c C s� t |j�}| �t|��}|D ]K}t|�}|jdkr$d�dd� |jD ��}|dv rOtdd� |D ��}|dhkr@|dkr?| �|�}q|d hkrN|dkrN| �|�}qt| ||| �|��}qt� d
198 |� |S ) NZcomp_op� c s s � | ]}|j V qd S r[ rW �r> r� r= r= rA r^ � s � z infer_or_test.<locals>.<genexpr>)�and�orc s � � | ]}|� � V qd S r[ )�
199 py__bool__)r> �leftr= r= rA r^ � r� Tr� Fzinfer_or_test types %s)
200 �iterrf ru r� rc �join�setr� r rl )rL Zor_test�iterator�typesr� r� Z
201 left_boolsr= r= rA r� � s*
202
203
204
205 �
206
207 �� r� c c s| � | D ]8}|dkrt |�r|�� V q|dkr8|�� }|du r.t|jj�d��� ��� V qt �
208 |j| �V q|V qdS )z6
209 Calculates `+`, `-`, `~` and `not` prefixes.
210 r2 �notN�bool) r �negater� rm rF rI r� r� r� r r� )r� r� rX �br= r= rA r� � s" �
211 ����r� c C sF t }|D ] }t|�rt�| |jj�}||�� O }q|t|g�O }q|S r[ )r r r r� rx � string_namer� r )rF rt Z
212 new_resultr� �clsr= r= rA �_literals_to_types� s r� c s� � j �t�t�r �}nt�j�}|r�s!|pt�ptB }t�|�S |dkr9tdd� t�|��D ��r9t �
213 |�f�S t |�t �� dkrJt�|�B �S t �
214 � ���fdd�|D ��S )Nr9 c s s � | ] }|� � p |�� V qd S r[ )�is_class� is_compiled)r> rX r= r= rA r^ s
215 � �
216 �z$_infer_comparison.<locals>.<genexpr>� c 3 s* � | ]}�D ] }t �� |�|�V qqd S r[ )�_infer_comparison_part)r> r� r� �rL r� � right_valuesr� r= rA r^ s � �� �) rF r` �strrX r r� �all� itertools�chainr � from_setsrk )rL r� r� r� Z operator_strrt r= r� rA r� s
217
218
219
220 ��r� c C s� t �| ddd�}|d u rdS |jdv r+|j}|d ur)|j| j ko&|jk S S dS |jdkrS|j}t|�dkrS|d jdkrS|d j| j koP|d jk S S dS )N�param�funcdefr� F)r� r� rC r� )r r� rc r rg rh rf rk )rx Zancestor�annr� r= r= rA r� % s
221
222 �&r� c C �
223 | j dkS )Nrm �r� rW r= r= rA �_is_list5 �
224 r� c C r� )N�tupler� rW r= r= rA � _is_tuple9 r� r� c C s t �| t|��S r[ )r r� r� )rF �bool_r= r= rA �_bool_to_value= s r c C sv t | tj�sd S g }| �� D ]*}t |t�s d S |j}|jdkr# d S z
225 |�t|j �� W q t
226 y8 Y d S w |S )Nry ) r` r r� Z
227 py__iter__r
228 �datarc �append�intrX �
229 ValueError)rX �numbersr� r� r= r= rA �_get_tuple_intsA s
230
231 �r c C s� t |�}t |�}t|t�r|}nt|j�}|dkr8t|tj�s#t|�r(t|g�S t|tj�s2t|�r7t|g�S n�|dkrj|r@|sHt|�rNt|�rN|�||�S t |�rVt |�s^t
232 |�rit
233 |�ritt� | ||f�g�S n�|dkry|rx|rx|�||�S nu|dkr�t|g�S |t v r�|�
234 � r�|�
235 � r�|�||�}|r�|S n=|dv r�t | } | ||�}
236 |dv |
237 kr�tt| |
238 �g�S t|t�r�t|�} | d ur�tjj | | jjt| ��} tt| | �g�S tt| d�t| d�g�S |d v r�| j�d
239 ��� S d d � }
240 |d
241 v �r||k�r|
242 |��s|
243 |��sd}t�|d||||f � |�� �s |�� �r t S t | }|�|�}|�r6|� |�}|�r6|S |�sLt | }|�|�}|� |�}|�rL|S t||g�}t �!d||� |S )Nr3 r1 r2 r6 )�isz!=�==zis not)r r TF)�inznot inr� c S s t | t�o
244 | jjdv S )z4Checks if a Jedi object is either a float or an int.)r �float)r` r rx r� )�objr= r= rA �check� s
245
246 �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 r` r� rX r �Sequencer r Zexecute_operationr� r� Z MergedArrayr r� r r r r �access� environment� version_infor� rI r� r� r
247 �addr� r �operator_to_magic_methodr� � reverse_operator_to_magic_methodr rl )rF rL r� r� r� Zl_is_numZr_is_numZ str_operatorrt Z operationr r Z bool_resultr
248 �message� method_nameZ
249 magic_methodsZreverse_method_namer= r= rA r� R s�
250
251
252
253 � � �
254 �
255
256
257 ����
258
259 �
260
261
262
263 r� c C s$ t }|�� j}|d urg|�� �|jg �}d}|D ]J}|j}|jdkrb|jd jdkrbt �
264 |�|jk} |jd }
265 | rbd}|
266 jd jdkrR|
267 jd j|jkrR|j rR|j }|t �
268 ||jd jd ��� O }q|rg|S g } |jddd�} | d u r�|j} | jdkr�|�|�}
269 |
270 �� r�t S t|
271 �� �}|�|j�}t�d d
272 � |D ��S | jd vr�|�|�}
273 t|
274 |�S | j}|d kr�t �|| |�} | r�| S |d
275 kr�t �|| |�} | r�| S |dv �rz |j| |j } W | S t�y t|| jd �}t |� � || jjdkd�}t ||�}t ||�} Y | S w |dk�rt || |�} | S |d
276 k�rA|�!| �"|��}| jjdk�r8|�#d�}|�$� }|�%� �&� S |�#d�}|�$� S |d v �rNt'�(||�} | S |dv �rZt)|| �} | S |dk�rn|�!|�*� �*� �}|�$� } | S |dk�rwt } | S |dk�r�t } | S |dk�r�t!|| �} | S t+d| ��)NFr� rC r� Trx )Zimport_name_alwaysr� Z global_stmtc s r� r[ )rj )r> rx 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
277 async_stmt)Zcontextualized_node�is_async�
278 __aenter__� __enter__)r� �classdefZtry_stmtr� Zdel_stmtr� zShould not happen. type: %s),r Zget_root_contextrE Zget_used_namesre rX rb rc rf 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_withrd rK r r rj r r� r� ru 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_annotationrx r� Z
279 correct_scopeZ
280 ann_assignr� r� r� �filterr� r� Z for_typesrO Zvalue_managersZ
281 enter_methods�coro�
282 exceptionsr= r= rA �tree_name_to_values� s�
283
284 ����
285
286
287
288
289
290 )�
291 �
292 �
293
294 �
295
296
297
298 �
299
300 �
301 �
302 �
303 �
304 �r! c s| |j dkrt| j| |d�� nt�| |�� t� g� }}t| �r!|S t|�� �D ]�}t j
305 d||dd� t � � �f | � |j
306 d �}|j
307 dd� }|rWt�d |�}||_t| ||�}t|�sw|jd
308 d �}|d krlt �d
309 ||� |W d � S |�t�|g��}t|�s�t �d|� |W d � S W d � n1 s�w Y t j
310 d|dd� q'||kr�t� fdd�|D ��S |S )z�
311 Returns the function, that should to be executed in the end.
312 This is also the places where the decorators are processed.
313 r )rG rE zdecorator: %s %sZMAGENTA)�colorrC r< r� r� F)Zinclude_prefixz @runtime
314 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 s z%_apply_decorators.<locals>.<listcomp>)rc r rF r r� r r �reversedZget_decoratorsr rl Zincrease_indent_cmru rf r Z
315 PythonNoderb r� rk �get_coderJ r� r ZValuesArguments) rL r� �initial�values�decZ
316 dec_valuesZ
317 trailer_nodesr� �coder= r# rA r sH
318 �
319 � � �r c C s� d}| � � D ]?\}}t| j|�}|�|�}t|t�r t S d}||krAzt|�}W n
320 ty7 t Y S w ||j 7 }||ks$|�
321 � }q|S )z(
322 Checks if tuples are assigned.
323 Nr ) Zassignment_indexesr rG r� r` �slicer r� �
324 StopIteration�maxrj )rx r� r� �indexr� r� Ziteratedr\ r= r= rA r� K s"
325
326 �
327 �
328 r� c @ s e Zd Zdd� ZdS )r� c C s t | j| j�S r[ )r� rL r� )�selfr= r= rA rj g s z%ContextualizedSubscriptListNode.inferN)�__name__�
329 __module__� __qualname__rj r= r= r= rA r� f s r� c C s� |dkrt t�| ddd�g�S |jdkr`|jd dks`g }|jD ](}|dkr.|s-|�d� q |jdkrCt|j�dkrB|�|jd � q |�|� q |dgd t|� 7 }t tj| g|�R � g�S |jd
330 krpt t�| j| |�g�S | � |�S ) z,
331 Handles slices in subscript nodes.
332 r� NZ subscriptr r� Zsliceopr< rC r� r� )
333 r r �Slicerc rf r rk r� rF ru )rL r- rt �elr= r= rA r� k s&
334
335 �
336 �
337
338 r� r[ )Q�__doc__ro r� Z parso.pythonr Zjedir r Zjedi.inference.base_valuer r r r r Zjedi.inference.lazy_valuer
339 Zjedi.inferencer r r
340 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 ru rq rv Zincrease_indentra 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
341 NU
342 M
343 ]
344 i
345 1