cjf; d Z ddlmZ ddlmZmZ ddlmZ ddl m
Z
d Z d Z d Z
d Zd-d Zd Zd
Zd Z e e
fdZd.dZd Zd Zd-dZd Zd-dZd-dZd Zd Z d Z d Z d Z h d Z d Z!d a"d a#d a$d!a%d" Z&d# Z'd$ Z(d% Z)d& Z*d' Z+d( Z,d) Z-ej\ ej^ hZ0d-d*Z1ej^ ej\ ejd hZ3d+ Z4d-d,Z5y
)/z1Utility functions, node construction macros, etc. )token)LeafNode)python_symbols)patcompc l t t j | t t j
d |g S )N=)r symsargumentr r EQUAL)keywordvalues +/usr/lib64/python3.12/lib2to3/fixer_util.py
KeywordArgr s*
$u{{C0%8 : : c 6 t t j d S )N()r r LPAR r r LParenr
C r c 6 t t j d S )N))r r RPARr r r RParenr r r c t | t s| g} t |t s
d|_ |g}t t j
| t
t j dd gz |z S )z Build an assignment statement r prefix)
isinstancelistr r r
atomr r r )targetsources r Assignr% s] fd # fd #
$u{{C<==F H Hr Nc : t t j | | S )zReturn a NAME leafr )r r NAME)namer s r Namer) $ s
D 00r c N | t t j t |g gS )zA node tuple for obj.attr)r r
trailerDot)objattrs r Attrr/ ( s dllSUDM2 33r c 6 t t j d S )z A comma leaf,)r r COMMAr r r Commar3 , s S !!r c 6 t t j d S )zA period (.) leaf.)r r DOTr r r r, r, 0 s 3 r c t t j |j |j g }| r*|j dt t j
| |S )z-A parenthesised argument list, used by Call()r )r r
r+ clone insert_childarglist)argslparenrparennodes r ArgListr? 4 sF v||~v||~ > ?D !T$,, 56 Kr c b t t j | t | g }|||_ |S )zA function call)r r
powerr? r ) func_namer; r r> s r CallrC ; s-
Y
6 7D
Kr c 6 t t j d S )zA newline literal
r r NEWLINEr r r NewlinerH B s
t $$r c 6 t t j d S )z A blank line rF r r r BlankLinerK F s
r ""r c : t t j | | S )Nr )r r NUMBER)nr s r NumberrO J s a //r c t t j t t j
d | t t j d g S )z A numeric or string subscript[])r r
r+ r r LBRACERBRACE)
index_nodes r SubscriptrV M s8 tELL# 6 ) #ELL# 6 8 9 9r c : t t j | | S )z
A string leafr )r r STRING)stringr s r StringrZ S s fV 44r c h d| _ d|_ d|_ t t j d }d|_ t t j d }d|_ ||||g}|rSd|_ t t j d }d|_ |j t t j ||g t t j | t t j | g }t t j t t j d |t t j 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.
rJ r forinifrQ rR )
r r r r' appendr r
comp_if listmakercomp_forr" rS rT ) xpfpittestfor_leafin_leaf
inner_argsif_leafinners r ListComprl W s
BIBIBIEJJ&HHO5::t$GGNB,J uzz4( $t||gt_=> "d4==*&E!F GE U\\3/ U\\3/1 2 2r c < |D ] }|j t t j d t t j | d t t j dd t t
j | g}t t
j | }|S )zO Return an import statement in the form:
from package import name_leafsfromr r import)remover r r' r r
import_as_names import_from) package_name
name_leafsleafchildrenimps r
FromImportrx o sw
UZZ(UZZ c:UZZ#6T)):68H t
*C Jr c N |d j }|j t j k( r|j }n)t t j |j g }|d }|r |D cg c] }|j }}t t j
t
t |d t |d t t j |d j ||d j g gz |z }| j |_ |S c c}w )zfReturns an import statement and calls a method
of the module:
import module
module.name()r- after r lparrpar)
r8 typer
r: r rA r/ r) r+ r )r> resultsnamesr-
newarglistrz rN news r
ImportAndCallr s %.
C
xx4<< YY[
$,,
6
G E $)*EqE*
tzzDqNDqN3T\\ fo++- fo++-/0 11 49 9 :C CJ J +s 6D"c t | t r"| j t t gk( ryt | t xr t | j dk( xr t | j d t xrx t | j d t xrY t | j d t xr: | j d j dk( xr | j d j dk( S )z(Does the node represent a tuple literal?T r{ r r r )r r rv r r lenr r r> s r is_tupler s $ $--FHfh3G"G tT "
.DMM"a'
.4==+T2
. 4==+T2
. 4==+T2
.
a &&#-
.
a &&#-
/r c J t | t xr t | j dkD xrx t | j d t xrY t | j d t xr: | j d j
dk( xr | j d j
dk( S )z'Does the node represent a list literal?r r{ rQ rR )r r r rv r r r s r is_listr s tT "
/DMM"Q&
/4==+T2
/ 4==,d3
/
a &&#-
/
b!''3. 0r c \ t t j t | t g S N)r r
r" r r r s r parenthesizer s FHdFH5 66r >
allanymaxminsetsumr! tuplesorted enumeratec # P K t | | }|r| t || }|ryyw)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. nexts r
attr_chainr s- 3 D
tT" s !&&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 ')' >
any*
>
Fc D t sMt j t at j t at j t
ada t t t
g}t
|t | d D ]# \ }}i }|j || s|d | u s# y y)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.
Tparentr> F)
pats_builtr compile_patternp0p1p2zipr match)r> patternspatternr r s r in_special_contextr s
$
$R
(
$
$R
(
$
$R
(
B|H xD()CD == )gfo.E E r c | j }| |j t j k( ry| j }|j t
j t
j fv ry|j t
j k( r|j d | u ry|j t
j k( sM|j t
j k( r1| |j t j k( s|j d | u ryy)zG
Check that something isn't an attribute or function name etc.
Fr{ T)
prev_siblingr~ r r6 r r
funcdefclassdef expr_stmtrv
parameters
typedargslistr2 )r> prevr s r is_probably_builtinr s D DII 2
[[F
{{t||T]]33
{{dnn$ );t)C
{{doo%
[[D . .
.
$))u{{": OOA $ & r c | || j t j k( rPt | j dkD r8| j d }|j t
j k( r |j S | j } | |y)z Find the indentation of *node*.r r rJ ) r~ r
suiter rv r INDENTr r )r> indents r find_indentationr sf
99
"s4=='9A'=]]1%F{{ell* ||#{{
r c | j t j k( r| S | j } | j d c}| _ t t j | g }||_ |S r )r~ r
r r8 r r )r> r r s r
make_suiter sR yyDJJ :: bindings r does_tree_importr / s
44 ':G =r c Z | j t j t j fv S )z0Returns true if the node is an import statement.)r~ r
import_namerr r s r is_importr 7 s" 99))4+;+;< < \ }} || st |j |d D ] \ }} || r n ||z } n |dk( ryt |j D ]a \ }}|j t
j k( s$|j s1|j d j t j k( s\|dz } n | Ot t
j t t j d t t j |d g } n't | t t j |d g } | t g}
|j |t t
j |
y)z\ Works like `does_tree_import` but adds an import statement
if it was not imported. c | j t j k( xr& | j xr t | j d S )Nr{ )r~ r
simple_stmtrv r r s r is_import_stmtz$touch_import..is_import_stmt> s: T - -- ,$-- ,$--*+ -r Nr{ r ro r r )r r r rv r~ r
r r rX r r r r' rx rH r9 ) r r( r> r root
insert_posoffsetidxnode2import_rv s r touch_importr ; sh - T?Dt, J t}}- T d# &t}}ST': ;MFE!%( < 6\
. Q"4==1IC T - --$--}}Q $$ 4 1W
2 t'' X & T# .*
WtEJJS'I&JK#Hj$t'7'7"BCr c
|j D ]< }d}|j t j k( rGt | |j d r|c S t | t
|j d | }|r|}n|j t j t j fv r*t | t
|j d | }|rh|}nd|j t j k( rt | t
|j d | }|r|}n t |j dd D ]^ \ }}|j t j k( s$|j dk( s4t | t
|j |dz | }|s]|}` n|j t v r |j d j | k( r|}nst || | r|}nc|j t j k( rt | || }n8|j t j" k( rt | |j d r|}|s(|s|c S t% | s;|c S y) 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 r r r : r{ )rv r~ r
for_stmt_findr r if_stmt
while_stmttry_stmtr r COLONr _def_syms_is_import_bindingr r r )r( r> r childretrN ikids r r r i s
:: &T5>>!,- T:ennR.@#A7KA#
ZZDLL$//:
: T:ennR.@#A7KA#
ZZ4==
( T:ennQ.?#@'JA 'qr(: ;FAsxx5;;.3993C (z%..1:M/NPW X Ac <
ZZ9
$ ):)@)@D)HC
tW
5C
ZZ4++
+ tUG4C
ZZ4>>
)T5>>!,-
~
E F r c
|g}|r~|j }|j dkD r.|j t vr |j |j n.|j t
j k( r|j | k( r|S |r~y )N )popr~ _block_symsextendrv r r' r )r( r> nodess r r r sg
FE
yy{ 99s?tyy ; LL '
YY%**
$t);K r c , | j t j k( r9|s6| j d }|j t j k( r|j D ]q }|j t j
k( r!|j d j |k( s=| c S |j t j k( s_|j |k( so| c S y|j t j
k( r=|j d }|j t j k( r?|j |k( r0| S |j t j k( r|j |k( r| S y| j t j k( r |r*t | j d j |k7 ry| j d }|r
t d| ry|j t j k( rt || r| S |j t j k( r>|j d }|j t j k( r|j |k( r| S y|j t j k( r|j |k( r| S |r |j t j k( r| S y)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 r r Nr as)r~ r
r rv dotted_as_namesdotted_as_namer r r' rr strstripr rq import_as_nameSTAR)r> r( r rw r lastrN s r r r s
yyD$$$WmmA 88t++ + ::!4!44 ~~a(..$6 # ZZ5::-%++2E K &> 3 XX,,
,<<#DyyEJJ&4::+=
XX
# T(9K( '
d&& & s4==+,224? MM! uT1~
VVt++
+dAK
VVt**
*JJqMEzzUZZ'EKK4,?
VVuzz
!aggoK
5::-K r r )NN)6__doc__pgen2r pytreer r pygramr r
rJ r r r r r% r) r/ r3 r, r? rC rH rK rO rV rZ rl rx r r r r consuming_callsr r r r r r r r r r r r r r r r r r+ r r r r r r r s 7 * :!! H14" &( %#09 520&8
/0 7.#&
&. =*DZ ]]DLL ) (T ||T]]DLL9 'r