Operation   : Linux premium131.web-hosting.com 4.18.0-553.44.1.lve.el8.x86_64 #1 SMP Thu Mar 13 14:29:12 UTC 2025 x86_64
Software     : Apache
Server IP    : 162.0.232.56 | Your IP: 216.73.216.111
Domains      : 1034 Domain(s)
Permission   : [ 0755 ]

a

XC?h���@s�dZd
dl
Z
d
dlTd
dlmZmZ
d
dlmZmZ
d`ddd	�d
d�Z	dd
�Z
dadd�
dd�Zdd�Zdd�Z
dbdd�
Zdd�Zdd�Zdcdd�
Zdd �Zd!d"�Zdd#�
d$d%�Zd&d'�ZGd(d)�d)e�ZGd*d+�d+e�Zeed,��
sd-d.�Zd/d0�Zeee�e_eee�e_Gd1d2�d2e �Z!d3d4�Z"Gd5d6�d6ee!d7�Z#Gd8d9�d9ee!d7�Z$Gd:d;�d;ee!d7�Z%Gd<d=�d=ee!d7�Z&Gd>d?�d?ee!d7�Z'e#e(e)e*fe$e+f
e%e,f
e&e d�
e-fe'e d@�
f
iZ.e#e-f
i
Z/e-d=e d�
d=e(d6e)d6e*d6e+d9e,d;e d@�
d?iZ0GdAdB�dBe1�Z2GdCdD�dDe2�Z3GdEdF�dFe2�Z4ee5dG��sFdHdI�Z6dJdK�Z7ee6e7�e5_8GdLdM�dMe9�Z:GdNdO�dOe;�Z<GdPdQ�dQe;�Z=GdRdS�dSe;�Z>dTe?e
j@jAd�
ZBGdUdV�dVe�ZCdWZDdXZEgeD�
eE�
RZFGdYdZ�dZe�ZGd[d\�ZHd]d^�ZIeJd_k�r�eI�
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)�IntEnum�auto�	<unknown>�execF)�
type_comments�feature_versioncCsRt}|r|t
O}t|t�r4|\}}|d
ks.J�
|}n|dur@d}t||
|||d�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.
    �N���)
�_feature_version)Z
PyCF_ONLY_ASTZPyCF_TYPE_COMMENTS�
isinstance�tuple�compile)�source�filename�moder	r
�flags�major�minor�r�(/opt/alt/python39/lib64/python3.9/ast.py�parse!s










�rc

s`t|t
�rt|d
d�}t|t�r&|j}dd���f
dd��
�
f
dd����
��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.
    �eval�
rc

Sstd
|���
�
dS)Nzmalformed node or string: )
�
ValueError�
�noderrr�_raise_malformed_nodeCs
z+literal_eval.<locals>._raise_malformed_nodec

s,t|t
�rt|j�
tttfv
r&�|�

|jS�
N)r�Constant�type�value�int�float�complexr)
rrr�_convert_numEs


z"literal_eval.<locals>._convert_numc
sDt|t
�r<t|jttf�r<�|j�
}
t|jt�r6|

S|
S�|�
Sr )rZUnaryOp�op�UAdd�USub�operand)rr+)
r'rr�_convert_signed_numIs





z)literal_eval.<locals>._convert_signed_numc
sZ
t|t
�r|jSt|t�r*tt�|j��
St|t�rDtt�|j��
St|t	�r^t
t�|j��
St|t�r�t|jt
�r�|jjd
kr�|j|jkr�gkr�n
nt
�St|t�r�t|j�
t|j�
krȈ|�

ttt�|j�t�|j���
St|t��
rRt|jttf��
rR�|j�
}
�
|j�
}t|
ttf��
rRt|t��
rRt|jt��
rJ|
|S|
|S�|�
S)N�set) rr!r#�Tupler�map�elts�List�list�Setr-ZCall�func�Name�id�args�keywords�Dict�len�keys�values�dict�zipZBinOpr(�Add�Sub�left�rightr$r%r&)rrArB��_convertr'r,rrrrDQs<














�
�
�







�







zliteral_eval.<locals>._convert)r�strrZ
Expression�body)
Znode_or_stringrrCr�literal_eval6s	





rGT)
�indentc
sTd��
��fdd�	�t|t
�s.td|jj�
�
�du
rHt�t�sHd���|�
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�
�du
r*�d
7�d��}d��}nd}d}t|t
��
r�t|�
}g}d}�}|jD]�}zt||�}	Wnty�


d}YqXYn0|	dur�t||d�dur�d}qX�
|	��\}	}
|o�|
}|r�|�d||	f�

qX|�|	�

qX��
rh|j�
rh|jD]t}zt||�}	Wnt�
y


Yq�Yn0|	du�
r<t||d�du�
r<q�
|	��\}	}
|�
oR|
}|�d||	f�

q�|�
r�t|�
d	k
�
r�d
|j	j
d�|�
f|fSd|j	j
||�|�
fdfSt|t��
r�|�
s�d
Sd||��
�fdd�|D�
�
fdfSt
|�
dfS)N�
�

z,
��, T.z%s=%srz%s(%s)z%s(%s%s)F)z[]Tz[%s%s]c
3s|]}
�|
�
�dV
qd
S�r
Nr)�.0�
x)�_format�levelrr�	<genexpr>��z(dump.<locals>._format.<locals>.<genexpr>)r�ASTr"�_fields�getattr�AttributeError�append�_attributesr:�	__class__�__name__�joinr2�repr)rrQ�prefix�sep�clsr7Z	allsimpler8�namer#�simple�rP�annotate_fields�include_attributesrH)
rQrrPzsX













































&
zdump.<locals>._formatzexpected AST, got %rN�
 )
r
)rrT�	TypeErrorrZr[rE)rrdrerHrrcr�dumpns0




rhcCsVd
D]L}||
jvr||jvrt
|
|d�}|du
sDt|
|�r|�d�
rt|||�
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*.
    )�lineno�
col_offset�
end_lineno�end_col_offsetNZend_)rYrV�hasattr�
startswith�setattr)�new_nodeZold_node�attrr#rrr�
copy_location�s


�
�
rrc

s �f
d
d���|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*.
    cs�d
|jvr"t
|d
�s|
|_n|j}
d|jvrJt|dd�durD||_n|j}d|jvrlt
|d�sf||_n|j}d|jvr�t|dd�dur�||_n|j}t|�
D]}�||
|||�
q�dS)Nrirkrjrl)rYrmrirVrkrjrl�iter_child_nodes)rrirjrkrl�child�
�_fixrrrv�s$



















z#fix_missing_locations.<locals>._fixrIr
rrrrur�fix_missing_locations�s
rwrIcCsVt|�
D]H}d
|j
vr(t|d
d�|
|_d|j
vrt|dd�}du
r||
|_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.
    rir
rkN)�walkrYrVrirk)r�
nrtrkrrr�increment_lineno�s


��
rzc
	cs8|jD],}
z|
t
||
�fV
Wqty0


Yq0qd
S)zs
    Yield a tuple of ``(fieldname, value)`` for each field in ``node._fields``
    that is present on *node*.
    N)rUrVrW)r�fieldrrr�iter_fields�s





r|c
csLt|�
D]>\}
}t
|t�r"|V
qt
|t�r|D]}t
|t�r0|V
q0qd
S)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|rrTr2)rrar{�itemrrrrs
s








rscCs�t|t
tttf�s"td
|jj�
�
|jr8t|jdt	�s<dS|jdj
}t|t�rZ|j}n"t|t
�rxt|j
t�rx|j
}ndS|
r�ddl}|�|�
}|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�FunctionDef�ClassDef�ModulergrZr[rF�Exprr#�Str�
sr!rE�inspectZcleandoc)rZclean�textr�rrr�
get_docstring
s	













r�c
Cs�d
}
g}d}|
t|�
krx||
}||7}|
d7}
|dkr`|
t|�
kr`||
dkr`|d7}|
d7}
|dvr|�
|�

d}q|r�|�
|�

|S)z}Split a string into lines ignoring form feed and other chars.

    This mimics how the Python parser splits source code.
    r
rKrI�

rJz
)r:rX)r�idx�linesZ	next_line�
crrr�_splitlines_no_ff*
s 





 








r�c
Cs,d
}
|D]}|dvr|
|7}
q|
d7}
q|
S)z6Replace all chars except '\f\t' in a line with spaces.rKz	rfr)r�resultr�rrr�_pad_whitespaceC
s





r�)
�paddedc
Cs
z>|
jd
us|
j
d
urWd
S|
jd}|
jd}|
j}|
j
}WntyR


Yd
S0t|�
}||kr|||��||���S|r�t||��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.
    NrIrKr
)rkrlrirjrWr��encode�decoder��insertrXr\)rrr�rirkrjrlr�Zpadding�firstZlastrrr�get_source_segmentN
s*	


















r�c
cs<d
dlm
}

|
|g
�
}|r8|��}|�t|�
�

|V
qdS)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��popleft�extendrs)rr�Ztodorrrrxs
s





rxc@s(eZ
dZd
Zdd�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.
    cCs"d
|
jj
}t|||j�}||
�
S)z
Visit a node.�visit_)rZr[rV�
generic_visit)�selfr�method�visitorrrr�visit�
s

zNodeVisitor.visitcCsTt|
�
D]F\}}t
|t�r:|D]}t
|t�r|�|�

qqt
|t�r|�|�

qd
S)z9Called if no explicit visitor function exists for a node.N)r|rr2rTr�)r�rr{r#r}rrrr��
s








zNodeVisitor.generic_visitc	Cs�|
j}t
�t|�
�
}|dur@t
��D]\}}t||�r$|}
q@q$|du
r�d
|}zt||�}Wntyp


Yn&0ddl}|�	|�d�t
d�
||
�
S|�|
�
S)Nr�r
z" is deprecated; add visit_Constant�)r#�_const_node_type_names�getr"�itemsrrVrW�warnings�warn�DeprecationWarningr�)	r�rr#Z	type_namer`rar�r�r�rrr�visit_Constant�
s&















�
zNodeVisitor.visit_ConstantN)r[�
__module__�__qualname__�__doc__r�r�r�rrrrr��
s

r�c@seZ
dZd
Zdd�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)
    cCs�t|
�
D]�\}}t
|t�rvg}|D]D}t
|t�r\|�|�
}|durFq"nt
|t�s\|�|�

q"|�|�

q"||dd�<qt
|t�r|�|�
}|dur�t|
|�
qt|
||�
q|
Sr )	r|rr2rTr�r�rX�delattrro)r�rr{�	old_valueZ
new_valuesr#rprrrr��
s&
























zNodeTransformer.generic_visitN)r[r�r�r�r�rrrrr��
s
#r�ryc


Cs|jS)
zDeprecated. Use value instead.�
r#�
r�rrr�_getter�
sr�cCs
|
|_dSr r��r�r#rrr�_setter�
s
r�c@seZ
dZd
d�Zdd�ZdS)�_ABCc
Gs
d
|_dS)Nz3Deprecated AST node class. Use ast.Constant instead)
r�)r`r7rrr�__init__s
z
_ABC.__init__cCsdt|
t
�sd
S|tvrXz
|
j}Wnty4


Yd
S0t|t|�oVt|t�|d��St�||
�S)NFr)	rr!�_const_typesr#rW�_const_types_notr�r"�__instancecheck__)r`�instr#rrrr�
s









�z_ABC.__instancecheck__N)r[r�r�r�r�rrrrr�sr�c
Osp|D]<}||jv
rq|j�
|�
}|t|
�
krt|j�d
|���
�
q|tvrXt|
i|�
�
Stj|g
|
�
Ri|�
�
S)Nz" got multiple values for argument )rU�indexr:rgr[r�r!�__new__)r`r7�kwargs�key�posrrr�_news








r�c
@seZ
dZd
ZeZdS)�Num)
ryN�r[r�r�rUr�r�rrrrr�%s

r�)
�	metaclassc
@seZ
dZd
ZeZdS)r��
r�Nr�rrrrr�)s

r�c
@seZ
dZd
ZeZdS)�Bytesr�Nr�rrrrr�-s

r�c
@seZ
dZeZd
S)�NameConstantN)r[r�r�r�r�rrrrr�1s
r�c@seZ
dZd
Zdd�ZdS)�Ellipsisrc
Os6|turt
d
g
|
�
Ri|�
�
St
j|g
|
�
Ri|�
�
S)N.)r�r!r�)r`r7r�rrrr�7s


zEllipsis.__new__N)r[r�r�rUr�rrrrr�4s
r�.c
@seZ
dZd
ZdS)�slicezDeprecated AST node class.N�r[r�r�r�rrrrr�Rs
r�c@seZ
dZd
Zdd�ZdS)�Indexz@Deprecated AST node class. Use the index value directly instead.c
Ks|
Sr r)r`r#r�rrrr�Ws
z
Index.__new__N�r[r�r�r�r�rrrrr�Us

r�c@seZ
dZd
Zddd�
ZdS)�ExtSlicez1Deprecated AST node class. Use ast.Tuple instead.rcKstt
|
�
t�fi|�
�
Sr )r.r2ZLoad)r`�dimsr�rrrr�\s
zExtSlice.__new__N)
rr�rrrrr�Zs

r�r�c


Cs|jS)
zDeprecated. Use elts instead.�
r0r�rrr�_dims_getterdsr�cCs
|
|_dSr r�r�rrr�_dims_setterhs
r�c
@seZ
dZd
ZdS)�Suite�/Deprecated AST node class.  Unused in Python 3.Nr�rrrrr�ms
r�c
@seZ
dZd
ZdS)�AugLoadr�Nr�rrrrr�ps
r�c
@seZ
dZd
ZdS)�AugStorer�Nr�rrrrr�ss
r�c
@seZ
dZd
ZdS)�Paramr�Nr�rrrrr�vs
r�Z1ec@s�eZ
dZd
Ze�Ze�Ze�Ze�Ze�Z	e�Z
e�Ze�ZeZ
e�Ze�Ze�Ze�Ze�Ze�Ze�Ze�Ze�Zdd�ZdS)�_Precedencez5Precedence table that originated from python grammar.c

Cs,z|�|d
�
WSt
y&


|YS0dS�NrI)rZrr�rrr�next�s



z_Precedence.nextN)r[r�r�r�r�TUPLE�YIELD�TEST�OR�AND�NOT�CMP�EXPR�BOR�BXOR�BAND�SHIFT�ARITH�TERM�FACTOR�POWER�AWAIT�ATOMr�rrrrr�~s(
















r�)�
'�
")z"""z'''cs�eZ
dZd
Zdd�
dd�Zdd�Zdd	�Zd
d�Zd�d
d�
Zdd�Z	dd�Z
edd��
Ze
dd�
dd��
Ze
dd��
Zdd�Zdd�Zdd �Zd!d"�Zd#d$�Zd%d&�Z�f
d'd(�Zd)d*�Zd+d,�Zd-d.�Zd/d0�Zd1d2�Zd3d4�Zd5d6�Zd7d8�Zd9d:�Zd;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;ddq�drds�Z<e;dt�
dudv�Z=dwdx�Z>dydz�Z?d{d|�Z@d}d~�ZAdd��ZBd�d��ZCd�d��ZDd�d��ZEd�d��ZFd�d��ZGd�d��ZHd�d��ZId�d��ZJd�d��ZKd�d��ZLd�d��ZMd�d��ZNd�d��ZOd�d��ZPd�d�d�d�d��ZQeRjSeRjTeRjTeRjTd��ZUd�d��ZVd�d�d�d�d�d�d�d�d�d�d�d�d�d��
ZWeRjXeRjXeRjYeRjYeRjYeRjYeRjZeRjZeRj[eRj\eRj]eRjYeRj^d��
Z_e`d��
Zad�d��Zbd�d�d�d�d�d�d�d�d�d�d��
Zcd�d��Zdd�d�dĜZeeRjfeRjgdŜZhd�dDŽZid�dɄZjd�d˄Zkd�d̈́Zld�dτZmd�dфZnd�dӄZod�dՄZpd�dׄZqd�dلZrd�dۄZsd�d݄Ztd�d߄Zu�ZvS)��	_Unparserz�Methods in this class recursively traverse an AST and
    output source code for the abstract syntax; original formatting
    is disregarded.F�
�_avoid_backslashesc

Cs(g|_g|_
i|_i|_d
|_|
|_dS)Nr
)�_source�_buffer�_precedences�
_type_ignores�_indentr�)r�r�rrrr��s





z_Unparser.__init__cCsHt|�
}z|t
|�
�

Wnty*


Yn0|D]}|
�
||�

q0d
S)z7Call f on each item in seq, calling inter() in between.N)�iterr��
StopIteration)r�Zinter�
f�seqrOrrr�
interleave�s





z_Unparser.interleavecs>t|�
d
kr$|
|d�

��
d�

n���f
dd�|
|�
dS)z�Traverse 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.rIr
�
,cs
��d
�
S�NrL�
�writerr�rr�<lambda>�rSz&_Unparser.items_view.<locals>.<lambda>N)r:r�r�)r�Z	traverserr�rr�r�
items_view�s

z_Unparser.items_viewc

Cs|jr|�
d
�

dS)z8Adds a newline if it isn't the start of generated sourcerJN)r�r�r�rrr�
maybe_newline�s
z_Unparser.maybe_newlinerKcCs |��
|�
d
|j|
�

dS)zXIndent a piece of text and append it, according to the current
        indentation levelz    N)r�r�r��r�r�rrr�fill�s
z_Unparser.fillcCs|j�
|
�

d
S)zAppend a piece of textN)r�rXr�rrrr��sz_Unparser.writecCs|j�
|
�

dSr )r�rXr�rrr�
buffer_writer�s
z_Unparser.buffer_writerc
Csd
�|j
�
}
|j
��
|
S)NrK)r\r��clearr�rrr�buffer�s


z_Unparser.bufferN�
�extrac

cs>|�d
�

|
r|�|
�

|j
d7_
dV
|j
d8_
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.
        �
:rIN)r�r�)r�r
rrr�block�s






z_Unparser.blockccs|�|
�

d
V
|�|�

d
S)z�A context manager for preparing the source for expressions. It adds
        *start* to the buffer and enters, after exit it adds *end*.Nr�)r��start�endrrr�delimit�s


z_Unparser.delimitcCs|r|�|
|�St
�SdSr )r

r)r�r
r	
�	conditionrrr�
delimit_if�s

z_Unparser.delimit_ifcCs|�d
d|�
|�
|
k�S)z,Shortcut to adding precedence related parens�
(�
))r
�get_precedence)r��
precedencerrrr�require_parens�sz_Unparser.require_parenscCs|j�
|
tj�Sr )r�r�r�r��r�rrrrr
�s
z_Unparser.get_precedencecGs|D]}|
|j|<qdSr )
r�)r�r
Znodesrrrr�set_precedence�s

z_Unparser.set_precedencecCs`t|
t
tttf�r t|
j�
d
kr$dS|
jd}
t|
t�s<dS|
j}
t|
t	�r\t|
jt
�r\|
SdS)z�If a docstring node is found in the body of the *node* parameter,
        return that docstring node, None otherwise.

        Logic mirrored from ``_PyAST_GetDocString``.rINr
)rr~rr�r�r:rFr�r#r!rEr
rrr�get_raw_docstrings
��







z_Unparser.get_raw_docstringcCs*|j�
|
j�
p|
j}|du
r&d
|��SdS)Nz	 # type: )r�r�ri�type_comment)r�rZcommentrrr�get_type_comments


z_Unparser.get_type_commentcs0t|
t
�r |
D]}|�|�

qnt��|
�

dSr )rr2�traverse�superr�)r�rr}�
rZrrr
s



z_Unparser.traversecCsg|_|�
|
�

d
�|j�
S)z�Outputs a source code string that, if converted back to an ast
        (using ast.parse) will generate an AST equivalent to *node*rK)r�r
r\r
rrrr�s


z_Unparser.visitcCs>|�|
�
}r.|�
|�

|�|
jd
d��

n|�|
j�

dSr�)r
�_write_docstringr
rF)r�rZ	docstringrrr�"_write_docstring_and_traverse_body&s



z,_Unparser._write_docstring_and_traverse_bodycCs*d
d�|
jD�
|_
|�|
�

|j
��
dS)Nc
Ssi|]}
|
jd|
j
���qS)
�ignore)ri�tag)rNr
rrr�
<dictcomp>.s�z*_Unparser.visit_Module.<locals>.<dictcomp>)�type_ignoresr�r
r
r
rrr�visit_Module-s

�

z_Unparser.visit_Modulecs`��d
d��*
��
�f
dd��j|
j�
Wd�
n1s<0


Y
��d�

��|
j�

dS)Nr

r
cs
��d
�
Sr�r�rr�rrr�8rSz._Unparser.visit_FunctionType.<locals>.<lambda>� -> )r

r�r
�argtypesr��returnsr
rr�r�visit_FunctionType5s


�"

z_Unparser.visit_FunctionTypecCs(|��
|�
tj|
j�
|�|
j�

dSr )r
r
r�r�r#r
r
rrr�
visit_Expr>s


z_Unparser.visit_ExprcCsh|�t
j|
��F
|�t
j|
j|
j�
|�|
j�

|�d
�

|�|
j�

Wd�
n1sZ0


Y
dS)Nz := )	r
r�r�r
r��targetr#r
r�r
rrr�visit_NamedExprCs






z_Unparser.visit_NamedExprcs(��d
�

��
�f
dd��j|
j�
dS)Nzimport cs
��d
�
Sr�r�rr�rrr�LrSz(_Unparser.visit_Import.<locals>.<lambda>)r
r�r
�namesr
rr�r�visit_ImportJs


z_Unparser.visit_ImportcsT��d
�

��
d|
j�

|
jr,��
|
j�

��
d�

���f
dd��j|
j�
dS)Nzfrom �
.z import cs
��d
�
Sr�r�rr�rrr�TrSz,_Unparser.visit_ImportFrom.<locals>.<lambda>)r
r�rQ�moduler�r
r(
r
rr�r�visit_ImportFromNs







z_Unparser.visit_ImportFromcCsP|��
|
j
D]}|�|�

|�d
�

q|�|
j�

|�|
�
}rL|�|�

dS)N� = )r
�targetsr
r�r#r
)r�rr&
r
rrr�visit_AssignVs








z_Unparser.visit_AssigncCsB|��
|�
|
j�

|�d
|j|
jjjd�

|�
|
j�

dS)Nrfz= )	r
r
r&
r��binopr(rZr[r#r
rrr�visit_AugAssign_s



z_Unparser.visit_AugAssigncCs�|��
|�
d
d|
jo"t|
jt���
|�|
j�

Wd�
n1sH0


Y
|�d�

|�|
j�

|
j	r�|�d�

|�|
j	�

dS)Nr

r
�: r-
)
r
r
rbrr&
r5r
r��
annotationr#r
rrr�visit_AnnAssignes

 
*






z_Unparser.visit_AnnAssigncCs*|�d
�

|
j
r&|�d�

|�|
j
�

dS)N�returnrf)r
r#r�r
r
rrr�visit_Returnos





z_Unparser.visit_ReturncCs|�d
�

dS)N�pass�
r
r
rrr�
visit_Passus
z_Unparser.visit_PasscCs|�d
�

dS)N�breakr8
r
rrr�visit_Breakxs
z_Unparser.visit_BreakcCs|�d
�

dS)N�continuer8
r
rrr�visit_Continue{s
z_Unparser.visit_Continuecs(��d
�

��
�f
dd��j|
j�
dS)Nzdel cs
��d
�
Sr�r�rr�rrr��rSz(_Unparser.visit_Delete.<locals>.<lambda>)r
r�r
r.
r
rr�r�visit_Delete~s


z_Unparser.visit_DeletecCs6|�d
�

|�
|
j�

|
jr2|�d�

|�
|
j�

dS)Nzassert rL)r
r
�test�msgr�r
rrr�visit_Assert�s







z_Unparser.visit_Assertcs(��d
�

��
�f
dd��j|
j�
dS)Nzglobal cs
��d
�
Sr�r�rr�rrr��rSz(_Unparser.visit_Global.<locals>.<lambda>�r
r�r�r(
r
rr�r�visit_Global�s


z_Unparser.visit_Globalcs(��d
�

��
�f
dd��j|
j�
dS)Nz	nonlocal cs
��d
�
Sr�r�rr�rrr��rSz*_Unparser.visit_Nonlocal.<locals>.<lambda>rB
r
rr�r�visit_Nonlocal�s


z_Unparser.visit_NonlocalcCsh|�t
j|
��F
|�d
�

|
jrF|�d�

|�t
j|
j�
|�|
j�

Wd�
n1sZ0


Y
dS)N�awaitrf)r
r�r�r�r#r
r�r
r
rrr�visit_Await�s







z_Unparser.visit_AwaitcCsh|�t
j|
��F
|�d
�

|
jrF|�d�

|�t
j|
j�
|�|
j�

Wd�
n1sZ0


Y
dS)N�yieldrf)r
r�r�r�r#r
r�r
r
rrr�visit_Yield�s







z_Unparser.visit_YieldcCsf|�t
j|
��D
|�d
�

|
js(td�
�
|�t
j|
j�
|�|
j�

Wd�
n1sX0


Y
dS)Nzyield from z-Node can't be used without a value attribute.)	r
r�r�r�r#rr
r�r
r
rrr�visit_YieldFrom�s






z_Unparser.visit_YieldFromcCsX|�d
�

|
j
s"|
jrtd�
�
dS|�d�

|�|
j
�

|
jrT|�d�

|�|
j�

dS)N�raisez*Node can't use cause without an exception.rfz from )r
�exc�causerr�r
r
rrr�visit_Raise�s












z_Unparser.visit_RaisecCs�|�d
�

|�
��
|�|
j�

Wd�
n1s40


Y
|
jD]}|�|�

qD|
jr�|�d�

|�
��
|�|
j�

Wd�
n1s�0


Y
|
jr�|�d�

|�
��
|�|
j�

Wd�
n1s�0


Y
dS)N�try�else�finally)r
r
r
rF�handlers�orelse�	finalbody)r�rZexrrr�	visit_Try�s




*








*





z_Unparser.visit_TrycCsz|�d
�

|
j
r&|�d�

|�|
j
�

|
jrB|�d�

|�|
j�

|���
|�|
j�

Wd�
n1sl0


Y
dS)N�exceptrf� as )r
r"r�r
rar
rFr
rrr�visit_ExceptHandler�s












z_Unparser.visit_ExceptHandlercCs�|��
|
j
D]}|�d
�

|�|�

q|�d|
j�

|jdd|
jpJ|
jd��h
d}|
jD]"}|rp|�d�

nd}|�|�

q\|
jD]"}|r�|�d�

nd}|�|�

q�Wd�
n1s�0


Y
|�	��
|�
|
�

Wd�
n1s�0


Y
dS)	N�
@zclass r

r
)
r
FrLT)r��decorator_listr
r
rar
�basesr8r�r
r
)r�r�deco�comma�
errr�visit_ClassDef�s&


















*

z_Unparser.visit_ClassDefcCs|�|
d
�
dS)N�def�
�_function_helperr
rrr�visit_FunctionDef�s
z_Unparser.visit_FunctionDefcCs|�|
d
�
dS)Nz	async defr`
r
rrr�visit_AsyncFunctionDef�s
z _Unparser.visit_AsyncFunctionDefcCs�|��
|
j
D]}|�d
�

|�|�

q|d|
j}|�|�

|�dd��
|�|
j�

Wd�
n1sn0


Y
|
jr�|�d�

|�|
j�

|j	|�
|
�
d�
�
|�|
�

Wd�
n1s�0


Y
dS)NrX
rfr

r
r!
r
)r�rY
r
r
rar

r7r#
r�r
r
r
)r�rZfill_suffixr[
Zdef_strrrrra
�s










*





z_Unparser._function_helpercCs|�d
|
�
dS)Nzfor �
�_for_helperr
rrr�	visit_For�s
z_Unparser.visit_ForcCs|�d
|
�
dS)Nz
async for rd
r
rrr�visit_AsyncFor�s
z_Unparser.visit_AsyncForcCs�|�|
�

|�
|j�

|�d
�

|�
|j�

|j|�|�
d�
�
|�
|j�

Wd�
n1s`0


Y
|jr�|�d�

|���
|�
|j�

Wd�
n1s�0


Y
dS)N� in r
rO
)	r
r
r&
r�r�r
r
rFrR
)r�r
rrrrre
s







*





z_Unparser._for_helpercCs
|�d
�

|�
|
j�

|���
|�
|
j�

Wd�
n1s@0


Y
|
jr�t|
j�
dkr�t|
jdt�r�|
jd}
|�d�

|�
|
j�

|���
|�
|
j�

Wd�
qJ1s�0


Y
qJ|
j�
r|�d�

|���
|�
|
j�

Wd�
n1�
s0


Y
dS)Nzif rIr
zelif rO
)	r
r
r?
r
rFrR
r:rZIfr
rrr�visit_Ifs





*$







,




z_Unparser.visit_IfcCs�|�d
�

|�
|
j�

|���
|�
|
j�

Wd�
n1s@0


Y
|
jr�|�d�

|���
|�
|
j�

Wd�
n1s�0


Y
dS)Nzwhile rO
)r
r
r?
r
rFrR
r
rrr�visit_While s





*





z_Unparser.visit_Whilecsf��d
�

��
�f
dd��j|
j�
�j��|
�
d�
�
��|
j�

Wd�
n1sX0


Y
dS)Nzwith cs
��d
�
Sr�r�rr�rrr�,rSz&_Unparser.visit_With.<locals>.<lambda>r
�r
r�r
r�r
r
rFr
rr�r�
visit_With*s




z_Unparser.visit_Withcsf��d
�

��
�f
dd��j|
j�
�j��|
�
d�
�
��|
j�

Wd�
n1sX0


Y
dS)Nzasync with cs
��d
�
Sr�r�rr�rrr�2rSz+_Unparser.visit_AsyncWith.<locals>.<lambda>r
rk
r
rr�r�visit_AsyncWith0s




z_Unparser.visit_AsyncWith��quote_types�escape_special_whitespacecs��f
d
d�}d�t
|���
�
|}d�
vr6dd�|D�
}�
f
dd�|D�
}|s�t��
�t�f
dd	�|D�
�d
�}�dd�|g
fS�
r�|j�
f
d
d�d�

|d
d
�
dkr�t|d
�
dks�J�
�
dd�d�
d�
�
|fS)z�Helper for writing string literals, minimizing escapes.
        Returns the tuple (string literal to write, possible quote types).
        c

s4�s|d
vr|S|dks |��s0|�
d�
�d�
S|S)Nz
	�
\Zunicode_escape�ascii)�isprintabler�r�)
r�)
rp
rr�escape_char<s



z2_Unparser._str_literal_helper.<locals>.escape_charrKrJc
Ssg|]}
|
tvr|
�qSr)
�
_MULTI_QUOTES�rN�
qrrr�
<listcomp>IrSz1_Unparser._str_literal_helper.<locals>.<listcomp>c
sg|]}
|
�v
r|
�qSrrrv
�
�escaped_stringrrrx
JrSc
3s|]}
�d|
vr|
V
qd
SrMrrv
)
�stringrrrRPrSz0_Unparser._str_literal_helper.<locals>.<genexpr>r
rIrc

s|d
�dkS)Nr
rr)
rw
ry
rrr�TrSz/_Unparser._str_literal_helper.<locals>.<lambda>)
r�rNrq
)r\r/r]r��sortr:)r�r{
ro
rp
rt
Zpossible_quotesZquoter)rp
rz
r{
r�_str_literal_helper6s 











z_Unparser._str_literal_helper�
ro
c
Cs4|j|
|d
�\}
}|d}|�
|�|
�|���

dS)zKWrite string literal value with a best effort attempt to avoid backslashes.r~
r
N)r}
r�)r�r{
ro
�
quote_typerrr�_write_str_avoiding_backslashes\s

z)_Unparser._write_str_avoiding_backslashesc	Cs�|�d
�

|j
r.|�|
|j�
|�|j�

dSg}|
jD]:}t|dt|�
j	�}|||j�
|�
|jt|t�f�

q8g}t
}|D]&\}}|j|||d�\}}|�
|�

q�d�|�
}|d}|�|�|�|���

dS)Nr��	_fstring_rn
rKr
)r�r��_fstring_JoinedStrr

r�
r
r<rVr"r[rXrr!�_ALL_QUOTESr}
r\)	r�rr
r#�methZ
new_bufferro
Zis_constantr
rrr�visit_JoinedStrbs*















�




z_Unparser.visit_JoinedStrcCs(|�d
�

|�
|
|j�
|�|j�

dS)Nr�)r��_fstring_FormattedValuer

r�
r
r
rrr�visit_FormattedValue�s



z_Unparser.visit_FormattedValuecCs.|
jD]"}t
|d
t|�
j�}|||�
qdS)Nr�
)r<rVr"r[)r�rr�r#r�
rrrr�
�s



z_Unparser._fstring_JoinedStrcCs6t|
j
t�std
�
�
|
j
�dd��dd�}||�

dS)Nz.Constants inside JoinedStr should be a string.�
{z{{�
}z}})rr#rEr�replace)r�rr�r#rrr�_fstring_Constant�s



z_Unparser._fstring_ConstantcCs�|d
�

t|�
dd�
}|�
tj��|
j�
|�|
j�
}|�d
�
rH|d�

d|vrXtd�
�
||�

|
j	dkr�t
|
j	�
}|dv
r�td	�
�
|d
|���

|
jr�|d�

t|dt|
j�
j
�}||
j|�
|d
�

dS)Nr�
Tr�rfrq
z5Unable to avoid backslash in f-string expression partrZsrazUnknown f-string conversion.�
!r
r�
r�
)r"r
r�r�r�r#r�rnr�
conversion�chr�format_specrVr[)r�rr��unparser�exprr�
r�
rrrr�
�s&





















z!_Unparser._fstring_FormattedValuecCs|�|
j
�

dSr )r�r6r
rrr�
visit_Name�s
z_Unparser.visit_NamecCs0|��
|
j
d
kr|�d
�

|j|
jtd�
dS)N�
ur~
)r
�kindr�r�
r#ru
r
rrrr
�s





z_Unparser._write_docstringc
Csjt|
t
tf�r<|�t|
�
�d
t��ddt�dt�d���

n*|jrXt|
t�rX|�	|
�

n|�t|
�
�

dS)N�inf�nanr

�
-r
)
rr%r&r�r]r�
�_INFSTRr�rEr�
r�rrr�_write_constant�s


���
z_Unparser._write_constantcCs�|
j}t
|t�rL|�d
d��
|�|j|�
Wd�
q�1s@0


Y
n4|dur`|�d�

n |
jdkrt|�d�

|�|
j�

dS)Nr

r
.�...r�
)r#rrr

r�r�
r�r�
)r�rr#rrrr��s




.





z_Unparser.visit_ConstantcsJ��d
d��*
��
�f
dd��j|
j�
Wd�
n1s<0


Y
dS)N�
[�
]cs
��d
�
Sr�r�rr�rrr��rSz&_Unparser.visit_List.<locals>.<lambda>)r

r�r
r0r
rr�r�
visit_List�s

z_Unparser.visit_ListcCsR|�d
d��2
|�
|
j�

|
jD]}|�
|�

q Wd�
n1sD0


Y
dS)Nr�
r�
�r

r
�elt�
generators�r�r�genrrr�visit_ListComp�s




z_Unparser.visit_ListCompcCsR|�d
d��2
|�
|
j�

|
jD]}|�
|�

q Wd�
n1sD0


Y
dS�Nr

r
r�
r�
rrr�visit_GeneratorExp�s




z_Unparser.visit_GeneratorExpcCsR|�d
d��2
|�
|
j�

|
jD]}|�
|�

q Wd�
n1sD0


Y
dS)Nr�
r�
r�
r�
rrr�
visit_SetComp�s




z_Unparser.visit_SetCompcCsh|�d
d��H
|�
|
j�

|�d�

|�
|
j�

|
jD]}|�
|�

q6Wd�
n1sZ0


Y
dS)Nr�
r�
r2
)r

r
r�r�r#r�
r�
rrr�visit_DictComp�s







z_Unparser.visit_DictCompcCs�|
jr|�
d
�

n
|�
d�

|�tj|
j�
|�|
j�

|�
d�

|jtj��|
j	g|
j
�
R�
|�|
j	�

|
j
D]}|�
d�

|�|�

qrdS)Nz async for z for rh
� if )�is_asyncr�r
r�r�r&
r
r�r�r��ifs)r�rZ	if_clauserrr�visit_comprehension�s













z_Unparser.visit_comprehensioncCs�|�t
j|
��p
|�t
j��|
j|
j�
|�|
j�

|�d
�

|�|
j�

|�d�

|�t
j|
j	�
|�|
j	�

Wd�
n1s�0


Y
dS)Nr�
z else )
r
r�r�r
r�rFr?
r
r�rR
r
rrr�visit_IfExp�s









z_Unparser.visit_IfExpcs\|
jrN��
d
d��*
���f
dd��j|
j�
Wd�
qX1sB0


Y
n
��d�

dS)Nr�
r�
cs
��d
�
Sr�r�rr�rrr�rSz%_Unparser.visit_Set.<locals>.<lambda>z{*()})r0r

r�r
r�r
rr�r�	visit_Set�s


:z_Unparser.visit_Setcsj�f
d
d��
��
fdd�}��dd��0
��
�f
dd�|t|
j|
j��
Wd�
n1s\0


Y
dS)	Ncs"��|�

��
d
�

��|
�

dS�Nr2
)r
r�)�
k�
vr�rr�write_key_value_pair	s




z2_Unparser.visit_Dict.<locals>.write_key_value_pairc
sB|\}
}|
dur4��d
�

��
tj|�
��|�

n
�
|
|�
dS)N�**)r�r
r�r�r
)r}r�
r�
�r�r�
rr�
write_items




z(_Unparser.visit_Dict.<locals>.write_itemr�
r�
cs
��d
�
Sr�r�rr�rrr�rSz&_Unparser.visit_Dict.<locals>.<lambda>)r

r�r>r;r<)r�rr�
rr�
r�
visit_Dicts


�z_Unparser.visit_DictcCs@|�d
d�� 
|�
|j|
j�
Wd�
n1s20


Y
dSr�
)r

r�r
r0r
rrr�visit_Tuples

z_Unparser.visit_Tuple�
~�not�
+r�
)ZInvertZNotr)r*)r�
r�
r�
r�
cCs�|j|
j
jj}|j|}|�||
��H
|�|�

|tju
rF|�d
�

|�	||
j
�
|�|
j
�

Wd�
n1st0


Y
dS�Nrf)�unopr(rZr[�unop_precedencer
r�r�r�r
r+r
)r�r�operator�operator_precedencerrr�
visit_UnaryOp*s










z_Unparser.visit_UnaryOprrX
�
/�
%�<<�>>�
|�
^�
&�//r�
)
r?r@ZMultZMatMultZDivZModZLShiftZRShiftZBitOrZBitXorZBitAndZFloorDivZPow)
r�
r�
rrX
r�
r�
r�
r�
r�
r�
r�
r�
r�
)
r�
cCs�|j|
j
jj}|j|}|�||
��z
||jvr@|��}|}n|}|��}|�||
j	�
|�
|
j	�

|�d
|�d
��

|�||
j�
|�
|
j�

Wd�
n1s�0


Y
dSr�
)
r0
r(rZr[�binop_precedencer
�binop_rassocr�r
rAr
r�rB)r�rr�
r�
Zleft_precedenceZright_precedencerrr�visit_BinOpWs












z_Unparser.visit_BinOpz==z!=�
<z<=�
>z>=�iszis not�inznot in)
ZEqZNotEqZLtZLtEZGtZGtEZIsZIsNotZInZNotIncCs�|�t
j|
��x
|jt
j��|
jg|
j�
R�
|�|
j�

t|
j	|
j�D].\}}|�
d
|j|jj
d
�

|�|�

qHWd�
n1s�0


Y
dSr�
)r
r�r�r
r�rA�comparatorsr
r>�opsr��cmpopsrZr[)r�r�
or]
rrr�
visit_Compareus





z_Unparser.visit_Compare�and�or)ZAndZOr)r�
r�
cs~�j|
j
jj}�j|���fd
d�}���|
��6
d|�d��
���
�fdd�||
j�
Wd�
n1sp0


Y
dS)Nc

s"�����
�
�|�
�
�|�

dSr )r�r
r
r)r�
r�rr�increasing_level_traverse�s

z9_Unparser.visit_BoolOp.<locals>.increasing_level_traverserfcs
�
���
Sr r�r)r�r�rrr��rSz(_Unparser.visit_BoolOp.<locals>.<lambda>)�boolopsr(rZr[�boolop_precedencer
r�r<)r�rr�
r�
r)r�
r�r�r�visit_BoolOp�s




z_Unparser.visit_BoolOpcCsZ|�t
j|
j�
|�|
j�

t|
jt�r@t|
jjt�r@|�d
�

|�d�

|�|
j	�

dS)Nrfr*
)
r
r�r�r#r
rr!r$r�rqr
rrr�visit_Attribute�s






z_Unparser.visit_AttributecCs�|�t
j|
j�
|�|
j�

|�d
d��h
d}|
jD]"}|rH|�d�

nd}|�|�

q4|
jD]"}|rr|�d�

nd}|�|�

q^Wd�
n1s�0


Y
dS)Nr

r
FrLT)	r
r�r�r4r
r

r7r�r8)r�rr\
r]
rrr�
visit_Call�s













z_Unparser.visit_CallcCs~d
d�}|�t
j|
j�
|�|
j�

|�dd��:
||
j�
rP|�|j|
jj�
n|�|
j�

Wd�
n1sp0


Y
dS)Nc

Ss&t|t
�o$|jo$td
d�|jD�
�
S)Nc
ss|]}
t|
t
�V
qdSr )rZStarred)rNr�
rrrrR�rSzE_Unparser.visit_Subscript.<locals>.is_simple_tuple.<locals>.<genexpr>)rr.r0�any)
Zslice_valuerrr�is_simple_tuple�s


��z2_Unparser.visit_Subscript.<locals>.is_simple_tupler�
r�
)	r
r�r�r#r
r

r�r�r0)r�rr�
rrr�visit_Subscript�s






z_Unparser.visit_SubscriptcCs*|�d
�

|�
tj|
j�
|�|
j�

dS)Nr)r�r
r�r�r#r
r
rrr�
visit_Starred�s



z_Unparser.visit_StarredcCs|�d
�

dS)Nr�
r�r
rrr�visit_Ellipsis�s
z_Unparser.visit_EllipsiscCsN|
jr|�
|
j�

|�d
�

|
jr.|�
|
j�

|
jrJ|�d
�

|�
|
j�

dS)Nr
)�lowerr
r��upper�stepr
rrr�visit_Slice�s









z_Unparser.visit_SlicecCs,|�|
j
�

|
jr(|�d
�

|�|
j�

dSr�
)r��argr3
r
r
rrr�	visit_arg�s




z_Unparser.visit_argc	Cs�
d
}|
j|
j
}dg
t|�
t|
j�
|
j}tt||�d�D]^\}}|\}}|rXd}n
|�d�

|�|�

|r�|�d�

|�|�

|t|
j�
kr>|�d�

q>|
js�|
j	r�|r�d}n
|�d�

|�d�

|
jr�|�|
jj
�

|
jjr�|�d�

|�|
jj�

|
j	�
rLt|
j	|
j�D]8\}}|�d�

|�|�

|�
r|�d�

|�|�

�
q|
j
�
r�|�
r`d}n
|�d�

|�d	|
j
j
�

|
j
j�
r�|�d�

|�|
j
j�

dS)
NTrIFrL�
=z, /rr2
r�
)�posonlyargsr7r:�defaults�	enumerater>r�r
�vararg�
kwonlyargsr�
r3
�kw_defaults�kwarg)	r�rr�Zall_argsr�
r��elements�
a�
drrr�visit_arguments�sN












































z_Unparser.visit_argumentscCs<|
jdur|�
d
�

n|�
|
j�

|�
d�

|�|
j�

dS)Nr�
r�
)r�
r�r
r#r
rrr�
visit_keyword	s






z_Unparser.visit_keywordcCsn|�t
j|
��L
|�d
�

|�|
j�

|�d�

|�t
j|
j�
|�|
j�

Wd�
n1s`0


Y
dS)Nzlambda r2
)r
r�r�r�r
r7r
rFr
rrr�visit_Lambdas







z_Unparser.visit_LambdacCs&|�|
j
�

|
jr"|�d
|
j�

dS�NrV
)r�ra�asnamer
rrr�visit_aliass


z_Unparser.visit_aliascCs,|�|
j
�

|
jr(|�d
�

|�|
j�

dSr�
)r
�context_expr�
optional_varsr�r
rrr�visit_withitems




z_Unparser.visit_withitem)
rK)wr[r�r�r�r�r�r�r�r
r�r

�propertyr
rr
r

r
r
r
r
r
r
r
r�r
r 
r$
r%
r'
r)
r,
r/
r1
r4
r6
r9
r;
r=
r>
rA
rC
rD
rF
rH
rI
rM
rT
rW
r^
rb
rc
ra
rf
rg
re
ri
rj
rl
rm
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�
r0
r�r�r�r�r�r�r�r�
�	frozensetr�
r�
r�
r�
r�
r�r�r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
�
__classcell__rrr
rr��s









		

�&
	


�












�











�









�



3r�c
Cst�}
|
�
|�
Sr )r�r�)Zast_objr�
rrr�unparse$s

r�
cCs�d
dl}|j
dd�
}
|
jd|jdd�
ddd	d
�
|
jddd
ddd�
|
jddddd�
|
jddddd�
|
jddtddd�
|
��}|j�}|��}Wd�
n1s�0


Y
t||jj	|j
|jd �}tt
||j|jd!��

dS)"Nr
z
python -m ast)
�prog�infile�rbr�
?r�
z$the file to parse; defaults to stdin)r"�nargs�default�helpz-mz--moder)rZsinglerZ	func_typez(specify what kind of code must be parsed)r�choicesrz--no-type-commentsTZstore_falsez)don't add information about type comments)r�actionrz-az--include-attributes�
store_truez:include attributes such as line numbers and column offsets)rrz-iz--indentrz'indentation of nodes (number of spaces))r"rr)
r	)rerH)�argparse�ArgumentParser�add_argumentZFileTyper$�
parse_argsr�readrrarZno_type_comments�printrhrerH)r	�parserr7rrZtreerrr�main)s0



�


�

�

�
�
&

r�__main__)rr)TF)
rI)
T)Kr��sysZ_ast�
contextlibrr�enumrrrrGrhrrrwrzr|rsr�r�r�r�rx�objectr�r�rmr!r�r�r�
ryr�r"r�r�r�r�r�r�r�r$r%r&rE�bytes�boolr�r�r�rTr�r�r�r.r�r�r��modr�Zexpr_contextr�r�r�r]�
float_info�
max_10_expr�
r�Z_SINGLE_QUOTESru
r�
r�r�
rr[rrrr�<module>
s�



�8C#

%:<
	





��






�