| Şuanki Dizin: /usr/lib64/python3.9/lib2to3/__pycache__/ |
| Şuanki Dosya : //usr/lib64/python3.9/lib2to3/__pycache__/fixer_util.cpython-39.pyc |
a
�DOgf; � @ s� d Z ddlmZ ddlmZmZ ddlmZ ddl m
Z
dd� Z dd � Z d
d � Z
d d
� ZdNdd�Zdd� Zdd� Zdd� Ze � e
� fdd�ZdOdd�Zdd � Zd d � ZdPd d �Zd!d"� ZdQd#d$�ZdRd%d&�Zd'd(� Zd)d*� Z d+d,� Z d-d.� Z d/d0� Z h d1�Z d2d3� Z!d4a"d5a#d6a$d7a%d8d9� Z&d:d;� Z'd<d=� Z(d>d?� Z)d@dA� Z*dBdC� Z+dDdE� Z,dFdG� Z-ej.ej/hZ0dSdHdI�Z1ej/ej.ej2hZ3dJdK� Z4dTdLdM�Z5dS )Uz1Utility functions, node construction macros, etc.� )�token)�Leaf�Node)�python_symbols)�patcompc C s t tj| ttjd�|g�S )N�=)r �syms�argumentr r �EQUAL)�keyword�value� r
�*/usr/lib64/python3.9/lib2to3/fixer_util.py�
KeywordArg s �r c C s t tjd�S )N�()r r �LPARr
r
r
r �LParen s r c C s t tjd�S )N�))r r �RPARr
r
r
r �RParen s r c C sH t | t�s| g} t |t�s&d|_|g}ttj| ttjddd�g | �S )z Build an assignment statement� r ��prefix) �
isinstance�listr r r �atomr r r
)�target�sourcer
r
r �Assign s
�r Nc C s t tj| |d�S )zReturn a NAME leafr )r r �NAME)�namer r
r
r �Name$ s r! c C s | t tjt� |g�gS )zA node tuple for obj.attr)r r �trailer�Dot)�obj�attrr
r
r �Attr( s r& c C s t tjd�S )z A comma leaf�,)r r �COMMAr
r
r
r �Comma, s r) c C s t tjd�S )zA period (.) leaf�.)r r �DOTr
r
r
r r# 0 s r# c C s4 t tj|�� |�� g�}| r0|�dt tj| �� |S )z-A parenthesised argument list, used by Call()r )r r r" �clone� insert_child�arglist)�argsZlparenZrparen�noder
r
r �ArgList4 s r1 c C s& t tj| t|�g�}|dur"||_|S )zA function callN)r r �powerr1 r )� func_namer/ r r0 r
r
r �Call; s r4 c C s t tjd�S )zA newline literal�
�r r �NEWLINEr
r
r
r �NewlineB s r8 c C s t tjd�S )z A blank line� r6 r
r
r
r � BlankLineF s r: c C s t tj| |d�S )Nr )r r �NUMBER)�nr r
r
r �NumberJ s r= c C s" t tjttjd�| ttjd�g�S )z A numeric or string subscript�[�])r r r" r r �LBRACE�RBRACE)Z
index_noder
r
r � SubscriptM s
�rB c C s t tj| |d�S )z
A string leafr )r r �STRING)�stringr r
r
r �StringS s rE c C s� d| _ d|_ d|_ ttjd�}d|_ ttjd�}d|_ ||||g}|rtd|_ ttjd�}d|_ |�ttj||g�� ttj| ttj |�g�}ttj
ttj d�|ttj d�g�S )zuA list comprehension of the form [xp for fp in it if test].
If test is None, the "if test" part is omitted.
r9 r �for�in�ifr> r? )
r r r r �appendr r Zcomp_ifZ listmakerZcomp_forr r@ rA ) Zxp�fp�it�testZfor_leafZin_leafZ
inner_argsZif_leaf�innerr
r
r �ListCompW s(
��rN c C sV |D ] }|� � qttjd�ttj| dd�ttjddd�ttj|�g}ttj|�}|S )zO Return an import statement in the form:
from package import name_leafs�fromr r �import)�remover r r r r �import_as_names� import_from)Z package_nameZ
name_leafsZleaf�children�impr
r
r �
FromImporto s
� rV c C s� |d � � }|jtjkr"|� � }nttj|� � g�}|d }|rNdd� |D �}ttjtt|d �t|d ��ttj|d � � ||d � � g�g | �}| j |_ |S ) zfReturns an import statement and calls a method
of the module:
import module
module.name()r$ �afterc S s g | ] }|� � �qS r
)r, )�.0r< r
r
r �
<listcomp>� � z!ImportAndCall.<locals>.<listcomp>� r ZlparZrpar)
r, �typer r. r r2 r& r! r" r )r0 �results�namesr$ Z
newarglistrW �newr
r
r �
ImportAndCall� s*
�����r` c C s� t | t�r | jt� t� gkr dS t | t�o�t| j�dko�t | jd t�o�t | jd t�o�t | jd t�o�| jd jdko�| jd jdkS )z(Does the node represent a tuple literal?T� r[ r � r r )r r rT r r �lenr r �r0 r
r
r �is_tuple� s
������re c C sX t | t�oVt| j�dkoVt | jd t�oVt | jd t�oV| jd jdkoV| jd jdkS )z'Does the node represent a list literal?r r[ ���r> r? )r r rc rT r r rd r
r
r �is_list� s
�����rg c C s t tjt� | t� g�S �N)r r r r r rd r
r
r � parenthesize� s ri >
�sum�max�set�sorted�min�tupler �any� enumerate�allc c s$ t | |�}|r |V t ||�}q
dS )al Follow an attribute chain.
If you have a chain of objects where a.foo -> b, b.foo-> c, etc,
use this to iterate over all objects in the chain. Iteration is
terminated by getattr(x, attr) is None.
Args:
obj: the starting object
attr: the name of the chaining attribute
Yields:
Each successive object in the chain.
N)�getattr)r$ r% �nextr
r
r �
attr_chain� s
ru zefor_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
z�
power<
( 'iter' | 'list' | 'tuple' | 'sorted' | 'set' | 'sum' |
'any' | 'all' | 'enumerate' | (any* trailer< '.' 'join' >) )
trailer< '(' node=any ')' >
any*
>
z`
power<
( 'sorted' | 'enumerate' )
trailer< '(' arglist<node=any any*> ')' >
any*
>
Fc C sp t s&t�t�at�t�at�t�ada tttg}t|t| d��D ]*\}}i }|�||�r@|d | u r@ dS q@dS )a Returns true if node is in an environment where all that is required
of it is being iterable (ie, it doesn't matter if it returns a list
or an iterator).
See test_map_nochange in test_fixers.py for some examples and tests.
T�parentr0 F) �
pats_builtr �compile_pattern�p0�p1�p2�zipru �match)r0 �patterns�patternrv r] r
r
r �in_special_context� s
r� c C s� | j }|dur |jtjkr dS | j}|jtjtjfv r:dS |jtjkrX|j d | u rXdS |jtj
ks�|jtj kr�|dur�|jtj ks�|j d | u r�dS dS )zG
Check that something isn't an attribute or function name etc.
NFr[ T)
Z prev_siblingr\ r r+ rv r �funcdef�classdef� expr_stmtrT �
parametersZ
typedargslistr( )r0 �prevrv r
r
r �is_probably_builtin� s&
��
� �r� c C sJ | durF| j tjkr>t| j�dkr>| jd }|j tjkr>|jS | j} q dS )z Find the indentation of *node*.Nrb r r9 ) r\ r �suiterc rT r �INDENTr rv )r0 �indentr
r
r �find_indentation s
r� c C s> | j tjkr| S | �� } | jd }| _ttj| g�}||_|S rh )r\ r r� r, rv r )r0 rv r� r
r
r �
make_suite s r� c C s$ | j tjkr | j} | s td��q | S )z Find the top level namespace.z,root found before file_input node was found.)r\ r Z
file_inputrv �
ValueErrorrd r
r
r � find_root& s
r� c C s t |t|�| �}t|�S )z� Returns true if name is imported from package at the
top level of the tree which node belongs to.
To cover the case of an import like 'import foo', use
None for the package and 'foo' for the name. )� find_bindingr� �bool)�packager r0 Zbindingr
r
r �does_tree_import/ s r� c C s | j tjtjfv S )z0Returns true if the node is an import statement.)r\ r � import_namerS rd r
r
r � is_import7 s r� c C s. dd� }t |�}t| ||�r dS d }}t|j�D ]F\}}||�sDq2t|j|d� �D ]\}}||�sV qlqV|| } qzq2|dkr�t|j�D ]8\}}|jtjkr�|jr�|jd jtjkr�|d } q�q�| du r�t tj
t tj d�t tj |dd�g�} nt
| t tj |dd�g�} | t� g}
|�|t tj|
�� dS ) z\ Works like `does_tree_import` but adds an import statement
if it was not imported. c S s | j tjko | jo t| jd �S )Nr[ )r\ r � simple_stmtrT r� rd r
r
r �is_import_stmt> s �z$touch_import.<locals>.is_import_stmtNr[ r rP r r )r� r� rq rT r\ r r� r rC r r� r r rV r8 r- ) r� r r0 r� �rootZ
insert_pos�offset�idxZnode2�import_rT r
r
r � touch_import; s8 �
�
r� c C s� |j D �]�}d}|jtjkrVt| |j d �r4| S t| t|j d �|�}|rR|}�n0|jtjtjfv r�t| t|j d �|�}|r�|}� n�|jtj k�rt| t|j d �|�}|r�|}nTt
|j dd� �D ]@\}}|jt j kr�|j
dkr�t| t|j |d �|�}|r�|}q�nx|jtv �r2|j d j
| k�r2|}nTt|| |��rF|}n@|jtjk�rbt| ||�}n$|jtjk�r�t| |j d ��r�|}|r|�s�| S t|�r| S qdS ) z� Returns the node which binds variable name, otherwise None.
If optional argument package is supplied, only imports will
be returned.
See test cases for examples.Nr rf rb ra �:� r[ )rT r\ r Zfor_stmt�_findr� r� Zif_stmtZ
while_stmtZtry_stmtrq r �COLONr � _def_syms�_is_import_bindingr� r� r� )r r0 r� �child�retr< �iZkidr
r
r r� i sB
r� c C sT |g}|rP|� � }|jdkr4|jtvr4|�|j� q|jtjkr|j| kr|S qd S )N� )�popr\ � _block_syms�extendrT r r r )r r0 Znodesr
r
r r� � s r� c C s� | j tjkr�|s�| jd }|j tjkrx|jD ]H}|j tjkrV|jd j|krt| S q,|j tjkr,|j|kr,| S q,nL|j tjkr�|jd }|j tjkr�|j|kr�| S n|j tjkr�|j|kr�| S n�| j tj k�r�|r�t
| jd �� � |kr�dS | jd }|�rt d|��rdS |j tj
k�r0t ||��r0| S |j tjk�rh|jd }|j tjk�r�|j|k�r�| S n6|j tjk�r�|j|k�r�| S |�r�|j tjk�r�| S dS )z� Will return node if node will import name, or node
will import * from package. None is returned otherwise.
See test cases for examples. r rb rf Nra �as)r\ r r� rT Zdotted_as_namesZdotted_as_namer r r rS �str�stripr� rR Zimport_as_name�STAR)r0 r r� rU r� �lastr< r
r
r r� � s@
r� )N)NN)N)N)N)N)N)6�__doc__Zpgen2r Zpytreer r Zpygramr r r9 r r r r r r! r& r) r# r1 r4 r8 r: r= rB rE rN rV r` re rg ri Zconsuming_callsru ry rz r{ rw r� r� r� r� r� r� r� r� r� r� r� r� r" r� r� r� r
r
r
r �<module> sX
-
*
Linux 65-254-81-4.cprapid.com 5.14.0-284.11.1.el9_2.x86_64 #1 SMP PREEMPT_DYNAMIC Tue May 9 05:49:00 EDT 2023 x86_64
Apache
65.254.81.4