Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/astroid/__pycache__/rebuilder.cpython-39.pyc
Ðазад
a k�h� � @ sf U d Z ddlmZ ddlZddlZddlZddlmZmZ ddl m Z ddl m Z m Z ddlmZmZmZmZmZmZ ddlmZ dd lmZmZmZ dd lm Z m Z dd l m Z dd l m!Z! dd l"m#Z# ddl$m%Z% ddl&m'Z' dddddddd�Z(de)d< eddded �Z*ed ej+ej,�Z-ed ej.ej/�Z0ed ej1ej2�Z3eej4ej5ej+f Z6G d d � d �Z7dS )!zlThis module contains utilities for rebuilding an _ast tree in order to get a single Astroid representation. � )� annotationsN)�Callable� Generator)�StringIO)� TokenInfo�generate_tokens)� TYPE_CHECKING�Final�TypeVar�Union�cast�overload)�nodes)� ParserModule�get_parser_module�parse_function_type_comment)� PY312_PLUS�Context)�AstroidManager)�NodeNG)� AssignName)�Position)�InferenceResult� Arguments� Comprehension� ExceptHandler�Keyword� MatchCase)� arguments� comprehensionZ ListCompForZ GenExprFor� excepthandler�keywordZ match_casezFinal[dict[str, str]]�REDIRECT�T_Doc� ast.Module� ast.ClassDef)�ast.FunctionDef�ast.AsyncFunctionDef� _FunctionT�_ForT�_WithTc @ s| e Zd ZdZ�d�ddddd�dd �Zd d d �d d�Zddd �dd�Zdddd�dd�Zddddd d �d d �Ze �re d d!d"d�d#d$��Z e d%d!d&d�d'd$��Z e d(d!d)d�d*d$��Z e d+d!d,d�d-d$��Z e d.d!d/d�d0d$��Z e d1d!d2d�d3d$��Z e d4d!d5d�d6d$��Z e d7d!d8d�d9d$��Z e d:d!d;d�d<d$��Z e d=d!d>d�d?d$��Z e d@d!dAd�dBd$��Z e dCd!dDd�dEd$��Z e dFd!dGd�dHd$��Z e dId!dJd�dKd$��Z e dLd!dMd�dNd$��Z e dOd!dPd�dQd$��Z e dRd!dSd�dTd$��Z e dUd!dVd�dWd$��Z e dXd!dYd�dZd$��Z e d[d!d\d�d]d$��Z e d^d!d_d�d`d$��Z e dad!dbd�dcd$��Z e ddd!ded�dfd$��Z e dgd!dhd�did$��Z e djd!dkd�dld$��Z e dmd!dnd�dod$��Z e dpd!dqd�drd$��Z e dsd!dtd�dud$��Z e dvd!dwd�dxd$��Z e dyd!dzd�d{d$��Z e d|d!d}d�d~d$��Z e dd!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e j d�k�r0e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d�d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e j d�k�re d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e j d�k�r|e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e j d�k�r�e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e d�d!d�d�d�d$��Z e �d d!d!d��dd$��Z e dd!dd��dd$��Z �dd!�dd��dd$�Z �ddd ��d�d�Zd d!d"d��d �d �Zd%d!d&d��d �d �Zd(d!d)d��d �d�Z�d�d�dd��d�d�Z�dd!�dd��d�d�Zd+d!d,d��d�d�Zd.d!d/d��d�d�Zd1d!d2d��d�d �Zd4d!d5d��d �d �Zd7d!d8d��d �d �Zd:d!d;d��d!�d"�Ze �d d!dd"�d#��d$�d%��Ze �d d!dd�d#��d&�d%��Z�d d!d�d'�d#��d(�d%�Zd=d!d>d��d)�d*�Zd@d!dAd��d+�d,�Z dCd!dDd��d-�d.�Z dFd!dGd��d/�d0�Z dId!dJd��d1�d2�Z �d�dLd!ddM�d4��d5�d6�Z dOd!dPd��d7�d8�Z!dRd!dSd��d9�d:�Z"dUd!dVd��d;�d<�Z#dd!�d=d��d>�d?�Z$dXd!dYd��d@�dA�Z%d[d!d\�dB�dC��dD�dE�Z&d[d!d\d��dF�dG�Z'd^d!d_d��dH�dI�Z(dad!dbd��dJ�dK�Z)ddd!ded��dL�dM�Z*e �dNdgd!dh�dO��dP�dQ��Z+e �dRd.d!d/�dO��dS�dQ��Z+�dT�dUd!�dV�dO��dW�dQ�Z+dgd!dhd��dX�dY�Z,djd!dkd��dZ�d[�Z-e �d\dmd!dn�dO��d]�d^��Z.e �d_d+d!d,�dO��d`�d^��Z.�da�dd!�db�dO��dc�d^�Z.dmd!dnd��dd�de�Z/dpd!dqd��df�dg�Z0dsd!�dhd��di�dj�Z1dvd!dwd��dk�dl�Z2dyd!dzd��dm�dn�Z3d|d!d}d��do�dp�Z4dd!d�d��dq�dr�Z5d�d!d�d��ds�dt�Z6d�d!d�d��du�dv�Z7d�d!d�d��dw�dx�Z8d�d!d�d��dy�dz�Z9d�d!d�d��d{�d|�Z:d�d!d�d��d}�d~�Z;d�d!d�d��d�d��Z<d�d!�d�d��d��d��Z=d�d!d�d��d��d��Z>d�d!d�d��d��d��Z?d�d!d�d��d��d��Z@d�d!d�d��d��d��ZAd�d!d�d��d��d��ZBd�d!d�d��d��d��ZCd�d!d�d��d��d��ZDd�d!d�d��d��d��ZEd�d�d�d��d��d��ZFd�d!d�d��d��d��ZGd�d!d�d��d��d��ZHd�d!d�d��d��d��ZId�d!d�d��d��d��ZJd�d!d�d��d��d��ZKd�d!d�d��d��d��ZLd�d!d�d��d��d��ZMd�d!d�d��d��d��ZNd�d!d�d��d��d��ZOd�d!d�d��d��d��ZPe �d�d�d!ddO��d��d���ZQe �d�d4d!d5�dO��d��d���ZQ�d��d�d!�d��dO��d��d��ZQd�d!d!d��d��d��ZRd�d!d!d��d��d��ZSd�d!d!d��d��d��ZTe j d�k�rxd�d!d�d��d��d��ZUd�d!d�d��d��d��ZVd�d!d�d��d��d��ZWd�d!d�d��d��d��ZXd�d!d�d��d��dZYd�d!d�d��dÐdĄZZd�d!d�d��dŐdƄZ[d�d!d�d��dǐdȄZ\d�d!d�d��dɐdʄZ]d�d!d�d��dːd̄Z^dS (� � TreeRebuilderz1Rebuilds the _ast tree to become an Astroid tree.Nr zParserModule | Nonez str | None�None)�manager� parser_module�data�returnc C sN || _ |r|�d�nd | _g | _g | _g | _i | _|d u rDt� | _n|| _d S )N� ) �_manager�split�_data� _global_names�_import_from_nodes�_delayed_assattr� _visit_methsr �_parser_module)�selfr- r. r/ � r; ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/astroid/rebuilder.py�__init__7 s zTreeRebuilder.__init__r# z+tuple[T_Doc, ast.Constant | ast.Str | None])�noder0 c C sz z^|j r\t|j d tj�r\|j d j}t|tj�r\t|jt�r\|}|j dd� |_ ||fW S W n typ Y n0 |dfS )zReturn the doc ast node.r � N)�body� isinstance�ast�Expr�value�Constant�str� IndexError)r: r> Z first_value� doc_ast_noder; r; r< �_get_docI s � zTreeRebuilder._get_doczMast.Attribute | ast.List | ast.Name | ast.Subscript | ast.Starred | ast.Tupler c C s | j j�t|j�tj�S �N)r9 Zcontext_classes�get�type�ctxr �Load�r: r> r; r; r< � _get_contextX s zTreeRebuilder._get_contextz5ast.ClassDef | ast.FunctionDef | ast.AsyncFunctionDefz;nodes.ClassDef | nodes.FunctionDef | nodes.AsyncFunctionDefzPosition | None)r> �parentr0 c C s | j s dS |j}|jr"|jd j}d�| j |jd |� �}d}tjf}t|tj �rZd}nt|tj �rld}nd}t t |�j �D ]R}|dur�|jtjkr�|j|jkr� q�|j|v r�|j|kr�|}q~|jdv r�q~d}q~dS t|j|jd d |jd |j|jd d |jd d �S ) a* Return position information for ClassDef and FunctionDef nodes. In contrast to AST positions, these only include the actual keyword(s) and the class / function name. >>> @decorator >>> async def some_func(var: int) -> None: >>> ^^^^^^^^^^^^^^^^^^^ Nr r1 r? �async�def�class> rS )�lineno� col_offset� end_lineno�end_col_offset)r4 rW r@ rU �join�token�NAMErA r �AsyncFunctionDef� FunctionDefr r �readlinerL �string�namer �start�end) r: r> rQ rW r/ Z start_tokenZkeyword_tokensZ search_token�tr; r; r< �_get_position_infoe sF � � � �z TreeRebuilder._get_position_infor$ rF �boolz nodes.Module)r> �modname�modpath�packager0 c sN �� |�\}}tj|||g|d�� � j� �fdd�|jD ���|� �d� � S )zmVisit a Module node by returning a fresh instance of it. Note: Method not called by 'visit' )r` �file�pathrh c s g | ]}�� |� ��qS r; ��visit��.0�child��newnoder: r; r< � <listcomp>� � z.TreeRebuilder.visit_module.<locals>.<listcomp>)�doc_node)rI r �Module�postinitr@ rl )r: r> rf rg rh rH r; rp r< � visit_module� s � �zTreeRebuilder.visit_modulezast.argr znodes.AssignNamec C s d S rJ r; �r: r> rQ r; r; r< rl � s zTreeRebuilder.visitz ast.argumentsznodes.Argumentsc C s d S rJ r; rx r; r; r< rl � s z ast.Assertz nodes.Assertc C s d S rJ r; rx r; r; r< rl � s r' znodes.AsyncFunctionDefc C s d S rJ r; rx r; r; r< rl � s z ast.AsyncForznodes.AsyncForc C s d S rJ r; rx r; r; r< rl � s z ast.Awaitz nodes.Awaitc C s d S rJ r; rx r; r; r< rl � s z ast.AsyncWithznodes.AsyncWithc C s d S rJ r; rx r; r; r< rl � s z ast.Assignz nodes.Assignc C s d S rJ r; rx r; r; r< rl � s z ast.AnnAssignznodes.AnnAssignc C s d S rJ r; rx r; r; r< rl � s z ast.AugAssignznodes.AugAssignc C s d S rJ r; rx r; r; r< rl � s z ast.BinOpz nodes.BinOpc C s d S rJ r; rx r; r; r< rl � s z ast.BoolOpz nodes.BoolOpc C s d S rJ r; rx r; r; r< rl � s z ast.Breakz nodes.Breakc C s d S rJ r; rx r; r; r< rl � s zast.Callz nodes.Callc C s d S rJ r; rx r; r; r< rl � s r% znodes.ClassDefc C s d S rJ r; rx r; r; r< rl � s z ast.Continueznodes.Continuec C s d S rJ r; rx r; r; r< rl � s z ast.Comparez nodes.Comparec C s d S rJ r; rx r; r; r< rl � s zast.comprehensionznodes.Comprehensionc C s d S rJ r; rx r; r; r< rl � s z ast.Deletez nodes.Deletec C s d S rJ r; rx r; r; r< rl � s zast.Dictz nodes.Dictc C s d S rJ r; rx r; r; r< rl � s z ast.DictCompznodes.DictCompc C s d S rJ r; rx r; r; r< rl � s zast.Exprz nodes.Exprc C s d S rJ r; rx r; r; r< rl � s zast.ExceptHandlerznodes.ExceptHandlerc C s d S rJ r; rx r; r; r< rl � s zast.Forz nodes.Forc C s d S rJ r; rx r; r; r< rl � s zast.ImportFromznodes.ImportFromc C s d S rJ r; rx r; r; r< rl s r& znodes.FunctionDefc C s d S rJ r; rx r; r; r< rl s zast.GeneratorExpznodes.GeneratorExpc C s d S rJ r; rx r; r; r< rl s z ast.Attributeznodes.Attributec C s d S rJ r; rx r; r; r< rl s z ast.Globalz nodes.Globalc C s d S rJ r; rx r; r; r< rl s zast.Ifznodes.Ifc C s d S rJ r; rx r; r; r< rl s z ast.IfExpz nodes.IfExpc C s d S rJ r; rx r; r; r< rl s z ast.Importz nodes.Importc C s d S rJ r; rx r; r; r< rl s z ast.JoinedStrznodes.JoinedStrc C s d S rJ r; rx r; r; r< rl s zast.FormattedValueznodes.FormattedValuec C s d S rJ r; rx r; r; r< rl s z ast.NamedExprznodes.NamedExprc C s d S rJ r; rx r; r; r< rl " s z ast.keywordz nodes.Keywordc C s d S rJ r; rx r; r; r< rl % s z ast.Lambdaz nodes.Lambdac C s d S rJ r; rx r; r; r< rl ( s zast.Listz nodes.Listc C s d S rJ r; rx r; r; r< rl + s z ast.ListCompznodes.ListCompc C s d S rJ r; rx r; r; r< rl . s zast.Namez;nodes.Name | nodes.Const | nodes.AssignName | nodes.DelNamec C s d S rJ r; rx r; r; r< rl 1 s z ast.Nonlocalznodes.Nonlocalc C s d S rJ r; rx r; r; r< rl 6 s z ast.Constantz nodes.Constc C s d S rJ r; rx r; r; r< rl 9 s )� � z ast.ParamSpecznodes.ParamSpecc C s d S rJ r; rx r; r; r< rl > s zast.Passz nodes.Passc C s d S rJ r; rx r; r; r< rl A s z ast.Raisez nodes.Raisec C s d S rJ r; rx r; r; r< rl D s z ast.Returnz nodes.Returnc C s d S rJ r; rx r; r; r< rl G s zast.Setz nodes.Setc C s d S rJ r; rx r; r; r< rl J s z ast.SetCompz nodes.SetCompc C s d S rJ r; rx r; r; r< rl M s z ast.Sliceznodes.Subscriptz nodes.Slicec C s d S rJ r; rx r; r; r< rl P s z ast.Subscriptc C s d S rJ r; rx r; r; r< rl S s z ast.Starredz nodes.Starredc C s d S rJ r; rx r; r; r< rl V s zast.Tryz nodes.Tryc C s d S rJ r; rx r; r; r< rl Y s )ry � z ast.TryStarz nodes.TryStarc C s d S rJ r; rx r; r; r< rl ^ s z ast.Tuplez nodes.Tuplec C s d S rJ r; rx r; r; r< rl a s z ast.TypeAliasznodes.TypeAliasc C s d S rJ r; rx r; r; r< rl f s z ast.TypeVarz nodes.TypeVarc C s d S rJ r; rx r; r; r< rl i s zast.TypeVarTupleznodes.TypeVarTuplec C s d S rJ r; rx r; r; r< rl l s z ast.UnaryOpz nodes.UnaryOpc C s d S rJ r; rx r; r; r< rl q s z ast.Whilez nodes.Whilec C s d S rJ r; rx r; r; r< rl t s zast.Withz nodes.Withc C s d S rJ r; rx r; r; r< rl w s z ast.Yieldz nodes.Yieldc C s d S rJ r; rx r; r; r< rl z s z ast.YieldFromznodes.YieldFromc C s d S rJ r; rx r; r; r< rl } s )ry � z ast.Matchz nodes.Matchc C s d S rJ r; rx r; r; r< rl � s zast.match_caseznodes.MatchCasec C s d S rJ r; rx r; r; r< rl � s zast.MatchValueznodes.MatchValuec C s d S rJ r; rx r; r; r< rl � s zast.MatchSingletonznodes.MatchSingletonc C s d S rJ r; rx r; r; r< rl � s zast.MatchSequenceznodes.MatchSequencec C s d S rJ r; rx r; r; r< rl � s zast.MatchMappingznodes.MatchMappingc C s d S rJ r; rx r; r; r< rl � s zast.MatchClassznodes.MatchClassc C s d S rJ r; rx r; r; r< rl � s z ast.MatchStarznodes.MatchStarc C s d S rJ r; rx r; r; r< rl � s z ast.MatchAsz nodes.MatchAsc C s d S rJ r; rx r; r; r< rl � s z ast.MatchOrz nodes.MatchOrc C s d S rJ r; rx r; r; r< rl � s z ast.patternz nodes.Patternc C s d S rJ r; rx r; r; r< rl � s zast.ASTc C s d S rJ r; rx r; r; r< rl � s c C s d S rJ r; rx r; r; r< rl � s zast.AST | Nonez NodeNG | Nonec C s` |d u r d S |j }|| jv r(| j| }n.|j}dt�||��� }t| |�}|| j|< |||�S )N�visit_)� __class__r8 �__name__r" rK �lower�getattr)r: r> rQ �clsZ visit_method�cls_name� visit_namer; r; r< rl � s z nodes.AssignName | nodes.DelNamec C sR | j r*|j| j d v r*|�� �|j|� n$|js4J �|js>J �|j�|j|� dS )zASave assignment situation since node.parent is not available yet.���N)r5 r` �root� set_localrQ rO r; r; r< �_save_assignment� s z TreeRebuilder._save_assignmentc C s | � |||j�S )z8Visit an arg node by returning a fresh AssName instance.)�visit_assignname�argrx r; r; r< � visit_arg� s zTreeRebuilder.visit_argc s d}d}|j }|j}t�|j r&|j jnd|jr6|jjnd||r\t|j|j|j||j|j d�nd|r�t|j|j|j||j|j d�nd�� � �fdd�|j D �}� �fdd�|j D �}d} d} |j r�|j j}�� |j j � �} |jr�|jj}�� |jj � �} � �fdd�|jD �} � �fdd�|jD �} � �fdd�|j D �} � �fd d�|jD �}� �fd d�|jD �}� �fd d�|jD �}� �fd d�|j D �}� �fd d�|jD �}� �fdd�|jD �}� j||| || | ||| | |||d� � j�s�J �|�r � j�|� � |�r� j�|� � � S )z<Visit an Arguments node by returning a fresh instance of it.N)rW rX c s g | ]}�� |� ��qS r; rk rm rp r; r< rr � rs z1TreeRebuilder.visit_arguments.<locals>.<listcomp>c s g | ]}�� |� ��qS r; rk rm rp r; r< rr � rs c s g | ]}�� |� ��qS r; rk rm rp r; r< rr � rs c s g | ]}�� |� ��qS r; rk rm rp r; r< rr � rs c s g | ]}�� |j� ��qS r; �rl � annotation�rn r� rp r; r< rr rs c s g | ]}�� |j� ��qS r; r� r� rp r; r< rr s c s g | ]}�� |� ��qS r; rk rm rp r; r< rr rs c s g | ]}�� |j� ��qS r; r� r� rp r; r< rr s c s g | ]}�j |� d ��qS ��rQ ��check_type_commentrm rp r; r< rr s c s g | ]}�j |� d ��qS r� r� rm rp r; r< rr s c s g | ]}�j |� d ��qS r� r� rm rp r; r< rr s ) �args�defaults� kwonlyargs� posonlyargs� kw_defaultsr �kwonlyargs_annotations�posonlyargs_annotations�varargannotation�kwargannotation�type_comment_args�type_comment_kwonlyargs�type_comment_posonlyargs)�vararg�kwargr r r� r rU rV rW rX r� r� rl r� r� r� r� rv rQ r� )r: r> rQ r� r� Z vararg_nodeZ kwarg_noder� r� r� r� r� r� r r� r� r� r� r� r� r; rp r< �visit_arguments� s� �� �� � � � � � �� z TreeRebuilder.visit_argumentsc C sN t j|j|j|j|j|d�}d}|jr4| �|j|�}|�| �|j |�|� |S )z8Visit a Assert node by returning a fresh instance of it.�rU rV rW rX rQ N) r �AssertrU rV rW rX �msgrl rv �test)r: r> rQ rq r� r; r; r< � visit_assert* s �zTreeRebuilder.visit_assertzHast.Assign | ast.arg | ast.For | ast.AsyncFor | ast.With | ast.AsyncWithzZnodes.Assign | nodes.Arguments | nodes.For | nodes.AsyncFor | nodes.With | nodes.AsyncWithc C sf |j s d S z| j�|j �}W n ty0 Y d S 0 |js<d S | j|jd |d�}t|tj�s`d S |j S )Nr r� ) � type_commentr9 �parse� SyntaxErrorr@ rl rA r rC rD )r: r> rQ �type_comment_astZ type_objectr; r; r< r� 9 s z TreeRebuilder.check_type_commentz&ast.FunctionDef | ast.AsyncFunctionDefz)tuple[NodeNG | None, list[NodeNG]] | Nonec sp |j s d S zt|j �}W n ty, Y d S 0 |s6d S d }� �fdd�|jpNg D �}|jrh��|j� �}||fS )Nc s g | ]}�� |� ��qS r; rk )rn �elem�rQ r: r; r< rr i s z=TreeRebuilder.check_function_type_comment.<locals>.<listcomp>)r� r r� �argtypes�returnsrl )r: r> rQ r� r� r� r; r� r< �check_function_type_commentY s �z)TreeRebuilder.check_function_type_commentc C s | � tj||�S rJ )�_visit_functiondefr r\ rx r; r; r< �visit_asyncfunctiondefq s z$TreeRebuilder.visit_asyncfunctiondefc C s | � tj||�S rJ )� _visit_forr �AsyncForrx r; r; r< �visit_asyncforv s z TreeRebuilder.visit_asyncforc C s6 t j|j|j|j|j|d�}|j| �|j|�d� |S �Nr� )rD ) r �AwaitrU rV rW rX rv rl rD �r: r> rQ rq r; r; r< � visit_awaity s �zTreeRebuilder.visit_awaitc C s | � tj||�S rJ )� _visit_withr � AsyncWithrx r; r; r< �visit_asyncwith� s z TreeRebuilder.visit_asyncwithc sZ t j|j|j|j|j|d�� �j|� d�}� j� �fdd�|jD ��� |j � �|d� � S )z8Visit a Assign node by returning a fresh instance of it.r� r� c s g | ]}�� |� ��qS r; rk rm rp r; r< rr � rs z.TreeRebuilder.visit_assign.<locals>.<listcomp>)�targetsrD �type_annotation) r �AssignrU rV rW rX r� rv r� rl rD )r: r> rQ r� r; rp r< � visit_assign� s � �zTreeRebuilder.visit_assignc C sR t j|j|j|j|j|d�}|j| �|j|�| �|j |�|j | �|j |�d� |S )z<Visit an AnnAssign node by returning a fresh instance of it.r� )�targetr� �simplerD ) r � AnnAssignrU rV rW rX rv rl r� r� r� rD r� r; r; r< �visit_annassign� s � �z TreeRebuilder.visit_annassign)r> rQ � node_namer0 c C s d S rJ r; �r: r> rQ r� r; r; r< r� � s z TreeRebuilder.visit_assignnamec C s d S rJ r; r� r; r; r< r� � s znodes.AssignName | Nonec C s8 |du r dS t j||j|j|j|j|d�}| �|� |S )z_Visit a node and return a AssignName node. Note: Method not called by 'visit' N�r` rU rV rW rX rQ )r r rU rV rW rX r� )r: r> rQ r� rq r; r; r< r� � s � c C sT t j| jjt|j� d |j|j|j|j |d�}|� | � |j |�| � |j |�� |S )z;Visit a AugAssign node by returning a fresh instance of it.�=��oprU rV rW rX rQ )r � AugAssignr9 �bin_op_classesrL r� rU rV rW rX rv rl r� rD r� r; r; r< �visit_augassign� s ��z TreeRebuilder.visit_augassignc C sP t j| jjt|j� |j|j|j|j |d�}|� | � |j |�| � |j |�� |S )z7Visit a BinOp node by returning a fresh instance of it.r� )r �BinOpr9 r� rL r� rU rV rW rX rv rl �left�rightr� r; r; r< � visit_binop� s ��zTreeRebuilder.visit_binopc sL t j�jjt|j� |j|j|j|j |d�� � � � �fdd�|j D �� � S )z8Visit a BoolOp node by returning a fresh instance of it.r� c s g | ]}�� |� ��qS r; rk rm rp r; r< rr � rs z.TreeRebuilder.visit_boolop.<locals>.<listcomp>) r �BoolOpr9 Zbool_op_classesrL r� rU rV rW rX rv �valuesrx r; rp r< � visit_boolop� s � zTreeRebuilder.visit_boolopc C s t j|j|j|j|j|d�S )z7Visit a Break node by returning a fresh instance of it.r� )r �BreakrU rV rW rX rx r; r; r< � visit_break� s �zTreeRebuilder.visit_breakc s^ t j|j|j|j|j|d�� � j��|j� �� �fdd�|j D �� �fdd�|j D �d� � S )z:Visit a CallFunc node by returning a fresh instance of it.r� c s g | ]}�� |� ��qS r; rk rm rp r; r< rr rs z,TreeRebuilder.visit_call.<locals>.<listcomp>c s g | ]}�� |� ��qS r; rk rm rp r; r< rr rs )�funcr� �keywords) r �CallrU rV rW rX rv rl r� r� r� rx r; rp r< � visit_call� s � �zTreeRebuilder.visit_callT)r> rQ �newstyler0 c s� �� |�\}}tj|j|j|j|j|j|d�� d}|jD ] }|j dkr8�� |� �j } qZq8�� |� �}� j � �fdd�|jD �� �fdd�|jD �|||� �fdd�|jD ���|� ��� |� �trڇ �fdd�|jD �ng d � � S ) z(Visit a ClassDef node to become astroid.r� N� metaclassc s g | ]}�� |� ��qS r; rk rm rp r; r< rr rs z0TreeRebuilder.visit_classdef.<locals>.<listcomp>c s g | ]}�� |� ��qS r; rk rm rp r; r< rr ! rs c s" g | ]}|j d kr��|� ��qS )r� )r� rl )rn Zkwdrp r; r< rr % s �c s g | ]}�� |� ��qS r; rk �rn �paramrp r; r< rr - rs )�positionrt � type_params)rI r �ClassDefr` rU rV rW rX r� r� rl rD �visit_decoratorsrv �basesr@ rd r r� )r: r> rQ r� rH r� r! � decoratorsr; rp r< �visit_classdef s> � � ��z TreeRebuilder.visit_classdefc C s t j|j|j|j|j|d�S )z:Visit a Continue node by returning a fresh instance of it.r� )r �ContinuerU rV rW rX rx r; r; r< �visit_continue4 s �z TreeRebuilder.visit_continuec sP t j|j|j|j|j|d�� � ���|j� �� �fdd�t |j |j �D �� � S )z9Visit a Compare node by returning a fresh instance of it.r� c s* g | ]"\}}�j j|j ��|� �f�qS r; )r9 Zcmp_op_classesr~ rl )rn r� �exprrp r; r< rr I s � �z/TreeRebuilder.visit_compare.<locals>.<listcomp>) r �ComparerU rV rW rX rv rl r� �zip�ops� comparatorsrx r; rp r< � visit_compare> s � �� zTreeRebuilder.visit_comparec sT t j|ddddd�� � ���|j� ���|j� �� �fdd�|jD �t|j�� � S )z?Visit a Comprehension node by returning a fresh instance of it.N)rQ rU rV rW rX c s g | ]}�� |� ��qS r; rk rm rp r; r< rr c rs z5TreeRebuilder.visit_comprehension.<locals>.<listcomp>) r r rv rl r� �iter�ifsre �is_asyncrx r; rp r< �visit_comprehensionS s � �z!TreeRebuilder.visit_comprehensionznodes.Decorators | Nonec sd |j s dS |j d j}|j d j}|j d j}tj||j|||d�� � �� �fdd�|j D �� � S )zqVisit a Decorators node by returning a fresh instance of it. Note: Method not called by 'visit' Nr r� r� c s g | ]}�� |� ��qS r; rk rm rp r; r< rr � rs z2TreeRebuilder.visit_decorators.<locals>.<listcomp>)�decorator_listrU rW rX r Z DecoratorsrV rv )r: r> rQ rU rW rX r; rp r< r� h s � z TreeRebuilder.visit_decoratorsc s< t j|j|j|j|j|d�� � �� �fdd�|jD �� � S )z8Visit a Delete node by returning a fresh instance of it.r� c s g | ]}�� |� ��qS r; rk rm rp r; r< rr � rs z.TreeRebuilder.visit_delete.<locals>.<listcomp>)r �DeleterU rV rW rX rv r� rx r; rp r< � visit_delete� s � zTreeRebuilder.visit_deletez Generator[tuple[NodeNG, NodeNG]])r> rQ rq r0 c c s` t |j|j�D ]L\}}| �||�}|sDtj|j|j|j|j |d�}n | �||�}||fV qd S �Nr� ) r� �keysr� rl r Z DictUnpackrU rV rW rX )r: r> rQ rq �keyrD Z rebuilt_valueZ rebuilt_keyr; r; r< �_visit_dict_items� s � z TreeRebuilder._visit_dict_itemsc C s< t j|j|j|j|j|d�}t| �|||��}|�|� |S )z6Visit a Dict node by returning a fresh instance of it.r� ) r �DictrU rV rW rX �listr� rv )r: r> rQ rq �itemsr; r; r< � visit_dict� s � � zTreeRebuilder.visit_dictc sT t j|j|j|j|j|d�� � ���|j� ���|j � �� �fdd�|j D �� � S )z:Visit a DictComp node by returning a fresh instance of it.r� c s g | ]}�� |� ��qS r; rk rm rp r; r< rr � rs z0TreeRebuilder.visit_dictcomp.<locals>.<listcomp>) r �DictComprU rV rW rX rv rl r� rD � generatorsrx r; rp r< �visit_dictcomp� s � �z TreeRebuilder.visit_dictcompc C s4 t j|j|j|j|j|d�}|�| �|j|�� |S )z6Visit a Expr node by returning a fresh instance of it.r� ) r rC rU rV rW rX rv rl rD r� r; r; r< � visit_expr� s �zTreeRebuilder.visit_exprc sV t j|j|j|j|j|d�� � ���|j� ��� |� |j �� �fdd�|j D �� � S )z@Visit an ExceptHandler node by returning a fresh instance of it.r� c s g | ]}�� |� ��qS r; rk rm rp r; r< rr � rs z5TreeRebuilder.visit_excepthandler.<locals>.<listcomp>) r r rU rV rW rX rv rl rL r� r` r@ rx r; rp r< �visit_excepthandler� s � �z!TreeRebuilder.visit_excepthandlerztype[nodes.For])r� r> rQ r0 c C s d S rJ r; �r: r� r> rQ r; r; r< r� � s zTreeRebuilder._visit_forztype[nodes.AsyncFor]c C s d S rJ r; r r; r; r< r� � s z type[_ForT]zast.For | ast.AsyncForr) c sx ||j |j|j|j|d�� �j|� d�}� j��|j� ���|j� �� �fdd�|j D �� �fdd�|j D �|d� � S )z5Visit a For node by returning a fresh instance of it.r� r� c s g | ]}�� |� ��qS r; rk rm rp r; r< rr � rs z,TreeRebuilder._visit_for.<locals>.<listcomp>c s g | ]}�� |� ��qS r; rk rm rp r; r< rr � rs )r� r� r@ �orelser� ) rU rV rW rX r� rv rl r� r� r@ r �r: r� r> rQ r� r; rp r< r� � s � �c C s | � tj||�S rJ )r� r �Forrx r; r; r< � visit_for s zTreeRebuilder.visit_forc C sN dd� |j D �}tj|jp d||jp&d|j|j|j|j|d�}| j � |� |S )z=Visit an ImportFrom node by returning a fresh instance of it.c S s g | ]}|j |jf�qS r; �r` �asname�rn �aliasr; r; r< rr rs z2TreeRebuilder.visit_importfrom.<locals>.<listcomp>� N)�fromname�names�levelrU rV rW rX rQ ) r r � ImportFrom�moduler rU rV rW rX r6 �append)r: r> rQ r rq r; r; r< �visit_importfrom s � z TreeRebuilder.visit_importfromztype[nodes.FunctionDef]c C s d S rJ r; r r; r; r< r� s z TreeRebuilder._visit_functiondefz type[nodes.AsyncFunctionDef]c C s d S rJ r; r r; r; r< r� s ztype[_FunctionT]r( c s �j �i � ��|�\}}|j}|jr2|jd j}||j||j|j|j|d�� �� |� �}|j rp�� |j � �}nd}d }} �� |� �} | r�| \} }� j �� |j� �� �fdd�|jD �||| |��|� ��� |� �tr� �fdd�|jD �ng d� �j �� � S )z,Visit an FunctionDef node to become astroid.r r� Nc s g | ]}�� |� ��qS r; rk rm rp r; r< rr M rs z4TreeRebuilder._visit_functiondef.<locals>.<listcomp>c s g | ]}�� |� ��qS r; rk r� rp r; r< rr U rs ) r� r@ r� r� �type_comment_returnsr� r� rt r� )r5 r rI rU r� r` rV rW rX r� r� rl r� rv r� r@ rd r r� �pop) r: r� r> rQ rH rU r� r� r� r Ztype_comment_annotationr; rp r< r� # sH � �� c C s | � tj||�S rJ )r� r r] rx r; r; r< �visit_functiondef] s z TreeRebuilder.visit_functiondefc sH t j|j|j|j|j|d�� � ���|j� �� �fdd�|j D �� � S )z>Visit a GeneratorExp node by returning a fresh instance of it.r� c s g | ]}�� |� ��qS r; rk rm rp r; r< rr o rs z4TreeRebuilder.visit_generatorexp.<locals>.<listcomp>) r � GeneratorExprU rV rW rX rv rl �eltr� rx r; rp r< �visit_generatorexpb s � �z TreeRebuilder.visit_generatorexpz2nodes.Attribute | nodes.AssignAttr | nodes.DelAttrc C s� | � |�}|tjkr6tj|j|j|j|j|j |d�}nd|tj krztj |j|j|j|j|j |d�}t |tj �s�| j�|� n tj|j|j|j|j|j |d�}|�| �|j|�� |S )z<Visit an Attribute node by returning a fresh instance of it.)�attrnamerU rV rW rX rQ )rP r �Delr ZDelAttr�attrrU rV rW rX �StoreZ AssignAttrrA r r7 r � Attributerv rl rD �r: r> rQ �contextrq r; r; r< �visit_attributes s> � � �z TreeRebuilder.visit_attributec C sN t j|j|j|j|j|j|d�}| jrJ|jD ] }| jd �|g �� |� q,|S )z&Visit a Global node to become astroid.�r rU rV rW rX rQ r� ) r �Globalr rU rV rW rX r5 � setdefaultr )r: r> rQ rq r` r; r; r< � visit_global� s � zTreeRebuilder.visit_globalc s\ t j|j|j|j|j|d�� � ���|j� �� �fdd�|j D �� �fdd�|j D �� � S )z5Visit an If node by returning a fresh instance of it.r� c s g | ]}�� |� ��qS r; rk rm rp r; r< rr � rs z*TreeRebuilder.visit_if.<locals>.<listcomp>c s g | ]}�� |� ��qS r; rk rm rp r; r< rr � rs ) r �IfrU rV rW rX rv rl r� r@ r rx r; rp r< �visit_if� s � �zTreeRebuilder.visit_ifc C sL t j|j|j|j|j|d�}|�| �|j|�| �|j |�| �|j |�� |S )z7Visit a IfExp node by returning a fresh instance of it.r� ) r �IfExprU rV rW rX rv rl r� r@ r r� r; r; r< � visit_ifexp� s � �zTreeRebuilder.visit_ifexpc C s` dd� |j D �}tj||j|j|j|j|d�}|j D ]&\}}|pB|}|�|�d�d |� q4|S )z8Visit a Import node by returning a fresh instance of it.c S s g | ]}|j |jf�qS r; r r r; r; r< rr � rs z.TreeRebuilder.visit_import.<locals>.<listcomp>r �.r ) r r �ImportrU rV rW rX r� r3 )r: r> rQ r rq r` r r; r; r< � visit_import� s � zTreeRebuilder.visit_importc s< t j|j|j|j|j|d�� � �� �fdd�|jD �� � S )Nr� c s g | ]}�� |� ��qS r; rk rm rp r; r< rr � rs z1TreeRebuilder.visit_joinedstr.<locals>.<listcomp>)r � JoinedStrrU rV rW rX rv r� rx r; rp r< �visit_joinedstr� s � z TreeRebuilder.visit_joinedstrc C sF t j|j|j|j|j|d�}|j| �|j|�|j | �|j |�d� |S )Nr� )rD � conversion� format_spec) r �FormattedValuerU rV rW rX rv rl rD r- r. r� r; r; r< �visit_formattedvalue� s � �z"TreeRebuilder.visit_formattedvaluec C s@ t j|j|j|j|j|d�}|�| �|j|�| �|j |�� |S r� ) r � NamedExprrU rV rW rX rv rl r� rD r� r; r; r< �visit_namedexpr� s ��z TreeRebuilder.visit_namedexprc C sP t j|jt|dd�t|dd�t|dd�t|dd�|d�}|�| �|j|�� |S )z9Visit a Keyword node by returning a fresh instance of it.rU NrV rW rX )r� rU rV rW rX rQ )r r r� r� rv rl rD r� r; r; r< � visit_keyword s � zTreeRebuilder.visit_keywordc C s@ t j|j|j|j|j|d�}|�| �|j|�| �|j |�� |S )z8Visit a Lambda node by returning a fresh instance of it.r� ) r �LambdarU rV rW rX rv rl r� r@ r� r; r; r< � visit_lambda s � zTreeRebuilder.visit_lambdac sH �� |�}tj||j|j|j|j|d�� � �� �fdd�|jD �� � S )z6Visit a List node by returning a fresh instance of it.�rM rU rV rW rX rQ c s g | ]}�� |� ��qS r; rk rm rp r; r< rr - rs z,TreeRebuilder.visit_list.<locals>.<listcomp>) rP r �ListrU rV rW rX rv �elts�r: r> rQ r r; rp r< � visit_list" s � zTreeRebuilder.visit_listc sH t j|j|j|j|j|d�� � ���|j� �� �fdd�|j D �� � S )z:Visit a ListComp node by returning a fresh instance of it.r� c s g | ]}�� |� ��qS r; rk rm rp r; r< rr ; rs z0TreeRebuilder.visit_listcomp.<locals>.<listcomp>) r �ListComprU rV rW rX rv rl r r� rx r; rp r< �visit_listcomp0 s � �z TreeRebuilder.visit_listcompz-nodes.Name | nodes.AssignName | nodes.DelNamec C s� | � |�}|tjkr6tj|j|j|j|j|j |d�}nL|tj krbtj |j|j|j|j|j |d�}n tj |j|j|j|j|j |d�}|tjtj fv r�t ttj tjf |�}| �|� |S )z6Visit a Name node by returning a fresh instance of it.r� )rP r r r ZDelName�idrU rV rW rX r r �Namer r r� r r; r; r< r� ? s> � � � zTreeRebuilder.visit_namec C s t j|j|j|j|j|j|d�S )z6Visit a Nonlocal node and return a new instance of it.r )r �Nonlocalr rU rV rW rX rx r; r; r< �visit_nonlocalf s �z TreeRebuilder.visit_nonlocalc C s$ t j|j|j|j|j|j|j|d�S )z=Visit a Constant node by returning a fresh instance of Const.)rD �kindrU rV rW rX rQ )r ZConstrD rA rU rV rW rX rx r; r; r< �visit_constantq s �z TreeRebuilder.visit_constantc C s8 t j|j|j|j|j|d�}|j| �|||j�d� |S )z;Visit a ParamSpec node by returning a fresh instance of it.r� �r` ) r � ParamSpecrU rV rW rX rv r� r` r� r; r; r< �visit_paramspec} s � z TreeRebuilder.visit_paramspecc C s t j|j|j|j|j|d�S )z6Visit a Pass node by returning a fresh instance of it.r� )r �PassrU rV rW rX rx r; r; r< � visit_pass� s �zTreeRebuilder.visit_passc C sB t j|j|j|j|j|d�}|j| �|j|�| �|j |�d� |S )z7Visit a Raise node by returning a fresh instance of it.r� )�exc�cause) r �RaiserU rV rW rX rv rl rH rI r� r; r; r< � visit_raise� s � �zTreeRebuilder.visit_raisec C s4 t j|j|j|j|j|d�}|�| �|j|�� |S )z8Visit a Return node by returning a fresh instance of it.r� ) r �ReturnrU rV rW rX rv rl rD r� r; r; r< � visit_return� s �zTreeRebuilder.visit_returnc s< t j|j|j|j|j|d�� � �� �fdd�|jD �� � S )z5Visit a Set node by returning a fresh instance of it.r� c s g | ]}�� |� ��qS r; rk rm rp r; r< rr � rs z+TreeRebuilder.visit_set.<locals>.<listcomp>)r �SetrU rV rW rX rv r8 rx r; rp r< � visit_set� s � zTreeRebuilder.visit_setc sH t j|j|j|j|j|d�� � ���|j� �� �fdd�|j D �� � S )z9Visit a SetComp node by returning a fresh instance of it.r� c s g | ]}�� |� ��qS r; rk rm rp r; r< rr � rs z/TreeRebuilder.visit_setcomp.<locals>.<listcomp>) r �SetComprU rV rW rX rv rl r r� rx r; rp r< � visit_setcomp� s � �zTreeRebuilder.visit_setcompc C sf t jt|dd�t|dd�t|dd�t|dd�|d�}|j| �|j|�| �|j|�| �|j|�d� |S )z7Visit a Slice node by returning a fresh instance of it.rU NrV rW rX r� )r� �upper�step)r �Slicer� rv rl r� rR rS r� r; r; r< � visit_slice� s � �zTreeRebuilder.visit_slicec C sL | � |�}tj||j|j|j|j|d�}|�| �|j |�| �|j |�� |S )z;Visit a Subscript node by returning a fresh instance of it.r6 ) rP r � SubscriptrU rV rW rX rv rl rD �slicer r; r; r< �visit_subscript� s ��z TreeRebuilder.visit_subscriptc C s@ | � |�}tj||j|j|j|j|d�}|�| �|j |�� |S )z5Visit a Starred node and return a new instance of it.r6 ) rP r �StarredrU rV rW rX rv rl rD r r; r; r< � visit_starred� s �zTreeRebuilder.visit_starredc sz t j|j|j|j|j|d�� � j� �fdd�|jD �� �fdd�|jD �� �fdd�|j D �� �fdd�|j D �d� � S )z4Visit a Try node by returning a fresh instance of itr� c s g | ]}�� |� ��qS r; rk rm rp r; r< rr rs z+TreeRebuilder.visit_try.<locals>.<listcomp>c s g | ]}�� |� ��qS r; rk rm rp r; r< rr rs c s g | ]}�� |� ��qS r; rk rm rp r; r< rr rs c s g | ]}�� |� ��qS r; rk rm rp r; r< rr rs �r@ �handlersr � finalbody) r �TryrU rV rW rX rv r@ r\ r r] rx r; rp r< � visit_try� s ��zTreeRebuilder.visit_tryc sz t j|j|j|j|j|d�� � j� �fdd�|jD �� �fdd�|jD �� �fdd�|j D �� �fdd�|j D �d� � S )Nr� c s g | ]}�� |� ��qS r; rk �rn �nrp r; r< rr rs z/TreeRebuilder.visit_trystar.<locals>.<listcomp>c s g | ]}�� |� ��qS r; rk r` rp r; r< rr rs c s g | ]}�� |� ��qS r; rk r` rp r; r< rr rs c s g | ]}�� |� ��qS r; rk r` rp r; r< rr rs r[ ) r ZTryStarrU rV rW rX rv r@ r\ r r] rx r; rp r< � visit_trystar s ��zTreeRebuilder.visit_trystarc sH �� |�}tj||j|j|j|j|d�� � �� �fdd�|jD �� � S )z7Visit a Tuple node by returning a fresh instance of it.r6 c s g | ]}�� |� ��qS r; rk rm rp r; r< rr ' rs z-TreeRebuilder.visit_tuple.<locals>.<listcomp>) rP r �TuplerU rV rW rX rv r8 r9 r; rp r< � visit_tuple s � zTreeRebuilder.visit_tuplec sV t j|j|j|j|j|d�� � j��|j� �� �fdd�|j D ���|j � �d� � S )z;Visit a TypeAlias node by returning a fresh instance of it.r� c s g | ]}�� |� ��qS r; rk )rn �prp r; r< rr 5 rs z1TreeRebuilder.visit_typealias.<locals>.<listcomp>)r` r� rD ) r � TypeAliasrU rV rW rX rv rl r` r� rD rx r; rp r< �visit_typealias* s � �z TreeRebuilder.visit_typealiasc C sD t j|j|j|j|j|d�}|j| �|||j�| � |j |�d� |S )z9Visit a TypeVar node by returning a fresh instance of it.r� )r` �bound) r r rU rV rW rX rv r� r` rl rh r� r; r; r< � visit_typevar: s � �zTreeRebuilder.visit_typevarc C s8 t j|j|j|j|j|d�}|j| �|||j�d� |S )z>Visit a TypeVarTuple node by returning a fresh instance of it.r� rC ) r � TypeVarTuplerU rV rW rX rv r� r` r� r; r; r< �visit_typevartupleK s � z TreeRebuilder.visit_typevartuplec C sB t j| jj|jj |j|j|j|j |d�}|� | � |j |�� |S )z9Visit a UnaryOp node by returning a fresh instance of it.r� ) r �UnaryOpr9 Zunary_op_classesr� r~ rU rV rW rX rv rl �operandr� r; r; r< � visit_unaryop[ s �zTreeRebuilder.visit_unaryopc s\ t j|j|j|j|j|d�� � ���|j� �� �fdd�|j D �� �fdd�|j D �� � S )z7Visit a While node by returning a fresh instance of it.r� c s g | ]}�� |� ��qS r; rk rm rp r; r< rr s rs z-TreeRebuilder.visit_while.<locals>.<listcomp>c s g | ]}�� |� ��qS r; rk rm rp r; r< rr t rs ) r �WhilerU rV rW rX rv rl r� r@ r rx r; rp r< � visit_whileh s � �zTreeRebuilder.visit_whileztype[nodes.With]c C s d S rJ r; r r; r; r< r� x s zTreeRebuilder._visit_withztype[nodes.AsyncWith]c C s d S rJ r; r r; r; r< r� } s z type[_WithT]zast.With | ast.AsyncWithr* c st ||j |j|j|j|d�� ddd�� �fdd� ��j|� d�}� j�fdd �|jD �� �fd d �|jD �|d � � S ) Nr� z ast.withitemz tuple[NodeNG, NodeNG | None])ro r0 c s$ �� | j� �}�� | j� �}||fS rJ )rl � context_expr� optional_vars)ro r� �varrp r; r< � visit_child� s z.TreeRebuilder._visit_with.<locals>.visit_childr� c s g | ] }� |��qS r; r; rm )rt r; r< rr � rs z-TreeRebuilder._visit_with.<locals>.<listcomp>c s g | ]}�� |� ��qS r; rk rm rp r; r< rr � rs )r� r@ r� )rU rV rW rX r� rv r� r@ r r; )rq r: rt r< r� � s ��c C s | � tj||�S rJ )r� r �Withrx r; r; r< � visit_with� s zTreeRebuilder.visit_withc C s4 t j|j|j|j|j|d�}|�| �|j|�� |S )z7Visit a Yield node by returning a fresh instance of it.r� ) r �YieldrU rV rW rX rv rl rD r� r; r; r< � visit_yield� s �zTreeRebuilder.visit_yieldc C s4 t j|j|j|j|j|d�}|�| �|j|�� |S r� ) r � YieldFromrU rV rW rX rv rl rD r� r; r; r< �visit_yieldfrom� s �z TreeRebuilder.visit_yieldfromc sJ t j|j|j|j|j|d�� � j��|j� �� �fdd�|j D �d� � S )Nr� c s g | ]}�� |� ��qS r; rk )rn �caserp r; r< rr � rs z-TreeRebuilder.visit_match.<locals>.<listcomp>)�subject�cases) r �MatchrU rV rW rX rv rl r| r} rx r; rp r< � visit_match� s � �zTreeRebuilder.visit_matchc sF t j|d�� � j��|j� ���|j� �� �fdd�|jD �d� � S )Nr� c s g | ]}�� |� ��qS r; rk rm rp r; r< rr � rs z1TreeRebuilder.visit_matchcase.<locals>.<listcomp>)�pattern�guardr@ )r r rv rl r� r� r@ rx r; rp r< �visit_matchcase� s �z TreeRebuilder.visit_matchcasec C s6 t j|j|j|j|j|d�}|j| �|j|�d� |S r� ) r Z MatchValuerU rV rW rX rv rl rD r� r; r; r< �visit_matchvalue� s �z TreeRebuilder.visit_matchvaluec C s t j|j|j|j|j|j|d�S )N)rD rU rV rW rX rQ )r ZMatchSingletonrD rU rV rW rX rx r; r; r< �visit_matchsingleton� s �z"TreeRebuilder.visit_matchsingletonc s> t j|j|j|j|j|d�� � j� �fdd�|jD �d� � S )Nr� c s g | ]}�� |� ��qS r; rk �rn r� rp r; r< rr � rs z5TreeRebuilder.visit_matchsequence.<locals>.<listcomp>��patterns)r Z MatchSequencerU rV rW rX rv r� rx r; rp r< �visit_matchsequence� s ��z!TreeRebuilder.visit_matchsequencec s` t j|j|j|j|j|d�� � j� �fdd�|jD �� �fdd�|jD ��� |� |j �d� � S )Nr� c s g | ]}�� |� ��qS r; rk rm rp r; r< rr rs z4TreeRebuilder.visit_matchmapping.<locals>.<listcomp>c s g | ]}�� |� ��qS r; rk r� rp r; r< rr rs )r� r� �rest) r Z MatchMappingrU rV rW rX rv r� r� r� r� rx r; rp r< �visit_matchmapping� s � �z TreeRebuilder.visit_matchmappingc sb t j|j|j|j|j|d�� � j��|j� �� �fdd�|j D �|j � �fdd�|j D �d� � S )Nr� c s g | ]}�� |� ��qS r; rk r� rp r; r< rr rs z2TreeRebuilder.visit_matchclass.<locals>.<listcomp>c s g | ]}�� |� ��qS r; rk r� rp r; r< rr s )r� r� � kwd_attrs� kwd_patterns) r Z MatchClassrU rV rW rX rv rl r� r� r� r� rx r; rp r< �visit_matchclass s � ��z TreeRebuilder.visit_matchclassc C s8 t j|j|j|j|j|d�}|j| �|||j�d� |S )Nr� rC ) r Z MatchStarrU rV rW rX rv r� r` r� r; r; r< �visit_matchstar! s � z TreeRebuilder.visit_matchstarc C sD t j|j|j|j|j|d�}|j| �|j|�| � |||j �d� |S )Nr� )r� r` ) r ZMatchAsrU rV rW rX rv rl r� r� r` r� r; r; r< � visit_matchas0 s � �zTreeRebuilder.visit_matchasc s> t j|j|j|j|j|d�� � j� �fdd�|jD �d� � S )Nr� c s g | ]}�� |� ��qS r; rk r� rp r; r< rr I rs z/TreeRebuilder.visit_matchor.<locals>.<listcomp>r� )r ZMatchOrrU rV rW rX rv r� rx r; rp r< � visit_matchor@ s ��zTreeRebuilder.visit_matchor)NN)T)_r � __module__� __qualname__�__doc__r= rI rP rd rw r r rl �sys� version_infor� 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# r% r' r* r, r0 r2 r3 r5 r: r< r� r@ rB rE rG rK rM rO rQ rU rX rZ r_ rb rd rg ri rk rn rp r� rv rx rz r r� r� r� r� r� r� r� r� r� r; r; r; r< r+ 4 s � 7 [ � ( :, ' r+ )8r� � __future__r rB r� rZ �collections.abcr r �ior �tokenizer r �typingr r r r r r Zastroidr Z astroid._astr r r Z astroid.constr r Zastroid.managerr Z astroid.nodesr Zastroid.nodes.node_classesr Zastroid.nodes.utilsr Zastroid.typingr r" �__annotations__r# r] r\ r( r r� r) ru r� r* ru r� ZNodesWithDocsTyper+ r; r; r; r< �<module> sF � �
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка