֦i d Z ddlZddlZddl ddlmZmZ ddlmZm Z m
Z
dPddddZ d Z dQdd
d Z
d Zd
ZdRdZd Zd ZdSdZ ej( d ZdTdZd ZdddZd Z G d de Z G d d e Z d Z d Z e e d s(d Z!d! Z"d" Z#d# Z$ e%e!e" e _& e%e#e$ e _' G d$ d%e( Z)d& Z* G d' d(e e)) Z+ G d* d+e e)) Z, G d, d-e e)) Z- G d. d/e e)) Z. G d0 d1e e)) Z/e/Z0e+e1e2e3fe,e4fe-e5fe. e(d e6fe/ e(d2 fiZ7e+e6fiZ8e6d/ e(d d/e1d(e2d(e3d(e4d+e5d- e(d2 d1iZ9 G d3 d4e: Z; G d5 d6e; Z< G d7 d8e; Z= e e>d9 sd: Z?d; Z@ e%e?e@ e>_A G d< d=eB ZC G d> d?eD ZE G d@ dAeD ZF G dB dCeD ZGdD eHej j dz z ZK e
e G dE dF ZLdGZMdHZNg eMeNZO G dI dJe ZPdK ZQdLD ci c] } | eR j | c} ZTdM ZUdN ZVeWdOk( r eV yyc c} w )UaH
ast
~~~
The `ast` module helps Python applications to process trees of the Python
abstract syntax grammar. The abstract syntax itself might change with
each Python release; this module helps to find out programmatically what
the current grammar looks like and allows modifications of it.
An abstract syntax tree can be generated by passing `ast.PyCF_ONLY_AST` as
a flag to the `compile()` builtin function or by using the `parse()`
function from this module. The result will be a tree of objects whose
classes all inherit from `ast.AST`.
A modified abstract syntax tree can be compiled into a Python code object
using the built-in `compile()` function.
Additionally various helper functions are provided that make working with
the trees simpler. The main intention of the helper functions and this
module in general is to provide an easy to use interface for libraries
that work tightly with the python syntax (template engines for example).
:copyright: Copyright 2008 by Armin Ronacher.
:license: Python License.
N)*)contextmanager nullcontext)IntEnumauto _simple_enumF)
type_commentsfeature_versionc t }|r |t z }|d}n*t |t r|\ }}|dk7 rt d| |}t | |||| S )z
Parse the source into an AST node.
Equivalent to compile(source, filename, mode, PyCF_ONLY_AST).
Pass type_comments=True to get back type comments where the syntax allows.
zUnsupported major version: )_feature_version)
PyCF_ONLY_ASTPyCF_TYPE_COMMENTS
isinstancetuple
ValueErrorcompile)sourcefilenamemoder r
flagsmajorminors /usr/lib64/python3.12/ast.pyparser " sl
E
## OU +& u A: :5' BC C 68T5$3 5 5 c t | t r t | j d d } t | t r | j
} d fdfdfd | S )aT
Evaluate an expression node or a string containing only a Python
expression. The string or node provided may only consist of the following
Python literal structures: strings, bytes, numbers, tuples, lists, dicts,
sets, booleans, and None.
Caution: A complex expression can overflow the C stack and cause a crash.
z evalr c V d}t | dd x}r|d| z
}t |d| z )Nzmalformed node or stringlinenoz on line : )getattrr )nodemsglnos r _raise_malformed_nodez+literal_eval.._raise_malformed_nodeE sB ($$/ /3 / Yse$ $CD8},--r c t | t r&t | j t t
t fvr | | j S N)r Constanttypevalueintfloatcomplex)r% r( s r _convert_numz"literal_eval.._convert_numJ s7 $)T$**-=c5RYEZ-Z !$ 'zzr c t | t rRt | j t t f r2 | j
}t | j t r|S | S | S r* )r UnaryOpopUAddUSuboperand)r% r7 r1 s r _convert_signed_numz)literal_eval.._convert_signed_numN sU dG $DGGdD\)J"4<<0G$''4( y y D!!r c | t | t r | j S t | t r t t | j S t | t r t t | j S t | t r t t | j S t | t r]t | j t rC| j j dk( r*| j | j cxk( rg k( r t S t | t" rpt% | j& t% | j( k7 r | t+ t- t | j& t | j( S t | t. rt | j0 t2 t4 f rn | j6 } | j8 }t |t: t< f r4t |t> r$t | j0 t2 r||z S ||z
S | S )Nset) r r+ r- Tupler mapeltsListlistSetr: CallfuncNameidargskeywordsDictlenkeysvaluesdictzipBinOpr4 AddSubleftrightr. r/ r0 )r% rP rQ _convertr1 r8 r( s r rR z literal_eval.._convertV s dH %::
e
$Xtyy12 2
d
#Hdii01 1
c
"s8TYY/0 0t$DIIt)Diille# T]](Hb(H5L )I
d
#499~T[[!11%d+C$)) 4 $++ 68 9
9
e
$DGGc3Z)H&tyy1D ,E$e -*UG2L dggs+ %<' %<'"4((r )r strr lstrip
Expressionbody)node_or_stringrR r1 r8 r( s @@@@r literal_evalrX 8 s\ .#& ~ 4 4U ;&I.*-',,.
")4 N ##r )indentc dfd t | t s"t d| j j z t t
sdz | d S )a
Return a formatted dump of the tree in node. This is mainly useful for
debugging purposes. If annotate_fields is true (by default),
the returned string will show the names and the values for fields.
If annotate_fields is false, the result string will be more compact by
omitting unambiguous field names. Attributes such as line
numbers and column offsets are not dumped by default. If this is wanted,
include_attributes can be set to true. If indent is a non-negative
integer or string, then the tree will be pretty-printed with that indent
level. None (the default) selects the single line representation.
r c dz
dz z }dz z }nd}d}t | t rNt | }g }d} }| j D ]] } t | | } | t ||d d}" | \ } }
|xr |
}|r|j
|d| M|j
| _
rb| j rV| j D ]G } t | | } | t ||d | \ } }
|xr |
}|j
|d| I |rz(dump.._format.. s /Sd50A!0Dds ])r ASTr, _fieldsr$ AttributeErrorappend _attributesrH __class____name__joinr? repr)r% rj prefixsepclsrE allsimplerF namer- simpleri annotate_fieldsinclude_attributesrY s ` r ri zdump.._format s
QJEFUN*F&5.(CFC dC t*CD I&H #D$ /E =WS$%<%D #H 'u 5
v % 0& KK4 78KK& % "d&6&6 , ,D! 'd 3 }dC)@)H $+E5$9ME6 ) 4fIKK4 78 - SY!^#'>>#:#:DIIdOLRVhVV!% !8!8&#((4.QSXX X
d
#! %sxx/Sd/S'STV[[ [Dz4 = & #H * ! !s$ G G GG G G zexpected AST, got %r )r )r rm TypeErrorrr rs rS )r% r| r} rY ri s ```@r dumpr s s\ . . ` dC . 1H1HHII
*VS"9v 4= r c dD ][ }||j v s|| j v s!t ||d }| t || s=|j d sOt | || ] | S )z
Copy source location (`lineno`, `col_offset`, `end_lineno`, and `end_col_offset`
attributes) from *old_node* to *new_node* if possible, and return *new_node*.
)r"
col_offset
end_linenoend_col_offsetNend_)rq r$ hasattr
startswithsetattr)new_nodeold_nodeattrr- s r
copy_locationr si
G 8'' 'DH4H4H,HHdD1E $'DOOF,C$. G Or c * fd | dddd | S )a{
When you compile a node tree with compile(), the compiler expects lineno and
col_offset attributes for every node that supports them. This is rather
tedious to fill in for generated nodes, so this helper adds these attributes
recursively where not already set, by setting them to the values of the
parent node. It works recursively starting at *node*.
c d| j v r t | d s|| _ n | j }d| j v r!t | dd || _ n | j }d| j v r t | d s|| _ n | j
}d| j v r!t | dd || _ n | j }t | D ] } ||||| y )Nr" r r r )rq r r" r$ r r r iter_child_nodes)r% r" r r r child_fixs r r z#fix_missing_locations.._fix s t'' '4* $ 4++ +t\408", !__
4++ +4 .", !__
t / / /t -t4<&4#!%!4!4%d+E
J G ,r r\ r rf )r% r s @r fix_missing_locationsr s H. q!Q Kr r\ c
t | D ]t }t |t rt |dd |z |_ )d|j
v rt |dd |z |_ d|j
v s[t |dd x}k||z |_ v | S )z
Increment the line number and end line number of each node in the tree
starting at *node* by *n*. This is useful to "move code" to a different
location in a file.
r" r r )walkr
TypeIgnorer$ r" rq r )r% nr r s r increment_linenor s d eZ ("5(A6:EL u(( ("5(A6:EL E - - - &ulA >>K )A~E Kr c # n K | j D ] } |t | | f y# t $ r Y "w xY ww)zs
Yield a tuple of ``(fieldname, value)`` for each field in ``node._fields``
that is present on *node*.
N)rn r$ ro )r% fields r iter_fieldsr s@
u-- - s 5&5 2525c # K t | D ]G \ }}t |t r| t |t s,|D ] }t |t s| I yw)z
Yield all direct child nodes of *node*, that is, all fields that are nodes
and all items of fields that are lists of nodes.
N)r r rm r? )r% rz r items r r r
sM
#4( e eS !K
t
$ dC( J )s 7AA Ac t | t t t t f s"t d| j j z | j r t | j d t sy| j d j } t | t r't | j t r
| j }ny|rddl
}|j | }|S )aC
Return the docstring for the given node or None if no docstring can
be found. If the node provided does not have docstrings a TypeError
will be raised.
If *clean* is `True`, all tabs are expanded to spaces and any whitespace
that can be uniformly removed from the second line onwards is removed.
z%r can't have docstringsr N)r AsyncFunctionDef FunctionDefClassDefModuler rr rs rV Exprr- r+ rS inspectcleandoc)r% cleantextr s r
get_docstringr s d -{Hf M N2T^^5L5LLMM 99DIIaL$7 99Q< D$!jS&Azz % Kr z(.*?(?:\r\n|\n|\r|$))c g }t t j | d D ]# \ }}|||kD r |S |j |d % |S )z}Split a string into lines ignoring form feed and other chars.
This mimics how the Python parser splits source code.
r\ r ) enumerate
_line_patternfinditerrp )r maxlineslinesr" matchs r _splitlines_no_ffr 4 sX
E"=#9#9&#A1E
FX$5 L U1X F Lr c 6 d}| D ] }|dv r||z
}
|dz
} |S )z6Replace all chars except '\f\t' in a line with spaces.r^ z r~ rf )r resultcs r _pad_whitespacer A s1
F
; aKF cMF
Mr )paddedc |j |j y|j dz
}|j dz
}|j }|j }t | |dz }||k( r$|| j
|| j S |r.t || j
d| j }nd}||| j
|d j z } || j
d| j }
||dz | }|j d| |j |
dj | S # t $ r Y yw xY w)aB Get source code segment of the *source* that generated *node*.
If some location information (`lineno`, `end_lineno`, `col_offset`,
or `end_col_offset`) is missing, return None.
If *padded* is `True`, the first line of a multi-line statement will
be padded with spaces to match its original position.
Nr\ )r r^ r ) r r r" r ro r encodedecoder insertrp rt ) r r% r r" r r r r paddingfirstlasts r get_source_segmentr L sP ?? "d&9&9&Aq __q(
__
,,
fz!| % s E 6E EEc # K ddl m} || g }|r2|j } |j t | | |r1yyw)z
Recursively yield all descendant nodes in the tree starting at *node*
(including *node* itself), in no specified order. This is useful if you
only want to modify nodes in place and don't care about the context.
r )dequeN) collectionsr popleftextendr )r% r todos r r r q s@ " $=D
||~ $T*+
s AAAc " e Zd ZdZd Zd Zd Zy) NodeVisitora<
A node visitor base class that walks the abstract syntax tree and calls a
visitor function for every node found. This function may return a value
which is forwarded by the `visit` method.
This class is meant to be subclassed, with the subclass adding visitor
methods.
Per default the visitor functions for the nodes are ``'visit_'`` +
class name of the node. So a `TryFinally` node visit function would
be `visit_TryFinally`. This behavior can be changed by overriding
the `visit` method. If no visitor function exists for a node
(return value `None`) the `generic_visit` visitor is used instead.
Don't use the `NodeVisitor` if you want to apply changes to nodes during
traversing. For this a special visitor exists (`NodeTransformer`) that
allows modifications.
c r d|j j z }t | || j } || S )z
Visit a node.visit_)rr rs r$
generic_visit)selfr% methodvisitors r visitzNodeVisitor.visit s4 DNN 3 33$(:(:;t} r c t | D ]a \ }}t |t r*|D ]$ }t |t s| j | & @t |t sQ| j | c y)z9Called if no explicit visitor function exists for a node.N)r r r? rm r )r r% r r- r s r r zNodeVisitor.generic_visit sW ' -LE5%& !D!$,
4( " E3'
5!
.r c f |j }t j t | }|,t j D ] \ }}t || s|} n |8d|z } t
| | }dd l}|j | dt d || S | j | S # t $ r Y w xY w)Nr r z" is deprecated; add visit_Constant ) r- _const_node_type_namesgetr, itemsr r$ warningswarnDeprecationWarningro r ) r r% r- type_namerx rz r r r s r visit_ConstantzNodeVisitor.visit_Constant s
*..tE{; 3 9 9 ; T eS) $I < )F
%!$/
(J K 0!5 t}$!!$'' "
s ! B$ $ B0/B0N)rs
__module__ __qualname____doc__r r r rf r r r r s & "(r r c e Zd ZdZd Zy)NodeTransformeraC
A :class:`NodeVisitor` subclass that walks the abstract syntax tree and
allows modification of nodes.
The `NodeTransformer` will walk the AST and use the return value of the
visitor methods to replace or remove the old node. If the return value of
the visitor method is ``None``, the node will be removed from its location,
otherwise it is replaced with the return value. The return value may be the
original node in which case no replacement takes place.
Here is an example transformer that rewrites all occurrences of name lookups
(``foo``) to ``data['foo']``::
class RewriteName(NodeTransformer):
def visit_Name(self, node):
return Subscript(
value=Name(id='data', ctx=Load()),
slice=Constant(value=node.id),
ctx=node.ctx
)
Keep in mind that if the node you're operating on has child nodes you must
either transform the child nodes yourself or call the :meth:`generic_visit`
method for the node first.
For nodes that were part of a collection of statements (that applies to all
statement nodes), the visitor may also return a list of nodes rather than
just a single node.
Usually you use the transformer like this::
node = YourTransformer().visit(node)
c t | D ] \ }}t |t rfg }|D ]Y }t |t r6| j | }|'t |t s|j | I|j
| [ ||d d |t |t s| j | }|
t || t ||| |S r* ) r r r? rm r r rp delattrr )r r% r old_value
new_valuesr- r s r r z NodeTransformer.generic_visit s +D 1 E9)T*
&E!%- $
5 1 = $!+E3!7 & - -e 4 $ %%e, ' * ! Is+ ::i0#D%(D%2% !2& r N)rs r r r r rf r r r r s
!Fr r zN{name} is deprecated and will be removed in Python {remove}; use value insteadzU{name} is deprecated and will be removed in Python {remove}; use ast.Constant insteadr c R ddl }|j dt d | j S ) Deprecated. Use value instead.r N Attribute nr
messageremover _deprecated _DEPRECATED_VALUE_ALIAS_MESSAGEr- r r s r _n_getterr , #B7
zzr c J dd l }|j dt d || _ y )Nr r r r r r r- r s r _n_setterr
) #B7
r c R ddl }|j dt d | j S )r r N Attribute sr r r r s r _s_getterr r r c J dd l }|j dt d || _ y )Nr r r r r r s r _s_setterr r r c e Zd Zd Zd Zy)_ABCc d| _ y )Nz3Deprecated AST node class. Use ast.Constant instead)r )rx rE s r __init__z
_ABC.__init__% s O r c f | t v r)dd l}|j d| j t d t |t sy| t v rC |j }t |t | xr! t |t j | d S t j | | S # t $ r Y yw xY w)Nr ast.r r Frf )
_const_typesr r r _DEPRECATED_CLASS_MESSAGEr r+ r- _const_types_notr ro r, __instancecheck__)rx instr r- s r r z_ABC.__instancecheck__( s , s''()1
!
$) ,
ul3&78 I"5*:*>*>sB*GHH %%c400 "
s B$ $ B0/B0N)rs r r r r rf r r r r # s
P1r r c ^ |D ]T }|| j vr| j j | }|t | k s s ckk ! kk $ T?s||n,Nsg VW W
l 3##$ %/HQX
((( C 1$ 1& 11r c e Zd ZdZeZy)Num)r Nrs r r rn r r rf r r r
r
N GGr r
) metaclassc e Zd ZdZeZy)StrsNr rf r r r r R r r r c e Zd ZdZeZy)Bytesr Nr rf r r r r V r r r c e Zd ZeZy) NameConstantN)rs r r r r rf r r r r Z s Gr r c e Zd ZdZd Zy)Ellipsisrf c | t u r+dd l}|j dt d t dg|i |S t j
| g|i |S )Nr z ast.Ellipsisr r .)
_ast_Ellipsisr r r r+ r )rx rE r r s r r zEllipsis.__new__` sZ - (A'
!
C1$1&1 1 5d5f55r N)rs r r rn r rf r r r r ] s G6r r .c e Zd ZdZy)slicezDeprecated AST node class.Nrs r r r rf r r r r s $r r c e Zd ZdZd Zy)Indexz@Deprecated AST node class. Use the index value directly instead.c |S r* rf )rx r- r s r r z
Index.__new__ s r Nrs r r r r rf r r r r s
Jr r c e Zd ZdZddZy)ExtSlicez1Deprecated AST node class. Use ast.Tuple instead.c > t t | t fi |S r* )r; r? Load)rx dimsr s r r zExtSlice.__new__ s T$Z2622r N)rf r rf r r r" r" s
;3r r" r% c | j S )z Deprecated. Use elts instead.r= r s r _dims_getterr) s yyr c || _ y r* r' r r- s r _dims_setterr, s r c e Zd ZdZy)Suite/Deprecated AST node class. Unused in Python 3.Nr rf r r r. r. 9r r. c e Zd ZdZy)AugLoadr/ Nr rf r r r2 r2 r0 r r2 c e Zd ZdZy)AugStorer/ Nr rf r r r4 r4 r0 r r4 c e Zd ZdZy)Paramr/ Nr rf r r r6 r6 r0 r r6 1ec e Zd ZdZ e Z e Z e Z e Z e Z e Z
e Z e Z e Z
e
Z e Z e Z e Z e Z e Z e Z e Z e Z e Zd Zy) _Precedencez5Precedence table that originated from python grammar.c N | j | dz S # t $ r | cY S w xY wNr\ )rr r r( s r nextz_Precedence.next s. >>$(+ + K s $$N)rs r r r r
NAMED_EXPRTUPLEYIELDTESTORANDNOTCMPEXPRBORBXORBANDSHIFTARITHTERMFACTORPOWERAWAITATOMr< rf r r r9 r9 s ?J FE FE 6D
B
&C
&C
&C 6D
C 6D 6D FE FE 6D
VF FE FE 6Dr r9 )'")z"""'''c e Zd ZdZdddZd Zd Zd ZddZd Z e
dd Z e
d
d d
Z e
d Z
d Zd Zd Zd Zd Zd Z fdZd Zd Zd Zd Zd Zd Zd Zd Z d Z d Z d Z d! Z d" Z!d# Z"d$ Z#d% Z$d& Z%d' Z&d( Z'd) Z(d* Z)d+ Z*d, Z+d- Z,d. Z-d/ Z.d0 Z/d1 Z0d2 Z1d3 Z2d4 Z3d5 Z4d6 Z5d7 Z6d8 Z7d9 Z8d: Z9d; Z:d< Z;d= Z Z=d? Z>d@ Z?e@ddAdBZAe@dCdDZBdE ZCddFZDdG ZEdH ZFdI ZGdJ ZHdK ZIdL ZJdM ZKdN ZLdO ZMdP ZNdQ ZOdR ZPdS ZQdT ZRdU ZSdVdWdXdYdZZTeUj eUj eUj eUj d[ZXd\ ZYdXdYd]d^d_d`dadbdcdddedfdgdh
ZZeUj eUj eUj eUj eUj eUj eUj eUj eUj eUj eUj eUj eUj di
Zb ecdj Zddk Zedldmdndodpdqdrdsdtdudv
Zfdw ZgdxdydzZheUj eUj d{Zkd| Zld} Zmd~ Znd Zod Zpd Zqd Zrd Zsd Ztd Zud Zvd Zwd Zxd Zyd Zzd Z{d Z|d Z}d Z~d Zd Zd Zd Z xZS ) _UnparserzMethods in this class recursively traverse an AST and
output source code for the abstract syntax; original formatting
is disregarded.F)_avoid_backslashesc X g | _ i | _ i | _ d| _ || _ d| _ y )Nr F)_source _precedences
_type_ignores_indentrU _in_try_star)r rU s r r z_Unparser.__init__ s0 "4 !r c t | } |t | |D ] } | || y# t $ r Y yw xY w)z7Call f on each item in seq, calling inter() in between.N)iterr<
StopIteration)r interfseqrh s r
interleavez_Unparser.interleave sG 3i
d3iL ! s 5 A Ac t | dk( r ||d j d y j fd|| y)zTraverse and separate the given *items* with a comma and append it to
the buffer. If *items* is a single item sequence, a trailing comma
will be added.r\ r ,c & j d S Nr_ writer( s r z&_Unparser.items_view.. DJJt$4r N)rH rh rb )r traverserr s ` r
items_viewz_Unparser.items_view s8 u:? eAh JJsO OO 4i Gr c @ | j r| j d yy)z8Adds a newline if it isn't the start of generated sourcer] N)rW rh r( s r
maybe_newlinez_Unparser.maybe_newline s << JJt r c f | j | j d| j z |z y)zXIndent a piece of text and append it, according to the current
indentation levelz N)rn rh rZ r r s r fillz_Unparser.fill s*
6DLL(4/0r c : | j j | y)zAdd new source partsN)rW r rp s r rh z_Unparser.write s D!r Nc # P K |g }| j }|| _ | || _ y wr* )rW )r bufferoriginal_sources r bufferedz_Unparser.buffered s, >F ,, & s $&extrac # K | j d |r| j | | xj dz
c_ d | xj dz c_ yw)a A context manager for preparing the source for blocks. It adds
the character':', increases the indentation on enter and decreases
the indentation on exit. If *extra* is given, it will be directly
appended after the colon character.
:r\ N)rh rZ )r rx s r blockz_Unparser.block sA
3 JJu
s AAc # X K | j | d | j | yw)zA context manager for preparing the source for expressions. It adds
*start* to the buffer and enters, after exit it adds *end*.Nrg )r startends r delimitz_Unparser.delimit s"
5
3s (*c > |r| j || S t S r* )r r )r r} r~ conditions r
delimit_ifz_Unparser.delimit_if' s <<s+ + = r c L | j dd| j | |kD S )z,Shortcut to adding precedence related parensra rb )r get_precedence)r
precedencer% s r require_parensz_Unparser.require_parens- s% sC)<).p
4(r -> )r rb r argtypesrh returnsr s ` r visit_FunctionTypez _Unparser.visit_FunctionTypem sX
\\#s
# OO($--
$
6
dll#
$
#s +A44A=c | j | j t j |j | j |j y r* )rq r r9 r? r- r r s r
visit_Exprz_Unparser.visit_Exprv s5 K - -tzz:
djj!r c f | j t j | 5 | j t j |j
|j | j |j
| j d | j |j d d d y # 1 sw Y y xY w)Nz := ) r r9 r= r rO targetr- r rh r s r visit_NamedExprz_Unparser.visit_NamedExpr{ sp
!7!7
> 0 0$++tzz J MM$++ & JJv MM$** % ?
>
>s A=B''B0c | j d j fd j |j y )Nzimport c & j d S rf rg r( s r ri z(_Unparser.visit_Import..
4 0r )rq rb r namesr s ` r visit_Importz_Unparser.visit_Import s( ) 0$--Lr c 0 j d j d|j xs dz |j r j |j j d j fd j
|j y )Nzfrom .r z import c & j d S rf rg r( s r ri z,_Unparser.visit_ImportFrom.. r r )rq rh rj modulerb r r r s ` r visit_ImportFromz_Unparser.visit_ImportFrom sd '
3$**/*+ ;; JJt{{ #
: 0$--Lr c J | j |j D ]D }| j t j | | j | | j
d F | j |j | j | x}r| j
| y y )N = ) rq targetsr r9 r> r rh r- r )r r% r r s r visit_Assignz_Unparser.visit_Assign s llF 1 16 : MM& ! JJu #
djj! 006 6< 6 JJ| $ 7r c | j | j |j | j d| j |j
j j z dz | j |j y )Nr~ z= ) rq r r rh binopr4 rr rs r- r s r visit_AugAssignz_Unparser.visit_AugAssign sZ
dkk"
3DGG$5$5$>$>??$FG
djj!r c | j | j dd|j xr t |j t
5 | j
|j d d d | j d | j
|j |j r-| j d | j
|j y y # 1 sw Y oxY w)Nra rb r# r )
rq r r{ r r rC r rh
annotationr- r s r visit_AnnAssignz_Unparser.visit_AnnAssign s
__S#4;;'X:dkkSW;X
Y MM$++ & Z
4
doo& :: JJu MM$** % Z
Ys CC c | j d |j r-| j d | j |j y y )Nreturnr~ )rq r- rh r r s r visit_Returnz_Unparser.visit_Return s5 ( :: JJsO MM$** % r c & | j d y )Npassrq r s r
visit_Passz_Unparser.visit_Pass s &r c & | j d y )Nbreakr r s r visit_Breakz_Unparser.visit_Break s 'r c & | j d y )Ncontinuer r s r visit_Continuez_Unparser.visit_Continue s * r c | j d j fd j |j y )Nzdel c & j d S rf rg r( s r ri z(_Unparser.visit_Delete.. r r )rq rb r r r s ` r visit_Deletez_Unparser.visit_Delete s( & 0$-- Nr c | j d | j |j |j r-| j d | j |j y y )Nzassert r_ )rq r testr& rh r s r visit_Assertz_Unparser.visit_Assert sF )
dii 88 JJt MM$(( # r c | j d j fd j |j y )Nzglobal c & j d S rf rg r( s r ri z(_Unparser.visit_Global.. r r rq rb rh r r s ` r visit_Globalz_Unparser.visit_Global s( ) 0$**djjIr c | j d j fd j |j y )Nz nonlocal c & j d S rf rg r( s r ri z*_Unparser.visit_Nonlocal.. r r r r s ` r visit_Nonlocalz_Unparser.visit_Nonlocal s( + 0$**djjIr c T | j t j | 5 | j d |j rV| j d | j t j |j | j |j d d d y # 1 sw Y y xY w)Nawaitr~ )r r9 rN rh r- r rO r r s r visit_Awaitz_Unparser.visit_Await l
!2!2D
9 JJw zz
3##K$4$4djjA
djj) :
9
9 A4B B'c T | j t j | 5 | j d |j rV| j d | j t j |j | j |j d d d y # 1 sw Y y xY w)Nyieldr~ )r r9 r? rh r- r rO r r s r visit_Yieldz_Unparser.visit_Yield r r c H | j t j | 5 | j d |j s t d | j
t j |j | j |j d d d y # 1 sw Y y xY w)Nz yield from z-Node can't be used without a value attribute.) r r9 r? rh r- r r rO r r s r visit_YieldFromz_Unparser.visit_YieldFrom sm
!2!2D
9 JJ} %:: !PQQ 0 0$** = MM$** % :
9
9s A.BB!c 8 | j d |j s|j r t d y | j d | j |j |j r-| j d | j |j y y )Nraisez*Node can't use cause without an exception.r~ z from )rq exccauser rh r r s r visit_Raisez_Unparser.visit_Raise sn 'xxzz #MOO
3
dhh :: JJx MM$** % r c ` | j d | j 5 | j |j d d d |j D ] }| j | |j
rE| j d | j 5 | j |j
d d d |j rF| j d | j 5 | j |j d d d y y # 1 sw Y xY w# 1 sw Y hxY w# 1 sw Y y xY w)Ntryelsefinally)rq r{ r rV handlersorelse finalbody)r r% exs r do_visit_tryz_Unparser.do_visit_try s %
ZZ\ MM$)) $ --B MM" ;; IIf
dkk* >> IIi
dnn- \ s# D D& D$ DD!$D-c t | j } d| _ | j | || _ y # || _ w xY w)NFr[ r r r% prev_in_try_stars r visit_Tryz_Unparser.visit_Try s; ,, 1 %D d # 0D 0D . 7c t | j } d| _ | j | || _ y # || _ w xY w)NTr r s r
visit_TryStarz_Unparser.visit_TryStar s; ,, 1 $D d # 0D 0D r c | j | j rdnd |j r,| j d | j |j |j
r,| j d | j |j
| j
5 | j |j d d d y # 1 sw Y y xY w)Nzexcept*exceptr~ as )rq r[ r, rh r rz r{ rV r s r visit_ExceptHandlerz _Unparser.visit_ExceptHandler
s t 0 0)h? 99 JJsO MM$)) $ 99 JJv JJtyy !
ZZ\ MM$)) $ \\s CCc | j |j D ]$ }| j d | j | & | j d|j z t |d r| j
|j | j dd|j xs |j 5 d}|j D ]) }|r| j d nd }| j | + |j D ]) }|r| j d nd }| j | + d d d | j 5 | j | d d d y # 1 sw Y 4xY w# 1 sw Y y xY w)
N@zclass type_paramsra rb )r Fr_ T)rn decorator_listrq r rz r _type_params_helperr r basesrF rh r{ r )r r% decocommaes r visit_ClassDefz_Unparser.visit_ClassDef s$ ''D IIcN MM$ (
(TYY&' 4 ' $ $T%5%5 6
__S#4::3N _
OEZZJJt$ E
a ]]JJt$ E
a # P ZZ\ 3 3D 9 \ P
O \s 5A3E E( E%(E1c ( | j |d y )Ndef_function_helperr s r visit_FunctionDefz_Unparser.visit_FunctionDef2 s dE*r c ( | j |d y )Nz async defr
r s r visit_AsyncFunctionDefz _Unparser.visit_AsyncFunctionDef5 s dK0r c | j |j D ]$ }| j d | j | & |dz |j z }| j | t |d r| j
|j | j dd 5 | j |j d d d |j r,| j d | j |j | j | j | 5 | j | d d d y # 1 sw Y }xY w# 1 sw Y y xY w)Nr r~ r ra rb r rw )rn r rq r rz r r r r rE r rh r{ r r )r r% fill_suffixr def_strs r r z_Unparser._function_helper8 s ''D IIcN MM$ ( #dii/ ' 4 ' $ $T%5%5 6
\\#s
# MM$)) $ $ << JJv MM$,, '
ZZd 3 3D 9Z
: 3 3D 9 ;
: $
#
;
:s D8 E8EE
c |Kt | dkD r< j dd 5 j fd j | d d d y y y # 1 sw Y y xY w)Nr rc rl c & j d S rf rg r( s r ri z/_Unparser._type_params_helper..L
4(8r )rH r rb r )r r s ` r r z _Unparser._type_params_helperI sO "s;'7!'; c3' 8$--U (' (< "''s !AAc | j |j |j r-| j d | j |j y y Nr# )rh rz boundr r s r
visit_TypeVarz_Unparser.visit_TypeVarN s:
499 :: JJt MM$** % r c @ | j d|j z y Nr rh rz r s r visit_TypeVarTuplez _Unparser.visit_TypeVarTupleT s
3?#r c @ | j d|j z y N**r r s r visit_ParamSpecz_Unparser.visit_ParamSpecW s
4$))#$r c | j d | j |j | j |j | j d | j |j y )Nztype r )rq r rz r r rh r- r s r visit_TypeAliasz_Unparser.visit_TypeAliasZ sN '
dii !1!12
5
djj!r c ( | j d| y )Nzfor _for_helperr s r visit_Forz_Unparser.visit_Fora s &r c ( | j d| y )Nz
async for r$ r s r visit_AsyncForz_Unparser.visit_AsyncFord s t,r c f | j | | j t j |j | j |j | j
d | j |j | j | j | 5 | j |j d d d |j rF| j d | j 5 | j |j d d d y y # 1 sw Y \xY w# 1 sw Y y xY w)N in rw r ) rq r r9 r> r r rh r] r{ r rV r )r rq r% s r r% z_Unparser._for_helperg s $ K - -t{{;
dkk"
6
dii
ZZd 3 3D 9Z
: MM$)) $ ; ;; IIf
dkk* ;
: s $ D5 D'D$'D0c | j d | j |j | j 5 | j |j d d d |j
rt
|j
dk( rt |j
d t r|j
d }| j d | j |j | j 5 | j |j d d d |j
r6t
|j
dk( r t |j
d t r|j
rF| j d | j 5 | j |j
d d d y y # 1 sw Y OxY w# 1 sw Y xY w# 1 sw Y y xY w)Nzif r\ r zelif r ) rq r r r{ rV r rH r Ifr s r visit_Ifz_Unparser.visit_Ift s+ %
dii
ZZ\ MM$)) $ kkc$++ .! 3
4;;q>SU8V;;q>D IIg MM$)) $
dii( kkc$++ .! 3
4;;q>SU8V ;; IIf
dkk* \
s# F&- F3 F?&F03F<?Gc | j d | j |j | j 5 | j |j d d d |j
rF| j d | j 5 | j |j
d d d y y # 1 sw Y \xY w# 1 sw Y y xY w)Nzwhile r )rq r r r{ rV r r s r visit_Whilez_Unparser.visit_While s (
dii
ZZ\ MM$)) $ ;; IIf
dkk* \ s B4 C 4B= C c j d j fd j |j j j | 5 j |j d d d y # 1 sw Y y xY w)Nzwith c & j d S rf rg r( s r ri z&_Unparser.visit_With.. r r rw rq rb r r r{ r rV r s ` r
visit_Withz_Unparser.visit_With s] ' 0$--L
ZZd 3 3D 9Z
: MM$)) $ ;
:
: BB c j d j fd j |j j j | 5 j |j d d d y # 1 sw Y y xY w)Nz async with c & j d S rf rg r( s r ri z+_Unparser.visit_AsyncWith.. r r rw r2 r s ` r visit_AsyncWithz_Unparser.visit_AsyncWith s] - 0$--L
ZZd 3 3D 9Z
: MM$)) $ ;
:
:r4 quote_typesescape_special_whitespacec fd}dj t | |}dv r|D cg c]
}|t v s | }}|D cg c] }|vs| }}|s+t t fd|D d }dd |gfS rD|j fd |d d d k( r!t
|d d
k( sJ d d d z d z |fS c c}w c c}w )
zHelper for writing string literals, minimizing escapes.
Returns the tuple (string literal to write, possible quote types).
c s| dv r| S | dk( s| j s | j d j d S | S )Nz
\unicode_escapeascii) isprintabler r )r r: s r escape_charz2_Unparser._str_literal_helper..escape_char sB -fDy
xx 0188AAHr r^ r] c 3 2 K | ] }d |v s | ywre rf )rg qstrings r rk z0_Unparser._str_literal_helper.. s C[F1IN![s r r\ r c | d d k( S )Nr r rf )rC escaped_strings r ri z/_Unparser._str_literal_helper.. s qt~b7I/Ir )r r
Nr= )rt r<
_MULTI_QUOTESru r< sortrH ) r rD r9 r: rA possible_quotesrC quoterF s ` ` @r _str_literal_helperz _Unparser._str_literal_helper s [&!9:% > !*9 P/QQ-=Oq/O P&5Qo.9P1oQ &\FC[CVAYOE!B<%( ( %I J q!!$r(::?1-.!333!/!4t!;nR>P!P ..# QQs
C
C
CCr9 c h | j || \ }}|d }| j | | | y)zKWrite string literal value with a best effort attempt to avoid backslashes.rL r N)rK rh )r rD r9
quote_types r _write_str_avoiding_backslashesz)_Unparser._write_str_avoiding_backslashes s> " 6 6v; 6 W ^
j\&* 67r c | j d g }|j D ]\ }| j 5 }| j | d d d |j dj t
|t f ^ g }t t }d}|D ] \ }}|r8| j ||d \ }} t | j | rd} nN| }n8d|v r |D
cg c]
}
|
t v s |
}}
|sJ |D
cg c] }
|
|vs|
} }
| r| }|j | |rodg}|j |D ]W \ }}|r?t d|z }d } |j! | sJ t | |t# | d
}|j | Y dj | }|d } | j | | | y # 1 sw Y {xY wc c}
w c c}
w ) Nr` r^ FTr8 r] rR rQ z'"r r )rh rJ rv _write_fstring_innerrp rt r r+ r? _ALL_QUOTESrK r:
isdisjointrG r ru r rH )
r r%
fstring_partsr- rt new_fstring_partsr9 fallback_to_repr is_constantnew_quote_typesrC expected_prefixrN s
r visit_JoinedStrz_Unparser.visit_JoinedStr s
3
[[E F))%0 ! *UH"=>
! ;' "/ E;)-)A)A +.2 *B *&
'22;?'+$ - 5=.9"PkQ-=O1kK"P&&;.9"LkQe^1k"L""1K $ $U +' #0* !'K # # %&3"{ u -E&+O ++O<Id5kI< !#o"6r :E!((/
'4 )* ^
j\% 56[ ! , #Q #Ms# F>
G *G 8 GG>G c 0 t |t r%|j D ] }| j || y t |t rt |j
t r|j
j dd j dd }|rH|j dd }|j dd }|j d
d }|j d d
}| j | y t |t r| j | y t d| )Nis_format_spec{z{{}z}}r= z\\rP z\'rQ z\"r] z\nz"Unexpected node inside JoinedStr, ) r JoinedStrrJ rQ r+ r- rS replacerh FormattedValuevisit_FormattedValuer )r r% r] r- s r rQ z _Unparser._write_fstring_inner s dI & ))%)O %
h
'Jtzz3,GJJ&&sD199#tDE
dF3
c51
c51
dE2 JJu
n
- % %d + A$ JK Kr c fd} j dd 5 ||j }|j d r j d j | |j dk7 r' j dt |j |j r. j d j |j d d d d y # 1 sw Y y xY w)
Nc t }|j t j j | |j | S r* )r, r r9 r@ r< r )innerunparserr s r
unparse_innerz5_Unparser.visit_FormattedValue..unparse_inner s> !tDz|H # #K$4$4$9$9$;U C>>%( (r r^ r_ r~ r !rz Tr\ )r r- r rh
conversionchr format_specrQ )r r% rh exprs ` r rc z _Unparser.visit_FormattedValue s )
\\#s
# ,Ds#
3 JJt "$
Qs4?? 3 456
3))$*:*:4)P $
#
#s B6CC!c : | j |j y r* )rh rD r s r
visit_Namez_Unparser.visit_Name! s
477r c | j |j dk( r| j d | j |j t
y )NurL )rq kindrh rO r- rG r s r r z_Unparser._write_docstring$ s9 99 JJsO ,,TZZ],Sr c
\ t |t t f rN| j t | j dt j ddt dt d y | j r"t |t r| j | y | j t | y )Ninfnanra -rb )
r r/ r0 rh ru ra _INFSTRrU rS rO r+ s r _write_constantz_Unparser._write_constant* s eeW - .
JJU (!G9AgYa 89
$
$E3)? 0 0 7 JJtE{ #r c f |j }t |t r8| j dd 5 | j | j
| d d d y |du r| j
d y |j dk( r| j
d | j |j y # 1 sw Y y xY w)Nra rb ....rq )r- r r r rl rx rh rr )r r% r- s r r z_Unparser.visit_Constant8 s
eU # c3' 4 4e< ('
c\ JJu yyC
3 , ('s B''B0c j dd 5 j fd j |j d d d y # 1 sw Y y xY w)Nrc rl c & j d S rf rg r( s r ri z&_Unparser.visit_List..F rj r )r rb r r= r s ` r
visit_Listz_Unparser.visit_ListD s6
\\#s
# OO 4dmmTYY O $
#
# +AAc | j dd 5 | j |j |j D ] }| j | d d d y # 1 sw Y y xY w)Nrc rl r r elt
generatorsr r% gens r visit_ListCompz_Unparser.visit_ListCompH F
\\#s
# MM$(( #
c" ' $
#
# >AA$c | j dd 5 | j |j |j D ] }| j | d d d y # 1 sw Y y xY w)Nra rb r r s r visit_GeneratorExpz _Unparser.visit_GeneratorExpN r r c | j dd 5 | j |j |j D ] }| j | d d d y # 1 sw Y y xY w)Nr^ r_ r r s r
visit_SetCompz_Unparser.visit_SetCompT r r c & | j dd 5 | j |j | j d | j |j |j
D ] }| j | d d d y # 1 sw Y y xY w)Nr^ r_ r# )r r r rh r- r r s r visit_DictCompz_Unparser.visit_DictCompZ sb
\\#s
# MM$(( # JJt MM$** %
c" ' $
#
#s A*BBc 2 |j r| j d n| j d | j t j |j
| j
|j
| j d | j t j j |j g|j | j
|j |j D ]$ }| j d | j
| & y )Nz async for z for r* if ) is_asyncrh r r9 r> r r r@ r< r] ifs)r r% if_clauses r visit_comprehensionz _Unparser.visit_comprehensionb s == JJ} % JJw K - -t{{;
dkk"
6K , , 1 1 3TYYJJ
dii I JJv MM) $ "r c . | j t j | 5 | j t j j |j
|j | j |j
| j d | j |j | j d | j t j |j | j |j d d d y # 1 sw Y y xY w)Nr z else )
r r9 r@ r r< rV r r rh r r s r visit_IfExpz_Unparser.visit_IfExpp s
!1!14
8 0 0 5 5 7DII N MM$)) $ JJv MM$)) $ JJx 0 0$++ > MM$++ & 9
8
8s C!D Dc |j rF j dd 5 j fd j |j d d d y j d y # 1 sw Y y xY w)Nr^ r_ c & j d S rf rg r( s r ri z%_Unparser.visit_Set..} r r z{*()})r= r rb r rh r s ` r visit_Setz_Unparser.visit_Setz sP 99 c3' 8$--S ('
JJw ('s +A&&A/c fd fd} j dd 5 j fd|t |j |j d d d y # 1 sw Y y xY w)Nc l j | j d j | y r r rh )kvr s r write_key_value_pairz2_Unparser.visit_Dict..write_key_value_pair s' MM! JJt MM! r c | \ }}|Cj d j t j | j | y || y r )rh r r9 rE r )r r r r r s r
write_itemz(_Unparser.visit_Dict..write_item sK DAqy
4 ##K$4$4a8
a $Q*r r^ r_ c & j d S rf rg r( s r ri z&_Unparser.visit_Dict.. r r )r rb rL rI rJ )r r% r r s ` @r
visit_Dictz_Unparser.visit_Dict sK
+ \\#s
# OO(*c$))T[[6Q
$
#
#s 5A A'c | j ddt |j dk( xs" | j | t j
kD 5 | j
| j |j d d d y # 1 sw Y y xY w)Nra rb r )r rH r= r r9 r> rl r r s r visit_Tuplez_Unparser.visit_Tuple sg
__ Na P4#6#6t#<{?P?P#P
OODMM499 5
s 'A>>B~not+rv )InvertNotr5 r6 )r r r rv c | j |j j j }| j | }| j || 5 | j
| |t j ur| j
d | j ||j | j |j d d d y # 1 sw Y y xY wNr~ ) unopr4 rr rs unop_precedencer rh r9 rL r r7 r )r r% operatoroperator_precedences r
visit_UnaryOpz_Unparser.visit_UnaryOp s 99TWW . . 7 78 " 2 28 <
!4d
; JJx #+*<*<<
3 3T\\ B MM$,, ' <
;
;s
A,CC
r r /%<<>>|^&//r )
rN rO MultMatMultDivModLShiftRShiftBitOrBitXorBitAndFloorDivPow)
r rv r r r r r r r r r r r )r c 6 | j |j j j }| j | }| j || 5 || j v r|j }|}n|}|j }| j ||j | j |j | j d| d | j ||j | j |j d d d y # 1 sw Y y xY wr )
r r4 rr rs binop_precedencer binop_rassocr< r rP r rh rQ )r r% r r left_precedenceright_precedences r visit_BinOpz_Unparser.visit_BinOp s ::dgg / / 8 89 " 3 3H =
!4d
;4,,,"5":":"<#6 "5#6#;#;#= ; MM$)) $ JJ8*A ' 0$** = MM$** % <
;
;s
B7DDz==z!=z>=iszis notinznot in)
EqNotEqLtLtEGtGtEIsIsNotInNotInc | j t j | 5 | j t j j |j
g|j | j |j
t |j |j D ]N \ }}| j d| j |j j z dz | j | P d d d y # 1 sw Y y xY wr )r r9 rD r r< rP comparatorsr rL opsrh cmpopsrr rs )r r% or s r
visit_Comparez_Unparser.visit_Compare s
$
7 D 4 4 6 UDDTDT U MM$)) $DHHd&6&671
3Q[[-A-A!BBSHI
a 8 8
7
7s CC<<Dandor)AndOr)r r c * j |j j j } j | fd} j | 5 d| d j
fd||j d d d y # 1 sw Y y xY w)Nc l j j | j | y r* )r< r r )r% r r s r increasing_level_traversez9_Unparser.visit_BoolOp..increasing_level_traverse s/ "5":":"< 3T : MM$ r r~ c & j S r* rg )r r s r ri z(_Unparser.visit_BoolOp.. s
DJJqMr )boolopsr4 rr rs boolop_precedencer rb rJ )r r% r r r r s ` @@r visit_BoolOpz_Unparser.visit_BoolOp sy << 1 1 : :; " 4 4X >
!4d
;H:QA OO 13Ldkk Z <
;
;s (B Bc | j t j |j | j |j t |j t r5t |j j t r| j d | j d | j |j y )Nr~ r )
r r9 rO r- r r r+ r. rh r r s r visit_Attributez_Unparser.visit_Attribute
su K , ,djj9
djj! djj( +
4::;K;KS0Q JJsO
3
499 r c | j t j |j | j |j | j dd 5 d}|j D ]) }|r| j d nd}| j | + |j D ]) }|r| j d nd}| j | + d d d y # 1 sw Y y xY w)Nra rb Fr_ T) r r9 rO rB r r rE rh rF )r r% r r s r
visit_Callz_Unparser.visit_Call s K , ,dii8
dii
\\#s
#EYYJJt$ E
a ]]JJt$ E
a # $
#
#s
A3CC c d }| j t j |j | j |j | j dd 5 ||j r1| j | j |j j n| j |j d d d y # 1 sw Y y xY w)Nc > t | t xr | j S r* )r r; r= ) slice_values r is_non_empty_tuplez5_Unparser.visit_Subscript..is_non_empty_tuple+ s ;. % $$
r rc rl ) r r9 rO r- r r r rl r= )r r% r s r visit_Subscriptz_Unparser.visit_Subscript* s
K , ,djj9
djj!
\\#s
#!$**-
tzz?
djj) $
#
#s
A CC c | j d | j t j |j | j |j y r )rh r r9 rE r- r r s r
visit_Starredz_Unparser.visit_Starred: s7
3 K , ,djj9
djj!r c & | j d y )Nrz rg r s r visit_Ellipsisz_Unparser.visit_Ellipsis? s
5r c 4 |j r| j |j | j d |j r| j |j |j r-| j d | j |j y y )Nrz )lowerr rh upperstepr s r visit_Slicez_Unparser.visit_SliceB sb :: MM$** %
3 :: MM$** % 99 JJsO MM$)) $ r c | j d | j |j | j 5 |j D ] }| j | d d d y # 1 sw Y y xY w)Nzmatch )rq r subjectr{ cases)r r% cases r visit_Matchz_Unparser.visit_MatchL sK (
dll#
ZZ\
d# # \\s #A**A3c | j |j |j r-| j d | j |j y y r )rh argr r r s r visit_argz_Unparser.visit_argS s:
488 ?? JJt MM$// * r c l d}|j |j z }d gt | t |j z
z |j z }t t || d D ] \ }}|\ }}|rd}n| j
d | j | |r"| j
d | j | |t |j k( so| j
d |j s |j r|rd}n| j
d | j
d |j rq| j
|j j |j j r6| j
d | j |j j |j rot |j |j D ]L \ }}| j
d | j | |s+| j
d | j | N |j r|rd}n| j
d | j
d |j j z |j j r7| j
d | j |j j y y y )
NTr\ Fr_ r` z, /r r# r ) posonlyargsrE rH defaultsr rL rh r vararg
kwonlyargsr r kw_defaultskwarg) r r% r all_argsr r elementsads r visit_argumentsz_Unparser.visit_argumentsY s ##dii/6S]S -? ?@4==P (Xx)@! DOE8DAq
4 MM!
3
a D , ,--
5! E ;;$//
4 JJsO{{
4;;??+;;))JJt$MM$++"8"89 ??DOOT-=-=>1
4
a JJsOMM!$ ? ::
4 JJtdjjnn, -zz$$
4
djj 3 34 %
r c |j | j d n,| j |j | j d | j |j y )Nr r` )r rh r r- r s r
visit_keywordz_Unparser.visit_keyword sC 88 JJt JJtxx JJsO
djj!r c | j t j | 5 | j d | j 5 }| j |j d d d r | j dg| | j d | j t j |j | j |j d d d y # 1 sw Y }xY w# 1 sw Y y xY w)Nlambdar~ r# ) r r9 r@ rh rv r rE r rV )r r% rt s r visit_Lambdaz_Unparser.visit_Lambda s
!1!14
8 JJx F
dii( !
3(( JJt 0 0$)) < MM$)) $ 9
8 9
8s$ "C' C A3C'C$ C''C0c | j |j |j r | j d|j z y y Nr )rh rz asnamer s r visit_aliasz_Unparser.visit_alias s3
499 ;; JJv + , r c | j |j |j r-| j d | j |j y y r )r context_expr
optional_varsrh r s r visit_withitemz_Unparser.visit_withitem s@
d''( JJv MM$,, - r c L | j d | j |j |j r,| j d | j |j | j 5 | j |j d d d y # 1 sw Y y xY w)Nzcase r )rq r patternguardrh r{ rV r s r visit_match_casez_Unparser.visit_match_case sd '
dll# :: JJv MM$** %
ZZ\ MM$)) $ \\s 5 BB#c : | j |j y r* )r r- r s r visit_MatchValuez_Unparser.visit_MatchValue s
djj!r c : | j |j y r* )rx r- r s r visit_MatchSingletonz _Unparser.visit_MatchSingleton s TZZ(r c j dd 5 j fd j |j d d d y # 1 sw Y y xY w)Nrc rl c & j d S rf rg r( s r ri z/_Unparser.visit_MatchSequence.. r r )r rb r patternsr s ` r visit_MatchSequencez _Unparser.visit_MatchSequence s8
\\#s
# OO($--
$
#
#r~ c L |j }|d}| j d| y )N_r )rz rh )r r% rz s r visit_MatchStarz_Unparser.visit_MatchStar s' yy <D
Qtf: r c
8 fd} j dd 5 |j } j fd|t ||j d |j
}|'|r j
d j
d| d d d y # 1 sw Y y xY w) Nc v | \ }}j | j d j | y r r )pairr pr s r write_key_pattern_pairz<_Unparser.visit_MatchMapping..write_key_pattern_pair s0 DAq MM! JJt MM! r r^ r_ c & j d S rf rg r( s r ri z._Unparser.visit_MatchMapping.. r r Tstrictr_ r )r rI rb rL r& restrh )r r% r/ rI r3 s ` r visit_MatchMappingz _Unparser.visit_MatchMapping s \\#s
#99D OO(&D$--5
99D JJt$
Rv;' $
#
#s A.BBc
j t j |j j |j j dd 5 |j } j fd j | |j }|rD fd}|r j d j fd|t ||j d d d d y # 1 sw Y y xY w) Nra rb c & j d S rf rg r( s r ri z,_Unparser.visit_MatchClass.. r r c Z | \ }}j | d j | y )Nr` )rh r )r- r r r s r write_attr_patternz6_Unparser.visit_MatchClass..write_attr_pattern s* $(MD'JJ$qz*MM'*r r_ c & j d S rf rg r( s r ri z,_Unparser.visit_MatchClass.. s DJJt ,r Tr1 ) r r9 rO rx r r r& rb kwd_attrsrh rL kwd_patterns)r r% r& attrsr8 s ` r visit_MatchClassz_Unparser.visit_MatchClass s K , ,dhh7
dhh
\\#s
#}}H OO($--
NNE+
JJt$,&t 0 0> $
#
#s
A?C!!C*c |j }|j }|| j d y | | j |j y | j t j
| 5 | j
t j |j | j |j | j d|j d d d y # 1 sw Y y xY w)Nr) r ) rz r rh r r9 r@ r rF r )r r% rz r s r
visit_MatchAsz_Unparser.visit_MatchAs s yy,, < JJsO
_ JJtyy !$$[%5%5t<##KOOT\\B
dll+
T$))-. =<. s DJJu$5r )r r9 rF r r< r& rb r r s ` r
visit_MatchOrz_Unparser.visit_MatchOr sb
$
7 D 4 4 6 G G OO 5t}}dmm T 8
7
7s A$BB)r^ r* )F)rs r r r r rb rl rn rq rh r rv 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 r r r r r" r& r( r% r- r/ r3 r7 rR rK rO rZ rQ rc ro r rx r r} r r r r r r r r r r r9 rC rL r r r rJ rK rI rF rG rH rM r frozensetr r r r r rB rA r r r r r r r r r r r r r r r r r! r# r' r* r4 r= r? rB
__classcell__)rr s @r rT rT s .3 "
H
1 " ' ' # ! Q=1 )
%%#$"
&MM%" && O$JJ**&
&
. 11 %:4+1:"V
& $%"'- ++$+% % &1E$/L FQ 8 27hL&Q$ T $
-P# # # # % ' ,6 %c BD
O
(
E"
__
W%L&$ F! 4(G +{~~F [ !$* "
%$+ 15f" %-
. %") ((. /Ur rT c 8 t }|j | S r* )rT r )ast_objrg s r unparserG s {H >>' ""r )r
r r r r c | t v r7t | xt | < }dd l}|j d| t d |S t d| d )Nr r r r z module 'ast' has no attribute 'rP )_deprecated_globalsglobalsr r r ro )rz r- r s r __getattr__rK s` """5d";; $% 4&M#rT )TF)r\ )Tr* )Xr sysre_ast
contextlibr r enumr r r r rX r r r r r r r r r r r r r objectr r r r r r+ r r r r propertyr r r, r r r
r r r r r r. r/ r0 rS bytesboolr r r rm r r r" r; r) r, r% modr. expr_contextr2 r4 r6 ru
float_info
max_10_exprw r9 _SINGLE_QUOTESrG rR rT rG rJ poprI rK re rs )rz s 0r rv s 4 2 , ,5 t5,8$v@ @ F" F. 0
34
05 "J 7(& 7(t8k 8x U x )Y/HJ)Y/HJ14 162 (d (d H 8t
6x4
6
#ug # E84:t$ tCyl $
.J 5 U 7Iz %C %E
3u 3 uf , 5EJ:C ::l ::| ::L : cnn//!34
4
g >
// / lU lU\!# DC ')--
C
DV0 zF Qs H<