__  __    __   __  _____      _            _          _____ _          _ _ 
 |  \/  |   \ \ / / |  __ \    (_)          | |        / ____| |        | | |
 | \  / |_ __\ V /  | |__) | __ ___   ____ _| |_ ___  | (___ | |__   ___| | |
 | |\/| | '__|> <   |  ___/ '__| \ \ / / _` | __/ _ \  \___ \| '_ \ / _ \ | |
 | |  | | |_ / . \  | |   | |  | |\ V / (_| | ||  __/  ____) | | | |  __/ | |
 |_|  |_|_(_)_/ \_\ |_|   |_|  |_| \_/ \__,_|\__\___| |_____/|_| |_|\___V 2.1
 if you need WebShell for Seo everyday contact me on Telegram
 Telegram Address : @jackleet
        
        
For_More_Tools: Telegram: @jackleet | Bulk Smtp support mail sender | Business Mail Collector | Mail Bouncer All Mail | Bulk Office Mail Validator | Html Letter private



Upload:

Command:

[email protected]: ~ $
�

*�_i�����SrSSKrSSKrSSK7 SSKJrJr SSKJrJ	r	J
r
 SQSSSS.S	jjrS
rSRSSS.Sjjr
S
rSrSSSjrSrSrSTSjr\R("S5rSUSjrSrSS.SjrSr"SS\5r"SS\5rSrSr\"\ S 5(d(S!r!S"r"S#r#S$r$\%"\!\"5\ l&\%"\#\$5\ l'"S%S&\(5r)S'r*"S(S)\ \)S*9r+"S+S,\ \)S*9r,"S-S.\ \)S*9r-"S/S0\ \)S*9r."S1S2\ \)S*9r/\/r0\+\1\2\34\,\44\-\54\.\("S5\64\/\("S3540r7\+\640r8\6S0\("S5S0\1S)\2S)\3S)\4S,\5S.\("S35S20r9"S4S5\:5r;"S6S7\;5r<"S8S9\;5r=\"\>S:5(dS;r?S<r@\%"\?\@5\>lA"S=S>\B5rC"S?S@\D5rE"SASB\D5rF"SCSD\D5rGSE\H"\R�R�S-5-rK\
"\5"SFSG55rLSHrMSIrN/\MQ\NQ7rO"SJSK\5rPSLrQSMVs0sHnU\R"5R�U5_M snrTSNrUSOrV\WSP:Xa\V"5 ggs snf)Va
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�_simple_enumF���)�
type_comments�feature_version�optimizec	���[nUS:�a	U[-nU(a	U[-nUcSnO/[U[5(aUupxUS:wa[SU35eUn[
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.
rr	�zUnsupported major version: )�_feature_versionr)�
PyCF_ONLY_AST�PyCF_OPTIMIZED_AST�PyCF_TYPE_COMMENTS�
isinstance�tuple�
ValueError�compile)	�source�filename�moder
rr�flags�major�minors	         �/usr/lib/python3.13/ast.py�parser"s}��
�E��!�|�
�#�#���
�#�#������	�O�U�	+�	+�&����A�:��:�5�'�B�C�C����6�T�$3�H�H�c��^^^^�[U[5(a[URS5SS9n[U[5(aUR
nSmU4SjmU4SjmUUUU4SjmT"U5$)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)rc�b�Sn[USS5=n(aUSU3-
n[USU<3-5e)Nzmalformed node or string�linenoz	 on line �: )�getattrr)�node�msg�lnos   r�_raise_malformed_node�+literal_eval.<locals>._raise_malformed_nodeGsB��(���$��$�/�/�3�/��Y�s�e�$�$�C����D�8�}�,�-�-rc�>�[U[5(a([UR5[[
[4;aT"U5 UR$�N)r�Constant�type�value�int�float�complex)r&r)s �r�_convert_num�"literal_eval.<locals>._convert_numLs:����$��)�)�T�$�*�*�-=�c�5�RY�EZ�-Z�!�$�'��z�z�rc�>�[U[5(a\[UR[[45(a7T"UR
5n[UR[5(aU7$U*$T"U5$r,)r�UnaryOp�op�UAdd�USub�operand)r&r:r3s  �r�_convert_signed_num�)literal_eval.<locals>._convert_signed_numPs^����d�G�$�$��D�G�G�d�D�\�)J�)J�"�4�<�<�0�G��$�'�'�4�(�(� �y� � �y� ��D�!�!rc	�>�[U[5(aUR$[U[5(a[	[TUR55$[U[5(a[[TUR55$[U[5(a[[TUR55$[U[5(af[UR[5(aGURRS:Xa-URUR s=:Xa/:Xa[5$ [U["5(aq[%UR&5[%UR(5:waT"U5 [+[-[TUR&5[TUR(555$[U[.5(a�[UR0[2[445(a{T"UR65nT"UR85n[U[:[<45(a<[U[>5(a'[UR0[25(aX-$X-
$T"U5$)N�set) rr-r/�Tupler�map�elts�List�list�Setr>�Call�func�Name�id�args�keywords�Dict�len�keys�values�dict�zip�BinOpr7�Add�Sub�left�rightr0r1r2)r&rTrU�_convertr3r;r)s   ����rrV�literal_eval.<locals>._convertXs�����d�H�%�%��:�:��
��e�
$�
$���X�t�y�y�1�2�2�
��d�
#�
#���H�d�i�i�0�1�1�
��c�
"�
"��s�8�T�Y�Y�/�0�0���t�$�$��D�I�I�t�)D�)D��i�i�l�l�e�#��	�	�T�]�]�(H�b�(H��5�L�)I�
��d�
#�
#��4�9�9�~��T�[�[�!1�1�%�d�+���C��$�)�)�4���$�+�+�6�8�9�
9�
��e�
$�
$��D�G�G�c�3�Z�)H�)H�&�t�y�y�1�D� ����,�E��$��e��-�-�*�U�G�2L�2L��d�g�g�s�+�+��<�'��<�'�"�4�(�(r)r�strr�lstrip�
Expression�body)�node_or_stringrVr3r;r)s @@@@r�literal_evalr]:sg����.�#�&�&��~�4�4�U�;�&�I���.�*�-�-�'�,�,��.�
�"�)�)�4�N�#�#r)�indent�
show_emptyc��^^^^^�SUUUUU4Sjjm[U[5(d"[SURR-5eTb[T[
5(dST-mT"U5S$)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.
rc�>^�TbTS-
mSTT--nSTT--nOSnSn[U[5(Ga�[U5n/n/nSnT
nURH�n	[	X	5n
U
c[	XIS5cSnM#T(d@U
bU
/:Xa7[U[[45(dUR[U
55 MjU(dURU5 /nT"U
T5up�U=(a UnU(aURU	<SU
<35 M�URU
5 M� T(apUR(a_URHOn	[	X	5n
U
c[	XIS5cM!T"U
T5up�U=(a UnURU	<SU
<35 MQ U(aC[U5S	::a4URR<S
SRU5<S3U(+4$URR<S
U<URU5<S3S4$[U[ 5(a.U(dg
SU<URUU4SjU55<S3S4$[U5S4$![
a SnGM#f=f![
a GMAf=f)N��
z,
��, T.�=r�(�)F)z[]T�[c3�<># �UHnT"UT5Sv� M g7f�rN�)�.0�x�_format�levels  ��r�	<genexpr>�(dump.<locals>._format.<locals>.<genexpr>�s����/S�d����5�0A�!�0D�d�s��])r�ASTr.�_fieldsr%�AttributeErrorr-�MatchSingleton�append�repr�extend�_attributesrL�	__class__�__name__�joinrC)r&rp�prefix�sep�clsrI�args_buffer�	allsimplerJ�namer/�simplero�annotate_fields�include_attributesr^r_s `          �����rro�dump.<locals>._format�sU������Q�J�E��F�U�N�*�F��&�5�.�(�C��F��C��d�C� � ��t�*�C��D��K��I�&�H������#�D�/�E��=�W�S��%<�%D�#�H��"���%�2�+�'�t�h��-G�H�H��&�&�t�E�{�3��!��K�K��,�"$�K� '��u� 5�
��%�0�&�	���K�K�4�� 7�8��K�K��&�5%�6"�d�&6�&6� �,�,�D�!� '�� 3���}���C�)@�)H� �$+�E�5�$9�M�E� )� 4�f�I��K�K�4�� 7�8�-��S��Y�!�^�#'�>�>�#:�#:�D�I�I�d�O�L�RV�h�V�V�!%���!8�!8�&�#�(�(�4�.�Q�SX�X�X�
��d�
#�
#��!��%�s�x�x�/S�d�/S�'S�T�V[�[�[��D�z�4����U&��#�H����8*�!� �!�s$�I(�
I<�(I9�8I9�<
J�
Jzexpected AST, got %r� )r)rrt�	TypeErrorr|r}rX)r&r�r�r^r_ros ````@r�dumpr�usb���$; �; �z�d�C� � ��.����1H�1H�H�I�I�
��*�V�S�"9�"9��v����4�=���rc���SHjnX!R;dMX R;dM%[XS5nUc*[X5(dMFURS5(dM^[	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_lineno�end_col_offsetN�end_)r{r%�hasattr�
startswith�setattr)�new_node�old_node�attrr/s    r�
copy_locationr��se��
G���'�'�'�D�4H�4H�,H��H�D�1�E�� ���'�'�D�O�O�F�,C�,C����.�G��Orc�,^�U4SjmT"USSSS5 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��>�SUR;a$[US5(dXlOURnSUR;a![USS5cX0lOURnSUR;a$[US5(dX lOUR
nSUR;a![USS5cX@lOURn[U5H
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      �rr��#fix_missing_locations.<locals>._fix�s�����t�'�'�'��4��*�*�$�������4�+�+�+��t�\�4�0�8�",��!�_�_�
��4�+�+�+��4��.�.�",��!�_�_�
��t�/�/�/��t�-�t�4�<�&4�#�!%�!4�!4��%�d�+�E���
��G�,rrbrrl)r&r�s @r�fix_missing_locationsr��s ���H�.	��q�!�Q����Krrbc�&�[U5H�n[U[5(a[USS5U-UlM/SUR
;a[USS5U-UlSUR
;dMf[USS5=ncMxX1-UlM� 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#rr�)�walkr�
TypeIgnorer%r#r{r�)r&�nr�r�s    r�increment_linenor��s����d����e�Z�(�(�"�5�(�A�6��:�E�L���u�(�(�(�"�5�(�A�6��:�E�L��E�-�-�-�&�u�l�A�>�>��K�)�~�E����Krc#�t# �URHnU[X54v� 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)rur%rv)r&�fields  r�iter_fieldsr�s=���
����	����-�-�-����	��	�s�8�'�8�
5�8�5�8c#��# �[U5H[up[U[5(aUv� M [U[5(dM7UHn[U[5(dMUv� 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�rrtrC)r&r�r��items    rr�r�"sS���
#�4�(����e�S�!�!��K�
��t�
$�
$����d�C�(�(��J��	)�s�?A.�A.�!
A.c���[U[[[[45(d"[SURR-5eUR(a"[URS[5(dgURSRn[U[5(a,[UR[5(a
URnOgU(aSSK
nURU5nU$)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 docstringsrN)r�AsyncFunctionDef�FunctionDef�ClassDef�Moduler�r|r}r[�Exprr/r-rX�inspect�cleandoc)r&�clean�textr�s    r�
get_docstringr�0s����d�-�{�H�f�M�N�N��2�T�^�^�5L�5L�L�M�M��9�9��D�I�I�a�L�$�7�7���9�9�Q�<���D��$��!�!�j����S�&A�&A��z�z���������%���Krz(.*?(?:\r\n|\n|\r|$))c��/n[[RU5S5H$up4UbX1:�a U$URUS5 M& U$)zuSplit a string into lines ignoring form feed and other chars.

This mimics how the Python parser splits source code.
rbr)�	enumerate�
_line_pattern�finditerrx)r�maxlines�linesr#�matchs     r�_splitlines_no_ffr�IsT��

�E�"�=�#9�#9�&�#A�1�E�
����F�$5���L�	���U�1�X��F��Lrc�>�SnUHnUS;aX-
nMUS-
nM U$)z6Replace all chars except '\f\t' in a line with spaces.rdz	r�rl)r�result�cs   r�_pad_whitespacer�Vs/��
�F�
����;��K�F��c�M�F�	�
�Mr)�paddedc��URb
URcgURS-
nURS-
nURnURn[XS-S9nXC:Xa"XsR
5XVR5$U(a-[XsR
5SUR55nOSnX�UR
5USR5-n	XtR
5SUR5n
XsS-UnURSU	5 URU
5 SRU5$![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�rdr)r�r�r#r�rvr��encode�decoder��insertrxr~)rr&r�r#r�r�r�r��padding�first�lasts           r�get_source_segmentr�as@����?�?�"�d�&9�&9�&A�����q����_�_�q�(�
��_�_�
��,�,��
�f�!�|�<�E����}�#�#�%�j�@�G�G�I�I�
�!�%�-�"6�"6�"8��*�"E�"L�"L�"N�O�����F�m�*�*�,�Z�[�9�@�@�B�B�E���#�#�%�o�~�6�=�=�?�D���(�:�&�E�	�L�L��E��	�L�L���
�7�7�5�>���%����s�E�6E�
E
�E
c#�# �SSKJn U"U/5nU(a8UR5nUR[	U55 Uv� U(aM7gg7f)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��popleftrzr�)r&r��todos   rr�r��sA���"��$��=�D�
��|�|�~�����$�T�*�+��
��$�s�AA�Ac�*�\rSrSrSrSrSrSrSrg)�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�SURR-n[XUR5nU"U5$)z
Visit a node.�visit_)r|r}r%�
generic_visit)�selfr&�method�visitors    r�visit�NodeVisitor.visit�s2���D�N�N�3�3�3���$��(:�(:�;���t�}�rc��[U5Huup#[U[5(a3UH+n[U[5(dMUR	U5 M- MM[U[5(dMdUR	U5 Mw g)z9Called if no explicit visitor function exists for a node.N)r�rrCrtr�)r�r&r�r/r�s     rr��NodeVisitor.generic_visit�s^��'��-�L�E��%��&�&�!�D�!�$��,�,��
�
�4�(�"��E�3�'�'��
�
�5�!�
.rc�t�URn[R[U55nUc1[R	5HupE[X$5(dMUn O Ub7SU-n[
X5nSSKnURUS3[S5 U"U5$URU5$![a Nf=f)Nr�rz" is deprecated; add visit_Constant�)r/�_const_node_type_names�getr.�itemsrr%�warnings�warn�DeprecationWarningrvr�)	r�r&r/�	type_namer�r�r�r�r�s	         r�visit_Constant�NodeVisitor.visit_Constant�s����
�
��*�.�.�t�E�{�;�	���3�9�9�;�	���e�)�)� $�I��<�� ��	�)�F�
%�!�$�/�� ��
�
���(J�K�0�!�5��t�}�$��!�!�$�'�'��"�
��
�s�(B*�*
B7�6B7rlN)	r}�
__module__�__qualname__�__firstlineno__�__doc__r�r�r��__static_attributes__rlrrr�r��s���&�"�(rr�c��\rSrSrSrSrSrg)�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���[U5H�up#[U[5(au/nUHgn[U[5(a>UR	U5nUcM.[U[5(dURU5 MVUR
U5 Mi XCSS&M�[U[5(dM�UR	U5nUc
[X5 M�[XU5 M� U$r,)	r�rrCrtr�rzrx�delattrr�)r�r&r��	old_value�
new_valuesr/r�s       rr��NodeTransformer.generic_visit�s��� +�D� 1��E��)�T�*�*��
�&�E�!�%��-�-� $�
�
�5� 1�� �=�$�!+�E�3�!7�!7�&�-�-�e�4�$��%�%�e�,�'� *�!���I�s�+�+��:�:�i�0���#��D�(��D��2�%!2�&�rrlN)r}r�r�r�r�r�r�rlrrr�r��s
��!�Frr�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�SSKnURS[SS9 UR$)�Deprecated. Use value instead.rN�Attribute n�r���message�remove�r��_deprecated�_DEPRECATED_VALUE_ALIAS_MESSAGEr/�r�r�s  r�	_n_getterr��,�������#B�7�	�	
��z�z�rc�B�SSKnURS[SS9 Xlg)Nrr�r�r�r��r�r/r�s   r�	_n_setterr�'�������#B�7�	�	
��
rc�L�SSKnURS[SS9 UR$)r�rN�Attribute sr�r�r�r�s  r�	_s_getterr&r�rc�B�SSKnURS[SS9 Xlg)Nrrr�r�r�rs   r�	_s_setterr.rrc� �\rSrSrSrSrSrg)�_ABCi8c��SUlg)Nz3Deprecated AST node class. Use ast.Constant instead)r�)r�rIs  r�__init__�
_ABC.__init__:s	��O��rc��U[;a&SSKnURSUR3[SS9 [U[5(dgU[;aLURn[U[U5=(a% [U[RUS55(+$[RX5$![a gf=f)Nr�ast.r�r�Frl)
�_const_typesr�r�r��_DEPRECATED_CLASS_MESSAGErr-r/�_const_types_notr�rvr.�__instancecheck__)r��instr�r/s    rr�_ABC.__instancecheck__=s����,���� � ��s�'�'�(�)�1��
!�
�
�$��)�)���,��
��
�
��
�u�l�3�&7�8�I�"�5�*:�*>�*>�s�B�*G�H�H���%�%�c�0�0��"�
��
�s�B2�2
B?�>B?rlN)r}r�r�r�rrr�rlrrr	r	8s
��P�1rr	c�j�UHYnX0R;aMURRU5nU[U5:dM@[URSU<35e U[
;a1SSKnURSUR3[SS9 [U0UD6$[R"U/UQ70UD6$)Nz" got multiple values for argument rrr�r�)ru�indexrLr�r}rr�r�r�rr-�__new__)r�rI�kwargs�key�posr�s      r�_newrSs������k�k�!���k�k����$����T��?��s�|�|�n�,N�s�g�V�W�W�
��l�������3�#�#�$�%�/H�QX�	�	
���(��(�(����C�1�$�1�&�1�1rc��\rSrSrSr\rSrg)�Numic)r�rlN�r}r�r�r�rurrr�rlrrrrc����G��Grr)�	metaclassc��\rSrSrSr\rSrg)�Strig��srlNrrlrrr"r"grrr"c��\rSrSrSr\rSrg)�Bytesikr#rlNrrlrrr&r&krrr&c��\rSrSr\rSrg)�NameConstantiorlN)r}r�r�r�rrr�rlrrr(r(os���Grr(c��\rSrSrSrSrSrg)�Ellipsisirrlc��U[La(SSKnURS[SS9 [	S/UQ70UD6$[R
"U/UQ70UD6$)Nrzast.Ellipsisr�r�.)�
_ast_Ellipsisr�r�rr-r)r�rIrr�s    rr�Ellipsis.__new__usZ���-���� � ��(A�'�
!�
��C�1�$�1�&�1�1�����5�d�5�f�5�5rN)r}r�r�r�rurr�rlrrr*r*rs���G�6rr*.c��\rSrSrSrSrg)�slicei�zDeprecated AST node class.rlN�r}r�r�r�r�r�rlrrr/r/�s��$rr/c��\rSrSrSrSrSrg)�Indexi�z@Deprecated AST node class. Use the index value directly instead.c��U$r,rl)r�r/rs   rr�
Index.__new__�s���rrlN�r}r�r�r�r�rr�rlrrr2r2�s
��J�rr2c�"�\rSrSrSrSSjrSrg)�ExtSlicei�z1Deprecated AST node class. Use ast.Tuple instead.rlc�>�[[U5[540UD6$r,)r?rC�Load)r��dimsrs   rr�ExtSlice.__new__�s���T�$�Z���2�6�2�2rN)rlr5rlrrr7r7�s
��;�3rr7r:c��UR$)zDeprecated. Use elts instead.�rA�r�s r�_dims_getterr?�s���y�y�rc��Xlgr,r=�r�r/s  r�_dims_setterrB�s���	rc��\rSrSrSrSrg)�Suitei��/Deprecated AST node class.  Unused in Python 3.rlNr0rlrrrDrD����9rrDc��\rSrSrSrSrg)�AugLoadi�rErlNr0rlrrrHrH�rFrrHc��\rSrSrSrSrg)�AugStorei�rErlNr0rlrrrJrJ�rFrrJc��\rSrSrSrSrg)�Parami�rErlNr0rlrrrLrL�rFrrL�1ec��\rSrSrSr\"5r\"5r\"5r\"5r	\"5r
\"5r\"5r\"5r
\"5r\r\"5r\"5r\"5r\"5r\"5r\"5r\"5r\"5r\"5rSrSrg)�_Precedencei�z5Precedence table that originated from python grammar.c�P�URUS-5$![a Us$f=f�Nrb)r|rr>s r�next�_Precedence.next�s.��	��>�>�$��(�+�+���	��K�	�s��%�%rlN)r}r�r�r�r�r�
NAMED_EXPR�TUPLE�YIELD�TEST�OR�AND�NOT�CMP�EXPR�BOR�BXOR�BAND�SHIFT�ARITH�TERM�FACTOR�POWER�AWAIT�ATOMrRr�rlrrrOrO�s���?���J��F�E��F�E��6�D�	
��B�
�&�C�
�&�C�
�&�C��6�D�
�C��6�D��6�D��F�E��F�E��6�D�
�V�F��F�E��F�E��6�D�rrO)�'�")z"""�'''c��^�\rSrSrSrSrSrSrSrS�Sjr	Sr
\S�S
j5r\S	S.Sj5r
\S
5rSrSrSrSrSrSrU4SjrSrSrSrSrSrSrSrSrSrSrSr 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/r0S0r1S1r2S2r3S3r4S4r5S5r6S6r7S7r8S8r9S9r:S:r;S;r<S<r=S=r>S>r?S?r@\AS@SA.SBjrB\ASC.SDjrCSErDS�SFjrESGrFSHrGSIrHSJrISKrJSLrKSMrLSNrMSOrNSPrOSQrPSRrQSSrRSTrSSUrTSVSWSXSYSZ.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"Sj5reSkrfSlSmSnSoSpSqSrSsStSuSv.
rgSwrhSxSySz.ri\VR�\VR�S{.rlS|rmS}rnS~roSrpS�rqS�rrS�rsS�rtS�ruS�rvS�rwS�rxS�ryS�rzS�r{S�r|S�r}S�r~S�rS�r�S�r�S�r�S�r�S�r�U=r�$)��	_Unparseri�z�Methods in this class recursively traverse an AST and
output source code for the abstract syntax; original formatting
is disregarded.c�J�/Ul0Ul0UlSUlSUlg)NrF)�_source�_precedences�
_type_ignores�_indent�_in_try_starr>s rr�_Unparser.__init__�s(��������������!��rc��[U5nU"[U55 UHnU"5 U"U5 M g![a gf=f)z7Call f on each item in seq, calling inter() in between.N)�iterrR�
StopIteration)r��inter�f�seqrns     r�
interleave�_Unparser.interleave�sG���3�i��	�
�d�3�i�L������!�����	��	�s�7�
A�Ac�^�[U5S:XaU"US5 TRS5 gTRU4SjX5 g)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.rbr�,c�&>�TRS5$�Nre��writer>s�r�<lambda>�&_Unparser.items_view.<locals>.<lambda>	����D�J�J�t�$4rN)rLr�ry)r��	traverserr�s`  r�
items_view�_Unparser.items_views6����u�:��?��e�A�h���J�J�s�O��O�O�4�i�Grc�J�UR(aURS5 gg)z8Adds a newline if it isn't the start of generated sourcercN)rmr�r>s r�
maybe_newline�_Unparser.maybe_newlines���<�<��J�J�t��rc�f�UR5 URSUR-U-5 g)zPIndent a piece of text and append it, according to the current
indentation levelz    N)r�r�rp�r�r�s  r�fill�_Unparser.fills*��	
�����
�
�6�D�L�L�(�4�/�0rc�:�URRU5 g)zAdd new source partsN)rmrzr�s  rr��_Unparser.writes�������D�!rNc#�N# �Uc/nURnXlUv� X lg7fr,)rm)r��buffer�original_sources   r�buffered�_Unparser.buffereds'����>��F��,�,������&��s�#%��extrac#�# �URS5 U(aURU5 U=RS-
slSv� U=RS-slg7f)z�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.
�:rbN)r�rp)r�r�s  r�block�_Unparser.block$s@���	
�
�
�3����J�J�u��������
�������s�AAc#�X# �URU5 Sv� URU5 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��start�ends   r�delimit�_Unparser.delimit2s!���
	
�
�
�5��
��
�
�3��s�(*c�F�U(aURX5$[5$r,)r�r)r�r�r��	conditions    r�
delimit_if�_Unparser.delimit_if;s����<�<��+�+��=� rc�L�URSSURU5U:�5$)z,Shortcut to adding precedence related parensrgrh)r��get_precedence)r��
precedencer&s   r�require_parens�_Unparser.require_parensAs%�����s�C��)<�)<�T�)B�Z�)O�P�Prc�V�URRU[R5$r,)rnr�rOrW�r�r&s  rr��_Unparser.get_precedenceEs!��� � �$�$�T�;�+;�+;�<�<rc�2�UHnXRU'M gr,)rn)r�r��nodesr&s    r�set_precedence�_Unparser.set_precedenceHs���D�&0���d�#�rc�R�[U[[[[45(a[UR5S:agURSn[U[5(dgURn[U[5(a"[UR[5(aU$gg)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``.rbNr)rr�r�r�r�rLr[r�r/r-rXr�s  r�get_raw_docstring�_Unparser.get_raw_docstringLs���
��#�[�(�F�C�
�
�
����^�a�
���y�y��|���$��%�%���z�z���d�H�%�%�*�T�Z�Z��*E�*E��K�+F�%rc��URRUR5=(d URnUbSU3$g)Nz	 # type: )ror�r#�type_comment)r�r&�comments   r�get_type_comment�_Unparser.get_type_comment\s?���$�$�(�(����5�J��9J�9J�����w�i�(�(�rc�>�[U[5(aUHnURU5 M g[TU]U5 gr,)rrC�traverse�superr�)r�r&r�r|s   �rr��_Unparser.traverseas4����d�D�!�!����
�
�d�#��
�G�M�$�rc�h�/UlURU5 SRUR5$)zzOutputs a source code string that, if converted back to an ast
(using ast.parse) will generate an AST equivalent to *node*rd)rmr�r~r�s  rr��_Unparser.visitks*������
�
�d���w�w�t�|�|�$�$rc���URU5=n(a0URU5 URURSS5 gURUR5 grQ)r��_write_docstringr�r[)r�r&�	docstrings   r�"_write_docstring_and_traverse_body�,_Unparser._write_docstring_and_traverse_bodyrsL���/�/��5�5�I�5��!�!�)�,��M�M�$�)�)�A�B�-�(��M�M�$�)�)�$rc���URVs0sHnURSUR3_M snUlUR	U5 URR5 gs snf)N�ignore)�type_ignoresr#�tagror��clear)r�r&r�s   r�visit_Module�_Unparser.visit_Moduleyse���+�+�
�+��
�M�M�V�F�J�J�<�0�0�+�
���	
�/�/��5���� � �"��
s�$A'c�^�TRSS5 TRU4SjTRUR5 SSS5 TR	S5 TRUR
5 g!,(df   N;=f)Nrgrhc�&>�TRS5$r~rr>s�rr��._Unparser.visit_FunctionType.<locals>.<lambda>������
�
�4�(r� -> )r�ryr��argtypesr��returnsr�s` r�visit_FunctionType�_Unparser.visit_FunctionType�sX���
�\�\�#�s�
#��O�O�(�$�-�-����
�$�
	
�
�
�6���
�
�d�l�l�#�
$�
#�s�,A5�5
Bc��UR5 UR[RUR5 URUR5 gr,)r�r�rOrVr/r�r�s  r�
visit_Expr�_Unparser.visit_Expr�s5���	�	�����K�-�-�t�z�z�:��
�
�d�j�j�!rc�p�UR[RU5 UR[RUR
UR5 URUR
5 URS5 URUR5 SSS5 g!,(df   g=f)Nz := )	r�rOrTr�rf�targetr/r�r�r�s  r�visit_NamedExpr�_Unparser.visit_NamedExpr�sp��
�
 �
 ��!7�!7��
>����� 0� 0�$�+�+�t�z�z�J��M�M�$�+�+�&��J�J�v���M�M�$�*�*�%�	?�
>�
>�s�A=B'�'
B5c�~^�TRS5 TRU4SjTRUR5 g)Nzimport c�&>�TRS5$r~rr>s�rr��(_Unparser.visit_Import.<locals>.<lambda>������
�
�4� 0r)r�ryr��namesr�s` r�visit_Import�_Unparser.visit_Import�s(����	�	�)�����0�$�-�-����Lrc�F^�TRS5 TRSUR=(d S-5 UR(aTRUR5 TRS5 TR	U4SjTR
UR5 g)Nzfrom �.rz import c�&>�TRS5$r~rr>s�rr��,_Unparser.visit_ImportFrom.<locals>.<lambda>�r�r)r�r�rp�moduleryr�r�r�s` r�visit_ImportFrom�_Unparser.visit_ImportFrom�sd����	�	�'���
�
�3�$�*�*�/��*�+��;�;��J�J�t�{�{�#��
�
�:�����0�$�-�-����Lrc�X�UR5 URHEnUR[RU5 URU5 UR
S5 MG URUR5 URU5=n(aUR
U5 gg)N� = )	r��targetsr�rOrUr�r�r/r�)r�r&r�r�s    r�visit_Assign�_Unparser.visit_Assign�s����	�	���l�l�F����� 1� 1�6�:��M�M�&�!��J�J�u��#�	
�
�
�d�j�j�!��0�0��6�6�<�6��J�J�|�$�7rc��UR5 URUR5 URSURUR
RR-S-5 URUR5 g)Nr�z= )	r�r�r�r��binopr7r|r}r/r�s  r�visit_AugAssign�_Unparser.visit_AugAssign�sZ���	�	���
�
�d�k�k�"��
�
�3����D�G�G�$5�$5�$>�$>�?�?�$�F�G��
�
�d�j�j�!rc���UR5 URSSUR(+=(a [UR[
55 UR
UR5 SSS5 URS5 UR
UR5 UR(a-URS5 UR
UR5 gg!,(df   Ny=f)Nrgrhr$r�)
r�r�r�rr�rGr�r��
annotationr/r�s  r�visit_AnnAssign�_Unparser.visit_AnnAssign�s����	�	��
�_�_�S�#�4�;�;��'X�:�d�k�k�SW�;X�
Y��M�M�$�+�+�&�Z��
�
�4���
�
�d�o�o�&��:�:��J�J�u���M�M�$�*�*�%��	Z�
Y�s�C#�#
C1c��URS5 UR(a-URS5 URUR5 gg)N�returnr�)r�r/r�r�r�s  r�visit_Return�_Unparser.visit_Return�s5���	�	�(���:�:��J�J�s�O��M�M�$�*�*�%�rc�&�URS5 g)N�pass�r�r�s  r�
visit_Pass�_Unparser.visit_Pass�s���	�	�&�rc�&�URS5 g)N�breakr�r�s  r�visit_Break�_Unparser.visit_Break�s���	�	�'�rc�&�URS5 g)N�continuer�r�s  r�visit_Continue�_Unparser.visit_Continue�s���	�	�*�rc�~^�TRS5 TRU4SjTRUR5 g)Nzdel c�&>�TRS5$r~rr>s�rr��(_Unparser.visit_Delete.<locals>.<lambda>�r�r)r�ryr�r�r�s` r�visit_Delete�_Unparser.visit_Delete�s(����	�	�&�����0�$�-�-����Nrc���URS5 URUR5 UR(a-UR	S5 URUR5 gg)Nzassert re)r�r��testr'r�r�s  r�visit_Assert�_Unparser.visit_Assert�sF���	�	�)���
�
�d�i�i� ��8�8��J�J�t���M�M�$�(�(�#�rc�~^�TRS5 TRU4SjTRUR5 g)Nzglobal c�&>�TRS5$r~rr>s�rr��(_Unparser.visit_Global.<locals>.<lambda>�r�r�r�ryr�r�r�s` r�visit_Global�_Unparser.visit_Global�s(����	�	�)�����0�$�*�*�d�j�j�Irc�~^�TRS5 TRU4SjTRUR5 g)Nz	nonlocal c�&>�TRS5$r~rr>s�rr��*_Unparser.visit_Nonlocal.<locals>.<lambda>�r�rrr�s` r�visit_Nonlocal�_Unparser.visit_Nonlocal�s(����	�	�+�����0�$�*�*�d�j�j�Irc�h�UR[RU5 URS5 UR(aVURS5 UR[RUR5 URUR5 SSS5 g!,(df   g=f)N�awaitr�)r�rOrer�r/r�rfr�r�s  r�visit_Await�_Unparser.visit_Await��l��
�
 �
 ��!2�!2�D�
9��J�J�w���z�z��
�
�3���#�#�K�$4�$4�d�j�j�A��
�
�d�j�j�)�:�
9�
9���A9B#�#
B1c�h�UR[RU5 URS5 UR(aVURS5 UR[RUR5 URUR5 SSS5 g!,(df   g=f)N�yieldr�)r�rOrVr�r/r�rfr�r�s  r�visit_Yield�_Unparser.visit_Yield�rrc�\�UR[RU5 URS5 UR(d[S5eUR
[RUR5 URUR5 SSS5 g!,(df   g=f)Nzyield from z-Node can't be used without a value attribute.)	r�rOrVr�r/rr�rfr�r�s  r�visit_YieldFrom�_Unparser.visit_YieldFrom�sm��
�
 �
 ��!2�!2�D�
9��J�J�}�%��:�:� �!P�Q�Q����� 0� 0�$�*�*�=��M�M�$�*�*�%�:�
9�
9�s�A3B�
B+c�V�URS5 UR(dUR(a[S5egUR	S5 URUR5 UR(a-UR	S5 URUR5 gg)N�raisez*Node can't use cause without an exception.r�z from )r��exc�causerr�r�r�s  r�visit_Raise�_Unparser.visit_Raise�sn���	�	�'���x�x��z�z� �#M�O�O���
�
�3���
�
�d�h�h���:�:��J�J�x� ��M�M�$�*�*�%�rc��URS5 UR5 URUR5 SSS5 URHnURU5 M UR
(aEURS5 UR5 URUR
5 SSS5 UR(aFURS5 UR5 URUR5 SSS5 gg!,(df   N�=f!,(df   Nw=f!,(df   g=f)N�try�else�finally)r�r�r�r[�handlers�orelse�	finalbody)r�r&�exs   r�do_visit_try�_Unparser.do_visit_trys����	�	�%��
�Z�Z�\��M�M�$�)�)�$���-�-�B��M�M�"�� ��;�;��I�I�f�������
�
�d�k�k�*���>�>��I�I�i� ������
�
�d�n�n�-�����\�������s#�D�D)�2D:�
D&�)
D7�:
Ec�p�URnSUlURU5 X lg!X lf=f)NF�rqr5�r�r&�prev_in_try_stars   r�	visit_Try�_Unparser.visit_Trys7���,�,��	1� %�D�����d�#� 0��� 0����-�5c�p�URnSUlURU5 X lg!X lf=f)NTr8r9s   r�
visit_TryStar�_Unparser.visit_TryStars7���,�,��	1� $�D�����d�#� 0��� 0��r=c���URUR(aSOS5 UR(a,URS5 UR	UR5 UR
(a,URS5 URUR
5 UR
5 UR	UR5 SSS5 g!,(df   g=f)Nzexcept*�exceptr�� as )r�rqr.r�r�r�r�r[r�s  r�visit_ExceptHandler�_Unparser.visit_ExceptHandler!s����	�	�t�0�0�)�h�?��9�9��J�J�s�O��M�M�$�)�)�$��9�9��J�J�v���J�J�t�y�y�!�
�Z�Z�\��M�M�$�)�)�$��\�\�s�/C�
C"c�(�UR5 URH%nURS5 URU5 M' URSUR-5 [US5(aUR
UR5 URSSUR=(d URS9 SnURH/nU(aURS5 OS	nURU5 M1 URH/nU(aURS5 OS	nURU5 M1 SSS5 UR5 URU5 SSS5 g!,(df   N9=f!,(df   g=f)
N�@zclass �type_paramsrgrh)r�FreT)r��decorator_listr�r�r�r��_type_params_helperrHr��basesrJr�r�r�)r�r&�deco�comma�es     r�visit_ClassDef�_Unparser.visit_ClassDef,s'�������'�'�D��I�I�c�N��M�M�$��(�	
�	�	�(�T�Y�Y�&�'��4��'�'��$�$�T�%5�%5�6�
�_�_�S�#�4�:�:�3N����_�
O��E��Z�Z����J�J�t�$� �E��
�
�a� � ��]�]����J�J�t�$� �E��
�
�a� �#�P��Z�Z�\��3�3�D�9��\�P�
O���\�s�>BE2�F�2
F�
Fc�(�URUS5 g)N�def��_function_helperr�s  r�visit_FunctionDef�_Unparser.visit_FunctionDefFs�����d�E�*rc�(�URUS5 g)Nz	async defrSr�s  r�visit_AsyncFunctionDef� _Unparser.visit_AsyncFunctionDefIs�����d�K�0rc���UR5 URH%nURS5 URU5 M' US-UR-nURU5 [US5(aUR
UR5 URSS5 URUR5 SSS5 UR(a,URS5 URUR5 URURU5S9 URU5 SSS5 g!,(df   N�=f!,(df   g=f)NrGr�rHrgrhr�r�)r�rIr�r�r�r�rJrHr�rIr�r�r�r�r�)r�r&�fill_suffixrL�def_strs     rrT�_Unparser._function_helperLs��������'�'�D��I�I�c�N��M�M�$��(���#�d�i�i�/���	�	�'���4��'�'��$�$�T�%5�%5�6�
�\�\�#�s�
#��M�M�$�)�)�$�$��<�<��J�J�v���M�M�$�,�,�'�
�Z�Z�d�3�3�D�9�Z�
:��3�3�D�9�;�
:�$�
#��
;�
:�s�'E�&E�
E�
E c��^�UbM[U5S:�a=TRSS5 TRU4SjTRU5 SSS5 ggg!,(df   g=f)Nrrirsc�&>�TRS5$r~rr>s�rr��/_Unparser._type_params_helper.<locals>.<lambda>`�����
�
�4�(8r)rLr�ryr�)r�rHs` rrJ�_Unparser._type_params_helper]sO����"�s�;�'7�!�';����c�3�'���� 8�$�-�-��U�(�'�(<�"�'�'�s�"A�
A!c�0�URUR5 UR(a,URS5 URUR5 UR(a-URS5 URUR5 gg)Nr$r�)r�r��boundr��
default_valuer�s  r�
visit_TypeVar�_Unparser.visit_TypeVarbsa���
�
�4�9�9���:�:��J�J�t���M�M�$�*�*�%�����J�J�u���M�M�$�,�,�-�rc��URSUR-5 UR(a-URS5 URUR5 gg)Nrr��r�r�rer�r�s  r�visit_TypeVarTuple�_Unparser.visit_TypeVarTupleksB���
�
�3����?�#�����J�J�u���M�M�$�,�,�-�rc��URSUR-5 UR(a-URS5 URUR5 gg)N�**r�rir�s  r�visit_ParamSpec�_Unparser.visit_ParamSpecqsC���
�
�4�$�)�)�#�$�����J�J�u���M�M�$�,�,�-�rc���URS5 URUR5 URUR5 URS5 URUR5 g)Nztype r�)r�r�r�rJrHr�r/r�s  r�visit_TypeAlias�_Unparser.visit_TypeAliaswsN���	�	�'���
�
�d�i�i� �� � ��!1�!1�2��
�
�5���
�
�d�j�j�!rc�(�URSU5 g)Nzfor ��_for_helperr�s  r�	visit_For�_Unparser.visit_For~s�������&rc�(�URSU5 g)Nz
async for rtr�s  r�visit_AsyncFor�_Unparser.visit_AsyncFor�s������t�,rc�~�URU5 UR[RUR5 URUR5 UR
S5 URUR5 URURU5S9 URUR5 SSS5 UR(aFURS5 UR5 URUR5 SSS5 gg!,(df   Nf=f!,(df   g=f)N� in r�r/)r�r�rOrUr�r�r�rtr�r�r[r2)r�r�r&s   rru�_Unparser._for_helper�s����	�	�$�����K�-�-�t�{�{�;��
�
�d�k�k�"��
�
�6���
�
�d�i�i� �
�Z�Z�d�3�3�D�9�Z�
:��M�M�$�)�)�$�;��;�;��I�I�f�������
�
�d�k�k�*����;�
:����s�!D�7D.�
D+�.
D<c���URS5 URUR5 UR5 URUR5 SSS5 UR
(a�[
UR
5S:Xa�[UR
S[5(a�UR
SnURS5 URUR5 UR5 URUR5 SSS5 UR
(a=[
UR
5S:Xa$[UR
S[5(aM�UR
(aFURS5 UR5 URUR
5 SSS5 gg!,(df   GNp=f!,(df   N�=f!,(df   g=f)Nzif rbrzelif r/)	r�r�rr�r[r2rLr�Ifr�s  r�visit_If�_Unparser.visit_If�s1���	�	�%���
�
�d�i�i� �
�Z�Z�\��M�M�$�)�)�$���k�k�c�$�+�+�.�!�3�
�4�;�;�q�>�SU�8V�8V��;�;�q�>�D��I�I�g���M�M�$�)�)�$������
�
�d�i�i�(��	�k�k�c�$�+�+�.�!�3�
�4�;�;�q�>�SU�8V�8V��;�;��I�I�f�������
�
�d�k�k�*�����\�����
��s#�G�8G�G%�
G�
G"�%
G3c��URS5 URUR5 UR5 URUR5 SSS5 UR
(aFURS5 UR5 URUR
5 SSS5 gg!,(df   Nf=f!,(df   g=f)Nzwhile r/)r�r�rr�r[r2r�s  r�visit_While�_Unparser.visit_While�s����	�	�(���
�
�d�i�i� �
�Z�Z�\��M�M�$�)�)�$���;�;��I�I�f�������
�
�d�k�k�*�����\����s�B9�C
�9
C�

Cc�$^�TRS5 TRU4SjTRUR5 TR	TRU5S9 TRUR5 SSS5 g!,(df   g=f)Nzwith c�&>�TRS5$r~rr>s�rr��&_Unparser.visit_With.<locals>.<lambda>�r�rr��r�ryr�r�r�r�r[r�s` r�
visit_With�_Unparser.visit_With�s]����	�	�'�����0�$�-�-����L�
�Z�Z�d�3�3�D�9�Z�
:��M�M�$�)�)�$�;�
:�
:���B�
Bc�$^�TRS5 TRU4SjTRUR5 TR	TRU5S9 TRUR5 SSS5 g!,(df   g=f)Nzasync with c�&>�TRS5$r~rr>s�rr��+_Unparser.visit_AsyncWith.<locals>.<lambda>�r�rr�r�r�s` r�visit_AsyncWith�_Unparser.visit_AsyncWith�s]����	�	�-� ����0�$�-�-����L�
�Z�Z�d�3�3�D�9�Z�
:��M�M�$�)�)�$�;�
:�
:�r�F��quote_types�escape_special_whitespacec��^^^�U4SjnSR[UT55mUnST;aUVs/sHof[;dMUPM nnUVs/sHofT;dM
UPM nnU(d,[T5m[	U4SjU5TS5nTSSU/4$T(aDURU4SjS	9 USSTS:Xa"[
US5S
:XdeTSSS-TS-mTU4$s snfs snf)
z{Helper for writing string literals, minimizing escapes.
Returns the tuple (string literal to write, possible quote types).
c�>�T(dUS;aU$US:XdUR5(d URS5RS5$U$)Nz
	�\�unicode_escape�ascii)�isprintabler�r�)r�r�s �r�escape_char�2_Unparser._str_literal_helper.<locals>.escape_char�sD���-��f�����D�y��
�
����x�x� 0�1�8�8��A�A��Hrrdrcc3�>># �UHnTSU;dMUv� M g7frkrl)rm�q�strings  �rrq�0_Unparser._str_literal_helper.<locals>.<genexpr>�s����C�[��F�1�I��N�!�!�[�s�
�	rrbr	c�>�USTS:H$)Nrr	rl)r��escaped_strings �rr��/_Unparser._str_literal_helper.<locals>.<lambda>�s���q��t�~�b�7I�/Ir)rrNr�)r~r@�
_MULTI_QUOTESryrR�sortrL)	r�r�r�r�r��possible_quotesr��quoter�s	 ` `    @r�_str_literal_helper�_Unparser._str_literal_helper�s
���	�����[�&�!9�:��%���>�!�*9�P�/�Q�-�=O�q�/�O�P�&5�Q�o��.�9P�1�o��Q���&�\�F��C�[�C�V�A�Y�O�E��!�B�<�%��(�(��� � �%I� �J��q�!�!�$��r�(:�:��?�1�-�.�!�3�3�3�!/���!4�t�!;�n�R�>P�!P����.�.��#Q��Qs�
C%�C%�	C*�C*�r�c�^�URXS9upUSnURUUU35 g)zKWrite string literal value with a best effort attempt to avoid backslashes.r�rN)r�r�)r�r�r��
quote_types    r�_write_str_avoiding_backslashes�)_Unparser._write_str_avoiding_backslashes�s:��"�6�6�v�6�W��� ��^�
��
�
�j�\�&��*��6�7rc��URS5 /nURH]nUR5nURU5 SSS5 UR	SRW5[
U[545 M_ /n[[5nSnUH�up8U(a9URUUSS9up9[U	5RU5(aSn OfU	nONSU;a&UV
s/sHo�[;dMU
PM nn
U(deUV
s/sHo�U;dM
U
PM n	n
U	(aU	nUR	U5 M� U(azS/nUR5 UHaup8U(aD[SU-5nS	nUR!U5(d[U55eU[#U5S
nUR	U5 Mc SRU5nUSnURUUU35 g!,(df   GN�=fs sn
fs sn
f)NrwrdFTr�rcrirhz'"r	r)r�rNr��_write_fstring_innerrxr~rr-rC�_ALL_QUOTESr�r>�
isdisjointr�r�ryr�rL)
r�r&�
fstring_partsr/r��new_fstring_partsr��fallback_to_repr�is_constant�new_quote_typesr��expected_prefixr�s
             r�visit_JoinedStr�_Unparser.visit_JoinedStr�s����
�
�3���
��[�[�E�����F��)�)�%�0�!�� � ������*�U�H�"=�>�
�!����;�'�� ��"/��E��)-�)A�)A�� +�.2�*B�*�&��
��'�2�2�;�?�?�'+�$��-���5�=�.9�"P�k��-�=O�1�k�K�"P�&�&�;�.9�"L�k��e�^�1�k��"L�"�"1�K��$�$�U�+�'#0�*�!�'�K��#�#�%�&3�"��� ��u��-�E�&+�O� �+�+�O�<�<�I�d�5�k�I�<�!�#�o�"6�r�:�E�!�(�(��/�
'4����)�*�� ��^�
��
�
�j�\�%����5�6�[!���,#Q��#Ms#�G-�%
G?�6G?�	H�H�-
G<	c�`�[U[5(a#URHnURX2S9 M g[U[5(a�[UR
[5(a�UR
RSS5RSS5nU(aHURSS5nURSS	5nURS
S5nURSS
5nURU5 g[U[5(aURU5 g[SU<35e)N��is_format_spec�{z{{�}z}}r�z\\rgz\'rhz\"rcz\nz"Unexpected node inside JoinedStr, )r�	JoinedStrrNr�r-r/rX�replacer��FormattedValue�visit_FormattedValuer)r�r&r�r/s    rr��_Unparser._write_fstring_inners����d�I�&�&������)�)�%�)�O�%�
��h�
'�
'�J�t�z�z�3�,G�,G��J�J�&�&�s�D�1�9�9�#�t�D�E���
�
�d�F�3���
�
�c�5�1���
�
�c�5�1���
�
�d�E�2���J�J�u��
��n�
-�
-��%�%�d�+��A�$��J�K�Krc��^�U4SjnTRSS5 U"UR5nURS5(aTRS5 TRU5 URS:wa'TRS[UR535 UR(a+TRS5 TRURSS	9 SSS5 g!,(df   g=f)
Nc�>�[T5"5nUR[RR	5U5 URU5$r,)r.r�rOrWrRr�)�inner�unparserr�s  �r�
unparse_inner�5_Unparser.visit_FormattedValue.<locals>.unparse_inner-s<����D�z�|�H��#�#�K�$4�$4�$9�$9�$;�U�C��>�>�%�(�(rr�r�r�r	�!r�Tr�)r�r/r�r��
conversion�chr�format_specr�)r�r&r��exprs`   rr��_Unparser.visit_FormattedValue,s����	)�
�\�\�#�s�
#� ����,�D����s�#�#��
�
�3���J�J�t�����"�$��
�
�Q�s�4�?�?�3�4�5�6�����
�
�3���)�)�$�*:�*:�4�)�P�$�
#�
#�s�B>C!�!
C/c�:�URUR5 gr,)r�rHr�s  r�
visit_Name�_Unparser.visit_Name>s���
�
�4�7�7�rc��UR5 URS:XaURS5 URUR[
S9 g)N�ur�)r��kindr�r�r/r�r�s  rr��_Unparser._write_docstringAs9���	�	���9�9����J�J�s�O��,�,�T�Z�Z�]�,�Src
�
�[U[[45(aNUR[	U5RS[5RSS[S[S355 gUR[	U55 g)N�inf�nanrg�-rh)rr1r2r�ryr��_INFSTRrAs  r�_write_constant�_Unparser._write_constantGsb���e�e�W�-�.�.�
�J�J��U������(����!�G�9�A�g�Y�a� 8�9�
�
�J�J�t�E�{�#rc�~�URn[U[5(a8URSS5 UR	UR
U5 SSS5 gUSLaUR
S5 gURS:XaUR
S5 URUR5 g!,(df   g=f)Nrgrh.�...r�)r/rrr�r�r�r�r�)r�r&r/s   rr��_Unparser.visit_ConstantSs����
�
���e�U�#�#����c�3�'����� 4� 4�e�<�(�'�
�c�\��J�J�u���y�y�C���
�
�3��� � ����,�(�'�s�B.�.
B<c�^�TRSS5 TRU4SjTRUR5 SSS5 g!,(df   g=f)Nrirsc�&>�TRS5$r~rr>s�rr��&_Unparser.visit_List.<locals>.<lambda>ar�r)r�ryr�rAr�s` r�
visit_List�_Unparser.visit_List_s6���
�\�\�#�s�
#��O�O�4�d�m�m�T�Y�Y�O�$�
#�
#���,A	�	
Ac���URSS5 URUR5 URHnURU5 M SSS5 g!,(df   g=f)Nrirs�r�r��elt�
generators�r�r&�gens   r�visit_ListComp�_Unparser.visit_ListCompc�F��
�\�\�#�s�
#��M�M�$�(�(�#������
�
�c�"�'�$�
#�
#���AA�
A*c���URSS5 URUR5 URHnURU5 M SSS5 g!,(df   g=f)Nrgrhr�r�s   r�visit_GeneratorExp�_Unparser.visit_GeneratorExpir�r�c���URSS5 URUR5 URHnURU5 M SSS5 g!,(df   g=f)Nr�r�r�r�s   r�
visit_SetComp�_Unparser.visit_SetCompor�r�c�2�URSS5 URUR5 URS5 URUR5 UR
HnURU5 M SSS5 g!,(df   g=f)Nr�r�r$)r�r�rr�r/r�r�s   r�visit_DictComp�_Unparser.visit_DictCompusb��
�\�\�#�s�
#��M�M�$�(�(�#��J�J�t���M�M�$�*�*�%������
�
�c�"�'�	$�
#�
#�s�A,B�
Bc�@�UR(aURS5 OURS5 UR[RUR
5 UR
UR
5 URS5 UR"[RR5UR/URQ76 UR
UR5 URH%nURS5 UR
U5 M' g)Nz async for z for r|� if )�is_asyncr�r�rOrUr�r�rWrRrt�ifs)r�r&�	if_clauses   r�visit_comprehension�_Unparser.visit_comprehension}s����=�=��J�J�}�%��J�J�w�����K�-�-�t�{�{�;��
�
�d�k�k�"��
�
�6�����K�,�,�1�1�3�T�Y�Y�J����J��
�
�d�i�i� ����I��J�J�v���M�M�)�$�"rc�8�UR[RU5 UR[RR	5UR
UR5 URUR
5 URS5 URUR5 URS5 UR[RUR5 URUR5 SSS5 g!,(df   g=f)Nr�z else )
r�rOrWr�rRr[rr�r�r2r�s  r�visit_IfExp�_Unparser.visit_IfExp�s���
�
 �
 ��!1�!1�4�
8����� 0� 0� 5� 5� 7����D�I�I�N��M�M�$�)�)�$��J�J�v���M�M�$�)�)�$��J�J�x� ����� 0� 0�$�+�+�>��M�M�$�+�+�&�9�
8�
8�s�C!D�
Dc�^�UR(aGTRSS5 TRU4SjTRUR5 SSS5 gTR	S5 g!,(df   g=f)Nr�r�c�&>�TRS5$r~rr>s�rr��%_Unparser.visit_Set.<locals>.<lambda>�rarz{*()})rAr�ryr�r�r�s` r�	visit_Set�_Unparser.visit_Set�sP����9�9����c�3�'���� 8�$�-�-����S�(�'�

�J�J�w��(�'�s�,A,�,
A:c	��^^�U4SjmUU4SjnTRSS5 TRU4SjU[URUR55 SSS5 g!,(df   g=f)Nc�l>�TRU5 TRS5 TRU5 g�Nr$�r�r�)�k�vr�s  �r�write_key_value_pair�2_Unparser.visit_Dict.<locals>.write_key_value_pair�s'����M�M�!���J�J�t���M�M�!�rc�>�UupUcCTRS5 TR[RU5 TR	U5 gT"X5 g)Nrm)r�r�rOr\r�)r�r
rr�rs   ��r�
write_item�(_Unparser.visit_Dict.<locals>.write_item�sG����D�A��y��
�
�4� ��#�#�K�$4�$4�a�8��
�
�a� �$�Q�*rr�r�c�&>�TRS5$r~rr>s�rr��&_Unparser.visit_Dict.<locals>.<lambda>�r�r)r�ryrPrMrN)r�r&rrs`  @r�
visit_Dict�_Unparser.visit_Dict�sK���	�
		+��\�\�#�s�
#��O�O�(�*�c�$�)�)�T�[�[�6Q�
�$�
#�
#�s�6A!�!
A/c�(�URSS[UR5S:H=(d" URU5[R
:�5 UR
URUR5 SSS5 g!,(df   g=f)Nrgrhr)r�rLrAr�rOrUr�r�r�s  r�visit_Tuple�_Unparser.visit_Tuple�sg��
�_�_�����	�	�N�a��P�4�#6�#6�t�#<�{�?P�?P�#P�
�

�O�O�D�M�M�4�9�9�5�
�
�
�s�'B�
B�~�not�+r�)�Invert�Notr8r9)rrrr�c��URURRRnURUnURX15 UR
U5 U[RLaUR
S5 URX1R5 URUR5 SSS5 g!,(df   g=f�Nr�)�unopr7r|r}�unop_precedencer�r�rOrcr�r:r�)r�r&�operator�operator_precedences    r�
visit_UnaryOp�_Unparser.visit_UnaryOp�s����9�9�T�W�W�.�.�7�7�8��"�2�2�8�<��
�
 �
 �!4�
;��J�J�x� �#�+�*<�*<�<��
�
�3����� 3�\�\�B��M�M�$�,�,�'�<�
;�
;�s
�A,C�
CrrG�/�%�<<�>>�|�^�&�//rm)
rRrS�Mult�MatMult�Div�Mod�LShift�RShift�BitOr�BitXor�BitAnd�FloorDiv�Pow)
rr�rrGr(r)r*r+r,r-r.r/rm)rmc�<�URURRRnURUnURX15 X R;aUR5nUnOUnUR5nURXAR5 URUR5 URSUS35 URXQR5 URUR5 SSS5 g!,(df   g=fr!)
r�r7r|r}�binop_precedencer��binop_rassocrRr�rTr�r�rU)r�r&r$r%�left_precedence�right_precedences      r�visit_BinOp�_Unparser.visit_BinOp�s����:�:�d�g�g�/�/�8�8�9��"�3�3�H�=��
�
 �
 �!4�
;��,�,�,�"5�":�":�"<��#6� �"5��#6�#;�#;�#=� �������;��M�M�$�)�)�$��J�J��8�*�A��'���� 0�*�*�=��M�M�$�*�*�%�<�
;�
;�s
�B6D
�
Dz==z!=�<z<=�>z>=�iszis not�inznot in)
�Eq�NotEq�Lt�LtE�Gt�GtE�Is�IsNot�In�NotInc��UR[RU5 UR"[RR	5UR
/URQ76 URUR
5 [URUR5HNup#URSURURR-S-5 URU5 MP SSS5 g!,(df   g=fr!)r�rOr[r�rRrT�comparatorsr�rP�opsr��cmpopsr|r})r�r&�orNs    r�
visit_Compare�_Unparser.visit_Compares���
�
 �
 ����$�
7������� 4� 4� 6��	�	�U�D�DT�DT�U��M�M�$�)�)�$��D�H�H�d�&6�&6�7����
�
�3����Q�[�[�-A�-A�!B�B�S�H�I��
�
�a� �8�8�
7�
7�s�CC<�<
D
�and�or)�And�Or)rWrXc�6^^^�TRURRRnTRUmUU4SjnTRTU5 SUS3mTR
UU4SjX1R5 SSS5 g!,(df   g=f)Nc�l>�TR5mTRTU5 TRU5 gr,)rRr�r�)r&r%r�s ��r�increasing_level_traverse�9_Unparser.visit_BoolOp.<locals>.increasing_level_traverses/���"5�":�":�"<����� 3�T�:��M�M�$�rr�c�&>�TRT5$r,r)r$r�s��rr��(_Unparser.visit_BoolOp.<locals>.<lambda>&s
���D�J�J�q�Mr)�boolopsr7r|r}�boolop_precedencer�ryrN)r�r&r$r]r%r$s`   @@r�visit_BoolOp�_Unparser.visit_BoolOpsw����<�<���� 1� 1� :� :�;��"�4�4�X�>��	 ��
 �
 �!4�d�
;��H�:�Q��A��O�O�1�3L�k�k�Z�<�
;�
;�s�(B
�

Bc��UR[RUR5 UR	UR5 [UR[5(a:[URR[5(aURS5 URS5 URUR5 g)Nr�r�)
r�rOrfr/r�rr-r0r�r�r�s  r�visit_Attribute�_Unparser.visit_Attribute(s{�����K�,�,�d�j�j�9��
�
�d�j�j�!��d�j�j�(�+�+�
�4�:�:�;K�;K�S�0Q�0Q��J�J�s�O��
�
�3���
�
�4�9�9�rc���UR[RUR5 UR	UR5 URSS5 SnURH/nU(aURS5 OSnUR	U5 M1 URH/nU(aURS5 OSnUR	U5 M1 SSS5 g!,(df   g=f)NrgrhFreT)	r�rOrfrFr�r�rIr�rJ)r�r&rMrNs    r�
visit_Call�_Unparser.visit_Call3s������K�,�,�d�i�i�8��
�
�d�i�i� �
�\�\�#�s�
#��E��Y�Y����J�J�t�$� �E��
�
�a� ���]�]����J�J�t�$� �E��
�
�a� �#�$�
#�
#�s
�BC"�"
C0c��SnUR[RUR5 UR	UR5 URSS5 U"UR5(a1URURURR5 OUR	UR5 SSS5 g!,(df   g=f)Nc�H�[U[5=(a UR$r,)rr?rA)�slice_values r�is_non_empty_tuple�5_Unparser.visit_Subscript.<locals>.is_non_empty_tupleFs���;��.�%��$�$�
rrirs)	r�rOrfr/r�r�r/r�rA)r�r&rns   r�visit_Subscript�_Unparser.visit_SubscriptEs���	�	
���K�,�,�d�j�j�9��
�
�d�j�j�!�
�\�\�#�s�
#�!�$�*�*�-�-�����
�
�t�z�z���?��
�
�d�j�j�)�$�
#�
#�s
�A$C�
Cc��URS5 UR[RUR5 URUR5 g)Nr)r�r�rOr\r/r�r�s  r�
visit_Starred�_Unparser.visit_StarredUs7���
�
�3�����K�,�,�d�j�j�9��
�
�d�j�j�!rc�&�URS5 g)Nr�rr�s  r�visit_Ellipsis�_Unparser.visit_EllipsisZs���
�
�5�rc�R�UR(aURUR5 URS5 UR(aURUR5 UR(a-URS5 URUR5 gg)Nr�)�lowerr�r��upper�stepr�s  r�visit_Slice�_Unparser.visit_Slice]sb���:�:��M�M�$�*�*�%��
�
�3���:�:��M�M�$�*�*�%��9�9��J�J�s�O��M�M�$�)�)�$�rc��URS5 URUR5 UR5 URHnURU5 M SSS5 g!,(df   g=f)Nzmatch )r�r��subjectr��cases)r�r&�cases   r�visit_Match�_Unparser.visit_MatchgsK���	�	�(���
�
�d�l�l�#�
�Z�Z�\��
�
���
�
�d�#�#��\�\�s�%A+�+
A9c��URUR5 UR(a-URS5 URUR5 ggr)r��argr�r�r�s  r�	visit_arg�_Unparser.visit_argns:���
�
�4�8�8���?�?��J�J�t���M�M�$�/�/�*�rc���SnURUR-nS/[U5[UR5-
-UR-n[	[X45S5H�upVUupxU(aSnOUR
S5 URU5 U(a"UR
S5 URU5 U[UR5:XdMyUR
S5 M� UR(dUR(a�U(aSnOUR
S5 UR
S5 UR(avUR
URR5 URR(a6UR
S5 URURR5 UR(av[URUR5HRupxUR
S5 URU5 U(dM0UR
S5 URU5 MT UR(a�U(aSnOUR
S5 UR
S	URR-5 URR(a7UR
S5 URURR5 ggg)
NTrbFrerfz, /rr$rm)�posonlyargsrIrL�defaultsr�rPr�r��vararg�
kwonlyargsr�r��kw_defaults�kwarg)	r�r&r��all_argsr�r�elements�a�ds	         r�visit_arguments�_Unparser.visit_argumentsts������#�#�d�i�i�/���6�S��]�S����-?�?�@�4�=�=�P��(��X�)@�!�D�O�E��D�A�����
�
�4� ��M�M�!����
�
�3���
�
�a� ���D�,�,�-�-��
�
�5�!� E��;�;�$�/�/�����
�
�4� ��J�J�s�O��{�{��
�
�4�;�;�?�?�+��;�;�)�)��J�J�t�$��M�M�$�+�+�"8�"8�9��?�?��D�O�O�T�-=�-=�>����
�
�4� ��
�
�a� ��1��J�J�s�O��M�M�!�$�?��:�:�����
�
�4� ��J�J�t�d�j�j�n�n�,�-��z�z�$�$��
�
�4� ��
�
�d�j�j�3�3�4�%�
rc���URcURS5 O,URUR5 URS5 URUR5 g)Nrmrf)r�r�r�r/r�s  r�
visit_keyword�_Unparser.visit_keyword�sC���8�8���J�J�t���J�J�t�x�x� ��J�J�s�O��
�
�d�j�j�!rc��UR[RU5 URS5 UR	5nURUR5 SSS5 W(aUR"S/UQ76 URS5 UR[RUR5 URUR5 SSS5 g!,(df   N�=f!,(df   g=f)N�lambdar�r$)	r�rOrWr�r�r�rIr�r[)r�r&r�s   r�visit_Lambda�_Unparser.visit_Lambda�s���
�
 �
 ��!1�!1�4�
8��J�J�x� �����F��
�
�d�i�i�(�!���
�
�3�(��(��J�J�t������ 0� 0�$�)�)�<��M�M�$�)�)�$�9�
8� ���9�
8�s$�"C1�C �A8C1� 
C.	�*C1�1
C?c��URUR5 UR(aURSUR-5 gg�NrC)r�r��asnamer�s  r�visit_alias�_Unparser.visit_alias�s3���
�
�4�9�9���;�;��J�J�v����+�,�rc��URUR5 UR(a-URS5 URUR5 ggr�)r��context_expr�
optional_varsr�r�s  r�visit_withitem�_Unparser.visit_withitem�s@���
�
�d�'�'�(�����J�J�v���M�M�$�,�,�-�rc�`�URS5 URUR5 UR(a,UR	S5 URUR5 UR5 URUR5 SSS5 g!,(df   g=f)Nzcase r�)r�r��pattern�guardr�r�r[r�s  r�visit_match_case�_Unparser.visit_match_case�sd���	�	�'���
�
�d�l�l�#��:�:��J�J�v���M�M�$�*�*�%�
�Z�Z�\��M�M�$�)�)�$��\�\�s�:B�
B-c�:�URUR5 gr,)r�r/r�s  r�visit_MatchValue�_Unparser.visit_MatchValue�s���
�
�d�j�j�!rc�:�URUR5 gr,)r�r/r�s  r�visit_MatchSingleton�_Unparser.visit_MatchSingleton�s�����T�Z�Z�(rc�^�TRSS5 TRU4SjTRUR5 SSS5 g!,(df   g=f)Nrirsc�&>�TRS5$r~rr>s�rr��/_Unparser.visit_MatchSequence.<locals>.<lambda>�r�r)r�ryr��patternsr�s` r�visit_MatchSequence�_Unparser.visit_MatchSequence�s8���
�\�\�#�s�
#��O�O�(�$�-�-����
�$�
#�
#�r�c�N�URnUcSnURSU35 g)N�_r)r�r�)r�r&r�s   r�visit_MatchStar�_Unparser.visit_MatchStar�s'���y�y���<��D��
�
�Q�t�f�:�rc�J^�U4SjnTRSS5 URnTRU4SjU[X1RSS95 UR
nUb,U(aTR
S5 TR
SU35 SSS5 g!,(df   g=f)	Nc�t>�UupTRU5 TRS5 TRU5 grr)�pairr
�pr�s   �r�write_key_pattern_pair�<_Unparser.visit_MatchMapping.<locals>.write_key_pattern_pair�s.����D�A��M�M�!���J�J�t���M�M�!�rr�r�c�&>�TRS5$r~rr>s�rr��._Unparser.visit_MatchMapping.<locals>.<lambda>�r�rT��strictrerm)r�rMryrPr��restr�)r�r&r�rMr�s`    r�visit_MatchMapping�_Unparser.visit_MatchMapping�s���	��\�\�#�s�
#��9�9�D��O�O�(�&��D�-�-��5�
�
�9�9�D�����J�J�t�$��
�
�R��v�;�'�$�
#�
#�s�A1B�
B"c�^�TR[RUR5 TR	UR5 TRSS5 URnTRU4SjTRU5 URnU(aGU4SjnU(aTRS5 TRU4SjU[X1RSS95 SSS5 g!,(df   g=f)	Nrgrhc�&>�TRS5$r~rr>s�rr��,_Unparser.visit_MatchClass.<locals>.<lambda>�r�rc�X>�UupTRUS35 TRU5 g)Nrf)r�r�)r�r�r�r�s   �r�write_attr_pattern�6_Unparser.visit_MatchClass.<locals>.write_attr_pattern�s(���$(�M�D��J�J�$��q�z�*��M�M�'�*rrec�&>�TRS5$r~rr>s�rr�r�s���D�J�J�t�,rTr�)r�rOrfr�r�r�r�ry�	kwd_attrsr�rP�kwd_patterns)r�r&r��attrsr�s`    r�visit_MatchClass�_Unparser.visit_MatchClass�s�������K�,�,�d�h�h�7��
�
�d�h�h��
�\�\�#�s�
#��}�}�H��O�O�(�$�-�-��
��N�N�E��+�
��J�J�t�$����,�&���0�0��>��$�
#�
#�s
�BC*�*
C8c���URnURnUcURS5 gUcURUR5 gUR[R
U5 UR
[RUR5 URUR5 URSUR35 SSS5 g!,(df   g=f)Nr�rC)	r�r�r�r�rOrWr�r]r�)r�r&r�r�s    r�
visit_MatchAs�_Unparser.visit_MatchAss����y�y���,�,���<��J�J�s�O�
�_��J�J�t�y�y�!��$�$�[�%5�%5�t�<��#�#�K�O�O�T�\�\�B��
�
�d�l�l�+��
�
�T�$�)�)��-�.�=�<�<�s
�-A$C�
C(c�B^�TR[RU5 TR"[RR	5/UR
Q76 TR
U4SjTRUR
5 SSS5 g!,(df   g=f)Nc�&>�TRS5$)Nz | rr>s�rr��)_Unparser.visit_MatchOr.<locals>.<lambda>s���D�J�J�u�$5r)r�rOr]r�rRr�ryr�r�s` r�
visit_MatchOr�_Unparser.visit_MatchOrs`���
�
 �
 ����$�
7������� 4� 4� 6�G����G��O�O�5�t�}�}�d�m�m�T�8�
7�
7�s�A%B�
B)rqrprnrmro)rdr,)F)�r}r�r�r�r�rryr�r�r�r�rr�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�rrr	r
rrrr"r%r+r5r;r?rDrOrUrXrTrJrfrjrnrqrvryrur�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�rrrrr"rOrZrcr#r&r�rarbr`r]r^r_rdr<�	frozensetr=r@rSrUrarYrXrbrcrfrirprsrvr|r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r��
__classcell__)r|s@rrkrk�s�����"�
�H��
1�"��'��'��#��������!�Q�=�1�� )�
 �%�%�#�$�"�
&�M�M�%�"�&�&����O�$�J�J�*�*�&�
&�
.�1�1�	%�:�4+�1�:�"V�
.�.�.�"�'�-�+�+�$+�%�%�&1�E�$/�LFQ�8�27�hL�&Q�$�T�
$�
-�P�#�#�#�#�%�'� ��,6��%��c�B�D����
�
�
�
�
�
�
�
�
�	�O�
(��������������
�E�"�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�������
�_�_�
�
�
�
�
�
��������� �W�%�L�&�$�����������F�!��4�(�G� +���{�~�~�F��[�	�!�$*� "�
�%�$�+�15�f"�	%�-�
.�%�"�)���(�(�./�U�Urrkc�8�[5nURU5$r,)rkr�)�ast_objr�s  r�unparser�s���{�H��>�>�'�"�"r)rr"r&r(r*c��U[;a4[U=[5U'nSSKnURSU3[SS9 U$[SUS35e)Nrrr�r�zmodule 'ast' has no attribute 'rg)�_deprecated_globals�globalsr�r�rrv)r�r/r�s   r�__getattr__r�'s`���"�"�"5�d�";�;��	�$��%������4�&�M�#<�W�	�	
���
�:�4�&��B�
C�Crc��SSKnURSS9nURSSSSS9 URS	S
SSS
S9 URSSSSS9 URSSSSS9 URSS[SSS9 UR	5nUR
S:Xa+Sn[RRR5nO;UR
n[UR
S5nUR5nSSS5 [WX2RURS 9n[[XbR UR"S!95 g!,(df   NU=f)"Nrz
python -m ast)�prog�infile�?r�z$the file to parse; defaults to stdin)�nargs�default�helpz-mz--mode�exec)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--indentrz'indentation of nodes (number of spaces))r.r�r�z<stdin>�rb)r
)r�r^)�argparse�ArgumentParser�add_argumentr0�
parse_argsr��sys�stdinr��read�openrr�no_type_comments�printr�r�r^)r��parserrIr�rr��trees       r�mainr2sO���
�
$�
$�/�
$�
:�F�
�����S�C��E�
����h�� G�G��I����,�d�=�H��J�
����4�\�.��/�����j�s�A�F��H�����D��{�{�c�������!�!�&�&�(���{�{��
�$�+�+�t�
$���[�[�]�F�%����y�y��8M�8M�N�D�	�$�t�(?�(?����
T�U�%�
$�s�!E�
E�__main__)z	<unknown>r�)TF)rb)Tr,)Xr�r��re�_ast�
contextlibrr�enumrrrrr]r�r�r�r�r�r�r�rr�r�r�r�r��objectr�r�r�rr�r-r�rrr�propertyr�r$r.r	rrr"r&r(r*r,r0r1r2rX�bytes�boolrrr�rtr/r2r7r?r?rBr:�modrD�expr_contextrHrJrLry�
float_info�
max_10_expr�rO�_SINGLE_QUOTESr�r�rkr�r��popr�r�rr})r�s0r�<module>rs0���4�	��2�,�,�H��t�b�H�08$�x49�S��E�S�l�" �F�.	���0�
�
�3�4�
�
��05�"�J�7(�&�7(�t8�k�8�xU� ����x���������)�Y�/�H�J��)�Y�/�H�J�1�4�1�62� �(�d���(�d���H����8�t��
6�x�4�
6��
��#�u�g�	��#��	�E�8��4��:�t�$��t�C�y�l����$����
	�.���J����	�5��U���	�7���I�z�	��%�C�%��E��
3�u�3��u�f������,��5�E�J�:�C�:�:�l�:�:�|�:�:�L�:���c�n�n�/�/�!�3�4�
4��
�g������>���
�/��/��/��rU��rU�h!#�D��C��	�'�)�-�-��
��C���
D�V�8�z���F���Ys�
!I

Filemanager

Name Type Size Permission Actions
__future__.cpython-313.pyc File 4.61 KB 0644
__hello__.cpython-313.pyc File 966 B 0644
_aix_support.cpython-313.pyc File 4.61 KB 0644
_android_support.cpython-313.pyc File 7.44 KB 0644
_apple_support.cpython-313.pyc File 3.4 KB 0644
_collections_abc.cpython-313.pyc File 45.6 KB 0644
_colorize.cpython-313.pyc File 3.92 KB 0644
_compat_pickle.cpython-313.pyc File 7.02 KB 0644
_compression.cpython-313.pyc File 7.62 KB 0644
_distutils_system_mod.cpython-313.pyc File 7.89 KB 0644
_ios_support.cpython-313.pyc File 2.65 KB 0644
_markupbase.cpython-313.pyc File 12.14 KB 0644
_opcode_metadata.cpython-313.pyc File 10.43 KB 0644
_osx_support.cpython-313.pyc File 17.7 KB 0644
_py_abc.cpython-313.pyc File 7.02 KB 0644
_pydatetime.cpython-313.pyc File 92.36 KB 0644
_pydecimal.cpython-313.pyc File 211.95 KB 0644
_pyio.cpython-313.pyc File 108.59 KB 0644
_pylong.cpython-313.pyc File 10.9 KB 0644
_sitebuiltins.cpython-313.pyc File 4.79 KB 0644
_strptime.cpython-313.pyc File 28.04 KB 0644
_sysconfigdata__linux_x86_64-linux-gnu.cpython-313.pyc File 60.07 KB 0644
_sysconfigdata__x86_64-linux-gnu.cpython-313.pyc File 60.06 KB 0644
_threading_local.cpython-313.pyc File 8.19 KB 0644
_weakrefset.cpython-313.pyc File 11.77 KB 0644
abc.cpython-313.pyc File 7.73 KB 0644
antigravity.cpython-313.pyc File 985 B 0644
argparse.cpython-313.pyc File 102.11 KB 0644
ast.cpython-313.pyc File 100.56 KB 0644
base64.cpython-313.pyc File 25.21 KB 0644
bdb.cpython-313.pyc File 39.61 KB 0644
bisect.cpython-313.pyc File 3.42 KB 0644
bz2.cpython-313.pyc File 14.81 KB 0644
cProfile.cpython-313.pyc File 8.46 KB 0644
calendar.cpython-313.pyc File 38.76 KB 0644
cmd.cpython-313.pyc File 18.52 KB 0644
code.cpython-313.pyc File 15.41 KB 0644
codecs.cpython-313.pyc File 39.59 KB 0644
codeop.cpython-313.pyc File 6.48 KB 0644
colorsys.cpython-313.pyc File 4.4 KB 0644
compileall.cpython-313.pyc File 20.22 KB 0644
configparser.cpython-313.pyc File 67.32 KB 0644
contextlib.cpython-313.pyc File 29.78 KB 0644
contextvars.cpython-313.pyc File 261 B 0644
copy.cpython-313.pyc File 10.38 KB 0644
copyreg.cpython-313.pyc File 7.36 KB 0644
csv.cpython-313.pyc File 20.21 KB 0644
dataclasses.cpython-313.pyc File 46.7 KB 0644
datetime.cpython-313.pyc File 411 B 0644
decimal.cpython-313.pyc File 2.93 KB 0644
difflib.cpython-313.pyc File 70.35 KB 0644
dis.cpython-313.pyc File 46.4 KB 0644
doctest.cpython-313.pyc File 105.01 KB 0644
enum.cpython-313.pyc File 83.7 KB 0644
filecmp.cpython-313.pyc File 14.67 KB 0644
fileinput.cpython-313.pyc File 20.15 KB 0644
fnmatch.cpython-313.pyc File 6.64 KB 0644
fractions.cpython-313.pyc File 37.42 KB 0644
ftplib.cpython-313.pyc File 41.34 KB 0644
functools.cpython-313.pyc File 41.26 KB 0644
genericpath.cpython-313.pyc File 7.63 KB 0644
getopt.cpython-313.pyc File 8.27 KB 0644
getpass.cpython-313.pyc File 7.14 KB 0644
gettext.cpython-313.pyc File 22.35 KB 0644
glob.cpython-313.pyc File 23.11 KB 0644
graphlib.cpython-313.pyc File 9.96 KB 0644
gzip.cpython-313.pyc File 31.23 KB 0644
hashlib.cpython-313.pyc File 7.99 KB 0644
heapq.cpython-313.pyc File 17.35 KB 0644
hmac.cpython-313.pyc File 10.41 KB 0644
imaplib.cpython-313.pyc File 61.18 KB 0644
inspect.cpython-313.pyc File 132.7 KB 0644
io.cpython-313.pyc File 4.17 KB 0644
ipaddress.cpython-313.pyc File 89.47 KB 0644
keyword.cpython-313.pyc File 1.02 KB 0644
linecache.cpython-313.pyc File 8.35 KB 0644
locale.cpython-313.pyc File 57.63 KB 0644
lzma.cpython-313.pyc File 15.35 KB 0644
mailbox.cpython-313.pyc File 115.95 KB 0644
mimetypes.cpython-313.pyc File 24.31 KB 0644
modulefinder.cpython-313.pyc File 27.73 KB 0644
netrc.cpython-313.pyc File 8.93 KB 0644
ntpath.cpython-313.pyc File 26.56 KB 0644
nturl2path.cpython-313.pyc File 2.67 KB 0644
numbers.cpython-313.pyc File 13.45 KB 0644
opcode.cpython-313.pyc File 3.97 KB 0644
operator.cpython-313.pyc File 16.96 KB 0644
optparse.cpython-313.pyc File 66 KB 0644
os.cpython-313.pyc File 44.75 KB 0644
pdb.cpython-313.pyc File 103.62 KB 0644
pickle.cpython-313.pyc File 76.57 KB 0644
pickletools.cpython-313.pyc File 78.54 KB 0644
pkgutil.cpython-313.pyc File 19.49 KB 0644
platform.cpython-313.pyc File 43.63 KB 0644
plistlib.cpython-313.pyc File 42.09 KB 0644
poplib.cpython-313.pyc File 17.99 KB 0644
posixpath.cpython-313.pyc File 17.7 KB 0644
pprint.cpython-313.pyc File 29 KB 0644
profile.cpython-313.pyc File 22.03 KB 0644
pstats.cpython-313.pyc File 36.97 KB 0644
pty.cpython-313.pyc File 7.23 KB 0644
py_compile.cpython-313.pyc File 9.83 KB 0644
pyclbr.cpython-313.pyc File 14.79 KB 0644
pydoc.cpython-313.pyc File 136.68 KB 0644
queue.cpython-313.pyc File 16.94 KB 0644
quopri.cpython-313.pyc File 9.34 KB 0644
random.cpython-313.pyc File 34.43 KB 0644
reprlib.cpython-313.pyc File 10.18 KB 0644
rlcompleter.cpython-313.pyc File 8.37 KB 0644
runpy.cpython-313.pyc File 14.05 KB 0644
sched.cpython-313.pyc File 7.42 KB 0644
secrets.cpython-313.pyc File 2.45 KB 0644
selectors.cpython-313.pyc File 25.74 KB 0644
shelve.cpython-313.pyc File 12.98 KB 0644
shlex.cpython-313.pyc File 14.5 KB 0644
shutil.cpython-313.pyc File 65.87 KB 0644
signal.cpython-313.pyc File 4.44 KB 0644
site.cpython-313.pyc File 31.86 KB 0644
sitecustomize.cpython-313.pyc File 299 B 0644
smtplib.cpython-313.pyc File 46.25 KB 0644
socket.cpython-313.pyc File 41.23 KB 0644
socketserver.cpython-313.pyc File 33.84 KB 0644
sre_compile.cpython-313.pyc File 627 B 0644
sre_constants.cpython-313.pyc File 630 B 0644
sre_parse.cpython-313.pyc File 623 B 0644
ssl.cpython-313.pyc File 63.68 KB 0644
stat.cpython-313.pyc File 5.39 KB 0644
statistics.cpython-313.pyc File 69.43 KB 0644
string.cpython-313.pyc File 11.38 KB 0644
stringprep.cpython-313.pyc File 24.67 KB 0644
struct.cpython-313.pyc File 325 B 0644
subprocess.cpython-313.pyc File 79.8 KB 0644
symtable.cpython-313.pyc File 22.65 KB 0644
tabnanny.cpython-313.pyc File 12.13 KB 0644
tarfile.cpython-313.pyc File 122.79 KB 0644
tempfile.cpython-313.pyc File 48.68 KB 0644
textwrap.cpython-313.pyc File 17.51 KB 0644
this.cpython-313.pyc File 1.38 KB 0644
threading.cpython-313.pyc File 61.72 KB 0644
timeit.cpython-313.pyc File 14.29 KB 0644
token.cpython-313.pyc File 3.49 KB 0644
tokenize.cpython-313.pyc File 24.84 KB 0644
trace.cpython-313.pyc File 33.17 KB 0644
traceback.cpython-313.pyc File 69.38 KB 0644
tracemalloc.cpython-313.pyc File 26.77 KB 0644
tty.cpython-313.pyc File 2.6 KB 0644
turtle.cpython-313.pyc File 171.21 KB 0644
types.cpython-313.pyc File 15.18 KB 0644
typing.cpython-313.pyc File 150.96 KB 0644
uuid.cpython-313.pyc File 31.4 KB 0644
warnings.cpython-313.pyc File 28.85 KB 0644
wave.cpython-313.pyc File 32.44 KB 0644
weakref.cpython-313.pyc File 31.06 KB 0644
webbrowser.cpython-313.pyc File 26.26 KB 0644
zipapp.cpython-313.pyc File 10.15 KB 0644
zipimport.cpython-313.pyc File 25.89 KB 0644
Filemanager