o
9j @ s d Z ddlZddlT ddlmZmZ ddlmZmZ d`ddd d
d Z d d
Z
daddddZ dd Z dd Z
dbddZdd Zdd Zdcd d Zd d Zd!d" Zdd#d$d%Zd&d' ZG d(d) d)eZG d*d+ d+eZeed,sd-d. Zd/d0 Z e ee e_ e ee e_ G d1d2 d2e Z!d3d4 Z"G d5d6 d6ee!d7Z#G d8d9 d9ee!d7Z$G d:d; d;ee!d7Z%G dd? d?ee!d7Z'e#e(e)e*fe$e+fe%e,fe&e de-fe'e d@fiZ.e#e-fiZ/e-d=e dd=e(d6e)d6e*d6e+d9e,d;e d@d?iZ0G dAdB dBe1Z2G dCdD dDe2Z3G dEdF dFe2Z4ee5dGs"dHdI Z6dJdK Z7e e6e7e5_8G dLdM dMe9Z:G dNdO dOe;ZdTe?ej@jAd ZBG dUdV dVeZCdWZDdXZEg eDeER ZFG dYdZ dZeZGd[d\ ZHd]d^ ZIeJd_kryeI dS dS )daH
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 execF)
type_commentsfeature_versionc C sR t }|r|tO }t|tr|\}}|dksJ |}n|du r d}t| ||||dS )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.
N)_feature_version)
PyCF_ONLY_ASTPyCF_TYPE_COMMENTS
isinstancetuplecompile)sourcefilenamemoder r
flagsmajorminor r /usr/lib/python3.10/ast.pyparse! s
r c sf t | trt| ddd} t | tr| j} dd fddfdd fd
d | 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 S s4 d}t | dd }r|d| 7 }t|d| )Nzmalformed node or stringlinenoz on line : )getattr
ValueError)nodemsglnor r r _raise_malformed_nodeC s z+literal_eval.._raise_malformed_nodec s, t | trt| jtttfvr | | jS N)r Constanttypevalueintfloatcomplexr" )r% r r _convert_numH s z"literal_eval.._convert_numc sD t | tr t | jttfr | j}t | jtr|
S | S | S r& )r UnaryOpopUAddUSuboperand)r" r3 )r. r r _convert_signed_numL s
z)literal_eval.._convert_signed_numc sL t | tr| jS t | trtt | jS t | tr"tt | jS t | t r/t
t | jS t | t rOt | j t
rO| j jdkrO| j| j krNg krOt
S t | trqt| jt| jkrb| ttt | jt | jS t | trt | jttfr| j}| j }t |t t frt |t rt | jtr|| S || S | S )Nset) r r' r) Tupler mapeltsListlistSetr5 CallfuncNameidargskeywordsDictlenkeysvaluesdictzipBinOpr0 AddSubleftrightr* r+ r, )r" rK rL _convertr. r4 r% r r rN T s4
"
z literal_eval.._convert)r strr lstrip
Expressionbody)node_or_stringr rM r literal_eval6 s
rT T)indentc sT d fdd t | tstd| jj dur$t ts$d | 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 s d ur d7 d }d }nd}d}t | trt| }g }d}}| jD ]@}zt| |} W n ty? d}Y q+w | d u rOt||dd u rOd}q+| \} }
|oY|
}|rf|d|| f q+|| q+r| jr| jD ]4}zt| |} W n ty Y qtw | d u rt||dd u rqt| \} }
|o|
}|d|| f qt|rt|d krd
| j j
d |f | fS d | j j
|| |f d fS t | t r| sd
S d|| fdd| D f d fS t
| dfS )N
z,
, T.z%s=%sr z%s(%s)z%s(%s%s)F)z[]Tz[%s%s]c 3 s | ]
} |d V qdS r Nr ).0x)_formatlevelr r s z(dump.._format..)r ASTr( _fieldsr AttributeErrorappend _attributesrC __class____name__joinr: repr) r" r^ prefixsepclsr@ allsimplerA namer) simpler] annotate_fieldsinclude_attributesrU )r^ r r] } s\
& zdump.._formatzexpected AST, got %rN )r )r r` TypeErrorre rf rO )r" rp rq rU r ro r dumpq s
0 rt c C sV dD ]&}||j v r(|| j v r(t||d}|dus"t||r(|dr(t| || q| 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_)rd r hasattr
startswithsetattr)new_nodeold_nodeattrr) r r r
copy_location s r c s fdd | 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 s d| j v rt| ds|| _n| j}d| j v r%t| dd d u r"|| _n| j}d| j v r6t| ds3|| _n| j}d| j v rJt| dd d u rG|| _n| j}t| D ]
} ||||| qNd S )Nr rv ru rw )rd ry r r rv ru rw iter_child_nodes)r" r ru rv rw child_fixr r r s&
z#fix_missing_locations.._fixrV r r r- r r r fix_missing_locations s r rV c C st t | D ]3}t|trt|dd| |_qd|jv r#t|dd| |_d|jv r7t|dd }dur7|| |_q| 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 rv N)walkr
TypeIgnorer r rd rv )r" nr rv r r r increment_lineno s
r c c s8 | j D ]}z
|t| |fV W q ty Y qw dS )zs
Yield a tuple of ``(fieldname, value)`` for each field in ``node._fields``
that is present on *node*.
N)ra r rb )r" fieldr r r iter_fields s
r c c sN t | D ] \}}t|tr|V qt|tr$|D ]
}t|tr#|V qqdS )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 r` r: )r" rm r itemr r r r s
r c C s t | ttttfstd| jj | jr t | jd t s dS | jd j
} t | t r-| j }nt | t
r|| || S |rOt|| d| }nd}||| |d } || d| }
||d | }| d| |
|
d |S )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.
NrV rX r ) rv rw r ru rb r encodedecoder insertrc rg ) r r" r r rv ru rw r paddingfirstlastr r r get_source_segmentW s,
r c c sD ddl m} || g}|r | } |t| | V |sdS dS )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 todor r r r | s
r c @ s( e Zd ZdZdd Zdd Zdd ZdS ) 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 C s" d|j j }t| || j}||S )z
Visit a node.visit_)re rf r
generic_visit)selfr" methodvisitorr r r visit s zNodeVisitor.visitc C sT t |D ]#\}}t|tr |D ] }t|tr| | qqt|tr'| | qdS )z9Called if no explicit visitor function exists for a node.N)r r r: r` r )r r" r r) r r r r r s
zNodeVisitor.generic_visitc C s |j }tt|}|d u r t D ]
\}}t||r |} nq|d urKd| }zt| |}W n ty8 Y nw dd l}| | dt
d ||S | |S )Nr r z" is deprecated; add visit_Constant ) r) _const_node_type_namesgetr( itemsr r rb warningswarnDeprecationWarningr ) r r" r) type_namerk rm r r r r r r visit_Constant s*
zNodeVisitor.visit_ConstantN)rf
__module__ __qualname____doc__r r r r r r r r s
r c @ e Zd ZdZdd ZdS )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 C s t |D ]P\}}t|tr:g }|D ]!}t|tr-| |}|d u r"qt|ts-|| q|| q||d d < qt|trT| |}|d u rNt|| qt||| q|S r& ) r r r: r` r r rc delattrr{ )r r" r old_value
new_valuesr) r| r r r r s(
z NodeTransformer.generic_visitN)rf r r r r r r r r r s #r r c C | j S )z Deprecated. Use value instead.r) r r r r _getter r c C
|| _ d S r& r r r) r r r _setter
r c @ s e Zd Zdd Zdd ZdS )_ABCc G s
d| _ d S )Nz3Deprecated AST node class. Use ast.Constant instead)r )rk r@ r r r __init__ r z
_ABC.__init__c C sd t |tsdS | tv r,z|j}W n
ty Y dS w t |t| o+t |t| d S t| |S )NFr ) r r' _const_typesr) rb _const_types_notr r( __instancecheck__)rk instr) r r r r s
z_ABC.__instancecheck__N)rf r r r r r r r r r s r c O sp |D ] }|| j vr
q| j |}|t|k r t| j d|q| tv r,t|i |S tj| g|R i |S )Nz" got multiple values for argument )ra indexrC rs rf r r' __new__)rk r@ kwargskeyposr r r _new" s
r c @ e Zd ZdZeZdS )Num)r Nrf r r ra r r r r r r r . r ) metaclassc @ r )r r Nr r r r r r 2 r r c @ r )Bytesr Nr r r r r r 6 r r c @ s e Zd ZeZdS ) NameConstantN)rf r r r r r r r r r : r c @ r )Ellipsisr c O s6 | t u rtdg|R i |S tj| g|R i |S )N.)r r' r )rk r@ r r r r r @ s zEllipsis.__new__N)rf r r ra r r r r r r = s r .c @ e Zd ZdZdS )slicezDeprecated AST node class.Nrf r r r r r r r r [ r r c @ r )Indexz@Deprecated AST node class. Use the index value directly instead.c K s |S r& r )rk r) r r r r r ` s z
Index.__new__Nrf r r r r r r r r r ^ s r c @ s e Zd ZdZdddZdS )ExtSlicez1Deprecated AST node class. Use ast.Tuple instead.r c K s t t|t fi |S r& )r6 r: Load)rk dimsr r r r r e s zExtSlice.__new__N)r r r r r r r c s r r c C r )z Deprecated. Use elts instead.r8 r r r r _dims_getterm r r c C r r& r r r r r _dims_setterq r r c @ r )Suite/Deprecated AST node class. Unused in Python 3.Nr r r r r r v r r c @ r )AugLoadr Nr r r r r r y r r c @ r )AugStorer Nr r r r r r | r r c @ r )Paramr Nr r r r r r r r 1ec @ s e Zd ZdZe Ze Ze Ze Ze Z e Z
e Z e Z e Z
e Ze Ze Ze Ze Ze Ze Ze Ze Zdd ZdS ) _Precedencez5Precedence table that originated from python grammar.c C s( z| | d W S ty | Y S w NrV )re r! r r r r next s
z_Precedence.nextN)rf r r r r TUPLEYIELDTESTORANDNOTCMPEXPRBORBXORBANDSHIFTARITHTERMFACTORPOWERAWAITATOMr r r r r r s* r )'")z"""z'''c s e Zd ZdZddddZdd Zdd Zd
d Zdd
dZdd Z dd Z
e dd Z e
ddddZe
dd Zdd Zd d Zd d Zd!d" Zd#d$ Zd%d& Z fd'd(Zd)d* Zd+d, Zd-d. Zd/d0 Zd1d2 Zd3d4 Z d5d6 Z d7d8 Z d9d: Z d;d< Z d=d> Z!d?d@ Z"dAdB Z#dCdD Z$dEdF Z%dGdH Z&dIdJ Z'dKdL Z(dMdN Z)dOdP Z*dQdR Z+dSdT Z,dUdV Z-dWdX Z.dYdZ Z/d[d\ Z0d]d^ Z1d_d` Z2dadb Z3dcdd Z4dedf Z5dgdh Z6didj Z7dkdl Z8dmdn Z9dodp Z:e;ddqdrdsZdydz Z?d{d| Z@d}d~ ZAdd ZBdd ZCdd ZDdd ZEdd ZFdd ZGdd ZHdd ZIdd ZJdd ZKdd ZLdd ZMdd ZNdd ZOdd ZPdddddZQeRjSeRjTeRjTeRjTdZUdd ZVdddddddddddddd
ZWeRjXeRjXeRjYeRjYeRjYeRjYeRjZeRjZeRj[eRj\eRj]eRjYeRj^d
Z_e`dZadd Zbddddddddddd
Zcdd ZddddĜZeeRjfeRjgdŜZhddDŽ ZiddɄ Zjdd˄ Zkdd̈́ Zlddτ Zmddф Znddӄ ZoddՄ Zpddׄ Zqddل Zrddۄ Zsdd݄ Ztdd߄ Zudd Zvdd Zwdd Zxdd Zydd Zzdd Z{dd Z|dd Z}dd Z~dd Z ZS ) _UnparserzMethods in this class recursively traverse an AST and
output source code for the abstract syntax; original formatting
is disregarded.F_avoid_backslashesc C s( g | _ g | _i | _i | _d| _|| _d S )Nr )_source_buffer _precedences
_type_ignores_indentr )r r r r r r s
z_Unparser.__init__c C sJ t |}z|t| W n
ty Y dS w |D ] }| || qdS )z7Call f on each item in seq, calling inter() in between.N)iterr
StopIteration)r interfseqr\ r r r
interleave s
z_Unparser.interleavec s@ t |dkr||d d dS fdd|| dS )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.rV r ,c
dS NrY writer r r r
z&_Unparser.items_view..N)rC r r )r traverserr r r r
items_view s z_Unparser.items_viewc C s | j r
| d dS dS )z8Adds a newline if it isn't the start of generated sourcerW N)r r r r r r
maybe_newline s z_Unparser.maybe_newlinerX c C s | | d| j | dS )zXIndent a piece of text and append it, according to the current
indentation levelz N)r# r r r r r r r fill s z_Unparser.fillc C s | j | dS )zAppend a piece of textN)r rc r$ r r r r s z_Unparser.writec C s | j | d S r& )r rc r$ r r r
buffer_writer z_Unparser.buffer_writerc C s d | j}| j |S )NrX )rg r clearr r r r buffer s
z_Unparser.bufferNextrac c s@ | d |r
| | | jd7 _dV | jd8 _dS )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.
:rV N)r r )r r+ r r r block s
z_Unparser.blockc c s | | dV | | dS )zA context manager for preparing the source for expressions. It adds
*start* to the buffer and enters, after exit it adds *end*.Nr )r startendr r r delimit s
z_Unparser.delimitc C s |r| ||S t S r& )r0 r )r r. r/ conditionr r r
delimit_if s z_Unparser.delimit_ifc C s | dd| ||kS )z,Shortcut to adding precedence related parens())r2 get_precedence)r
precedencer" r r r require_parens s z_Unparser.require_parensc C s | j |tjS r& )r r r r r r" r r r r5 r' z_Unparser.get_precedencec G s |D ]}|| j |< qd S r& )r )r r6 nodesr" r r r set_precedence s z_Unparser.set_precedencec C sd t |ttttfrt|jdk rdS |jd }t |ts dS |j}t |t r.t |jt
r0|S dS dS )zIf a docstring node is found in the body of the *node* parameter,
return that docstring node, None otherwise.
Logic mirrored from ``_PyAST_GetDocString``.rV Nr ) r r r r r rC rR r r) r' rO r8 r r r get_raw_docstring s
z_Unparser.get_raw_docstringc C s* | j |jp |j}|d urd| S d S )Nz # type: )r r r type_comment)r r" commentr r r get_type_comment s
z_Unparser.get_type_commentc s2 t |tr|D ]}| | qd S t | d S r& )r r: traversesuperr )r r" r re r r r? ! s
z_Unparser.traversec C s g | _ | | d| j S )zOutputs a source code string that, if converted back to an ast
(using ast.parse) will generate an AST equivalent to *node*rX )r r? rg r8 r r r r + s
z_Unparser.visitc C s@ | | }r| | | |jdd d S | |j d S r )r; _write_docstringr? rR )r r" docstringr r r "_write_docstring_and_traverse_body2 s
z,_Unparser._write_docstring_and_traverse_bodyc C s* dd |j D | _| | | j d S )Nc S s i | ]
}|j d |j qS )ignore)r tag)r[ rE r r r
: s z*_Unparser.visit_Module..) type_ignoresr rD r( r8 r r r visit_Module9 s
z_Unparser.visit_Modulec s` dd fdd j|j W d n1 s w Y d |j d S )Nr3 r4 c r r r r r r r r D r z._Unparser.visit_FunctionType.. -> )r0 r r? argtypesr returnsr8 r r r visit_FunctionTypeA s
z _Unparser.visit_FunctionTypec C s( | | tj|j | |j d S r& )r% r: r r r) r? r8 r r r
visit_ExprJ s z_Unparser.visit_Exprc C sj | tj|$ | tj|j|j | |j | d | |j W d d S 1 s.w Y d S )Nz := ) r7 r r r: r targetr) r? r r8 r r r visit_NamedExprO s
"z_Unparser.visit_NamedExprc ( d fdd j|j d S )Nzimport c r r r r r r r r X r z(_Unparser.visit_Import..)r% r r? namesr8 r r r visit_ImportV
z_Unparser.visit_Importc sX d d|jp d |jr |j d fdd j|j d S )Nzfrom .r z import c r r r r r r r r ` r z,_Unparser.visit_ImportFrom..)r% r r^ moduler r? rR r8 r r r visit_ImportFromZ s
z_Unparser.visit_ImportFromc C sT | |jD ] }| | | d q| |j | | }r(| | d S d S )N = )r% targetsr? r r) r> )r r" rO r< r r r visit_Assignb s
z_Unparser.visit_Assignc C sB | | |j | d| j|jjj d | |j d S )Nrr z= ) r% r? rO r binopr0 re rf r) r8 r r r visit_AugAssignk s z_Unparser.visit_AugAssignc C s | | dd|j ot|jt | |j W d n1 s$w Y | d | |j |j rD| d | |j d S d S )Nr3 r4 r rX )
r% r2 rn r rO r> r? r
annotationr) r8 r r r visit_AnnAssignq s
z_Unparser.visit_AnnAssignc C s. | d |jr| d | |j d S d S )Nreturnrr )r% r) r r? r8 r r r visit_Return{ s
z_Unparser.visit_Returnc C | d d S )Npassr% r8 r r r
visit_Pass z_Unparser.visit_Passc C ra )Nbreakrc r8 r r r visit_Break re z_Unparser.visit_Breakc C ra )Ncontinuerc r8 r r r visit_Continue re z_Unparser.visit_Continuec rQ )Nzdel c r r r r r r r r r z(_Unparser.visit_Delete..)r% r r? rY r8 r r r visit_Delete rT z_Unparser.visit_Deletec C s: | d | |j |jr| d | |j d S d S )Nzassert rY )r% r? testr# r r8 r r r visit_Assert s
z_Unparser.visit_Assertc rQ )Nzglobal c r r r r r r r r r z(_Unparser.visit_Global..r% r r rR r8 r r r visit_Global rT z_Unparser.visit_Globalc rQ )Nz nonlocal c r r r r r r r r r z*_Unparser.visit_Nonlocal..rm r8 r r r visit_Nonlocal rT z_Unparser.visit_Nonlocalc C z | tj|, | d |jr+| d | tj|j | |j W d d S W d d S 1 s6w Y d S )Nawaitrr )r7 r r r r) r: r r? r8 r r r visit_Await
"z_Unparser.visit_Awaitc C rp )Nyieldrr )r7 r r r r) r: r r? r8 r r r visit_Yield rs z_Unparser.visit_Yieldc C sh | tj|# | d |jstd| tj|j | |j W d d S 1 s-w Y d S )Nz yield from z-Node can't be used without a value attribute.) r7 r r r r) r! r: r r? r8 r r r visit_YieldFrom s
"z_Unparser.visit_YieldFromc C s\ | d |js|jrtdd S | d | |j |jr,| d | |j d S d S )Nraisez*Node can't use cause without an exception.rr z from )r% exccauser! r r? r8 r r r visit_Raise s
z_Unparser.visit_Raisec C s | d | | |j W d n1 sw Y |jD ]}| | q"|jrL| d | | |j W d n1 sGw Y |jrq| d | | |j W d d S 1 sjw Y d S d S )Ntryelsefinally)r% r- r? rR handlersorelse finalbody)r r" exr r r visit_Try s"
"z_Unparser.visit_Tryc C s| | d |jr| d | |j |jr!| d | |j | | |j W d d S 1 s7w Y d S )Nexceptrr as )r% r( r r? rm r- rR r8 r r r visit_ExceptHandler s
"z _Unparser.visit_ExceptHandlerc C s | |jD ] }| d | | q| d|j | jdd|jp%|jd4 d}|jD ]}|r8| d nd}| | q.|jD ]}|rM| d nd}| | qCW d n1 s_w Y | |
| W d d S 1 syw Y d S ) N@zclass r3 r4 )r1 FrY T) r# decorator_listr% r? rm r2 basesrA r r- rD )r r" decocommaer r r visit_ClassDef s,
"z_Unparser.visit_ClassDefc C | |d d S )Ndef_function_helperr8 r r r visit_FunctionDef r' z_Unparser.visit_FunctionDefc C r )Nz async defr r8 r r r visit_AsyncFunctionDef r' z _Unparser.visit_AsyncFunctionDefc C s | |jD ] }| d | | q|d |j }| | | dd | |j W d n1 s7w Y |jrJ| d | |j | j |
|d | | W d d S 1 sdw Y d S )Nr rr r3 r4 rJ r* ) r# r r% r? rm r0 r@ rL r r- r> rD )r r" fill_suffixr def_strr r r r s
"z_Unparser._function_helperc C | d| d S )Nzfor _for_helperr8 r r r visit_For r' z_Unparser.visit_Forc C r )Nz
async for r r8 r r r visit_AsyncFor r' z_Unparser.visit_AsyncForc C s | | | |j | d | |j | j| |d | |j W d n1 s0w Y |jrZ| d | | |j W d d S 1 sSw Y d S d S )N in r* r| ) r% r? rO r r r- r> rR r )r r% r" r r r r s
"z_Unparser._for_helperc C s4 | d | |j | | |j W d n1 s w Y |jrst|jdkrst|jd trs|jd }| d | |j | | |j W d n1 s\w Y |jrst|jdkrst|jd ts7|jr| d | | |j W d d S 1 sw Y d S d S )Nzif rV r zelif r| ) r% r? rk r- rR r rC r Ifr8 r r r visit_If s&
$
$
"z_Unparser.visit_Ifc C s | d | |j | | |j W d n1 s w Y |jrJ| d | | |j W d d S 1 sCw Y d S d S )Nzwhile r| )r% r? rk r- rR r r8 r r r visit_While, s
"z_Unparser.visit_Whilec h d fdd j|j j |d |j W d d S 1 s-w Y d S )Nzwith c r r r r r r r r 8 r z&_Unparser.visit_With..r* r% r r? r r- r> rR r8 r r r
visit_With6
"z_Unparser.visit_Withc r )Nz async with c r r r r r r r r > r z+_Unparser.visit_AsyncWith..r* r r8 r r r visit_AsyncWith< r z_Unparser.visit_AsyncWith quote_typesescape_special_whitespacec s fdd}d t||}dv rdd |D }fdd|D }|sAttfdd |D d
}d d |gfS rm|jfd
dd |d
d
d krmt|d
dksaJ dd d d |fS )zHelper for writing string literals, minimizing escapes.
Returns the tuple (string literal to write, possible quote types).
c s4 s| dv r| S | dks| s| ddS | S )Nz
\unicode_escapeascii) isprintabler r )r )r r r escape_charH s
z2_Unparser._str_literal_helper..escape_charrX rW c S s g | ]}|t v r|qS r )
_MULTI_QUOTESr[ qr r r
U z1_Unparser._str_literal_helper..c s g | ]}| vr|qS r r r escaped_stringr r r V r c 3 s | ] } d |v r|V qdS rZ r r )stringr r r_ \ s z0_Unparser._str_literal_helper..r rV r c s | d d kS )Nr r r )r r r r r ` s z/_Unparser._str_literal_helper..)r r Nr )rg r7 rh r sortrC )r r r r r possible_quotesquoter )r r r r _str_literal_helperB s
z _Unparser._str_literal_helperr c C s4 | j ||d\}}|d }| | | | dS )zKWrite string literal value with a best effort attempt to avoid backslashes.r r N)r r )r r r
quote_typer r r _write_str_avoiding_backslashesh s z)_Unparser._write_str_avoiding_backslashesc C s | d | jr| || j | | j d S g }|jD ] }t| dt|j }||| j |
| jt |t f q g }t
}|D ]\}}| j|||d\}}|
| q@d|}|d }| | | | d S )Nr _fstring_r rX r )r r _fstring_JoinedStrr& r r) rE r r( rf rc r r' _ALL_QUOTESr rg ) r r" r) r) meth
new_bufferr is_constantr r r r visit_JoinedStrn s*
z_Unparser.visit_JoinedStrc C s( | d | || j | | j d S )Nr )r _fstring_FormattedValuer& r r) r8 r r r visit_FormattedValue s
z _Unparser.visit_FormattedValuec C s. |j D ]}t| dt|j }||| qd S )Nr )rE r r( rf )r r" r r) r r r r r s
z _Unparser._fstring_JoinedStrc C s6 t |jts
td|jdddd}|| d S )Nz.Constants inside JoinedStr should be a string.{z{{}z}})r r) rO r! replace)r r" r r) r r r _fstring_Constant s z_Unparser._fstring_Constantc C s |d t | dd}|tj |j ||j}|dr$|d d|v r,td|| |j dkrIt
|j }|dvrBtd |d
| |j ra|d t | d t |j j
}||j | |d
d S )Nr Tr
rr r z5Unable to avoid backslash in f-string expression partr sraz Unknown f-string conversion.!r, r r )r( r: r r r r) r rz r!
conversionchr format_specr rf )r r" r unparserexprr r r r r r s&
z!_Unparser._fstring_FormattedValuec C | |j d S r& )r r? r8 r r r
visit_Name r' z_Unparser.visit_Namec C s0 | |jdkr| d | j|jtd d S )Nur )r% kindr r r) r r8 r r r rB s
z_Unparser._write_docstringc
C sn t |ttfr | t|dtddt dt d d S | jr.t |tr.| | d S | t| d S )Ninfnanr3 -r4 )
r r+ r, r rh r _INFSTRr rO r r r r r _write_constant s z_Unparser._write_constantc C s |j }t|tr(| dd | | j| W d d S 1 s!w Y d S |du r3| d d S |jdkr=| d | |j d S )Nr3 r4 ....r )r) r r r0 r" r r r )r r" r) r r r r s
"
z_Unparser.visit_Constantc L dd fdd j|j W d d S 1 s w Y d S )N[]c r r r r r r r r r z&_Unparser.visit_List..)r0 r r? r8 r8 r r r
visit_List s "z_Unparser.visit_Listc C T | dd | |j |jD ]}| | qW d d S 1 s#w Y d S )Nr r r0 r? elt
generatorsr r" genr r r visit_ListComp
"z_Unparser.visit_ListCompc C r Nr3 r4 r r r r r visit_GeneratorExp r z _Unparser.visit_GeneratorExpc C r )Nr r r r r r r
visit_SetComp r z_Unparser.visit_SetCompc C sj | dd% | |j | d | |j |jD ]}| | qW d d S 1 s.w Y d S )Nr r r )r0 r? r r r) r r r r r visit_DictComp s
"z_Unparser.visit_DictCompc C s |j r | d n| d | tj|j | |j | d | jtj |j g|j
R | |j |j
D ] }| d | | q9d S )Nz async for z for r if ) is_asyncr r: r r rO r? r r r ifs)r r" if_clauser r r visit_comprehension s
z _Unparser.visit_comprehensionc C s | tj|9 | tj |j|j | |j | d | |j | d | tj|j | |j W d d S 1 sCw Y d S )Nr z else )
r7 r r r: r rR rk r? r r r8 r r r visit_IfExp s
"z_Unparser.visit_IfExpc s` |j r) dd fdd j|j W d d S 1 s"w Y d S d d S )Nr r c r r r r r r r r r z%_Unparser.visit_Set..z{*()})r8 r0 r r? r r8 r r r visit_Set s
"z_Unparser.visit_Setc sl fdd fdd} dd fdd|t|j|j W d d S 1 s/w Y d S ) Nc s" | d | d S Nr r? r )kvr r r write_key_value_pair s
z2_Unparser.visit_Dict..write_key_value_pairc sD | \}}|d u r d tj| | d S || d S )N**)r r: r r r? )r r r r r r r
write_item s
z(_Unparser.visit_Dict..write_itemr r c r r r r r r r r ' r z&_Unparser.visit_Dict..)r0 r rG rD rE )r r" r r r r
visit_Dict s "z_Unparser.visit_Dictc C sB | dd | | j|j W d d S 1 sw Y d S r )r0 r" r? r8 r8 r r r visit_Tuple* s "z_Unparser.visit_Tuple~not+r )InvertNotr1 r2 )r r r r c C s | j |jjj }| j| }| ||% | | |tjur#| d | ||j
| |j
W d d S 1 s;w Y d S Nrr ) unopr0 re rf unop_precedencer7 r r r r: r3 r? )r r" operatoroperator_precedencer r r
visit_UnaryOp6 s
"z_Unparser.visit_UnaryOpr r /%<<>>|^&//r )
rI rJ MultMatMultDivModLShiftRShiftBitOrBitXorBitAndFloorDivPow)
r r r r r r r r r r r
r r )r c C s | j |jjj }| j| }| ||> || jv r | }|}n|}| }| ||j |
|j | d| d | ||j |
|j W d d S 1 sTw Y d S r )
r[ r0 re rf binop_precedencer7 binop_rassocr r: rK r? r rL )r r" r r left_precedenceright_precedencer r r visit_BinOpc s
"z_Unparser.visit_BinOpz==z!=z>=iszis notinznot in)
EqNotEqLtLtEGtGtEIsIsNotInNotInc C s | tj|= | jtj |jg|jR | |j t|j |jD ]\}}|
d| j |j j
d | | q$W d d S 1 sGw Y d S r )r7 r r r: r rK comparatorsr? rG opsr cmpopsre rf )r r" or r r r
visit_Compare s "z_Unparser.visit_Compareandor)AndOr)r/ r0 c s j |jjj }j| fdd} | d| dfdd||j W d d S 1 s9w Y d S )Nc s" | | d S r& )r r: r? r- )r r r r increasing_level_traverse s z9_Unparser.visit_BoolOp..increasing_level_traverserr c s
S r& r r )r r r r r r z(_Unparser.visit_BoolOp..)boolopsr0 re rf boolop_precedencer7 r rE )r r" r r3 r )r r r r visit_BoolOp s
"z_Unparser.visit_BoolOpc C sZ | tj|j | |j t|jtr t|jjtr | d | d | |j d S )Nrr rU )
r: r r r) r? r r' r* r r~ r8 r r r visit_Attribute s
z_Unparser.visit_Attributec C s | tj|j | |j | dd5 d}|jD ]}|r$| d nd}| | q|jD ]}|r9| d nd}| | q/W d d S 1 sLw Y d S )Nr3 r4 FrY T) r: r r r= r? r0 r@ r rA )r r" r r r r r
visit_Call s
"z_Unparser.visit_Callc C s dd }| tj|j | |j | dd& ||jr(| | j|jj n| |j W d d S W d d S 1 sAw Y d S )Nc S s& t | to| jotdd | jD S )Nc s s | ]}t |tV qd S r& )r Starred)r[ r r r r r_ s zE_Unparser.visit_Subscript..is_simple_tuple..)r r6 r8 any) slice_valuer r r is_simple_tuple s
z2_Unparser.visit_Subscript..is_simple_tupler r ) r: r r r) r? r0 r r" r8 )r r" r< r r r visit_Subscript s
"z_Unparser.visit_Subscriptc C s* | d | tj|j | |j d S )Nr )r r: r r r) r? r8 r r r
visit_Starred s
z_Unparser.visit_Starredc C ra )Nr r r8 r r r visit_Ellipsis re z_Unparser.visit_Ellipsisc C sR |j r | |j | d |jr| |j |jr'| d | |j d S d S )Nr, )lowerr? r upperstepr8 r r r visit_Slice s
z_Unparser.visit_Slicec C sZ | d | |j | |jD ]}| | qW d d S 1 s&w Y d S )Nzmatch )r% r? subjectr- cases)r r" caser r r visit_Match s
"z_Unparser.visit_Matchc C s0 | |j |jr| d | |j d S d S r )r argr] r? r8 r r r visit_arg
z_Unparser.visit_argc C s d}|j |j }d gt|t|j |j }tt||dD ]/\}}|\}}|r,d}n| d | | |rB| d | | |t|j krN| d q |jsU|j r~|rZd}n| d | d |jr~| |jj
|jj r~| d | |jj |j rt|j |j D ]\}}| d | | |r| d | | q|j
r|rd}n| d | d |j
j
|j
j r| d | |j
j d S d S d S )
NTrV FrY =z, /r r r ) posonlyargsr@ rC defaults enumeraterG r r? vararg
kwonlyargsrH r] kw_defaultskwarg) r r" r all_argsrM r elementsadr r r visit_arguments sV
z_Unparser.visit_argumentsc C s< |j d u r | d n | |j | d | |j d S )Nr rK )rH r r? r) r8 r r r
visit_keyword s
z_Unparser.visit_keywordc C sp | tj|' | d | |j | d | tj|j | |j W d d S 1 s1w Y d S )Nzlambda r )r7 r r r r? r@ r: rR r8 r r r visit_Lambda$ s
"z_Unparser.visit_Lambdac C s* | |j |jr| d|j d S d S Nr )r rm asnamer8 r r r visit_alias, s z_Unparser.visit_aliasc C s0 | |j |jr| d | |j d S d S rZ )r? context_expr
optional_varsr r8 r r r visit_withitem1 rJ z_Unparser.visit_withitemc C sl | d | |j |jr| d | |j | | |j W d d S 1 s/w Y d S )Nzcase r )r% r? patternguardr r- rR r8 r r r visit_match_case7 s
"z_Unparser.visit_match_casec C r r& )r? r) r8 r r r visit_MatchValue@ r' z_Unparser.visit_MatchValuec C r r& )r r) r8 r r r visit_MatchSingletonC r' z _Unparser.visit_MatchSingletonc r )Nr r c r r r r r r r r I r z/_Unparser.visit_MatchSequence..)r0 r r? patternsr8 r r r visit_MatchSequenceF s
"z _Unparser.visit_MatchSequencec C s& |j }|d u r d}| d| d S )N_r )rm r )r r" rm r r r visit_MatchStarL s z_Unparser.visit_MatchStarc
s fdd} dd; |j} fdd|t||jdd |j}|d ur?|r/ d d
| W d d S W d d S 1 sJw Y d S ) Nc s* | \}} | d | d S r r )pairr pr r r write_key_pattern_pairS s
z<_Unparser.visit_MatchMapping..write_key_pattern_pairr r c r r r r r r r r \ r z._Unparser.visit_MatchMapping..TstrictrY r )r0 rD r rG re restr )r r" rk rD rn r r r visit_MatchMappingR s
"z _Unparser.visit_MatchMappingc
s tj|j |j ddC |j} fdd j| |j}|rO fdd}|r6 d fdd|t
||j d d
W d d S W d d S 1 sZw Y d S ) Nr3 r4 c r r r r r r r r l r z,_Unparser.visit_MatchClass..c s& | \}} | d | d S )NrK )r r? )ri r~ r` r r r write_attr_patternp s z6_Unparser.visit_MatchClass..write_attr_patternrY c r r r r r r r r x r Trl ) r: r r rk r? r0 re r kwd_attrsr rG kwd_patterns)r r" re attrsrp r r r visit_MatchClassf s(
"z_Unparser.visit_MatchClassc C s |j }|j}|d u r| d d S |d u r | |j d S | tj| | tj|j | |j | d|j W d d S 1 sGw Y d S )Nrg r ) rm r` r r7 r r r: r r? )r r" rm r` r r r
visit_MatchAs} s "z_Unparser.visit_MatchAsc sh tj|# jtj g|jR fdd j|j W d d S 1 s-w Y d S )Nc r )Nz | r r r r r r r z)_Unparser.visit_MatchOr..)r7 r r r: r re r r? r8 r r r
visit_MatchOr s "z_Unparser.visit_MatchOr)rX )rf r r r r r r" r# r% r r& propertyr) r r- r0 r2 r7 r5 r: r; r> r? r rD rI rM rN rP rS rW rZ r\ r^ r` rd rg ri rj rl rn ro rr ru rv rz r r r r r r r r r r r r r r r r r r r r r r rB 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 frozensetr r r, r. r4 r r r5 r6 r7 r8 r= r> r? rC rG rI rW rX rY r\ r_ rb rc rd rf rh ro rt ru rv
__classcell__r r rA r r s4
&
3
r c C s t }|| S r& )r r )ast_objr r r r unparse s
r{ c C s dd l } | jdd}|jd| jddddd d
|jd d d
ddd |jddddd |jddddd |jdd td d d | }|j }| }W d n1 sTw Y t||jj |j
|j d }t t
||j|jd! d S )"Nr z
python -m ast)proginfilerbr ?r z$the file to parse; defaults to stdin)r( nargsdefaulthelpz-mz--moder )r singler func_typez(specify what kind of code must be parsed)r choicesr z--no-type-commentsT store_falsez)don't add information about type comments)r actionr z-az--include-attributes
store_truez:include attributes such as line numbers and column offsets)r r z-iz--indentr z'indentation of nodes (number of spaces))r( r r )r )rq rU )argparseArgumentParser add_argumentFileTyper*
parse_argsr} readr rm r no_type_commentsprintrt rq rU )r parserr@ r} r treer r r main s2
r __main__)r r )TF)rV )T)Kr sys_ast
contextlibr r enumr r r rT rt r r r r r r r r r r objectr r ry r' r r rw r r r( r r r r r r r r* r+ r, rO bytesboolr r r r` r r r r6 r r r modr expr_contextr r r rh
float_info
max_10_expr r _SINGLE_QUOTESr r r r{ r rf r r r r s ;C
#
%:
<
m