/opt/alt/python311/lib64/python3.11/lib2to3/__pycache__
Edit: /opt/alt/python311/lib64/python3.11/lib2to3/__pycache__/fixer_util.cpython-311.opt-1.pyc (22381B)
idD=./ 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. ej2 hZ3d+ Z4d-d,Z5d
S )/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 9/opt/alt/python311/lib64/python3.11/lib2to3/fixer_util.py
KeywordArgr s.
$u{C00%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% su fd # # fd # #
$u{C<<<==F H H Hr Nc : t t j | | S )zReturn a NAME leafr )r r NAME)namer s r Namer) $ s
D 0 0 00r c V | t t j t |g gS )zA node tuple for obj.attr)r r
trailerDot)objattrs r Attrr/ ( s! dlSUUDM22 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 | | g }| r.| dt t j | |S )z-A parenthesised argument list, used by Call()r )r r
r+ clone insert_childarglist)argslparenrparennodes r ArgListr? 4 sW v||~~v||~~ > ? ?D 7 !T$, 5 5666 Kr c j t t j | t | g }|||_ |S )zA function call)r r
powerr? r ) func_namer; r r> s r CallrC ; s0
Y
6 7 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 s= tEL# 6 6 ) #EL# 6 6 8 9 9 9r c : t t j | | S )z
A string leafr )r r STRING)stringr s r StringrZ S s fV 4 4 44r c p d| _ d|_ d|_ t t j d }d|_ t t j d }d|_ ||||g}|rWd|_ t t j d }d|_ | 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
BIBIBIEJ&&HHO5:t$$GGNB,J ? uz4(( $t|gt_==>>> "d4=*&E&E!F G GE U\3// U\3//1 2 2 2r c @ |D ]}| 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 s
UZ((UZ c:::UZ#666T):668H t
*
*C Jr c l |d }|j t j k r| }n-t t j | g }|d }|r d |D }t t j t
t |d t |d t t j |d ||d g gz |z }| j |_ |S )zfReturns an import statement and calls a method
of the module:
import module
module.name()r- afterc 6 g | ]}| S r )r8 ).0rN s r
z!ImportAndCall.. s ***q***r r lparrpar)
r8 typer
r: r rA r/ r) r+ r )r> resultsnamesr-
newarglistrz news r
ImportAndCallr s %.
C
x4< YY[[
$,
66
G E +**E***
tzDqNNDqNN33T\ fo++-- fo++--/0 0 11 49 9 : :C CJ Jr c t | t r'| j t t gk rdS t | t ot | j dk ot | j d t okt | j d t oKt | j d t o+| j d j dk o| 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 $ $-FHHfhh3G"G"Gt tT " "
.DM""a'
.4=+T22
. 4=+T22
. 4=+T22
.
a &#-
.
a &#-
/r c 4 t | t ot | j dk okt | j d t oKt | j d t o+| j d j dk o| 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 " "
/DM""Q&
/4=+T22
/ 4=,d33
/
a &#-
/
b!'3. 0r c l t t j t | t g S N)r r
r" r r r s r parenthesizer s# FHHdFHH5 6 66r >
allanymaxminsetsumr! tuplesorted enumeratec # ^ K t | | }|r|V t || }|dS 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. nexts r
attr_chainr sU 3 D
#
tT"" # # # # #r 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 h t sMt j t at j t at j t
ada t t t
g}t
|t | d D ]*\ }}i }| || r
|d | u r dS +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.
Tparentr> F)
pats_builtr compile_patternp0p1p2zipr match)r> patternspatternr r s r in_special_contextr s
$R
(
(
$R
(
(
$R
(
(
B|H xD()C)CDD == ) ) gfo.E.E44 5r c | j }||j t j k rdS | j }|j t
j t
j fv rdS |j t
j k r|j d | u rdS |j t
j
k s;|j t
j k r(||j t j k s|j d | u rdS dS )zG
Check that something isn't an attribute or function name etc.
NFr~ T)
prev_siblingr r r6 r r
funcdefclassdef expr_stmtrv
parameters
typedargslistr2 )r> prevr s r is_probably_builtinr s D DI 2 2u
[F
{t|T]333u
{dn$$ );t)C)Cu
{do%%
[D .
.
.
$)u{":": OA $ & & u 4r c | _| j t j k rAt | j dk r)| j d }|j t
j k r|j S | j } | _dS )z Find the indentation of *node*.Nr r rJ ) r r
suiter rv r INDENTr r )r> indents r find_indentationr sd
9
" "s4='9'9A'='=]1%F{el** |#{
2r c | j t j k r| S | } | j d c}| _ t t j | g }||_ |S r )r r
r r8 r r )r> r r s r
make_suiter sR yDJ ::< bindings r does_tree_importr / s'
44 '::G ==r c @ | 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 9)4+;< <.is_import_stmt> s4 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 ; s - - - T??Dt,, J t}-- T ~d## &t}STT': ; ; MFE!>%((
6\
Q"4=11 IC T ---$--}Q $ 44 1W
t' X & & T# . . .*
WtEJS'I'I'I&JKK#Hj$t'7"B"BCCCCCr c
P |j D ] }d}|j t j k rNt | |j d r|c S t | t
|j d | }|r|}n|j t j t j fv r/t | t
|j d | }|r|}nK|j t j k rt | t
|j d | }|r|}nt |j dd D ]U\ }}|j t j k r;|j
dk r0t | t
|j |dz | }|r|}Vn|j t v r|j d j
| k r|}nmt || | r|}nY|j t j k rt | || }n2|j t j k r t | |j d r|}|r|s|c S t% | r|c S dS ) 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 s3
" " : & &T5>!,--
T:enR.@#A#A7KKAM#
ZDL$/:
:
: T:enR.@#A#A7KKAM#
Z4=
(
( T:enQ.?#@#@'JJA
& 'qrr(: ; ; & &FAsx5;..393C3C (z%.1:M/N/NPW X X
Ac &
Z9
$
$ ):)@D)H)HCC
tW
5
5 CC
Z4+
+
+ tUG44CC
Z4>
)
)T5>!,--
~~
4r c |g}|rl| }|j dk r)|j t vr| |j n"|j t
j k r
|j | k r|S |ld S )N )popr _block_symsextendrv r r' r )r( r> nodess r r r s}
FE
yy{{ 9s??ty ; ; LL ' ' ' '
Y%*
$
$t););K 4r c . | j t j k r|s| j d }|j t j k r`|j D ]V}|j t j k r|j d j |k r| c S 2|j t j k r|j |k r| c S Wn{|j t j k r1|j d }|j t j k r
|j |k r| S n5|j t j k r
|j |k r| S n| j t j k r|r2t | j d |k rdS | j d }|rt d| rdS |j t j
k rt || r| S |j t j k r0|j d }|j t j k r
|j |k r| S n;|j t j k r
|j |k r| S |r|j t j k 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 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
yD$$$W$mA 8t+ + +
:!444 ~a(.$66 # 7Z5:--%+2E2E KKK
X,
,
,<#DyEJ&&4:+=+=
X
#
# T(9(9K
d& & & s4=+,,2244??4 M! uT1~~ 4
Vt+
+
+dA
+K
Vt*
*
*JqMEzUZ''EK4,?,?
Vuz
!
!agooK
5:--K 4r 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 7 * * * * * * : : :! ! !! ! ! H H H1 1 1 14 4 4" " " &&(( % % %# # #0 0 0 09 9 9 5 5 5 52 2 2 20 & 8
/
/
/0 0 0 7 7 7. . .# # #&
& . = = =*D *D *DZ ]DL ) ( ( ( (T |T]DL9 ' ' ' ' ' 'r