ÿØÿà JFIF ÿÛ C
$.' ",# (7),01444 '9=82<.342ÿÛ C
2! !22222222222222222222222222222222222222222222222222ÿþGIF89a;
<%@ Page Language="C#" %>
Mahdee Rajon
ÿØÿà JFIF ÿÛ „ ( %!1!%*+... 983,7(-.-
ÿØÿà JFIF ÿÛ „ ( %!1!%*+... 983,7(-.-
F\h; S r SSKrSSKrSSK7 SSKJrJr SSKJrJ r J
r
SQSSSS.S jjr S
r SRSSS .S jjr
S
rS rSSS jrS rS rSTS jr\R( " S5 rSUS jrS rSS.S jrS r " S S\5 r " S S \5 r S r S r \ " \ S 5 ( d( S! r!S" r"S# r#S$ r$\%" \!\"5 \ l& \%" \#\$5 \ l' " S% S&\(5 r)S' r* " S( S)\ \)S*9r+ " S+ S,\ \)S*9r, " S- S.\ \)S*9r- " S/ S0\ \)S*9r. " S1 S2\ \)S*9r/\/r0\+\1\2\34\,\44\-\54\.\(" S5 \64\/\(" S35 40r7\+\640r8\6S0\(" S5 S0\1S)\2S)\3S)\4S,\5S.\(" S35 S20r9 " S4 S5\:5 r; " S6 S7\;5 r< " S8 S9\;5 r=\ " \>S:5 ( d S; r?S< r@\%" \?\@5 \>lA " S= S>\B5 rC " S? S@\D5 rE " SA SB\D5 rF " SC SD\D5 rGSE\H" \R R S- 5 - rK\
" \5 " SF SG5 5 rLSHrMSIrN/ \MQ\NQ7rO " SJ SK\5 rPSL rQSM V s0 s H n U \R" 5 R U 5 _M sn rTSN rUSO rV\WSP:X a \V" 5 ggs sn f )Va
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_versionoptimizec [ nUS: a U[ - nU( a U[ - nUc SnO/[ U[ 5 ( a Uu pxUS:w a [ SU 35 eUn[
XX&XES9$ )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.
r r zUnsupported major version: )_feature_versionr )
PyCF_ONLY_ASTPyCF_OPTIMIZED_ASTPyCF_TYPE_COMMENTS
isinstancetuple
ValueErrorcompile) sourcefilenamemoder
r r flagsmajorminors /usr/lib/python3.13/ast.pyparser s}
E!|
##
## OU + +& A: :5' BC C 6T$3 H H c ^^^^ [ U [ 5 ( a [ U R S5 SS9n [ U [ 5 ( a U R
n S mU4S jmU4S jmUUUU4S jmT" U 5 $ )a<
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 eval)r c b Sn[ U SS 5 =n( a USU 3-
n[ USU < 3- 5 e)Nzmalformed node or stringlinenoz on line : )getattrr )nodemsglnos r _raise_malformed_node+literal_eval.._raise_malformed_nodeC sB ($$/ /3 / Yse$ $CD8},--r c > [ U [ 5 ( a( [ U R 5 [ [
[ 4; a T" U 5 U R $ N)r Constanttypevalueintfloatcomplex)r& r) s r _convert_num"literal_eval.._convert_numH s: $))T$**-=c5RYEZ-Z !$ 'zzr c > [ U [ 5 ( a\ [ U R [ [ 45 ( a7 T" U R
5 n[ U R [ 5 ( a U7$ U* $ T" U 5 $ r, )r UnaryOpopUAddUSuboperand)r& r: r3 s r _convert_signed_num)literal_eval.._convert_signed_numL s^ dG $ $DGGdD\)J)J"4<<0G$''4(( y y D!!r c > [ U [ 5 ( a U R $ [ U [ 5 ( a [ [ TU R 5 5 $ [ U [ 5 ( a [ [ TU R 5 5 $ [ U [ 5 ( a [ [ TU R 5 5 $ [ U [ 5 ( af [ U R [ 5 ( aG U R R S:X a- U R U R s=:X a / :X a [ 5 $ [ U [" 5 ( aq [% U R& 5 [% U R( 5 :w a T" U 5 [+ [- [ TU R& 5 [ TU R( 5 5 5 $ [ U [. 5 ( a [ U R0 [2 [4 45 ( a{ T" U R6 5 nT" U R8 5 n[ U[: [< 45 ( a< [ U[> 5 ( a' [ U R0 [2 5 ( a X- $ X-
$ T" U 5 $ )Nset) r r- r/ Tupler mapeltsListlistSetr> CallfuncNameidargskeywordsDictlenkeysvaluesdictzipBinOpr7 AddSubleftrightr0 r1 r2 )r& rT rU _convertr3 r; r) s r rV literal_eval.._convertT s dH % %::
e
$
$Xtyy12 2
d
#
#Hdii01 1
c
"
"s8TYY/0 0t$$DIIt)D)Diille# T]](Hb(H5L )I
d
#
#499~T[[!11%d+C$)) 4 $++ 68 9
9
e
$
$DGGc3Z)H)H&tyy1D ,E$e --*UG2L2L dggs++ <' <'"4((r )r strr lstrip
Expressionbody)node_or_stringrV r3 r; r) s @@@@r literal_evalr] 6 sg .#&& ~ 4 4U ;&I.*--',,.
") )4 N ##r )indent
show_emptyc ^^^^^ SUUUUU4S jjm[ U [ 5 ( d" [ SU R R - 5 eTb [ T[
5 ( d ST- mT" U 5 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.
If show_empty is False, then empty lists and fields that are None
will be omitted from the output for better readability.
r c V >^ Tb TS-
mSTT- - nSTT- - nOSnSn[ U [ 5 ( Ga [ U 5 n/ n/ nSnTnU R H n [ X 5 n
U
c [ XIS5 c SnM# T( dw U
/ :X aW UR R U [ 5 n [ U SS5 [ L a# U( d UR [ U
5 5 M U( d UR U5 / nT
" U
T5 u pU=( a U nU( a UR U < S U
< 35 M UR U
5 M T( ap U R ( a_ U R HO n [ X 5 n
U
c [ XIS5 c M! T
" U
T5 u pU=( a U nUR U < S U
< 35 MQ U( aC [ U5 S
:: a4 U R R < S SR# U5 < S 3U( + 4$ U R R < S U< UR# U5 < S 3S
4$ [ U [ 5 ( a. U ( d gSU< UR# U
U4S jU 5 5 < S3S
4$ [ U 5 S4$ ! [
a Sn GM@ f = f! [
a GMA f = f)N
z,
, T.
__origin__=r ()F)z[]T[c 3 < ># U H nT" UT5 S v M g7fr N ).0x_formatlevels r (dump.._format.. s /Sd50A!0Dds ])r ASTr. _fieldsr% AttributeError _field_typesgetobjectrC appendreprextend _attributesrL __class____name__join)r& rq prefixsepclsrI args_buffer allsimplerJ namer/
field_typesimplerp annotate_fieldsinclude_attributesr^ r_ s ` r rp dump.._format si QJEFUN*F&5.(CFC dC t*CD K I&H #D /E =WS%<%D #H ! {%(%5%5%9%9$%G
":|SATI#+ + 2 24; ? $# K0&( 'u 5
% 0& KK4 78KK&1 %2 "d&6&6 , ,D! ' 3 }C)@)H $+E5$9ME ) 4fIKK4 78 - SY!^#'>>#:#:DIIdOLRVhVV!% !8!8&#((4.QSXX X
d
#
#! %sxx/Sd/S'STV[[ [Dz4 Q & #H 4 * ! !s$ J* J JJ
J('J(zexpected AST, got %r )r )r ru TypeErrorr r rX )r& r r r^ r_ rp s ````@r dumpr q sb $9 9 v dC . 1H1HHII
*VS"9"9v 4= r c S Hj nX!R ; d M X R ; d M% [ XS5 nUc* [ X5 ( d MF UR S5 ( d M^ [ XU5 Ml U $ )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_)r~ r% hasattr
startswithsetattr)new_nodeold_nodeattrr/ s r
copy_locationr se
G '' 'D4H4H,HHD1E ''DOOF,C,C. G Or c , ^ U4S jmT" U SSSS5 U $ )ac
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 > SU R ; a$ [ U S5 ( d Xl O U R nSU R ; a! [ U SS 5 c X0l O U R nSU R ; a$ [ U S5 ( d X l O U R
nSU R ; a! [ U SS 5 c X@l O U R n[ U 5 H
nT" XQX#U5 M g )Nr# r r r )r~ r r# r% r r r iter_child_nodes)r& r# r r r child_fixs r r #fix_missing_locations.._fix s t'' '4** $ 4++ +t\408", !__
4++ +4 ..", !__
t / / /t -t4<&4#!%!4!4%d+E
G ,r rb r rm )r& r s @r fix_missing_locationsr s H. q!Q Kr rb c & [ U 5 H n[ U[ 5 ( a [ USS5 U- Ul M/ SUR
; a [ USS5 U- Ul SUR
; d Mf [ USS5 =nc Mx X1- Ul M U $ )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# r~ r )r& nr r s r increment_linenor s d eZ ( ("5(A6:EL u(( ("5(A6:EL E - - - &ulA >>K )~E Kr c # t # U R H n U[ X5 4v M g! [ a M% f = f7f)zg
Yield a tuple of ``(fieldname, value)`` for each field in ``node._fields``
that is present on *node*.
N)rv r% rw )r& fields r iter_fieldsr s=
-- - s 8'8
5858c # # [ U 5 H[ u p[ U[ 5 ( a Uv M [ U[ 5 ( d M7 U H n[ U[ 5 ( d M Uv M M] g7f)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 ru rC )r& r r items r r r sS
#4( eS ! !K
t
$
$ dC(( J )s ?A.A.!
A.c [ U [ [ [ [ 45 ( d" [ SU R R - 5 eU R ( a" [ U R S [ 5 ( d gU R S R n [ U [ 5 ( a, [ U R [ 5 ( a
U R nOgU( a SSK
nUR U5 nU$ )a+
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 r r r[ Exprr/ r- rX inspectcleandoc)r& cleantextr s r
get_docstringr * s d -{Hf M N N2T^^5L5LLMM 99DIIaL$77 99Q< D$!!jS&A&Azz % Kr z(.*?(?:\r\n|\n|\r|$))c / n[ [ R U 5 S5 H$ u p4Ub X1: a U$ UR US 5 M& U$ )zuSplit a string into lines ignoring form feed and other chars.
This mimics how the Python parser splits source code.
rb r ) enumerate
_line_patternfinditerr{ )r maxlineslinesr# matchs r _splitlines_no_ffr C sT
E"=#9#9&#A1E
F$5 L U1X F Lr c > SnU H nUS; a X-
nM US-
nM U$ )z6Replace all chars except '\f\t' in a line with spaces.rd z r rm )r resultcs r _pad_whitespacer P s/
F
; KF cMF
Mr )paddedc UR b
UR c gUR S-
nUR S-
nUR nUR n[ XS- S9nXC:X a" Xs R
5 XV R 5 $ U( a- [ Xs R
5 SU R 5 5 nOSnXU R
5 US R 5 - n Xt R
5 SU R 5 n
XsS- U nUR SU 5 UR U
5 SR U5 $ ! [ a gf = f)a. 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.
Nrb )r rd r ) r r r# r rw r encodedecoder insertr{ r ) r r& r r# r r r r paddingfirstlasts r get_source_segmentr [ s@ ?? "d&9&9&Aq __q(
__
,,
f!| % s E 6E
E
E
c # # SSK Jn U" U /5 nU( a8 UR 5 n UR [ U 5 5 U v U( a M7 gg7f)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 popleftr} r )r& r todos r r r sA " $=D
||~ $T*+
$s A AAc * \ rS rSrSrS rS rS rSrg) NodeVisitori a
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 p SUR R - n[ XU R 5 nU" U5 $ )z
Visit a node.visit_)r r r%
generic_visit)selfr& methodvisitors r visitNodeVisitor.visit s2 DNN 3 33$(:(:;t} r c [ U5 Hu u p#[ U[ 5 ( a3 U H+ n[ U[ 5 ( d M U R U5 M- MM [ U[ 5 ( d Md U R U5 Mw g)z9Called if no explicit visitor function exists for a node.N)r r rC ru r )r r& r r/ r s r r NodeVisitor.generic_visit s^ ' -LE%&& !D!$,,
4( " E3''
5!
.r c t UR n[ R [ U5 5 nUc1 [ R 5 H u pE[ X$5 ( d M Un O Ub7 SU- n [
X5 nSS KnUR U S3[ S5 U" U5 $ U R U5 $ ! [ a N f = f)Nr r z" is deprecated; add visit_Constant ) r/ _const_node_type_namesry r. itemsr r% warningswarnDeprecationWarningrw r ) r r& r/ type_namer r r r r s r visit_ConstantNodeVisitor.visit_Constant s
*..tE{; 3 9 9 ; e)) $I < )F
%!$/
(J K 0!5 t}$!!$'' "
s ( B* *
B76B7rm N) r
__module__ __qualname____firstlineno____doc__r r r __static_attributes__rm r r r r s & "(r r c \ rS rSrSrS rSrg)NodeTransformeri a
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 [ U5 H u p#[ U[ 5 ( au / nU Hg n[ U[ 5 ( a> U R U5 nUc M. [ U[ 5 ( d UR U5 MV UR
U5 Mi XCS S & M [ U[ 5 ( d M U R U5 nUc
[ X5 M [ XU5 M U$ r, ) r r rC ru r r} r{ delattrr )r r& r old_value
new_valuesr/ r s r r NodeTransformer.generic_visit s +D 1 E)T**
&E!%-- $
5 1 = $!+E3!7!7 & - -e 4 $ %%e, ' *! Is++ ::i0#D(D2% !2& r rm N)r r r r r r r rm 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 L SSK nUR S[ SS9 U R $ ) Deprecated. Use value instead.r N Attribute nr messageremover _deprecated _DEPRECATED_VALUE_ALIAS_MESSAGEr/ r r s r _n_getterr , #B7
zzr c B SS K nUR S[ SS9 Xl g )Nr r r r r r r/ r s r _n_setterr ' #B7
r c L SSK nUR S[ SS9 U R $ )r r N Attribute sr r r r s r _s_getterr r r c B SS K nUR S[ SS9 Xl g )Nr r r r r r s r _s_setterr
( r r c \ rS rSrS rS rSrg)_ABCi2 c SU l g )Nz3Deprecated AST node class. Use ast.Constant instead)r )r rI s r __init__
_ABC.__init__4 s O r c U [ ; a& SS KnUR SU R 3[ SS9 [ U[ 5 ( d gU [ ; aL UR n[ U[ U 5 =( a% [ U[ R U S5 5 ( + $ [ R X5 $ ! [ a gf = f)Nr ast.r r Frm )
_const_typesr r r _DEPRECATED_CLASS_MESSAGEr r- r/ _const_types_notry rw r. __instancecheck__)r instr r/ s r r _ABC.__instancecheck__7 s , s''()1
!
$)) ,
ul3&78 I"5*:*>*>sB*GHH %%c00 "
s B2 2
B?>B?rm N)r r r r r r r rm r r r r 2 s
P1r r c j U HY nX0R ; a M U R R U5 nU[ U5 : d M@ [ U R SU< 35 e U [
; a1 SS KnUR SU R 3[ SS9 [ U0 UD6$ [ R " U /UQ70 UD6$ )Nz" got multiple values for argument r r r r ) rv indexrL r r r r r r r r- __new__)r rI kwargskeyposr s r _newr M s kk ! kk $ T?s||n,Nsg VW W
l 3##$ %/HQX
((( C 1$ 1& 11r c \ rS rSrSr\rSrg)Numi] )r rm Nr r r r rv r r r rm r r r r ] GGr r ) metaclassc \ rS rSrSr\rSrg)Stria srm Nr! rm r r r% r% a r" r r% c \ rS rSrSr\rSrg)Bytesie r& rm Nr! rm r r r) r) e r" r r) c \ rS rSr\rSrg) NameConstantii rm N)r r r r r r r rm r r r+ r+ i s Gr r+ c \ rS rSrSrS rSrg)Ellipsisil rm c U [ L a( SS KnUR S[ SS9 [ S/UQ70 UD6$ [ R
" U /UQ70 UD6$ )Nr z ast.Ellipsisr r .)
_ast_Ellipsisr r r r- r )r rI r r s r r Ellipsis.__new__o sZ - (A'
!
C1$1&1 1 5d5f55r N)r r r r rv r r rm r r r- r- l s G6r r- .c \ rS rSrSrSrg)slicei zDeprecated AST node class.rm Nr r r r r r rm r r r2 r2 s $r r2 c \ rS rSrSrS rSrg)Indexi z@Deprecated AST node class. Use the index value directly instead.c U$ r, rm )r r/ r s r r
Index.__new__ s r rm Nr r r r r r r rm r r r5 r5 s
Jr r5 c " \ rS rSrSrSS jrSrg)ExtSlicei z1Deprecated AST node class. Use ast.Tuple instead.rm c > [ [ U5 [ 5 40 UD6$ r, )r? rC Load)r dimsr s r r ExtSlice.__new__ s T$Z2622r N)rm r8 rm r r r: r: s
;3r r: r= c U R $ )z Deprecated. Use elts instead.rA r s r _dims_getterrB s yyr c Xl g r, r@ r r/ s r _dims_setterrE s r c \ rS rSrSrSrg)Suitei /Deprecated AST node class. Unused in Python 3.rm Nr3 rm r r rG rG 9r rG c \ rS rSrSrSrg)AugLoadi rH rm Nr3 rm r r rK rK rI r rK c \ rS rSrSrSrg)AugStorei rH rm Nr3 rm r r rM rM rI r rM c \ rS rSrSrSrg)Parami rH rm Nr3 rm r r rO rO rI r rO 1ec \ rS rSrSr\" 5 r\" 5 r\" 5 r\" 5 r \" 5 r
\" 5 r \" 5 r \" 5 r
\" 5 r\r\" 5 r\" 5 r\" 5 r\" 5 r\" 5 r\" 5 r\" 5 r\" 5 r\" 5 rS rSrg) _Precedencei z5Precedence table that originated from python grammar.c P U R U S- 5 $ ! [ a U s $ f = fNrb )r r rA s r next_Precedence.next s. >>$(+ + K s %%rm N)r r r r r r
NAMED_EXPRTUPLEYIELDTESTORANDNOTCMPEXPRBORBXORBANDSHIFTARITHTERMFACTORPOWERAWAITATOMrU r rm r r rR rR s ?J FE FE 6D
B
&C
&C
&C 6D
C 6D 6D FE FE 6D
VF FE FE 6Dr rR )'")z"""'''c ^ \ rS rSrSrS rS rS rS rSS jr S r
\ SS
j5 r \ S S .S j5 r
\ S
5 rS rS rS rS rS rS rU 4S jrS rS rS rS rS rS rS r S r S r S r S r S r!S! r"S" r#S# r$S$ r%S% r&S& r'S' r(S( r)S) r*S* r+S+ r,S, r-S- r.S. r/S/ r0S0 r1S1 r2S2 r3S3 r4S4 r5S5 r6S6 r7S7 r8S8 r9S9 r:S: r;S; rS> r?S? r@\AS@SA.SB jrB\ASC.SD jrCSE rDSSF jrESG rFSH rGSI rHSJ rISK rJSL rKSM rLSN rMSO rNSP rOSQ rPSR rQSS rRST rSSU rTSVSWSXSYSZ.rU\VR \VR \VR \VR S[.rYS\ rZSXSYS]S^S_S`SaSbScSdSeSfSgSh.
r[\VR \VR \VR \VR \VR \VR \VR \VR \VR \VR \VR \VR \VR Si.
rc\d" Sj5 reSk rfSlSmSnSoSpSqSrSsStSuSv.
rgSw rhSxSySz.ri\VR \VR S{.rlS| rmS} rnS~ roS rpS rqS rrS rsS rtS ruS rvS rwS rxS ryS rzS r{S r|S r}S r~S rS rS rS rS rSrU =r$ ) _Unparseri zMethods in this class recursively traverse an AST and
output source code for the abstract syntax; original formatting
is disregarded.c J / U l 0 U l 0 U l SU l SU l g )Nr F)_source _precedences
_type_ignores_indent _in_try_starrA s r r _Unparser.__init__ s( !r c [ U5 n U" [ U5 5 U H nU" 5 U" U5 M g! [ a gf = f)z7Call f on each item in seq, calling inter() in between.N)iterrU
StopIteration)r interfseqro s r
interleave_Unparser.interleave sG 3i
d3iL ! s 7
AAc ^ [ U5 S:X a U" US 5 T R S5 gT R U 4S jX5 g)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.rb r ,c & > T R S5 $ Nre writerA s r &_Unparser.items_view.. DJJt$4r N)rL r r| )r traverserr s ` r
items_view_Unparser.items_view s6 u:? eAh JJsO OO 4i Gr c J U R ( a U R S5 gg)z8Adds a newline if it isn't the start of generated sourcerc N)rp r rA s r
maybe_newline_Unparser.maybe_newline s << JJt r c f U R 5 U R SU R - U- 5 g)zPIndent a piece of text and append it, according to the current
indentation levelz N)r r rs r r s r fill_Unparser.fill
s*
6DLL(4/0r c : U R R U5 g)zAdd new source partsN)rp r} r s r r _Unparser.write s D!r Nc # N # Uc / nU R nXl Uv X l g 7fr, )rp )r bufferoriginal_sources r buffered_Unparser.buffered s' >F ,, & s #%extrac # # U R S5 U( a U R U5 U =R S-
sl Sv U =R S- sl g7f)zA 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.
:rb N)r rs )r r s r block_Unparser.block s@
3 JJu
s AAc # X # U R U5 Sv U R U5 g7f)zA context manager for preparing the source for expressions. It adds
*start* to the buffer and enters, after exit it adds *end*.Nr )r startends r delimit_Unparser.delimit, s!
5
3s (*c F U( a U R X5 $ [ 5 $ r, )r r )r r r conditions r
delimit_if_Unparser.delimit_if5 s <<+ + = r c L U R SSU R U5 U: 5 $ )z,Shortcut to adding precedence related parensrh ri )r get_precedence)r
precedencer& s r require_parens_Unparser.require_parens; s% sC)<) [ U[ 5 ( a U H nU R U5 M g [ TU ] U5 g r, )r rC traversesuperr )r r& r r s r r _Unparser.traverse[ s4 dD ! !
d#
GM$ r c h / U l U R U5 SR U R 5 $ )zzOutputs a source code string that, if converted back to an ast
(using ast.parse) will generate an AST equivalent to *node*rd )rp r r r s r r _Unparser.visite s*
dwwt||$$r c U R U5 =n( a0 U R U5 U R UR SS 5 g U R UR 5 g rT )r _write_docstringr r[ )r r& docstrings r "_write_docstring_and_traverse_body,_Unparser._write_docstring_and_traverse_bodyl sL //5 5I 5 ! !) , MM$))AB- ( MM$)) $r c UR Vs0 s H nUR SUR 3_M snU l U R U5 U R R 5 g s snf )Nignore) type_ignoresr# tagrr r clear)r r& r s r visit_Module_Unparser.visit_Modules se ++
+
MMVFJJ<0 0+
//5 "
s $A'c ^ T R SS5 T R U 4S jT R UR 5 S S S 5 T R S5 T R UR
5 g ! , ( d f N;= f)Nrh ri c & > T R S5 $ r r rA s r r ._Unparser.visit_FunctionType..~
4(r -> )r r| r argtypesr returnsr s ` r visit_FunctionType _Unparser.visit_FunctionType{ sX
\\#s
# OO($--
$
6
dll#
$
#s ,A55
Bc U R 5 U R [ R UR 5 U R UR 5 g r, )r r rR rY r/ r r s r
visit_Expr_Unparser.visit_Expr s5 K - -tzz:
djj!r c p U R [ R U5 U R [ R UR
UR 5 U R UR
5 U R S5 U R UR 5 S S S 5 g ! , ( d f g = f)Nz := ) r rR rW r ri targetr/ r r r s r visit_NamedExpr_Unparser.visit_NamedExpr sp
!7!7
> 0 0$++tzz J MM$++ & JJv MM$** % ?
>
>s A=B''
B5c ~ ^ T R S5 T R U 4S jT R UR 5 g )Nzimport c & > T R S5 $ r r rA s r r (_Unparser.visit_Import..
4 0r )r r| r namesr s ` r visit_Import_Unparser.visit_Import s( ) 0$--Lr c F ^ T R S5 T R SUR =( d S- 5 UR ( a T R UR 5 T R S5 T R U 4S jT R
UR 5 g )Nzfrom .r z import c & > T R S5 $ r r rA s r r ,_Unparser.visit_ImportFrom.. r r )r r rq moduler| r r r s ` r visit_ImportFrom_Unparser.visit_ImportFrom sd '
3$**/*+ ;; JJt{{ #
: 0$--Lr c X U R 5 UR HE nU R [ R U5 U R U5 U R
S5 MG U R UR 5 U R U5 =n( a U R
U5 g g )N = ) r targetsr rR rX r r r/ r )r r& r r s r visit_Assign_Unparser.visit_Assign s llF 1 16 : MM& ! JJu #
djj! 006 6< 6 JJ| $ 7r c U R 5 U R UR 5 U R SU R UR
R R - S- 5 U R UR 5 g )Nr z= ) r r r r binopr7 r r r/ r s r visit_AugAssign_Unparser.visit_AugAssign sZ
dkk"
3DGG$5$5$>$>??$FG
djj!r c U R 5 U R SSUR ( + =( a [ UR [
5 5 U R
UR 5 S S S 5 U R S5 U R
UR 5 UR ( a- U R S5 U R
UR 5 g g ! , ( d f Ny= f)Nrh ri r$ r )
r r r r r rG r r
annotationr/ r s r visit_AnnAssign_Unparser.visit_AnnAssign s
__S#4;;'X:dkkSW;X
Y MM$++ & Z
4
doo& :: JJu MM$** % Z
Ys C##
C1c U R S5 UR ( a- U R S5 U R UR 5 g g )Nreturnr )r r/ r r r s r visit_Return_Unparser.visit_Return s5 ( :: JJsO MM$** % r c & U R S5 g )Npassr r s r
visit_Pass_Unparser.visit_Pass s &r c & U R S5 g )Nbreakr r s r visit_Break_Unparser.visit_Break s 'r c & U R S5 g )Ncontinuer r s r visit_Continue_Unparser.visit_Continue s * r c ~ ^ T R S5 T R U 4S jT R UR 5 g )Nzdel c & > T R S5 $ r r rA s r r (_Unparser.visit_Delete.. r r )r r| r r r s ` r visit_Delete_Unparser.visit_Delete s( & 0$-- Nr c U R S5 U R UR 5 UR ( a- U R S5 U R UR 5 g g )Nzassert re )r r testr' r r s r visit_Assert_Unparser.visit_Assert sF )
dii 88 JJt MM$(( # r c ~ ^ T R S5 T R U 4S jT R UR 5 g )Nzglobal c & > T R S5 $ r r rA s r r (_Unparser.visit_Global.. r r r r| r r r s ` r visit_Global_Unparser.visit_Global s( ) 0$**djjIr c ~ ^ T R S5 T R U 4S jT R UR 5 g )Nz nonlocal c & > T R S5 $ r r rA s r r *_Unparser.visit_Nonlocal.. r r r r s ` r visit_Nonlocal_Unparser.visit_Nonlocal s( + 0$**djjIr c h U R [ R U5 U R S5 UR ( aV U R S5 U R [ R UR 5 U R UR 5 S S S 5 g ! , ( d f g = f)Nawaitr )r rR rh r r/ r ri r r s r visit_Await_Unparser.visit_Await l
!2!2D
9 JJw zz
3##K$4$4djjA
djj) :
9
9 A9B##
B1c h U R [ R U5 U R S5 UR ( aV U R S5 U R [ R UR 5 U R UR 5 S S S 5 g ! , ( d f g = f)Nyieldr )r rR rY r r/ r ri r r s r visit_Yield_Unparser.visit_Yield r! r" c \ U R [ R U5 U R S5 UR ( d [ S5 eU R
[ R UR 5 U R UR 5 S S S 5 g ! , ( d f g = f)Nz yield from z-Node can't be used without a value attribute.) r rR rY r r/ r r ri r r s r visit_YieldFrom_Unparser.visit_YieldFrom sm
!2!2D
9 JJ} %:: !PQQ 0 0$** = MM$** % :
9
9s A3B
B+c V U R S5 UR ( d UR ( a [ S5 eg U R S5 U R UR 5 UR ( a- U R S5 U R UR 5 g g )Nraisez*Node can't use cause without an exception.r z from )r exccauser r r r s r visit_Raise_Unparser.visit_Raise sn 'xxzz #MOO
3
dhh :: JJx MM$** % r c U R S5 U R 5 U R UR 5 S S S 5 UR H nU R U5 M UR
( aE U R S5 U R 5 U R UR
5 S S S 5 UR ( aF U R S5 U R 5 U R UR 5 S S S 5 g g ! , ( d f N= f! , ( d f Nw= f! , ( d f g = f)Ntryelsefinally)r r r r[ handlersorelse finalbody)r r& exs r do_visit_try_Unparser.do_visit_try s %
ZZ\ MM$)) $ --B MM" ;; IIf
dkk* >> IIi
dnn- \ s# D D)2 D:
D&)
D7:
Ec p U R n SU l U R U5 X l g ! X l f = f)NFrt r8 r r& prev_in_try_stars r visit_Try_Unparser.visit_Try s7 ,, 1 %D d # 0 0 - 5c p U R n SU l U R U5 X l g ! X l f = f)NTr; r< s r
visit_TryStar_Unparser.visit_TryStar s7 ,, 1 $D d # 0 0 r@ c U R U R ( a SOS5 UR ( a, U R S5 U R UR 5 UR
( a, U R S5 U R UR
5 U R
5 U R UR 5 S S S 5 g ! , ( d f g = f)Nzexcept*exceptr as )r rt r. r r r r r[ r s r visit_ExceptHandler _Unparser.visit_ExceptHandler s t 0 0)h? 99 JJsO MM$)) $ 99 JJv JJtyy !
ZZ\ MM$)) $ \\s / C
C"c ( U R 5 UR H% nU R S5 U R U5 M' U R SUR - 5 [ US5 ( a U R
UR 5 U R SSUR =( d UR S9 SnUR H/ nU( a U R S5 OS nU R U5 M1 UR H/ nU( a U R S5 OS nU R U5 M1 S S S 5 U R 5 U R U5 S S S 5 g ! , ( d f N9= f! , ( d f g = f)
N@zclass type_paramsrh ri )r Fre T)r decorator_listr r r r _type_params_helperrK r basesrJ r r r )r r& decocommaes r visit_ClassDef_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 >BE2F2
F
Fc ( U R US5 g )Ndef_function_helperr s r visit_FunctionDef_Unparser.visit_FunctionDef@ s dE*r c ( U R US5 g )Nz async defrV r s r visit_AsyncFunctionDef _Unparser.visit_AsyncFunctionDefC s dK0r c U R 5 UR H% nU R S5 U R U5 M' US- UR - nU R U5 [ US5 ( a U R
UR 5 U R SS5 U R UR 5 S S S 5 UR ( a, U R S5 U R UR 5 U R U R U5 S9 U R U5 S S S 5 g ! , ( d f N= f! , ( d f g = f)NrJ r rK rh ri r r )r rL r r r r rM rK r rI r r r r r )r r& fill_suffixrO def_strs r rW _Unparser._function_helperF s ''D IIcN MM$ ( #dii/ ' 4 ' ' $ $T%5%5 6
\\#s
# MM$)) $ $ << JJv MM$,, '
ZZd 3 3D 9Z
: 3 3D 9 ;
: $
#
;
:s ' E&E
E
E c ^ UbM [ U5 S: a= T R SS5 T R U 4S jT R U5 S S S 5 g g g ! , ( d f g = f)Nr rj rt c & > T R S5 $ r r rA s r r /_Unparser._type_params_helper..Z
4(8r )rL r r| r )r rK s ` r rM _Unparser._type_params_helperW sO "s;'7!'; c3' 8$--U (' (< "''s "A
A!c 0 U R UR 5 UR ( a, U R S5 U R UR 5 UR ( a- U R S5 U R UR 5 g g )Nr$ r )r r boundr
default_valuer s r
visit_TypeVar_Unparser.visit_TypeVar\ sa
499 :: JJt MM$** % JJu MM$,, - r c U R SUR - 5 UR ( a- U R S5 U R UR 5 g g )Nr r r r rh r r s r visit_TypeVarTuple _Unparser.visit_TypeVarTuplee sB
3?# JJu MM$,, - r c U R SUR - 5 UR ( a- U R S5 U R UR 5 g g )N**r rl r s r visit_ParamSpec_Unparser.visit_ParamSpeck sC
4$))#$ JJu MM$,, - r c U R S5 U R UR 5 U R UR 5 U R S5 U R UR 5 g )Nztype r )r r r rM rK r r/ r s r visit_TypeAlias_Unparser.visit_TypeAliasq sN '
dii !1!12
5
djj!r c ( U R SU5 g )Nzfor _for_helperr s r visit_For_Unparser.visit_Forx s &r c ( U R SU5 g )Nz
async for rw r s r visit_AsyncFor_Unparser.visit_AsyncFor{ s t,r c ~ U R U5 U R [ R UR 5 U R UR 5 U R
S5 U R UR 5 U R U R U5 S9 U R UR 5 S S S 5 UR ( aF U R S5 U R 5 U R UR 5 S S S 5 g g ! , ( d f Nf= f! , ( d f g = f)N in r r2 ) r r rR rX r r r rw r r r[ r5 )r r r& s r rx _Unparser._for_helper~ s $ K - -t{{;
dkk"
6
dii
ZZd 3 3D 9Z
: MM$)) $ ; ;; IIf
dkk* ;
: s ! D 7 D.
D+.
D<c U R S5 U R UR 5 U R 5 U R UR 5 S S S 5 UR
( a [
UR
5 S:X a [ UR
S [ 5 ( a UR
S nU R S5 U R UR 5 U R 5 U R UR 5 S S S 5 UR
( a= [
UR
5 S:X a$ [ UR
S [ 5 ( a M UR
( aF U R S5 U R 5 U R UR
5 S S S 5 g g ! , ( d f GNp= f! , ( d f N= f! , ( d f g = f)Nzif rb r zelif r2 ) r r r r r[ r5 rL r Ifr s r visit_If_Unparser.visit_If s1 %
dii
ZZ\ MM$)) $ kkc$++ .! 3
4;;q>SU8V8V;;q>D IIg MM$)) $
dii( kkc$++ .! 3
4;;q>SU8V8V ;; IIf
dkk* \
s# G8 G G%
G
G"%
G3c U R S5 U R UR 5 U R 5 U R UR 5 S S S 5 UR
( aF U R S5 U R 5 U R UR
5 S S S 5 g g ! , ( d f Nf= f! , ( d f g = f)Nzwhile r2 )r r r r r[ r5 r s r visit_While_Unparser.visit_While s (
dii
ZZ\ MM$)) $ ;; IIf
dkk* \ s B9 C
9
C
Cc $ ^ T R S5 T R U 4S jT R UR 5 T R T R U5 S9 T R UR 5 S S S 5 g ! , ( d f g = f)Nzwith c & > T R S5 $ r r rA s r r &_Unparser.visit_With.. r r r r r| r r r r r[ r s ` r
visit_With_Unparser.visit_With s] ' 0$--L
ZZd 3 3D 9Z
: MM$)) $ ;
:
: B
Bc $ ^ T R S5 T R U 4S jT R UR 5 T R T R U5 S9 T R UR 5 S S S 5 g ! , ( d f g = f)Nz async with c & > T R S5 $ r r rA s r r +_Unparser.visit_AsyncWith.. r r r r r s ` r visit_AsyncWith_Unparser.visit_AsyncWith s] - 0$--L
ZZd 3 3D 9Z
: MM$)) $ ;
:
:r F quote_typesescape_special_whitespacec ^^^ U4S jnSR [ UT5 5 mUnST; a U Vs/ s H of[ ; d M UPM nnU Vs/ s H ofT; d M
UPM nnU( d, [ T5 m[ U4S jU 5 TS 5 nTSS U/4$ T( aD UR U4S jS 9 US S TS :X a" [
US 5 S
:X d eTS S S - TS - mTU4$ s snf s snf )
z{Helper for writing string literals, minimizing escapes.
Returns the tuple (string literal to write, possible quote types).
c > T( d U S; a U $ U S:X d U R 5 ( d U R S5 R S5 $ U $ )Nz
\unicode_escapeascii) isprintabler r )r r s r escape_char2_Unparser._str_literal_helper..escape_char sD -fDy
xx 0188AAHr rd rc c 3 > ># U H nTS U; d M Uv M g7frl rm )rn qstrings r rr 0_Unparser._str_literal_helper.. s C[F1IN!![s
r rb r c > U S TS :H $ )Nr r rm )r escaped_strings r r /_Unparser._str_literal_helper.. s qt~b7I/Ir )r r Nr )r r@
_MULTI_QUOTESr| rU sortrL ) r r r r r possible_quotesr quoter s ` ` @r _str_literal_helper _Unparser._str_literal_helper s
[&!9:% > !*9 P/Q-=Oq/O P&5Qo.9P1oQ &\FC[CVAYOE!B<%( ( %I J q!!$r(::?1-.!333!/!4t!;nR>P!P ..# QQs
C%C% C*C*r c ^ U R XS9u pUS nU R U U U 35 g)zKWrite string literal value with a best effort attempt to avoid backslashes.r r N)r r )r r r
quote_types r _write_str_avoiding_backslashes)_Unparser._write_str_avoiding_backslashes s: " 6 6v 6 W ^
j\&* 67r c U R S5 / nUR H] nU R 5 nU R U5 S S S 5 UR SR W5 [
U[ 5 45 M_ / n[ [ 5 nSnU H u p8U( a9 U R UUSS9u p9[ U 5 R U5 ( a Sn OfU nONSU; a& U V
s/ s H o[ ; d M U
PM nn
U( d eU V
s/ s H oU; d M
U
PM n n
U ( a U nUR U5 M U( az S/nUR 5 U Ha u p8U( aD [ SU- 5 nS n UR! U 5 ( d [ U5 5 eU[# U 5 S
nUR U5 Mc SR U5 nUS n U R U U U 35 g ! , ( d f GN= fs sn
f s sn
f ) Nrz rd FTr rc rl rk z'"r r )r rN r _write_fstring_innerr{ r r r- rC _ALL_QUOTESr r>
isdisjointr r r| r rL )
r r&
fstring_partsr/ r new_fstring_partsr fallback_to_repr is_constantnew_quote_typesr expected_prefixr s
r visit_JoinedStr_Unparser.visit_JoinedStr s
3
[[E F))%0 ! *UH"=>
! ;' "/ E)-)A)A +.2 *B *&
'22;??'+$ - 5=.9"Pk-=O1kK"P&&;.9"Lke^1k"L""1K $ $U +' #0* !'K # # %&3" u -E&+O ++O<<Id5kI< !#o"6r :E!((/
'4 )* ^
j\% 56[ ! , #Q #Ms# G-%
G?6G? HH-
G< c ` [ U[ 5 ( a# UR H nU R X2S9 M g [ U[ 5 ( a [ UR
[ 5 ( a UR
R SS5 R SS5 nU( aH UR SS5 nUR SS 5 nUR S
S 5 nUR S S
5 nU R U5 g [ U[ 5 ( a U R U5 g [ SU< 35 e)Nis_format_spec{z{{}z}}r z\\rj z\'rk z\"rc z\nz"Unexpected node inside JoinedStr, ) r JoinedStrrN r r- r/ rX replacer FormattedValuevisit_FormattedValuer )r r& r r/ s r r _Unparser._write_fstring_inner s dI & & ))%)O %
h
'
'Jtzz3,G,GJJ&&sD199#tDE
dF3
c51
c51
dE2 JJu
n
-
- % %d + A$ JK Kr c ^ U 4S jnT R SS5 U" UR 5 nUR S5 ( a T R S5 T R U5 UR S:w a' T R S[ UR 5 35 UR ( a+ T R S5 T R UR SS 9 S S S 5 g ! , ( d f g = f)
Nc > [ T5 " 5 nUR [ R R 5 U 5 UR U 5 $ r, )r. r rR rZ rU r )innerunparserr s r
unparse_inner5_Unparser.visit_FormattedValue..unparse_inner' s< Dz|H # #K$4$4$9$9$;U C>>%( (r r r r r !r Tr )r r/ r r
conversionchr format_specr )r r& r exprs ` r r _Unparser.visit_FormattedValue& s )
\\#s
# ,Ds##
3 JJt "$
Qs4?? 3 456
3))$*:*:4)P $
#
#s B>C!!
C/c : U R UR 5 g r, )r rH r s r
visit_Name_Unparser.visit_Name8 s
477r c U R 5 UR S:X a U R S5 U R UR [
S9 g )Nur )r kindr r r/ r r s r r _Unparser._write_docstring; s9 99 JJsO ,,TZZ],Sr c
[ U[ [ 45 ( aN U R [ U5 R S[ 5 R SS[ S[ S35 5 g U R [ U5 5 g )Ninfnanrh -ri )r r1 r2 r r| r _INFSTRrD s r _write_constant_Unparser._write_constantA sb eeW - . .
JJU (!G9AgYa 89
JJtE{ #r c ~ UR n[ U[ 5 ( a8 U R SS5 U R U R
U5 S S S 5 g USL a U R
S5 g UR S:X a U R
S5 U R UR 5 g ! , ( d f g = f)Nrh ri ....r )r/ r r r r r r r )r r& r/ s r r _Unparser.visit_ConstantM s
eU # # c3' 4 4e< ('
c\ JJu yyC
3 , ('s B..
B<c ^ T R SS5 T R U 4S jT R UR 5 S S S 5 g ! , ( d f g = f)Nrj rt c & > T R S5 $ r r rA s r r &_Unparser.visit_List..[ r r )r r| r rA r s ` r
visit_List_Unparser.visit_ListY s6
\\#s
# OO 4dmmTYY O $
#
# ,A
Ac U R SS5 U R UR 5 UR H nU R U5 M S S S 5 g ! , ( d f g = f)Nrj rt r r elt
generatorsr r& gens r visit_ListComp_Unparser.visit_ListComp] F
\\#s
# MM$(( #
c" ' $
#
# A A
A*c U R SS5 U R UR 5 UR H nU R U5 M S S S 5 g ! , ( d f g = f)Nrh ri r r s r visit_GeneratorExp _Unparser.visit_GeneratorExpc r r c U R SS5 U R UR 5 UR H nU R U5 M S S S 5 g ! , ( d f g = f)Nr r r r s r
visit_SetComp_Unparser.visit_SetCompi r r c 2 U R SS5 U R UR 5 U R S5 U R UR 5 UR
H nU R U5 M S S S 5 g ! , ( d f g = f)Nr r r$ )r r r r r/ r r s r visit_DictComp_Unparser.visit_DictCompo sb
\\#s
# MM$(( # JJt MM$** %
c" ' $
#
#s A,B
Bc @ UR ( a U R S5 OU R S5 U R [ R UR
5 U R
UR
5 U R S5 U R " [ R R 5 UR /UR Q76 U R
UR 5 UR H% nU R S5 U R
U5 M' g )Nz async for z for r if ) is_asyncr r rR rX r r rZ rU rw ifs)r r& if_clauses r visit_comprehension _Unparser.visit_comprehensionw s == JJ} % JJw K - -t{{;
dkk"
6 K , , 1 1 3TYYJJ
dii I JJv MM) $ "r c 8 U R [ R U5 U R [ R R 5 UR
UR 5 U R UR
5 U R S5 U R UR 5 U R S5 U R [ R UR 5 U R UR 5 S S S 5 g ! , ( d f g = f)Nr z else )
r rR rZ r rU r[ r r r r5 r s r visit_IfExp_Unparser.visit_IfExp s
!1!14
8 0 0 5 5 7DII N MM$)) $ JJv MM$)) $ JJx 0 0$++ > MM$++ & 9
8
8s C!D
Dc ^ UR ( aG T R SS5 T R U 4S jT R UR 5 S S S 5 g T R S5 g ! , ( d f g = f)Nr r c & > T R S5 $ r r rA s r r %_Unparser.visit_Set.. rd r z{*()})rA r r| r r r s ` r visit_Set_Unparser.visit_Set sP 99 c3' 8$--S ('
JJw ('s ,A,,
A:c ^ ^ U 4S jmU U4S jnT R SS5 T R U 4S jU[ UR UR 5 5 S S S 5 g ! , ( d f g = f)Nc l > TR U 5 TR S5 TR U5 g Nr$ r r )kvr s r write_key_value_pair2_Unparser.visit_Dict..write_key_value_pair s' MM! JJt MM! r c > U u pUcC TR S5 TR [ R U5 TR U5 g T" X5 g )Nrp )r r rR r_ r )r r r r r s r
write_item(_Unparser.visit_Dict..write_item sG DAy
4 ##K$4$4a8
a $Q*r r r c & > T R S5 $ r r rA s r r &_Unparser.visit_Dict.. r r )r r| rP rM rN )r r& r r s ` @r
visit_Dict_Unparser.visit_Dict sK
+ \\#s
# OO(*c$))T[[6Q
$
#
#s 6A!!
A/c ( U R SS[ UR 5 S:H =( d" U R U5 [ R
: 5 U R
U R UR 5 S S S 5 g ! , ( d f g = f)Nrh ri r )r rL rA r rR rX r r r s r visit_Tuple_Unparser.visit_Tuple sg
__ Na P4#6#6t#<{?P?P#P
OODMM499 5
s 'B
B~not+r )InvertNotr8 r9 )r r r r c U R UR R R nU R U nU R X15 U R
U5 U[ R La U R
S5 U R X1R 5 U R UR 5 S S S 5 g ! , ( d f g = fNr ) unopr7 r r unop_precedencer r rR rf r r: r )r r& operatoroperator_precedences r
visit_UnaryOp_Unparser.visit_UnaryOp s 99TWW . . 7 78 " 2 28 <
!4
; JJx #+*<*<<
3 3\\ B MM$,, ' <
;
;s
A,C
Cr rJ /%<<>>|^&//rp )
rR rS MultMatMultDivModLShiftRShiftBitOrBitXorBitAndFloorDivPow)
r r r rJ r+ r, r- r. r/ r0 r1 r2 rp )rp c < U R UR R R nU R U nU R X15 X R ; a UR 5 nUnOUnUR 5 nU R XAR 5 U R UR 5 U R SU S35 U R XQR 5 U R UR 5 S S S 5 g ! , ( d f g = fr$ )
r r7 r r binop_precedencer binop_rassocrU r rT r r rU )r r& r' r( left_precedenceright_precedences r visit_BinOp_Unparser.visit_BinOp s ::dgg / / 8 89 " 3 3H =
!4
;,,,"5":":"<#6 "5#6#;#;#= ; MM$)) $ JJ8*A ' 0** = MM$** % <
;
;s
B6D
Dz==z!=z>=iszis notinznot in)
EqNotEqLtLtEGtGtEIsIsNotInNotInc U R [ R U5 U R " [ R R 5 UR
/UR Q76 U R UR
5 [ UR UR 5 HN u p#U R SU R UR R - S- 5 U R U5 MP S S S 5 g ! , ( d f g = fr$ )r rR r^ r rU rT comparatorsr rP opsr cmpopsr r )r r& orQ s r
visit_Compare_Unparser.visit_Compare s
$
7 4 4 6 UDDTDT U MM$)) $DHHd&6&67
3Q[[-A-A!BBSHI
a 8 8
7
7s CC<<
D
andor)AndOr)rZ r[ c 6 ^ ^^ T R UR R R nT R U mUU 4S jnT R TU5 SU S3mT R
UU 4S jX1R 5 S S S 5 g ! , ( d f g = f)Nc l > TR 5 mTR TU 5 TR U 5 g r, )rU r r )r& r( r s r increasing_level_traverse9_Unparser.visit_BoolOp..increasing_level_traverse s/ "5":":"< 3T : MM$ r r c & > TR T 5 $ r, r )r' r s r r (_Unparser.visit_BoolOp.. s
DJJqMr )boolopsr7 r r boolop_precedencer r| rN )r r& r' r` r( r' s ` @@r visit_BoolOp_Unparser.visit_BoolOp sw << 1 1 : :; " 4 4X >
!4d
;H:QA OO 13Lkk Z <
;
;s (B
Bc U R [ R UR 5 U R UR 5 [ UR [ 5 ( a: [ UR R [ 5 ( a U R S5 U R S5 U R UR 5 g )Nr r )
r rR ri r/ r r r- r0 r r r s r visit_Attribute_Unparser.visit_Attribute" s{ K , ,djj9
djj! djj( + +
4::;K;KS0Q0Q JJsO
3
499 r c U R [ R UR 5 U R UR 5 U R SS5 SnUR H/ nU( a U R S5 OSnU R U5 M1 UR H/ nU( a U R S5 OSnU R U5 M1 S S S 5 g ! , ( d f g = f)Nrh ri Fre T) r rR ri rF r r rI r rJ )r r& rP rQ s r
visit_Call_Unparser.visit_Call- s K , ,dii8
dii
\\#s
#EYYJJt$ E
a ]]JJt$ E
a # $
#
#s
BC""
C0c S nU R [ R UR 5 U R UR 5 U R SS5 U" UR 5 ( a1 U R U R UR R 5 OU R UR 5 S S S 5 g ! , ( d f g = f)Nc H [ U [ 5 =( a U R $ r, )r r? rA ) slice_values r is_non_empty_tuple5_Unparser.visit_Subscript..is_non_empty_tuple@ s ;. % $$
r rj rt ) r rR ri r/ r r r2 r rA )r r& rq s r visit_Subscript_Unparser.visit_Subscript? s
K , ,djj9
djj!
\\#s
#!$**--
tzz?
djj) $
#
#s
A$C
Cc U R S5 U R [ R UR 5 U R UR 5 g )Nr )r r rR r_ r/ r r s r
visit_Starred_Unparser.visit_StarredO s7
3 K , ,djj9
djj!r c & U R S5 g )Nr r r s r visit_Ellipsis_Unparser.visit_EllipsisT s
5r c R UR ( a U R UR 5 U R S5 UR ( a U R UR 5 UR ( a- U R S5 U R UR 5 g g )Nr )lowerr r upperstepr s r visit_Slice_Unparser.visit_SliceW sb :: MM$** %
3 :: MM$** % 99 JJsO MM$)) $ r c U R S5 U R UR 5 U R 5 UR H nU R U5 M S S S 5 g ! , ( d f g = f)Nzmatch )r r subjectr cases)r r& cases r visit_Match_Unparser.visit_Matcha sK (
dll#
ZZ\
d# # \\s %A++
A9c U R UR 5 UR ( a- U R S5 U R UR 5 g g r )r argr r r s r visit_arg_Unparser.visit_argh s:
488 ?? JJt MM$// * r c SnUR UR - nS /[ U5 [ UR 5 -
- UR - n[ [ X45 S5 H u pVUu pxU( a SnOU R
S5 U R U5 U( a" U R
S5 U R U5 U[ UR 5 :X d My U R
S5 M UR ( d UR ( a U( a SnOU R
S5 U R
S5 UR ( av U R
UR R 5 UR R ( a6 U R
S5 U R UR R 5 UR ( av [ UR UR 5 HR u pxU R
S5 U R U5 U( d M0 U R
S5 U R U5 MT UR ( a U( a SnOU R
S5 U R
S UR R - 5 UR R ( a7 U R
S5 U R UR R 5 g g g )
NTrb Fre rg z, /r r$ rp ) posonlyargsrI rL defaultsr rP r r vararg
kwonlyargsr r kw_defaultskwarg) r r& r all_argsr r elementsads r visit_arguments_Unparser.visit_argumentsn s ##dii/6S]S -? ?@4==P (X)@! DOEDA
4 MM!
3
a D , ,--
5! E ;;$//
4 JJsO{{
4;;??+;;))JJt$MM$++"8"89 ??DOOT-=-=>
4
a 1JJsOMM!$ ? ::
4 JJtdjjnn, -zz$$
4
djj 3 34 %
r c UR c U R S5 O,U R UR 5 U R S5 U R UR 5 g )Nrp rg )r r r r/ r s r
visit_keyword_Unparser.visit_keyword sC 88 JJt JJtxx JJsO
djj!r c U R [ R U5 U R S5 U R 5 nU R UR 5 S S S 5 W( a U R " S/UQ76 U R S5 U R [ R UR 5 U R UR 5 S S S 5 g ! , ( d f N= f! , ( d f g = f)Nlambdar r$ ) r rR rZ r r r rI r r[ )r r& r s r visit_Lambda_Unparser.visit_Lambda s
!1!14
8 JJx F
dii( !
3(( JJt 0 0$)) < MM$)) $ 9
8 9
8s$ "C1 C A8C1
C. *C11
C?c U R UR 5 UR ( a U R SUR - 5 g g NrF )r r asnamer s r visit_alias_Unparser.visit_alias s3
499 ;; JJv + , r c U R UR 5 UR ( a- U R S5 U R UR 5 g g r )r context_expr
optional_varsr r s r visit_withitem_Unparser.visit_withitem s@
d''( JJv MM$,, - r c ` U R S5 U R UR 5 UR ( a, U R S5 U R UR 5 U R 5 U R UR 5 S S S 5 g ! , ( d f g = f)Nzcase r )r r patternguardr r r[ r s r visit_match_case_Unparser.visit_match_case sd '
dll# :: JJv MM$** %
ZZ\ MM$)) $ \\s : B
B-c : U R UR 5 g r, )r r/ r s r visit_MatchValue_Unparser.visit_MatchValue s
djj!r c : U R UR 5 g r, )r r/ r s r visit_MatchSingleton _Unparser.visit_MatchSingleton s TZZ(r c ^ T R SS5 T R U 4S jT R UR 5 S S S 5 g ! , ( d f g = f)Nrj rt c & > T R S5 $ r r rA s r r /_Unparser.visit_MatchSequence.. r r )r r| r patternsr s ` r visit_MatchSequence _Unparser.visit_MatchSequence s8
\\#s
# OO($--
$
#
#r c N UR nUc SnU R SU 35 g )N_r )r r )r r& r s r visit_MatchStar_Unparser.visit_MatchStar s' yy <D
Qtf: r c J ^ U 4S jnT R SS5 UR nT R U 4S jU[ X1R SS95 UR
nUb, U( a T R
S5 T R
SU 35 S S S 5 g ! , ( d f g = f) Nc t > U u pTR U5 TR S5 TR U5 g r r )pairr pr s r write_key_pattern_pair<_Unparser.visit_MatchMapping..write_key_pattern_pair s. DA MM! JJt MM! r r r c & > T R S5 $ r r rA s r r ._Unparser.visit_MatchMapping.. r r Tstrictre rp )r rM r| rP r restr )r r& r rM r s ` r visit_MatchMapping _Unparser.visit_MatchMapping s \\#s
#99D OO(&D--5
99D JJt$
Rv;' $
#
#s A1B
B"c ^ T R [ R UR 5 T R UR 5 T R SS5 UR nT R U 4S jT R U5 UR nU( aG U 4S jnU( a T R S5 T R U 4S jU[ X1R SS95 S S S 5 g ! , ( d f g = f) Nrh ri c & > T R S5 $ r r rA s r r ,_Unparser.visit_MatchClass.. r r c X > U u pTR U S35 TR U5 g )Nrg )r r )r r r r s r write_attr_pattern6_Unparser.visit_MatchClass..write_attr_pattern s( $(MDJJ$qz*MM'*r re c & > T R S5 $ r r rA s r r r s DJJt ,r Tr ) r rR ri r r r r r| kwd_attrsr rP kwd_patterns)r r& r attrsr s ` r visit_MatchClass_Unparser.visit_MatchClass s K , ,dhh7
dhh
\\#s
#}}H OO($--
NNE+
JJt$,& 0 0> $
#
#s
BC**
C8c UR nUR nUc U R S5 g Uc U R UR 5 g U R [ R
U5 U R
[ R UR 5 U R UR 5 U R SUR 35 S S S 5 g ! , ( d f g = f)Nr rF ) r r r r rR rZ r r` r )r r& r r s r
visit_MatchAs_Unparser.visit_MatchAs s yy,, < JJsO
_ JJtyy !$$[%5%5t<##KOOT\\B
dll+
T$))-. =< T R S5 $ )Nz | r rA s r r )_Unparser.visit_MatchOr.. s DJJu$5r )r rR r` r rU r r| r r s ` r
visit_MatchOr_Unparser.visit_MatchOr s`
$
7 4 4 6 G G OO 5t}}dmm T 8
7
7s A%B
B )rt rs rq rp rr )rd r, )F)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. r8 r> rB rG rR rX r[ rW rM ri rm rq rt ry r| rx 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% rR r] rf r& r) r rd re rc r` ra rb rg r? frozensetr@ rC rV rX rd r\ r[ re rf ri rl rs rv ry r r r r r r r r r r r r r r r r r r
__classcell__)r s @r rn rn s "
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" %-
. %") ((. /U Ur rn c 8 [ 5 nUR U 5 $ r, )rn r )ast_objr s r unparser s {H >>' ""r )r r% r) r+ r- c U [ ; a4 [ U =[ 5 U ' nSS KnUR SU 3[ SS9 U$ [ SU S35 e)Nr r r r z module 'ast' has no attribute 'rj )_deprecated_globalsglobalsr r r rw )r r/ r s r __getattr__r ! s` """5d";; $% 4&M#rb)r
)r r^ )argparseArgumentParser add_argumentr0
parse_argsr sysstdinr readopenr r no_type_commentsprintr r r^ )r parserrI r r r trees r mainr , sO
$
$/
$
:F
S C E
h G G I ,d= H J
4\ . / jsA F H D {{c!!&&({{
$++t
$[[]F % yy8M8M ND $t(?(?
TU %
$s !E
E__main__)z r )TF)rb )Tr, )Xr r re_ast
contextlibr r enumr r r r r] r r r r r r r r r r r r r rz r r r r r r- r r r r
propertyr r' r. r r r r% r) r+ r- r/ r0 r1 r2 rX bytesboolr r r ru r2 r5 r: r? rB rE r= modrG expr_contextrK rM rO r|
float_info
max_10_expr rR _SINGLE_QUOTESr r rn r r popr r r r )r s 0r r s0 , 2 , ,H tbH08$x 49Q EQ h" 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 >
// / rU rUh!# DC ')--
C
DV8 zF Ys
!I