Hacked By AnonymousFox

Current Path : /opt/imunify360/venv/lib/python3.11/site-packages/docutils/__pycache__/
Upload File :
Current File : //opt/imunify360/venv/lib/python3.11/site-packages/docutils/__pycache__/nodes.cpython-311.pyc

�

i��fn<�	�:�dZdZddlmZddlZddlZddlZddlZGd�d��ZGd�de	��Z
d	�Z�d\d�ZGd�d
ee	��Z
Gd�de��ZGd�de��ZGd�de��ZGd�d��ZGd�d��ZGd�d��ZGd�d��ZGd�d��ZGd�d��ZGd �d!e��ZGd"�d#��ZGd$�d%��ZGd&�d'e��ZGd(�d)e��ZGd*�d+e��ZGd,�d-e��ZGd.�d/e��ZGd0�d1��ZGd2�d3��Z Gd4�d5e��Z!Gd6�d7e��Z"Gd8�d9��Z#Gd:�d;eee��Z$Gd<�d=eee��Z%Gd>�d?eee��Z&Gd@�dAee��Z'GdB�dCee��Z(GdD�dEee��Z)GdF�dGee��Z*GdH�dIee��Z+GdJ�dKee��Z,GdL�dMee��Z-GdN�dOee��Z.GdP�dQee��Z/GdR�dSee��Z0GdT�dUee��Z1GdV�dWee��Z2GdX�dYee��Z3GdZ�d[ee��Z4Gd\�d]ee��Z5Gd^�d_ee��Z6Gd`�daee��Z7Gdb�dcee��Z8Gdd�deee��Z9Gdf�dgee��Z:Gdh�diee��Z;Gdj�dkee��Z<Gdl�dmee��Z=Gdn�doee��Z>Gdp�dqee��Z?Gdr�dsee��Z@Gdt�duee��ZAGdv�dwee��ZBGdx�dyee��ZCGdz�d{ee��ZDGd|�d}ee��ZEGd~�dee��ZFGd��d�ee��ZGGd��d�ee��ZHGd��d�ee��ZIGd��d�ee��ZJGd��d�ee��ZKGd��d�ee��ZLGd��d�ee��ZMGd��d�ee��ZNGd��d�ee��ZOGd��d�ee��ZPGd��d�ee��ZQGd��d�ee��ZRGd��d�ee��ZSGd��d�ee��ZTGd��d�ee��ZUGd��d�ee��ZVGd��d�ee��ZWGd��d�ee��ZXGd��d�ee��ZYGd��d�ee��ZZGd��d�ee��Z[Gd��d�ee��Z\Gd��d�ee��Z]Gd��d�ee��Z^Gd��d�ee��Z_Gd��d�ee��Z`Gd��d�ee��ZaGd��d�eee��ZbGd��d�eee��ZcGd��d�eee ee"��ZdGd��d�eeee#e"��ZeGd��d�eeee#e"��ZfGd��d�ee��ZgGd„d�ee��ZhGdĄd�ee��ZiGdƄd�ee��ZjGdȄd�ee��ZkGdʄd�ee��ZlGd̄d�ee��ZmGd΄d�ee��ZnGdЄd�ee��ZoGd҄d�ee��ZpGdԄd�ee��ZqGdքd�eeee��ZrGd؄d�eee��ZsGdڄd�ee ee��ZtGd܄d�e e��ZuGdބd�e e��ZvGd�d�e e��ZwGd�d�ee e!e��ZxGd�d�e e!e��ZyGd�d�e e!e��ZzGd�d�e e��Z{Gd�d�e e��Z|Gd�d�e e��Z}Gd�d�e e��Z~Gd�d�e e��ZGd�d�e e��Z�Gd�d�e e��Z�Gd��d�ee e��Z�Gd��d�e e��Z�Gd��d�e e��Z�Gd��d�e e��Z�d�����Z�	Gd���d��Z�G�d��de���Z�G�d��de���Z��d�Z��d�Z��d�Z��d�Z�e�e���G�d	��d
e���Z�G�d��de���Z�G�d
��de���Z�G�d��de���Z�G�d��de���Z�G�d��de���Z�G�d��de���Z�G�d��de���Z��d�Z�ej��d��Z�ej��d��Z�i�d�d��d�d��d �d!��d"�d#��d$�d%��d&�d'��d(�d)��d*�d)��d+�d,��d-�d��d.�d/��d0�d1��d2�d%��d3�d4��d5�d6��d7�d'��d8�d'�i�d9�d:��d;�d<��d=�d>��d?�d<��d@�d%��dA�d4��dB�d'��dC�dD��dE�d,��dF�dG��dH�d<��dI�dJ��dK�dD��dL�dM��dN�dO��dP�d:��Z��dQ�dR�dS�dT�dU�dV�Z��dW�Z��dX�Z��dY�Z��dZ�Z��d[�Z�dS(]a�
Docutils document tree element class library.

Classes in CamelCase are abstract base classes or auxiliary classes. The one
exception is `Text`, for a text (PCDATA) node; uppercase is used to
differentiate from element classes.  Classes in lower_case_with_underscores
are element classes, matching the XML element generic identifiers in the DTD_.

The position of each node (the level at which it can occur) is significant and
is represented by abstract base classes (`Root`, `Structural`, `Body`,
`Inline`, etc.).  Certain transformations will be easier because we can use
``isinstance(node, base_class)`` to determine the position of the node in the
hierarchy.

.. _DTD: https://docutils.sourceforge.io/docs/ref/docutils.dtd
�reStructuredText�)�CounterNc���eZdZdZdZ	dZ	dZ	dZed���Z	e	j
d���Z	d�Zdd�Zdd	�Z
d
�Zd�Zd�Zd
�Zd�Zd�Zd�Zd�Z		dd�Z		dd�Z		dd�ZdS)�Nodez0Abstract base class of nodes in a document tree.Nc�L�	|jp|jjS#t$rYdSwxYw)zJReturn the `document` root node of the tree containing this Node.
        N)�	_document�parent�document�AttributeError��selfs �n/builddir/build/BUILD/imunify360-venv-2.3.5/opt/imunify360/venv/lib/python3.11/site-packages/docutils/nodes.pyr
z
Node.document6s;��	��>�9�T�[�%9�9���	�	�	��4�4�	���s��
#�#c��||_dS�N)r)r
�values  rr
z
Node.document?s
�������c��dS)a
        Node instances are always true, even if they're empty.  A node is more
        than a simple container.  Its boolean "truth" does not depend on
        having one or more subnodes in the doctree.

        Use `len()` to check node length.
        T�rs r�__bool__z
Node.__bool__Cs	���trc�j�|�	ddlmcm}|���}|�|��S)z6Return a DOM **fragment** representation of this Node.Nr)�xml.dom.minidom�dom�minidom�Document�	_dom_node�r
r�domroots   r�asdomz
Node.asdomMsA���;�)�)�)�)�)�)�)�)�)��,�,�.�.���~�~�g�&�&�&r�    rc��t�)zs
        Return an indented pseudo-XML representation, for test purposes.

        Override in subclasses.
        ��NotImplementedError)r
�indent�levels   r�pformatzNode.pformatTs
��"�!rc��t�)zReturn a copy of self.r!rs r�copyz	Node.copy\���!�!rc��t�)z3Return a deep copy of self (also copying children).r!rs r�deepcopyz
Node.deepcopy`r(rc��t�)z,Return a string representation of this Node.r!rs r�astextzNode.astextdr(rc��||_|jr>|j|_|j�|jj|_|j�|jj|_dSdSdSr)r	r
�source�current_source�line�current_line�r
�childs  r�setup_childzNode.setup_childhsZ������=�	8�!�]�E�N��|�#�#�}�;����z�!�!�]�7��
�
�
�	8�	8�"�!rc�~�d}|jj�d|jjz��		|�|��n$#ttf$r|cYSt$rYnwxYw|j	}	|dd�D]}|�
|��rd}n�n#t$rYnwxYwn#t$rd}YnwxYw|S)a�
        Traverse a tree of `Node` objects, calling the
        `dispatch_visit()` method of `visitor` when entering each
        node.  (The `walkabout()` method is similar, except it also
        calls the `dispatch_departure()` method before exiting each
        node.)

        This tree traversal supports limited in-place tree
        modifications.  Replacing one node with one or more nodes is
        OK, as is removing an element.  However, if the node removed
        or replaced occurs after the current node, the old node will
        still be traversed, and any new nodes will not.

        Within ``visit`` methods (and ``depart`` methods for
        `walkabout()`), `TreePruningException` subclasses may be raised
        (`SkipChildren`, `SkipSiblings`, `SkipNode`, `SkipDeparture`).

        Parameter `visitor`: A `NodeVisitor` object, containing a
        ``visit`` implementation for each `Node` subclass encountered.

        Return true if we should stop the traversal.
        Fz6docutils.nodes.Node.walk calling dispatch_visit for %sNT)
r
�reporter�debug�	__class__�__name__�dispatch_visit�SkipChildren�SkipNode�
SkipDeparture�children�walk�SkipSiblings�
StopTraversal)r
�visitor�stopr>r3s     rr?z	Node.walkqs+��.����!�'�'�D��n�%�
&�	'�	'�	'�	�
��&�&�t�,�,�,�,�� �(�+�
�
�
����� �
�
�
���
�����}�H�
�%�a�a�a�[���E��z�z�'�*�*��#������� �
�
�
���
�������	�	�	��D�D�D�	�����s_�A�B+�A(�B+�	A(�%B+�'A(�(
B+�3&B�B+�
B'�$B+�&B'�'B+�+B:�9B:c��d}d}|jj�d|jjz��		|�|��n#t$r|cYSt$rd}YnwxYw|j}	|dd�D]}|�	|��rd}n�n#t$rYnwxYwn#t$rYnt$rd}YnwxYw|rA|jj�d|jjz��|�
|��|S)a�
        Perform a tree traversal similarly to `Node.walk()` (which
        see), except also call the `dispatch_departure()` method
        before exiting each node.

        Parameter `visitor`: A `NodeVisitor` object, containing a
        ``visit`` and ``depart`` implementation for each `Node`
        subclass encountered.

        Return true if we should stop the traversal.
        TFz;docutils.nodes.Node.walkabout calling dispatch_visit for %sNz?docutils.nodes.Node.walkabout calling dispatch_departure for %s)r
r6r7r8r9r:r<r=r>�	walkaboutr@r;rA�dispatch_departure)r
rB�call_departrCr>r3s      rrEzNode.walkabout�s���������!�'�'�I��n�%�
&�	'�	'�	'�	�
$��&�&�t�,�,�,�,���
�
�
����� �
$�
$�
$�#����
$�����}�H�
�%�a�a�a�[���E����w�/�/��#������� �
�
�
���
�������	�	�	��D��	�	�	��D�D�D�	�����	-���%�+�+���>�2�3�
4�
4�
4�
�&�&�t�,�,�,��se�A	�B(�	A%�B(�A%�"B(�$A%�%
B(�0&B�B(�
B$�!B(�#B$�$B(�(
C�4C�Cc#�|K�t||��r|V�|jD]}|�|��Ed{V���dS)z3Return iterator that only supports instance checks.N)�
isinstancer>�
_fast_findall)r
�clsr3s   rrJzNode._fast_findall�se�����d�C� � �	��J�J�J��]�	0�	0�E��*�*�3�/�/�/�/�/�/�/�/�/�/�	0�	0rc#�ZK�|V�|jD]}|���Ed{V���dS)z3Return iterator that doesn't check for a condition.N)r>�_superfast_findallr2s  rrMzNode._superfast_findall�sS����
�
�
�
��]�	2�	2�E��/�/�1�1�1�1�1�1�1�1�1�1�	2�	2rTFc	��tjdtd���t|�|||||����S)zyReturn list of nodes following `self`.

        For looping, Node.findall() is faster and more memory efficient.
        z5nodes.Node.traverse() is obsoleted by Node.findall().���
stacklevel)�warnings�warn�PendingDeprecationWarning�list�findall�r
�	condition�include_self�descend�siblings�ascends      r�traversez
Node.traverse�sR��	�
�M�/�A�	?�	?�	?�	?��D�L�L��L�'�!)�6�3�3�4�4�	4rc#��K�|rd}|rT|rR|sP|�|���Ed{V��dSt|t��r|�|��Ed{V��dSt|t��r|}|fd�}|r|�||��r|V�|r9t	|j��r%|D]"}|�|dddd���Ed{V���#|s|r�|}|jr�|j�|��}	|j|	|ur-|j�||	dz��}	|j|	|u�-|j|	dzd�D]"}
|
�|d|dd���Ed{V���#|sdS|j}|j��dSdSdS)a�
        Return an iterator yielding nodes following `self`:

        * self (if `include_self` is true)
        * all descendants in tree traversal order (if `descend` is true)
        * the following siblings (if `siblings` is true) and their
          descendants (if also `descend` is true)
        * the following siblings of the parent (if `ascend` is true) and
          their descendants (if also `descend` is true), and so on.

        If `condition` is not None, the iterator yields only nodes
        for which ``condition(node)`` is true.  If `condition` is a
        node class ``cls``, it is equivalent to a function consisting
        of ``return isinstance(node, cls)``.

        If `ascend` is true, assume `siblings` to be true as well.

        If the tree structure is modified during iteration, the result
        is undefined.

        For example, given the following tree::

            <paragraph>
                <emphasis>      <--- emphasis.traverse() and
                    <strong>    <--- strong.traverse() are called.
                        Foo
                    Bar
                <reference name="Baz" refid="baz">
                    Baz

        Then tuple(emphasis.traverse()) equals ::

            (<emphasis>, <strong>, <#text: Foo>, <#text: Bar>)

        and list(strong.traverse(ascend=True) equals ::

            [<strong>, <#text: Foo>, <#text: Bar>, <reference>, <#text: Baz>]
        TNc�"�t||��Sr)rI)�node�
node_classs  rrXzNode.findall.<locals>.conditions��!�$�
�3�3�3rF)rXrYrZr[r\�)	rMrI�typerJ�lenr>rVr	�index)r
rXrYrZr[r\rar3r`re�siblings           rrVzNode.findall�s�����P�	��H��	�G�	�H�	�� ��2�2�4�4�4�4�4�4�4�4�4����I�t�,�,�
��-�-�i�8�8�8�8�8�8�8�8�8����i��&�&�	4�"�J�+5�
4�
4�
4�
4��	�Y�.�)�)�D�/�/�.��J�J�J��	G�s�4�=�)�)�	G��
G�
G�� �=�=�9�6:�D�27��)�G�G�G�G�G�G�G�G�G�G��	'�v�	'��D��+�

'���)�)�$�/�/���k�%�(��4�4� �K�-�-�d�E�A�I�>�>�E��k�%�(��4�4�#�{�5��7�8�8�4�6�6�G�&���"+�%)�7�!&�u� /� 6� 6�6�6�6�6�6�6�6�6��'��E��;�D��+�

'�

'�

'�	'�	'�

'�

'rc	�r�	t|�|||||����S#t$rYdSwxYw)z�
        Return the first node in the iterator returned by findall(),
        or None if the iterable is empty.

        Parameter list is the same as of traverse.  Note that `include_self`
        defaults to False, though.
        N)�nextrV�
StopIterationrWs      r�	next_nodezNode.next_node9s[��	�����Y��%,�h��@�@�A�A�
A���	�	�	��4�4�	���s�%(�
6�6r�rr)NTTFF)NFTFF)r9�
__module__�__qualname__�__doc__r	r.r0r�propertyr
�setterrrr%r'r*r,r4r?rErJrMr]rVrjrrrrr(s}������:�:�
�F�F�
�F�L��D�N��I�
����X���_����_�����'�'�'�'�"�"�"�"�"�"�"�"�"�"�"�"�"�8�8�8�,�,�,�\)�)�)�V0�0�0�2�2�2�CG�(-�
4�
4�
4�
4�BF�',�Q'�Q'�Q'�Q'�fEI�).�
�
�
�
�
�
rrc�"��eZdZdZ�fd�Z�xZS)�reprunicodezR
    Deprecated backwards compatibility stub. Use the standard `str` instead.
    c���tjdtd���t�����dS)Nz`nodes.reprunicode() is not required with Python 3 and will be removed in Docutils 0.21 or later.rOrP)rRrS�DeprecationWarning�super�__init__)r
�sr8s  �rrvzreprunicode.__init__MsE����
�H�(�Q�	8�	8�	8�	8�	���������r)r9rlrmrnrv�
__classcell__)r8s@rrrrrIsB�����������������rrrc�>�tjdtd���|S)z@
    Deprecated backwards compatibility stub returning `s`.
    z_nodes.ensure_str() is not required with Python 3 and will be removed in Docutils 0.21 or later.rOrP)rRrSrt)rws r�
ensure_strrzTs/��
�M�D�$��4�4�4�4�
�HrFc��|r|�dd��SdD]*}d�|�|����}�+|S)zw
    Return a string with nulls removed or restored to backslashes.
    Backslash-escaped spaces are also removed.
    ��\)z z
r|�)�replace�join�split)�text�restore_backslashes�respect_whitespace�seps    r�unescaper�_sQ�����|�|�F�D�)�)�)�.�	,�	,�C��7�7�4�:�:�c�?�?�+�+�D�D��rc�b�eZdZdZdZdZ	dd�Zdd�Zd�Zd	�Z	d
�Z
d�Zd�Zdd�Z
dd�Zdd�ZdS)�Texta
    Instances are terminal nodes (leaves) containing text only; no child
    nodes or attributes.  Initialize by passing a string to the constructor.

    Access the raw (null-escaped) text with ``str(<instance>)``
    and unescaped text with ``<instance>.astext()``.
    z#textrNc��t|t��rtd���|�tjdt
d���t�||��S)zuAssert that `data` is not an array of bytes
        and warn if the deprecated `rawsource` argument is used.
        zexpecting str data, not bytesNz_nodes.Text: initialization argument "rawsource" is ignored and will be removed in Docutils 2.0.rOrP)rI�bytes�	TypeErrorrRrSrt�str�__new__)rK�data�	rawsources   rr�zText.__new__|se���d�E�"�"�	=��;�<�<�<�� ��M�L�,��
<�
<�
<�
<��{�{�3��%�%�%r�c��|}t|��|kr|d|dz
�dz}d|j�dt|���d�S)N�� ...�<�: �>)rd�tagnamer�)r
�maxlenr�s   r�	shortreprzText.shortrepr�sJ�����t�9�9�v����	����	�?�V�+�D��!�\�\�\�3�t�9�9�9�9�5�5rc�.�|�d���S)N�D)r�)r�rs r�__repr__z
Text.__repr__�s���~�~�R�~�(�(�(rc�F�|�t|����Sr)�createTextNoder�)r
rs  rrzText._dom_node�s���%�%�c�$�i�i�0�0�0rc�:�tt|����Sr)r�r�rs rr,zText.astext�s���8�D�>�>�"�"�"rc�F�|�t|����Sr)r8r�rs rr'z	Text.copy�s���~�~�c�$�i�i�(�(�(rc�*�|���Sr)r'rs rr*z
Text.deepcopy�s���y�y�{�{�rrrc����	|jjjrG��z�d��}��fd�|�d��D��}d�|g|�R��dzSn#t
$rYnwxYw��z��fd�|������D��}|sdSd�|��dzS)Nz<#text>c3�H�K�|]}��dzzt|��zV��dS�rbN)�repr��.0r0r#r$s  ��r�	<genexpr>zText.pformat.<locals>.<genexpr>�sK�����<�<�!� ��q��)�D��J�J�6�<�<�<�<�<�<rT�
c���g|]}�|z��Srr)r�r0r#s  �r�
<listcomp>z Text.pformat.<locals>.<listcomp>�s���D�D�D�����D�D�Drr~)r
�settings�detailed�
splitlinesr�rr,)r
r#r$�tag�liness ``  rr%zText.pformat�s����	��}�%�.�
7� &�u���i�i�8��<�<�<�<�<�%)�_�_�T�%:�%:�<�<�<���y�y�#�����/�/�$�6�6�	
7��
�	�	�	��D�	�����%���D�D�D�D������)A�)A�)C�)C�D�D�D���	��2��y�y����$�&�&s�AA�
A*�)A*c�^�|�t�||����Sr)r8r��rstrip�r
�charss  rr�zText.rstrip��"���~�~�c�j�j��u�5�5�6�6�6rc�^�|�t�||����Sr)r8r��lstripr�s  rr�zText.lstrip�r�rr)r�rk)r9rlrmrnr�r>r�r�r�rr,r'r*r%r�r�rrrr�r�ms����������G��H�@�
&�
&�
&�
&�6�6�6�6�)�)�)�1�1�1�#�#�#�)�)�)����
'�
'�
'�
'�&7�7�7�7�7�7�7�7�7�7rr�c��eZdZdZdZ	dZ	eezZ	edzZ	dZ	dZ		dFd�Z
d	�Zd
�Zd�Z
d�ZdGd
�Zd�Zd�Zd�Zd�Zd�Zd�Zd�Zd�Zd�Zd�Zd�Zd�Zd�ZdGd�Zd�Zd�ZdGd�Z eZ!dFd�Z"d �Z#d!�Z$d"�Z%dHd$�Z&d%�Z'd&e(j)fd'�Z*d(�Z+d)�Z,d*�Z-d+�Z.d,�Z/dId.�Z0dId/�Z1d0�Z2d1�Z3d2�Z4e4d-d3fd4�Z5		dJd5�Z6		dJd6�Z7		dJd7�Z8dKd8�Z9d9�Z:d:�Z;d;�Z<d&e(j)fd<�Z=d&e(j)fd=�Z>dLd?�Z?d@�Z@dA�ZAdB�ZBdMdC�ZCeDdD���ZEeDdE���ZFdS)N�ElementaV
    `Element` is the superclass to all specific elements.

    Elements contain attributes and child nodes.
    They can be described as a cross between a list and a dictionary.

    Elements emulate dictionaries for external [#]_ attributes, indexing by
    attribute name (a string). To set the attribute 'att' to 'value', do::

        element['att'] = 'value'

    .. [#] External attributes correspond to the XML element attributes.
       From its `Node` superclass, Element also inherits "internal"
       class attributes that are accessed using the standard syntax, e.g.
       ``element.parent``.

    There are two special attributes: 'ids' and 'names'.  Both are
    lists of unique identifiers: 'ids' conform to the regular expression
    ``[a-z](-?[a-z0-9]+)*`` (see the make_id() function for rationale and
    details). 'names' serve as user-friendly interfaces to IDs; they are
    case- and whitespace-normalized (see the fully_normalize_name() function).

    Elements emulate lists for child nodes (element nodes and/or text
    nodes), indexing by integer.  To get the first child node, use::

        element[0]

    to iterate over the child nodes (without descending), use::

        for child in element:
            ...

    Elements may be constructed using the ``+=`` operator.  To add one new
    child node to element, do::

        element += node

    This is equivalent to ``element.append(node)``.

    To add a list of multiple child nodes at once, use the same ``+=``
    operator::

        element += [node1, node2]

    This is equivalent to ``element.extend([node1, node2])``.
    )�ids�classes�names�dupnames)�backrefs)r.Nz

r~c�d�||_	g|_	|�|��i|_	|jD]}g|j|<�
|���D]?\}}|���}||jvr|dd�|j|<�5||j|<�@|j�|jj	|_dSdSr)
r�r>�extend�
attributes�list_attributes�items�lowerr�r8r9)r
r�r>r��attrs      rrvzElement.__init__s���"���	�
��
�;����H�������4��'�	&�	&�C�#%�D�O�C� � �$�*�*�,�,�	-�	-�J�C���)�)�+�+�C��d�*�*�*�',�Q�Q�Q�x����$�$�',����$�$��<���>�2�D�L�L�L� �rc�l�|�|j��}|���D]R\}}t|t��rd�d�|D����}|�|d|z���S|jD]*}|�|�	|�����+|S)N� c3�6K�|]}t|���V��dSr��
serial_escape�r��vs  rr�z$Element._dom_node.<locals>.<genexpr>#s,���� K� K���q�q�!;�!;� K� K� K� K� K� Krz%s)
�
createElementr��attlistrIrUr��setAttributer>�appendChildr)r
r�element�	attributerr3s      rrzElement._dom_nodes����'�'���5�5�� $�����	:�	:��I�u��%��&�&�
L���� K� K�U� K� K� K�K�K��� � ��D�5�L�9�9�9�9��]�	:�	:�E�������� 8� 8�9�9�9�9��rc� �d}|jD];}||���z
}t|��dkr|dd�dz}n�<|dr/d|jj�dd�|d���d	|�d
�Sd|jj�d|�d
�S)Nr~�<�8r�r�r�� "�; z": r�r�)r>r�rdr8r9r�)r
r��cs   rr�zElement.__repr__)s�������	�	�A��A�K�K�M�M�!�D��4�y�y�2�~�~��C�R�C�y�6�)�������=�	@�	@�&*�n�&=�&=�&=�&*�i�i��W�
�&>�&>�&>�&>����F�
F�	@�"&��!8�!8�!8�$�$�$�?�?rc�~�|dr,d|jj�dd�|d���d�Sd|jzS)Nr�r�r�r�z"...>z<%s...>)r8r9r�r�rs rr�zElement.shortrepr6sS����=�	,�	,�%)�^�%<�%<�%<�%)�Y�Y�t�G�}�%=�%=�%=�%=�?�
?��t�|�+�+rc���|jrN|����d�d�|jD�����|�����S|���S)Nr~c3�4K�|]}t|��V��dSr)r�)r�r�s  rr�z"Element.__str__.<locals>.<genexpr>@s(����&E�&E�!�s�1�v�v�&E�&E�&E�&E�&E�&Er)r>�starttagr��endtag�emptytagrs r�__str__zElement.__str__=sc���=�	#�#�}�}����!�w�w�&E�&E�t�}�&E�&E�&E�E�E�E�#�{�{�}�}�}�.�
.��=�=�?�?�"rc��|�t}|jg}|���D]�\}}|�|�d|z��� t	|t
��r"d�|D��}d�|��}nt|��}||��}|�|�d|������dd�|��zS)Nz	%s="True"c�.�g|]}t|�����Srr�r�s  rr�z$Element.starttag.<locals>.<listcomp>Os"��D�D�D��-���4�4�D�D�Drr��=z<%s>)�pseudo_quoteattrr�r��appendrIrUr�r�)r
�	quoteattr�parts�namer�valuess      rr�zElement.starttagEs�����(�I������<�<�>�>�
	2�
	2�K�D�%��}����[�4�/�0�0�0���%��&�&�
#�D�D�e�D�D�D������(�(����E�
�
���I�e�$�$�E��L�L�D�D�D�%�%�0�1�1�1�1��������'�'rc��d|jzS)Nz</%s>)r�rs rr�zElement.endtagWs�����%�%rc��d�|���D��}dd�|jg|�R��zS)Nc3�,K�|]\}}|�d|�d�V��dS)z="�"Nr)r��nr�s   rr�z#Element.emptytag.<locals>.<genexpr>[s3����D�D�T�Q��1�1�1�a�a�a�(�D�D�D�D�D�Drz<%s/>r�)r�r�r�)r
r�s  rr�zElement.emptytagZsA��D�D�T�\�\�^�^�D�D�D�
�����4�<�"=�*�"=�"=�>�>�>�>rc�*�t|j��Sr)rdr>rs r�__len__zElement.__len__^s���4�=�!�!�!rc�P�t|t��r	||jvS||jvSr)rIr�r�r>�r
�keys  r�__contains__zElement.__contains__as.���c�3���	*��$�/�)�)��d�m�#�#rc�*�t|t��r
|j|St|t��r
|j|St|t
��r,|jdvs
Jd���|j|j|j�Std����N�Nrb�cannot handle slice with stridezFelement index must be an integer, a slice, or an attribute name string�
rIr�r��intr>�slice�step�startrCr�r�s  r�__getitem__zElement.__getitem__gs����c�3���		8��?�3�'�'�
��S�
!�
!�	8��=��%�%�
��U�
#�
#�	8��8�y�(�(�(�*K�(�(�(��=���3�8�!3�4�4��7�8�8�
8rc��t|t��r||jt|��<dSt|t��r!|�|��||j|<dSt|t��rE|jdvs
Jd���|D]}|�|���||j|j|j	�<dStd���r�)rIr�r�r�r4r>r�r�r�rCr�)r
r��itemr`s    r�__setitem__zElement.__setitem__ss����c�3���	8�(,�D�O�C��H�H�%�%�%�
��S�
!�
!�
	8����T�"�"�"�!%�D�M�#����
��U�
#�
#�	8��8�y�(�(�(�*K�(�(�(��
'�
'��� � ��&�&�&�&�04�D�M�#�)�C�H�,�-�-�-��7�8�8�
8rc��t|t��r
|j|=dSt|t��r
|j|=dSt|t
��r)|jdvs
Jd���|j|j|j�=dStd���)Nr�r�zMelement index must be an integer, a simple slice, or an attribute name stringr�r�s  r�__delitem__zElement.__delitem__�s����c�3���		B����$�$�$�
��S�
!�
!�	B��
�c�"�"�"�
��U�
#�
#�	B��8�y�(�(�(�*K�(�(�(��
�c�i���0�1�1�1��A�B�B�
Brc��|j|zSr�r>�r
�others  r�__add__zElement.__add__�s���}�u�$�$rc��||jzSrrrs  r�__radd__zElement.__radd__�s���t�}�$�$rc��t|t��r|�|��n|�|�|��|S)z4Append a node or a list of nodes to `self.children`.)rIrr�r�rs  r�__iadd__zElement.__iadd__�sF���e�T�"�"�	��K�K������
�
��K�K������rc�T�|j�d�|jD����S)Nc�6�g|]}|�����Sr)r,�r�r3s  rr�z"Element.astext.<locals>.<listcomp>�s ��>�>�>�u�E�L�L�N�N�>�>�>r)�child_text_separatorr�r>rs rr,zElement.astext�s3���(�-�-�>�>��
�>�>�>�@�@�	@rc�|�i}|j���D]\}}|�|��r|||<� |Sr)r�r��is_not_default)r
�attsr�rs    r�non_default_attributeszElement.non_default_attributes�sM�����/�/�/�1�1�	"�	"�J�C���"�"�3�'�'�
"�!��S�	���rc�h�t|��������Sr)�sortedrr�rs rr�zElement.attlist�s(���d�1�1�3�3�9�9�;�;�<�<�<rc�8�|j�||��Sr)r��get�r
r��failobjs   rrzElement.get�s����"�"�3��0�0�0rc��||jvSr�r��r
�attrs  r�hasattrzElement.hasattr�s���t��&�&rc�,�||jvr
|j|=dSdSrrrs  r�delattrzElement.delattr�s'���4�?�"�"����%�%�%�#�"rc�8�|j�||��Sr)r��
setdefaultrs   rr"zElement.setdefault�s����)�)�#�w�7�7�7rc���|�dg��D]#}|�d��r|dd�cS�$	|j�|��S#t$r|cYSwxYw)z�Return node's language tag.

        Look iteratively in self and parents for a class argument
        starting with ``language-`` and return the remainder of it
        (which should be a `BCP49` language tag) or the `fallback`.
        r�z	language-�	N)r�
startswithr	�get_languager)r
�fallbackrKs   r�get_language_codezElement.get_language_code�s����8�8�I�r�*�*�	�	�C��~�~�k�*�*�
��1�2�2�w����
�	��;�+�+�H�5�5�5���	�	�	��O�O�O�	���s�A�A%�$A%c�d�|�|��|j�|��dSr)r4r>r��r
r�s  rr�zElement.append�s2����������
���T�"�"�"�"�"rc�:�|D]}|�|���dSr�r�)r
r�r`s   rr�zElement.extend�s0���	�	�D��K�K������	�	rc��t|t��r2|�|��|j�||��dS|�	||||�<dSdSr)rIrr4r>�insert)r
rer�s   rr.zElement.insert�sh���d�D�!�!�	%����T�"�"�"��M� � ���-�-�-�-�-�
�
� $�D��u������
r���c�6�|j�|��Sr)r>�pop�r
�is  rr1zElement.pop�s���}� � ��#�#�#rc�:�|j�|��dSr)r>�remover*s  rr5zElement.remove�s���
���T�"�"�"�"�"rrc�:�|j�|||��Sr)r>re)r
r�r�rCs    rrez
Element.index�s���}�"�"�4���5�5�5rc��	|j�|��}n#t$rYdSwxYw|dkr|j|dz
ndS)z*Return preceding sibling node or ``None``.Nrrb)r	rerr2s  r�previous_siblingzElement.previous_sibling�s^��	���!�!�$�'�'�A�A���	�	�	��4�4�	����#$�q�5�5�t�{�1�Q�3���d�2s��
+�+c�4�||gkr||jvrdSdS)Nrrb�r�r�s  rrzElement.is_not_default�s&����9��?�?�s�d�&:�:�:��1��1rc��t|t��r|j}|jD],}|�||�|g�����-dS)z�
        Update basic attributes ('ids', 'names', 'classes',
        'dupnames', but not 'source') from node or dictionary `dict_`.
        N)rIrr��basic_attributes�append_attr_listr)r
�dict_r�s   r�update_basic_attszElement.update_basic_atts�sa��
�e�T�"�"�	%��$�E��(�	;�	;�C��!�!�#�u�y�y��b�'9�'9�:�:�:�:�	;�	;rc�Z�|D]'}|||vr||�|���(dS)z�
        For each element in values, if it does not exist in self[attr], append
        it.

        NOTE: Requires self[attr] and values to be sequence type and the
        former should specifically be a list.
        Nr,)r
rr�rs    rr=zElement.append_attr_list�sE���	)�	)�E��D��J�&�&��T�
�!�!�%�(�(�(��	)�	)rc���t|�|��t��s||g||<t|t��s|g}|�||��dS)a
        First, convert both self[attr] and value to a non-string sequence
        type; if either is not already a sequence, convert it to a list of one
        element.  Then call append_attr_list.

        NOTE: self[attr] and value both must not be None.
        N)rIrrUr=)r
rrs   r�coerce_append_attr_listzElement.coerce_append_attr_listsd���$�(�(�4�.�.�$�/�/�	&��t�*��D��J��%��&�&�	��G�E����d�E�*�*�*�*�*rTc�B�|s|�|���|||<dSdS)z�
        If self[attr] does not exist or force is True or omitted, set
        self[attr] to value, otherwise do nothing.
        N�r)r
rr�forces    r�replace_attrzElement.replace_attrs0���	�D�H�H�T�N�N�*��D��J�J�J�+�*rc�d�|�|��|ur|�||��dSdS)a
        If attr is an attribute of self, set self[attr] to
        [self[attr], value], otherwise set self[attr] to value.

        NOTE: replace is not used by this function and is kept only for
              compatibility with the other copy functions.
        N)rrB�r
rrrs    r�copy_attr_convertzElement.copy_attr_converts=���8�8�D�>�>��&�&��(�(��u�5�5�5�5�5�'�&rc��|�|��|urnt|�|��t��st|t��r|�||��dS|�|||��dSdS)a�
        If attr is an attribute of self and either self[attr] or value is a
        list, convert all non-sequence values to a sequence of 1 element and
        then concatenate the two sequence, setting the result to self[attr].
        If both self[attr] and value are non-sequences and replace is True or
        self[attr] is None, replace self[attr] with value. Otherwise, do
        nothing.
        N)rrIrUrBrFrHs    r�copy_attr_coercezElement.copy_attr_coerce(s����8�8�D�>�>��&�&��$�(�(�4�.�.�$�/�/�
8��%��&�&�
8��,�,�T�5�9�9�9�9�9��!�!�$��w�7�7�7�7�7�'�&rc��|�|��|urnt|�|��t��r-t|t��r|�||��dS|�|||��dSdS)aM
        If attr is an attribute of self and both self[attr] and value are
        lists, concatenate the two sequences, setting the result to
        self[attr].  If either self[attr] or value are non-sequences and
        replace is True or self[attr] is None, replace self[attr] with value.
        Otherwise, do nothing.
        N)rrIrUr=rFrHs    r�copy_attr_concatenatezElement.copy_attr_concatenate8s����8�8�D�>�>��&�&��$�(�(�4�.�.�$�/�/�
8��%��&�&�
8��%�%�d�E�2�2�2�2�2��!�!�$��w�7�7�7�7�7�'�&rc�f�|�|��|ur|�|||��dSdS)zz
        If replace is True or self[attr] is None, replace self[attr] with
        value.  Otherwise, do nothing.
        N)rrFrHs    r�copy_attr_consistentzElement.copy_attr_consistentGs?��
�8�8�D�>�>��&�&����d�E�7�3�3�3�3�3�'�&rFc���t|t��r|j}|r|j}n|j}|�|��t
||��D]}||||||���dS)a.
        Updates all attributes from node or dictionary `dict_`.

        Appends the basic attributes ('ids', 'names', 'classes',
        'dupnames', but not 'source') and then, for all other attributes in
        dict_, updates the same attribute in self.  When attributes with the
        same identifier appear in both self and dict_, the two values are
        merged based on the value of update_fun.  Generally, when replace is
        True, the values in self are replaced or merged with the values in
        dict_; otherwise, the values in self may be preserved or merged.  When
        and_source is True, the 'source' attribute is included in the copy.

        NOTE: When replace is False, and self contains a 'source' attribute,
              'source' is not replaced even when dict_ has a 'source'
              attribute, though it may still be merged into a list depending
              on the value of update_fun.
        NOTE: It is easier to call the update-specific methods then to pass
              the update_fun method to this function.
        N)rIrr��is_not_list_attribute�is_not_known_attributer?�filter)r
r>�
update_funr�
and_source�
filter_funr�s       r�update_all_attszElement.update_all_attsOs���*�e�T�"�"�	%��$�E��	5��3�J�J��4�J�	
���u�%�%�%��*�e�,�,�	7�	7�C��J�t�S�%��*�g�6�6�6�6�	7�	7rc�J�|�|tj||��dS)aC
        Updates all attributes from node or dictionary `dict_`.

        Appends the basic attributes ('ids', 'names', 'classes',
        'dupnames', but not 'source') and then, for all other attributes in
        dict_, updates the same attribute in self.  When attributes with the
        same identifier appear in both self and dict_ and replace is True, the
        values in self are replaced with the values in dict_; otherwise, the
        values in self are preserved.  When and_source is True, the 'source'
        attribute is included in the copy.

        NOTE: When replace is False, and self contains a 'source' attribute,
              'source' is not replaced even when dict_ has a 'source'
              attribute, though it may still be merged into a list depending
              on the value of update_fun.
        N)rWr�rO�r
r>rrUs    r�update_all_atts_consistantlyz$Element.update_all_atts_consistantlyus2��$	
���U�G�$@�'�'�	)�	)�	)�	)�	)rc�J�|�|tj||��dS)a
        Updates all attributes from node or dictionary `dict_`.

        Appends the basic attributes ('ids', 'names', 'classes',
        'dupnames', but not 'source') and then, for all other attributes in
        dict_, updates the same attribute in self.  When attributes with the
        same identifier appear in both self and dict_ whose values aren't each
        lists and replace is True, the values in self are replaced with the
        values in dict_; if the values from self and dict_ for the given
        identifier are both of list type, then the two lists are concatenated
        and the result stored in self; otherwise, the values in self are
        preserved.  When and_source is True, the 'source' attribute is
        included in the copy.

        NOTE: When replace is False, and self contains a 'source' attribute,
              'source' is not replaced even when dict_ has a 'source'
              attribute, though it may still be merged into a list depending
              on the value of update_fun.
        N)rWr�rMrYs    r�update_all_atts_concatenatingz%Element.update_all_atts_concatenating�s2��*	
���U�G�$A�7�'�	)�	)�	)�	)�	)rc�J�|�|tj||��dS)a[
        Updates all attributes from node or dictionary `dict_`.

        Appends the basic attributes ('ids', 'names', 'classes',
        'dupnames', but not 'source') and then, for all other attributes in
        dict_, updates the same attribute in self.  When attributes with the
        same identifier appear in both self and dict_ whose values are both
        not lists and replace is True, the values in self are replaced with
        the values in dict_; if either of the values from self and dict_ for
        the given identifier are of list type, then first any non-lists are
        converted to 1-element lists and then the two lists are concatenated
        and the result stored in self; otherwise, the values in self are
        preserved.  When and_source is True, the 'source' attribute is
        included in the copy.

        NOTE: When replace is False, and self contains a 'source' attribute,
              'source' is not replaced even when dict_ has a 'source'
              attribute, though it may still be merged into a list depending
              on the value of update_fun.
        N)rWr�rKrYs    r�update_all_atts_coercionz Element.update_all_atts_coercion�s2��,	
���U�G�$<�g�'�	)�	)�	)�	)�	)rc�J�|�|tj|���dS)a}
        Updates all attributes from node or dictionary `dict_`.

        Appends the basic attributes ('ids', 'names', 'classes',
        'dupnames', but not 'source') and then, for all other attributes in
        dict_, updates the same attribute in self.  When attributes with the
        same identifier appear in both self and dict_ then first any non-lists
        are converted to 1-element lists and then the two lists are
        concatenated and the result stored in self; otherwise, the values in
        self are preserved.  When and_source is True, the 'source' attribute
        is included in the copy.

        NOTE: When replace is False, and self contains a 'source' attribute,
              'source' is not replaced even when dict_ has a 'source'
              attribute, though it may still be merged into a list depending
              on the value of update_fun.
        )rUN)rWr�rI)r
r>rUs   r�update_all_atts_convertzElement.update_all_atts_convert�s5��$	
���U�G�$=�(2�	�	4�	4�	4�	4�	4rc��g|_dSrrrs r�clearz
Element.clear�s
����
�
�
rc��|�|��}t|t��r|�|��|||<dS|�||||dz�<dSdS)z8Replace one child `Node` with another child or children.Nrb)rerIrr4)r
�old�newres    rrzElement.replace�sh���
�
�3�����c�4� � �	&����S�!�!�!��D��K�K�K�
�_�"%�D��u�Q�w������_rc�H�|}t|t��s	|d}n#t$rd}YnwxYwt|t��r|�|��n(|jD] }||rJd|�d||������!|j�||��dS)zc
        Replace `self` node with `new`, where `new` is a node or a
        list of nodes.
        rNzLosing "z
" attribute: )rIr�
IndexErrorr�r?r<r	r)r
re�updater�s    r�replace_selfzElement.replace_self�s���
���#�t�$�$�	�
��Q������
�
�
�����
�����f�g�&�&�	F��$�$�T�*�*�*�*��,�
F�
F����9�F�F�F�69�c�c�4��9�9�E�F�F�}�F�����D�#�&�&�&�&�&s�"�1�1c���t|t��s|f}t|tt	|��|����D]#}|D]}t|||��r|ccS��$dS)aM
        Return the index of the first child whose class exactly matches.

        Parameters:

        - `childclass`: A `Node` subclass to search for, or a tuple of `Node`
          classes. If a tuple, any of the classes may match.
        - `start`: Initial index to check.
        - `end`: Initial index to *not* check.
        N)rI�tuple�range�minrd�r
�
childclassr��endrer�s      r�first_child_matching_classz"Element.first_child_matching_class�s����*�e�,�,�	'�$��J��5�#�c�$�i�i��"5�"5�6�6�	!�	!�E��
!�
!���d�5�k�1�-�-�!� �L�L�L�L�L�!�
!��trc���t|t��s|f}t|tt	|��|����D](}|D]}t|j||��rn� |cS�)dS)aI
        Return the index of the first child whose class does *not* match.

        Parameters:

        - `childclass`: A `Node` subclass to skip, or a tuple of `Node`
          classes. If a tuple, none of the classes may match.
        - `start`: Initial index to check.
        - `end`: Initial index to *not* check.
        N)rIrkrlrmrdr>rns      r�first_child_not_matching_classz&Element.first_child_not_matching_classs����*�e�,�,�	'�$��J��5�#�c�$�i�i��"5�"5�6�6�	�	�E��
�
���d�m�E�2�A�6�6���E��������trrc������z�|����d�}��fd�|jD��}d�|g|�R��S)Nr�c3�J�K�|]}|���dz��V��dSr�)r%)r�r�r#r$s  ��rr�z"Element.pformat.<locals>.<genexpr>s5�����G�G�A�Q�Y�Y�v�u�Q�w�/�/�G�G�G�G�G�Grr~)r�r>r�)r
r#r$�tagline�	childrepss ``  rr%zElement.pformats[����$�U�l�l�D�M�M�O�O�O�O�<��G�G�G�G�G���G�G�G�	��w�w��,�)�,�,�-�-�-rc��|jdd|ji|j��}|j|_|j|_|j|_|S)Nr�r)r8r�r�rr.r0�r
�objs  rr'zElement.copy sB���d�n�I�I�t�~�I���I�I�����
��[��
��9����
rc�v�|���}|�d�|jD����|S)Nc�6�g|]}|�����Sr)r*rs  rr�z$Element.deepcopy.<locals>.<listcomp>)s"��A�A�A�%�U�^�^�%�%�A�A�Ar)r'r�r>)r
r's  rr*zElement.deepcopy's7���y�y�{�{�����A�A�4�=�A�A�A�B�B�B��rc��tjdtd���d|vsJ�|d�|�����dS)z+Add a new class to the "classes" attribute.z�docutils.nodes.Element.set_class() is deprecated;  and will be removed in Docutils 0.21 or later.Append to Element['classes'] list attribute directlyrOrPr�r�N)rRrSrtr�r��r
r�s  r�	set_classzElement.set_class,s]���
�M�)�Q�	8�	8�	8�	8��$������Y����t�z�z�|�|�,�,�,�,�,rc���d|_t|di���|��}t|di���|��}|r|�J�d|_|r
|�J�d|_dSdS)zQNote that this Element has been referenced by its name
        `name` or id `id`.rb�expect_referenced_by_name�expect_referenced_by_idN)�
referenced�getattrr)r
r��id�by_name�by_ids     r�note_referenced_byzElement.note_referenced_by5s������
�$� ;�R�@�@�D�D�T�J�J����7��<�<�@�@��D�D���	#��#�#�#�!"�G���	!��>�>�>� �E����	!�	!rc��||jvS)z�
        Returns True if and only if the given attribute is NOT one of the
        basic list attributes defined for all Elements.
        r:�rKrs  rrQzElement.is_not_list_attributeFs���3�.�.�.rc��||jvS)zj
        Returns True if and only if the given attribute is NOT recognized by
        this class.
        )�known_attributesr�s  rrRzElement.is_not_known_attributeNs���3�/�/�/r)r~r)r/)T)TF)Frk�NN)Gr9rlrmrnr<�local_attributesr�r�r�rrvrr�r�r�r�r�r�r�r�r�rrrr	rr,rr�rrr r"�has_keyr(r�r�r.r1r5�sys�maxsizerer8rr?r=rBrFrIrKrMrOrWrZr\r^r`rbrrirqrsr%r'r*rr��classmethodrQrRrrrr�r��s�������-�-�^?��C�%��K�'�)9�9�O��'��4��G��G�+�"��?�3�3�3�3�<���@�@�@�,�,�,�#�#�#�(�(�(�(�$&�&�&�?�?�?�"�"�"�$�$�$�
8�
8�
8�
8�
8�
8�
B�
B�
B�%�%�%�%�%�%����@�@�@����=�=�=�1�1�1�1�'�'�'�&�&�&�8�8�8�8��G�
�
�
�
�#�#�#����%�%�%�$�$�$�$�#�#�#�!"���6�6�6�6�3�3�3����;�;�;�)�)�)�
+�
+�
+�����	6�	6�	6�	6�8�8�8� 
8�
8�
8�4�4�4�1E� $��$7�$7�$7�$7�L;?�05�)�)�)�)�*<@�16�)�)�)�)�07;�,1�)�)�)�)�24�4�4�4�*���&�&�&�'�'�'�,<=�#�+�����&@A�+.�;�����,.�.�.�.�
������
-�-�-�!�!�!�!�"�/�/��[�/��0�0��[�0�0�0rr�c� �eZdZdZdZ	dd�ZdS)�TextElementa�
    An element which directly contains text.

    Its children are all `Text` or `Inline` subclass nodes.  You can
    check whether an element's context is inline simply by checking whether
    its immediate parent is a `TextElement` instance (including subclasses).
    This is handy for nodes like `image` that can appear both inline and as
    standalone body elements.

    If passing children to `__init__()`, make sure to set `text` to
    ``''`` or some other suitable value.
    r~c��|dkr(t|��}tj|||g|�Ri|��dStj||g|�Ri|��dS�Nr~)r�r�rv)r
r�r�r>r��textnodes      rrvzTextElement.__init__is���2�:�:��D�z�z�H���T�9�h�
+��
+�
+�
+�)�
+�
+�
+�
+�
+�
��T�9�F�x�F�F�F�:�F�F�F�F�FrN�r~r~)r9rlrmrnrrvrrrr�r�WsC����������?�G�G�G�G�G�Grr�c��eZdZdZdd�ZdS)�FixedTextElementz5An element which directly contains preformatted text.r~c�H�tj|||g|�Ri|��d|jd<dS)N�preservez	xml:space)r�rvr�)r
r�r�r>r�s     rrvzFixedTextElement.__init__vs9����T�9�d�L�X�L�L�L��L�L�L�'1����$�$�$rNr�)r9rlrmrnrvrrrr�r�rs.������?�?�2�2�2�2�2�2rr�c��eZdZdZdS)�
ResolvablerN)r9rlrm�resolvedrrrr�r�s�������H�H�Hrr�c��eZdZd�ZdS)�BackLinkablec�<�|d�|��dS)Nr�r,)r
�refids  r�add_backrefzBackLinkable.add_backref�s!���Z�����&�&�&�&�&rN)r9rlrmr�rrrr�r��s#������'�'�'�'�'rr�c��eZdZdS)�RootN�r9rlrmrrrr�r����������Drr�c��eZdZdS)�TitularNr�rrrr�r��r�rr�c��eZdZdZdS)�PreBibliographicz<Category of Node which may occur before Bibliographic Nodes.N�r9rlrmrnrrrr�r��s������F�F�F�Frr�c��eZdZdS)�
BibliographicNr�rrrr�r��r�rr�c��eZdZdS)�
DecorativeNr�rrrr�r��r�rr�c��eZdZdS)�
StructuralNr�rrrr�r��r�rr�c��eZdZdS)�BodyNr�rrrr�r��r�rr�c��eZdZdS)�GeneralNr�rrrr�r��r�rr�c��eZdZdZdS)�
SequentialzList-like elements.Nr�rrrr�r��s���������rr�c��eZdZdS)�
AdmonitionNr�rrrr�r����������rr�c��eZdZdZdS)�SpecialzSpecial internal body elements.Nr�rrrr�r��s������)�)�)�)rr�c��eZdZdZdS)�	Invisiblez.Internal elements that don't appear in output.Nr�rrrr�r��s������8�8�8�8rr�c��eZdZdS)�PartNr�rrrr�r��r�rr�c��eZdZdS)�InlineNr�rrrr�r��r�rr�c��eZdZdS)�ReferentialNr�rrrr�r��r�rr�c��eZdZdZdZdS)�
TargetablerN)r9rlrmr��indirect_reference_namerrrr�r��s�������J�"��1�1rr�c��eZdZdZdS)�Labeledz(Contains a `label` as its first element.Nr�rrrr�r��s������2�2�2�2rr�c���eZdZdZd�Zd�Zd!d�Zd"d�Zd#d�Zd	�Z	d
�Z
d!d�Zd!d�Zd
�Z
d�Zd�Zd�Zd�Zd�Zd�Zd�Zd�Zd�Zd�Zd�Zd!d�Zd�Zd!d�Zd�Zd�Zd�Zd�Zd �Z dS)$r
z�
    The document root element.

    Do not instantiate this class directly; use
    `docutils.utils.new_document()` instead.
    c�N�tj|g|�Ri|��d|_	d|_	||_	||_	g|_	i|_	i|_	i|_		i|_
	i|_	i|_	i|_
	i|_	i|_	g|_	g|_	g|_	g|_	g|_	g|_	d|_	d|_	t1��|_	g|_	g|_	ddl}|j�|��|_	g|_ 	d|_!	||_"dS)Nrbr)#r�rvr/r1r�r6�indirect_targets�substitution_defs�substitution_names�refnames�refids�nameids�	nametypesr��
footnote_refs�
citation_refs�
autofootnotes�autofootnote_refs�symbol_footnotes�symbol_footnote_refs�	footnotes�	citations�autofootnote_start�symbol_footnote_startr�
id_counter�parse_messages�transform_messages�docutils.transforms�
transforms�Transformer�transformer�include_log�
decorationr)r
r�r6�args�kwargs�docutilss      rrvzdocument.__init__�s������/��/�/�/��/�/�/�"���I� ���8� ��
�+� ��
�'� "���,�!#���M�"$���	���
�=����;����.����	����&����N����N����3�!#���=� "���,�$&��!�6����7����%�"#���4�%&��"�3�!�)�)���7� ���6�"$���B�"�"�"�"�#�.�:�:�4�@�@���D����G����+�����rc�L�|j���}d|d<d|d<|S)zB
        Return dict with unpicklable references removed.
        Nr6r�)�__dict__r')r
�states  r�__getstate__zdocument.__getstate__?s0���
�"�"�$�$�� ��j��#��m���rNc��|�	ddlmcm}|���}|�|�|����|S)z-Return a DOM representation of this document.Nr)rrrrr�rrs   rrzdocument.asdomHsT���;�)�)�)�)�)�)�)�)�)��,�,�.�.�����D�N�N�7�3�3�4�4�4��rr~c��|dr[|dD]P}|j�||��|j||ur$|j�d|z��}|�||z
}�Q|S|jj}|jj}d}d}|dD]@}	|rtd|	z��dd�}nt|	��}||z}|r||jvrn��A|r|�d��r|dz}
n=||z}
|
�d��r#|
dd	��|pt|j	���d�}
	|j
|
xxdz
cc<d|
|j
|
fz}||jvrn�2|d�|��||j|<|S)Nr�zDuplicate ID: "%s".r~r��xrb�%�-r/Tz%s%d)r�r"r6�severer��	id_prefix�auto_id_prefix�make_id�endswithr�r�r�)r
r`�msgnode�suggested_prefixr��msgr�r��base_idr��prefixs           r�set_idzdocument.set_idPs�����;�	��5�k�
'�
'����#�#�B��-�-�-��8�B�<�t�+�+��-�.�.�/D�r�/I�J�J�C��*��3�����I��M�+�	���5����
����M�	�	�D��
(�!�#�d�(�+�+�A�B�B�/���!�$�-�-���W�$�B��
�2�T�X�-�-�����	
B�>�2�2�3�7�7�	
B��c����"�^�3���?�?�3�'�'�B�(.�s��s���(8�)A�+2�4�<�+@�+@�)A�)A�B�F�
����'�'�'�1�,�'�'�'��v�t��v�'>�?�?���T�X�%�%��	
�
	
�U����2����������	rc��t|d��D]9}||jvr|�|||||���%||j|<||j|<�:dS)a�
        `self.nameids` maps names to IDs, while `self.nametypes` maps names to
        booleans representing hyperlink type (True==explicit,
        False==implicit).  This method updates the mappings.

        The following state transition table shows how `self.nameids` items
        ("id") and `self.nametypes` items ("type") change with new input
        (a call to this method), and what actions are performed
        ("implicit"-type system messages are INFO/1, and
        "explicit"-type system messages are ERROR/3):

        ====  =====  ========  ========  =======  ====  =====  =====
         Old State    Input          Action        New State   Notes
        -----------  --------  -----------------  -----------  -----
        id    type   new type  sys.msg.  dupname  id    type
        ====  =====  ========  ========  =======  ====  =====  =====
        -     -      explicit  -         -        new   True
        -     -      implicit  -         -        new   False
        -     False  explicit  -         -        new   True
        old   False  explicit  implicit  old      new   True
        -     True   explicit  explicit  new      -     True
        old   True   explicit  explicit  new,old  -     True   [#]_
        -     False  implicit  implicit  new      -     False
        old   False  implicit  implicit  new,old  -     False
        -     True   implicit  implicit  new      -     True
        old   True   implicit  implicit  new      old   True
        ====  =====  ========  ========  =======  ====  =====  =====

        .. [#] Do not clear the name-to-id map or invalidate the old target if
           both old and new targets are external and refer to identical URIs.
           The new target is invalidated regardless.
        r�N)rkr��set_duplicate_name_idr�)r
r`r�r��explicitr�s      r�set_name_id_mapzdocument.set_name_id_map}ss��B�$�w�-�(�(�	0�	0�D��t�|�#�#��*�*�4��T�7�H�M�M�M�M�&(���T�"�'/���t�$�$�
	0�	0rc��|j|}|j|}|p||j|<|r�|r�d}|�S|j|}	d|vr"|d}
|	drd|	vr|	d|
krd}|dkrt|	|��d|j|<|j�|d|z|g|���}|�||z
}t||��ne||j|<|�|j|}	t|	|��n;|�)|s'd|j|<|j|}	t|	|��t||��|r|s.|�.|j�d|z|g|���}|�||z
}dSdSdSdS)NrO�refurir�rbz%Duplicate explicit target name: "%s".)r��	base_nodez%Duplicate implicit target name: "%s".)r�r�r��dupnamer6�system_message�info)r
r`r�r�r�r�old_id�old_explicitr$�old_noderr�s            rrzdocument.set_duplicate_name_id�s�����d�#���~�d�+��+�7�x���t���	 ��
,����%�#�x��/�H��4�'�'�!%�h���$�W�-�&� (�H� 4� 4� (�� 2�f� <� <�$%�E��q�y�y���$�/�/�/�-1���T�*��m�2�2��B�T�I� �T�T�3�3�3���&��s�N�G���d�#�#�#�#�%'���T�"��%�#�x��/�H��H�d�+�+�+���!�,�!�%)���T�"��8�F�+����$�'�'�'��D�$�����	��	��1C��-�$�$�7�$�>����%�/�/�C��"��3�����#�"�		�	�1C�1Crc��||jvSr)r�r~s  r�has_namezdocument.has_name�s���t�|�#�#rc�d�|�||��}|�|||d���dS)NF�r�r�r�r
�targetr�r�s    r�note_implicit_targetzdocument.note_implicit_target�s8��
�[�[���
)�
)�����V�R��5��A�A�A�A�Arc�d�|�||��}|�|||d���dS)NTrrrs    r�note_explicit_targetzdocument.note_explicit_target�s8��
�[�[���
)�
)�����V�R��4��@�@�@�@�@rc�n�|j�|dg���|��dS�N�refname)r�r"r��r
r`s  r�note_refnamezdocument.note_refname�s2���
� � ��i��"�5�5�<�<�T�B�B�B�B�Brc�n�|j�|dg���|��dS)Nr�)r�r"r�rs  r�
note_refidzdocument.note_refid�s2������t�G�}�b�1�1�8�8��>�>�>�>�>rc�x�|j�|��|dr|�|��dSdS)Nr�)r�r�r�r
rs  r�note_indirect_targetzdocument.note_indirect_target�sI����$�$�V�,�,�,��'�?�	&����f�%�%�%�%�%�	&�	&rc�0�|�|��dSr)r�rs  r�note_anonymous_targetzdocument.note_anonymous_target�s�����F�����rc�d�|�|��|j�|��dSr)r�r�r��r
�footnotes  r�note_autofootnotezdocument.note_autofootnote�s1�����H������!�!�(�+�+�+�+�+rc�d�|�|��|j�|��dSr)r�r�r��r
�refs  r�note_autofootnote_refzdocument.note_autofootnote_ref�s1�����C������%�%�c�*�*�*�*�*rc�d�|�|��|j�|��dSr)r�r�r�r#s  r�note_symbol_footnotezdocument.note_symbol_footnote�s1�����H������$�$�X�.�.�.�.�.rc�d�|�|��|j�|��dSr)r�r�r�r's  r�note_symbol_footnote_refz!document.note_symbol_footnote_ref�s1�����C�����!�(�(��-�-�-�-�-rc�d�|�|��|j�|��dSr)r�r�r�r#s  r�
note_footnotezdocument.note_footnote�s0�����H��������h�'�'�'�'�'rc���|�|��|j�|dg���|��|�|��dSr)r�r�r"r�rr's  r�note_footnote_refzdocument.note_footnote_ref��Y�����C������%�%�c�)�n�b�9�9�@�@��E�E�E����#�����rc�:�|j�|��dSr)r�r�)r
�citations  r�
note_citationzdocument.note_citations������h�'�'�'�'�'rc���|�|��|j�|dg���|��|�|��dSr)r�r�r"r�rr's  r�note_citation_refzdocument.note_citation_refr2rc��t|��}||jvrC|j�d|z|���}|�||z
}|j|}t	||��||j|<||jt
|��<dS)Nz-Duplicate substitution definition name: "%s".)r)�whitespace_normalize_namer�r6�errorrr��fully_normalize_name)r
�subdef�def_namer�r�r��oldnodes       r�note_substitution_defzdocument.note_substitution_defs���(��2�2���4�)�)�)��-�%�%�E��L� &�&�(�(�C��"��3����,�T�2�G��G�T�"�"�"�'-���t�$�>B��� 4�T� :� :�;�;�;rc�*�t|��|d<dSr)r9)r
�subrefrs   r�note_substitution_refzdocument.note_substitution_refs��5�g�>�>��y���rc�<�|j�||��dSr)r��add_pending)r
�pending�prioritys   r�note_pendingzdocument.note_pendings!����$�$�W�h�7�7�7�7�7rc�:�|j�|��dSr)r�r��r
�messages  r�note_parse_messagezdocument.note_parse_message s����"�"�7�+�+�+�+�+rc�:�|j�|��dSr)r�r�rIs  r�note_transform_messagezdocument.note_transform_message#s����&�&�w�/�/�/�/�/rc�>�||_|�	||_dS|dz|_dSr�)r/r1)r
r.�offsets   r�note_sourcezdocument.note_source&s/��$����>� &�D���� &��
�D���rc�r�|j|j|jfi|j��}|j|_|j|_|Sr)r8r�r6r�r.r0rys  rr'z
document.copy-sC���d�n�T�]�D�M�0�0�#��0�0���[��
��9����
rc��|jslt��|_|�ttf��}|�|�|j��n|�||j��|jSr)r�rsr��metar�r.)r
res  r�get_decorationzdocument.get_decoration4sh����	4�(�l�l�D�O��7�7��$��H�H�E��}����D�O�,�,�,�,����E�4�?�3�3�3���rrr�r�)!r9rlrmrnrvr�rr�rrr
rrrrrr!r%r)r+r-r/r1r5r7r?rBrGrKrMrPr'rTrrrr
r
�s
��������Z�Z�Z�x�������+�+�+�+�Z'0�'0�'0�'0�R(�(�(�T$�$�$�B�B�B�B�A�A�A�A�C�C�C�?�?�?�&�&�&�
���,�,�,�+�+�+�/�/�/�.�.�.�(�(�(����
(�(�(����

C�
C�
C�
C�?�?�?�8�8�8�8�,�,�,�0�0�0�+�+�+��������rr
c��eZdZdS)�titleNr�rrrrVrVCr�rrVc��eZdZdS)�subtitleNr�rrrrXrXDr�rrXc��eZdZdS)�rubricNr�rrrrZrZEr�rrZc��eZdZdZdS)rSz;Container for "invisible" bibliographic data, or meta-data.Nr�rrrrSrSLs������E�E�E�ErrSc��eZdZdS)�docinfoNr�rrrr]r]Tr�rr]c��eZdZdS)�authorNr�rrrr_r_Ur�rr_c��eZdZdS)�authorsNr�rrrraraVr�rrac��eZdZdS)�organizationNr�rrrrcrcWr�rrcc��eZdZdS)�addressNr�rrrrereXr�rrec��eZdZdS)�contactNr�rrrrgrgYr�rrgc��eZdZdS)�versionNr�rrrririZr�rric��eZdZdS)�revisionNr�rrrrkrk[r�rrkc��eZdZdS)�statusNr�rrrrmrm\r�rrmc��eZdZdS)�dateNr�rrrroro]r�rroc��eZdZdS)�	copyrightNr�rrrrqrq^r�rrqc��eZdZd�Zd�ZdS)r�c���t|j��r t|jdt��s"|�dt����|jdS�Nr)rdr>rI�headerr.rs r�
get_headerzdecoration.get_headergsQ���4�=�!�!�	%��D�M�!�4D�f�)M�)M�	%��K�K��6�8�8�$�$�$��}�Q��rc���t|j��r t|jdt��s!|�t����|jdS)Nr/)rdr>rI�footerr�rs r�
get_footerzdecoration.get_footerlsO���4�=�!�!�	"��D�M�"�4E�v�)N�)N�	"��K�K����!�!�!��}�R� � rN)r9rlrmrvryrrrr�r�es2������ � � �
!�!�!�!�!rr�c��eZdZdS)ruNr�rrrrururr�rruc��eZdZdS)rxNr�rrrrxrxsr�rrxc��eZdZdS)�sectionNr�rrrr}r}zr�rr}c��eZdZdZdS)�topica�
    Topics are terminal, "leaf" mini-sections, like block quotes with titles,
    or textual figures.  A topic is just like a section, except that it has no
    subsections, and it doesn't have to conform to section placement rules.

    Topics are allowed wherever body elements (list, table, etc.) are allowed,
    but only at the top level of a section or document.  Topics cannot nest
    inside topics, sidebars, or body elements; you can't have a topic inside a
    table, list, block quote, etc.
    Nr�rrrrr}s������	�	�	�	rrc��eZdZdZdS)�sidebara�
    Sidebars are like miniature, parallel documents that occur inside other
    documents, providing related or reference material.  A sidebar is
    typically offset by a border and "floats" to the side of the page; the
    document's main text may flow around it.  Sidebars can also be likened to
    super-footnotes; their content is outside of the flow of the document's
    main text.

    Sidebars are allowed wherever body elements (list, table, etc.) are
    allowed, but only at the top level of a section or document.  Sidebars
    cannot nest inside sidebars, topics, or body elements; you can't have a
    sidebar inside a table, list, block quote, etc.
    Nr�rrrr�r��s���������rr�c��eZdZdS)�
transitionNr�rrrr�r��r�rr�c��eZdZdS)�	paragraphNr�rrrr�r��r�rr�c��eZdZdS)�compoundNr�rrrr�r��r�rr�c��eZdZdS)�	containerNr�rrrr�r��r�rr�c��eZdZdS)�bullet_listNr�rrrr�r��r�rr�c��eZdZdS)�enumerated_listNr�rrrr�r��r�rr�c��eZdZdS)�	list_itemNr�rrrr�r��r�rr�c��eZdZdS)�definition_listNr�rrrr�r��r�rr�c��eZdZdS)�definition_list_itemNr�rrrr�r��r�rr�c��eZdZdS)�termNr�rrrr�r��r�rr�c��eZdZdS)�
classifierNr�rrrr�r��r�rr�c��eZdZdS)�
definitionNr�rrrr�r��r�rr�c��eZdZdS)�
field_listNr�rrrr�r��r�rr�c��eZdZdS)�fieldNr�rrrr�r��r�rr�c��eZdZdS)�
field_nameNr�rrrr�r��r�rr�c��eZdZdS)�
field_bodyNr�rrrr�r��r�rr�c��eZdZdZdS)�optionr~N�r9rlrmrrrrr�r��s���������rr�c��eZdZd�ZdS)�option_argumentc�d�|�dd��t�|��zS)N�	delimiterr�)rr�r,rs rr,zoption_argument.astext�s)���x�x��S�)�)�K�,>�,>�t�,D�,D�D�DrN�r9rlrmr,rrrr�r��s(������E�E�E�E�Err�c��eZdZdZdS)�option_groupz, Nr�rrrr�r������������rr�c��eZdZdS)�option_listNr�rrrr�r��r�rr�c��eZdZdZdS)�option_list_itemz  Nr�rrrr�r��r�rr�c��eZdZdS)�
option_stringNr�rrrr�r��r�rr�c��eZdZdS)�descriptionNr�rrrr�r��r�rr�c��eZdZdS)�
literal_blockNr�rrrr�r��r�rr�c��eZdZdS)�
doctest_blockNr�rrrr�r��r�rr�c��eZdZdS)�
math_blockNr�rrrr�r��r�rr�c��eZdZdS)�
line_blockNr�rrrr�r��r�rr�c��eZdZdZdS)r0N)r9rlrmr#rrrr0r0�s������
�F�F�Frr0c��eZdZdS)�block_quoteNr�rrrr�r��r�rr�c��eZdZdS)�attributionNr�rrrr�r��r�rr�c��eZdZdS)�	attentionNr�rrrr�r��r�rr�c��eZdZdS)�cautionNr�rrrr�r��r�rr�c��eZdZdS)�dangerNr�rrrr�r��r�rr�c��eZdZdS)r:Nr�rrrr:r:�r�rr:c��eZdZdS)�	importantNr�rrrr�r��r�rr�c��eZdZdS)�noteNr�rrrr�r��r�rr�c��eZdZdS)�tipNr�rrrr�r��r�rr�c��eZdZdS)�hintNr�rrrr�r��r�rr�c��eZdZdS)�warningNr�rrrr�r��r�rr�c��eZdZdS)�
admonitionNr�rrrr�r��r�rr�c��eZdZdS)�commentNr�rrrr�r��r�rr�c��eZdZdS)�substitution_definitionNr�rrrr�r��r�rr�c��eZdZdS)rNr�rrrrr�r�rrc��eZdZdS)r$Nr�rrrr$r$�r�rr$c��eZdZdS)r4Nr�rrrr4r4�r�rr4c��eZdZdS)�labelNr�rrrr�r��r�rr�c��eZdZdS)�figureNr�rrrr�r��r�rr�c��eZdZdS)�captionNr�rrrr�r��r�rr�c��eZdZdS)�legendNr�rrrr�r��r�rr�c��eZdZdS)�tableNr�rrrr�r��r�rr�c��eZdZdS)�tgroupNr�rrrr�r��r�rr�c��eZdZdS)�colspecNr�rrrr�r��r�rr�c��eZdZdS)�theadNr�rrrr�r��r�rr�c��eZdZdS)�tbodyNr�rrrr�r��r�rr�c��eZdZdS)�rowNr�rrrr�r��r�rr�c��eZdZdS)�entryNr�rrrr�r��r�rr�c� �eZdZdZdd�Zd�ZdS)rz�
    System message element.

    Do not instantiate this class directly; use
    ``document.reporter.info/warning/error/severe()`` instead.
    Nc��|�dd��}|rtd|��}|f|z}	tj||g|�Ri|��dS#t	d|�����xYw)Nr�r~zsystem_message: children=)r1r�r�rv�print)r
rJr>r�r��ps      rrvzsystem_message.__init__s����N�N�;��3�3�	��	'��"�g�&�&�A��t�h��H�	���T�9�F�x�F�F�F�:�F�F�F�F�F��	��E�8�8�=�>�>�>����s�A�Ac��|�dd��}|d�d|�d|d�d|d�d	t�|����	S)
Nr0r~r.�:z: (rc�/r$z) )rr�r,)r
r0s  rr,zsystem_message.astextsX���x�x���#�#��&*�8�n�n�n�d�d�d�D��L�L�L�&*�7�m�m�m�W�^�^�D�5I�5I�5I�K�	Krr)r9rlrmrnrvr,rrrrr�sF��������	�	�	�	�K�K�K�K�Krrc�,�eZdZdZ		d	d�Zd
d�Zd�ZdS)rEaF
    The "pending" element is used to encapsulate a pending operation: the
    operation (transform), the point at which to apply it, and any data it
    requires.  Only the pending operation's location within the document is
    stored in the public document tree (by the "pending" object itself); the
    operation and its data are stored in the "pending" object's internal
    instance attributes.

    For example, say you want a table of contents in your reStructuredText
    document.  The easiest way to specify where to put it is from within the
    document, with a directive::

        .. contents::

    But the "contents" directive can't do its work until the entire document
    has been parsed and possibly transformed to some extent.  So the directive
    code leaves a placeholder behind that will trigger the second phase of its
    processing, something like this::

        <pending ...public attributes...> + internal attributes

    Use `document.note_pending()` so that the
    `docutils.transforms.Transformer` stage of processing can run all pending
    transforms.
    Nr~c�T�tj||g|�Ri|��||_	|pi|_dSr)r�rv�	transform�details)r
r�r�r�r>r�s      rrvzpending.__init__-sD�����y�B�8�B�B�B�z�B�B�B�"���	��}�"���I�Irrrc�r���dd|jj�d|jj��dg}t|j�����}|D�].\}}t
|t��r_|�dd�|�d���|�	d�|�
�����D�����z|r�t
|t��r�t
|d	t��re|�dd�|�d���|D]E}|�	d
�|�
�����D�����F��|�dd�|�d|������0t�
|����d���fd�|D����zS)
Nz.. internal attributes:z     .transform: �.z     .details:r~z>7r�c��g|]	}dd�|����
S�r~z>9r�r�r0s  rr�z#pending.pformat.<locals>.<listcomp>As9��"L�"L�"L�&*�.0�R�R���"6�"L�"L�"Lrrc��g|]	}dd�|����
Srrrs  rr�z#pending.pformat.<locals>.<listcomp>Hs9��&L�&L�&L�*.�24���T�T�&:�&L�&L�&Lrr�c3�.�K�|]}d��z�|�d�V��dS)rr�Nrr�s  ��rr�z"pending.pformat.<locals>.<genexpr>MsH�����1�1�"�d�,2�E�>�>�4�4�4�@�1�1�1�1�1�1r)r�rlr9rr�r�rIrr�r�r%r�rUr�r�)r
r#r$�	internalsr�r�rr�s ``     rr%zpending.pformat8s5����.�.�15��1J�1J�1J�15��1H�1H�J�%�'�	����+�+�-�-�.�.��!�
	A�
	A�J�C���%��&�&�
A�� � �R�R�R����!5�6�6�6�� � �"L�"L�.3�m�m�o�o�.H�.H�.J�.J�"L�"L�"L�M�M�M�M��
A� ���-�-�
A� ��q��4�0�0�
A�� � �R�R�R����!5�6�6�6��M�M�A��$�$�&L�&L�23�)�)�+�+�2H�2H�2J�2J�&L�&L�&L�M�M�M�M�M�� � ����C�C�C���!?�@�@�@�@�����f�e�4�4��'�'�1�1�1�1�1�&/�1�1�1�1�1�1�	2rc��|j|j|j|jfi|j��}|j|_|j|_|j|_|Sr)r8r�r�r�r�rr.r0rys  rr'zpending.copyPsP���d�n�T�^�T�\�4�>�0�0�#��0�0�����
��[��
��9����
rr�rk)r9rlrmrnrvr%r'rrrrErEsa��������4+/��	J�	J�	J�	J�2�2�2�2�0����rrEc��eZdZdZdS)�rawz@
    Raw data that is to be passed untouched to the Writer.
    Nr�rrrrrYs���������rrc��eZdZdS)�emphasisNr�rrrr	r	dr�rr	c��eZdZdS)�strongNr�rrrrrer�rrc��eZdZdS)�literalNr�rrrr
r
fr�rr
c��eZdZdS)�	referenceNr�rrrrrgr�rrc��eZdZdS)�footnote_referenceNr�rrrrrhr�rrc��eZdZdS)�citation_referenceNr�rrrrrir�rrc��eZdZdS)�substitution_referenceNr�rrrrrjr�rrc��eZdZdS)�title_referenceNr�rrrrrkr�rrc��eZdZdS)�abbreviationNr�rrrrrlr�rrc��eZdZdS)�acronymNr�rrrrrmr�rrc��eZdZdS)�superscriptNr�rrrrrnr�rrc��eZdZdS)�	subscriptNr�rrrrror�rrc��eZdZdS)�mathNr�rrrr!r!pr�rr!c��eZdZd�ZdS)�imagec�.�|�dd��S)N�altr~rDrs rr,zimage.astextus���x�x��r�"�"�"rNr�rrrr#r#ss#������#�#�#�#�#rr#c��eZdZdS)�inlineNr�rrrr'r'yr�rr'c��eZdZdS)�problematicNr�rrrr)r)zr�rr)c��eZdZdS)�	generatedNr�rrrr+r+{r�rr+aA
    Text
    abbreviation acronym address admonition attention attribution author
        authors
    block_quote bullet_list
    caption caution citation citation_reference classifier colspec comment
        compound contact container copyright
    danger date decoration definition definition_list definition_list_item
        description docinfo doctest_block document
    emphasis entry enumerated_list error
    field field_body field_list field_name figure footer
        footnote footnote_reference
    generated
    header hint
    image important inline
    label legend line line_block list_item literal literal_block
    math math_block meta
    note
    option option_argument option_group option_list option_list_item
        option_string organization
    paragraph pending problematic
    raw reference revision row rubric
    section sidebar status strong subscript substitution_definition
        substitution_reference subtitle superscript system_message
    table target tbody term tgroup thead tip title title_reference topic
        transition
    version
    warningc�6�eZdZdZdZ	d�Zd�Zd�Zd�Zd�Z	dS)	�NodeVisitora�
    "Visitor" pattern [GoF95]_ abstract superclass implementation for
    document tree traversals.

    Each node class has corresponding methods, doing nothing by
    default; override individual methods for specific and useful
    behaviour.  The `dispatch_visit()` method is called by
    `Node.walk()` upon entering a node.  `Node.walkabout()` also calls
    the `dispatch_departure()` method before exiting a node.

    The dispatch methods call "``visit_`` + node class name" or
    "``depart_`` + node class name", resp.

    This is a base class for visitors whose ``visit_...`` & ``depart_...``
    methods must be implemented for *all* compulsory node types encountered
    (such as for `docutils.writers.Writer` subclasses).
    Unimplemented methods will raise exceptions (except for optional nodes).

    For sparse traversals, where only certain node types are of interest, use
    subclass `SparseNodeVisitor` instead.  When (mostly or entirely) uniform
    processing is desired, subclass `GenericNodeVisitor`.

    .. [GoF95] Gamma, Helm, Johnson, Vlissides. *Design Patterns: Elements of
       Reusable Object-Oriented Software*. Addison-Wesley, Reading, MA, USA,
       1995.
    )rSc��||_dSr)r
�r
r
s  rrvzNodeVisitor.__init__�s
�� ��
�
�
rc��|jj}t|d|z|j��}|jj�d|j�d|����||��S)z�
        Call self."``visit_`` + node class name" with `node` as
        parameter.  If the ``visit_...`` method does not exist, call
        self.unknown_visit.
        �visit_z2docutils.nodes.NodeVisitor.dispatch_visit calling � for )r8r9r��
unknown_visitr
r6r7�r
r`�	node_name�methods    rr:zNodeVisitor.dispatch_visit�si���N�+�	���x�)�3�T�5G�H�H���
��$�$�$�����	�	�
+�	,�	,�	,��v�d�|�|�rc��|jj}t|d|z|j��}|jj�d|j�d|����||��S)z�
        Call self."``depart_`` + node class name" with `node` as
        parameter.  If the ``depart_...`` method does not exist, call
        self.unknown_departure.
        �depart_z6docutils.nodes.NodeVisitor.dispatch_departure calling r2)r8r9r��unknown_departurer
r6r7r4s    rrFzNodeVisitor.dispatch_departure�si���N�+�	���y�9�4�d�6L�M�M���
��$�$�$�����	�	�
+�	,�	,�	,��v�d�|�|�rc��|jjjs|jj|jvr#t
|j�d|jj�����dS)zk
        Called when entering unknown `Node` types.

        Raise an exception unless overridden.
        z visiting unknown node type: N�r
r��strict_visitorr8r9�optionalr"rs  rr3zNodeVisitor.unknown_visit��X��
�M�"�1�	=��~�&�d�m�;�;�%��>�>�>�4�>�#:�#:�<�=�=�
=�<�;rc��|jjjs|jj|jvr#t
|j�d|jj�����dS)zi
        Called before exiting unknown `Node` types.

        Raise exception unless overridden.
        z departing unknown node type: Nr;rs  rr9zNodeVisitor.unknown_departure�r>rN)
r9rlrmrnr=rvr:rFr3r9rrrr-r-�su��������6�H��!�!�!�������
=�
=�
=�
=�
=�
=�
=�
=rr-c��eZdZdZdS)�SparseNodeVisitora
    Base class for sparse traversals, where only certain node types are of
    interest.  When ``visit_...`` & ``depart_...`` methods should be
    implemented for *all* node types (such as for `docutils.writers.Writer`
    subclasses), subclass `NodeVisitor` instead.
    Nr�rrrrArA�s���������rrAc��eZdZdZd�Zd�ZdS)�GenericNodeVisitora�
    Generic "Visitor" abstract superclass, for simple traversals.

    Unless overridden, each ``visit_...`` method calls `default_visit()`, and
    each ``depart_...`` method (when using `Node.walkabout()`) calls
    `default_departure()`. `default_visit()` (and `default_departure()`) must
    be overridden in subclasses.

    Define fully generic visitors by overriding `default_visit()` (and
    `default_departure()`) only. Define semi-generic visitors by overriding
    individual ``visit_...()`` (and ``depart_...()``) methods also.

    `NodeVisitor.unknown_visit()` (`NodeVisitor.unknown_departure()`) should
    be overridden for default behavior.
    c��t��z)Override for generic, uniform traversals.r!rs  r�
default_visitz GenericNodeVisitor.default_visitr(rc��t�rEr!rs  r�default_departurez$GenericNodeVisitor.default_departurer(rN)r9rlrmrnrFrHrrrrCrCs<�������� "�"�"�"�"�"�"�"rrCc�0�|�|��dSr)rFrs  r�_call_default_visitrJ#s�����t�����rc�0�|�|��dSr)rHrs  r�_call_default_departurerL's�����4� � � � � rc��dSrrrs  r�_noprN+s���Drc��|D]z}ttd|zt��ttd|zt��ttd|zt
��ttd|zt
���{dS)z%Save typing with dynamic assignments:r1r8N)�setattrrCrJrLrArN)r��_names  r�_add_node_class_namesrR/s����<�<���"�H�u�$4�6I�J�J�J��"�I��$5�7N�O�O�O��!�8�e�#3�T�:�:�:��!�9�u�#4�d�;�;�;�;�	<�<rc�*�eZdZdZd�Zd�Zd�Zd�ZdS)�TreeCopyVisitorzQ
    Make a complete copy of a tree or branch, including element attributes.
    c�X�t�||��g|_g|_dSr)rCrv�parent_stackr	r/s  rrvzTreeCopyVisitor.__init__As+���#�#�D�(�3�3�3��������rc��|jdSrt)r	rs r�
get_tree_copyzTreeCopyVisitor.get_tree_copyFs���{�1�~�rc��|���}|j�|��|j�|j��||_dS)z9Copy the current node, and make it the new acting parent.N)r'r	r�rV)r
r`�newnodes   rrFzTreeCopyVisitor.default_visitIsI���)�)�+�+������7�#�#�#��� � ���-�-�-�����rc�B�|j���|_dS)z#Restore the previous acting parent.N)rVr1r	rs  rrHz!TreeCopyVisitor.default_departurePs���'�+�+�-�-����rN)r9rlrmrnrvrXrFrHrrrrTrT;sZ�����������
������.�.�.�.�.rrTc��eZdZdZdS)�TreePruningExceptionz�
    Base class for `NodeVisitor`-related tree pruning exceptions.

    Raise subclasses from within ``visit_...`` or ``depart_...`` methods
    called from `Node.walk()` and `Node.walkabout()` tree traversals to prune
    the tree traversed.
    Nr�rrrr]r]U����������rr]c��eZdZdZdS)r;z�
    Do not visit any children of the current node.  The current node's
    siblings and ``depart_...`` method are not affected.
    Nr�rrrr;r;`����������rr;c��eZdZdZdS)r@z�
    Do not visit any more siblings (to the right) of the current node.  The
    current node's children and its ``depart_...`` method are not affected.
    Nr�rrrr@r@hr`rr@c��eZdZdZdS)r<zq
    Do not visit the current node's children, and do not call the current
    node's ``depart_...`` method.
    Nr�rrrr<r<pr`rr<c��eZdZdZdS)r=z
    Do not call the current node's ``depart_...`` method.  The current node's
    children and siblings are not affected.
    Nr�rrrr=r=xr`rr=c��eZdZdZdS)�	NodeFoundz�
    Raise to indicate that the target of a search has been found.  This
    exception must be caught by the client; it is not caught by the traversal
    code.
    Nr�rrrrere�s���������rrec��eZdZdZdS)rAa<
    Stop the traversal altogether.  The current node's ``depart_...`` method
    is not affected.  The parent nodes ``depart_...`` methods are also called
    as usual.  No other nodes are visited.  This is an alternative to
    NodeFound that does not cause exception handling to trickle up to the
    caller.
    Nr�rrrrArA�r^rrAc���|���}|�t��}|�t��}t	jd|���dd���d��}t�	dd�
|�������}t�	d|��}t|��S)a�
    Convert `string` into an identifier and return it.

    Docutils identifiers will conform to the regular expression
    ``[a-z](-?[a-z0-9]+)*``.  For CSS compatibility, identifiers (the "class"
    and "id" attributes) should have no underscores, colons, or periods.
    Hyphens may be used.

    - The `HTML 4.01 spec`_ defines identifiers based on SGML tokens:

          ID and NAME tokens must begin with a letter ([A-Za-z]) and may be
          followed by any number of letters, digits ([0-9]), hyphens ("-"),
          underscores ("_"), colons (":"), and periods (".").

    - However the `CSS1 spec`_ defines identifiers based on the "name" token,
      a tighter interpretation ("flex" tokenizer notation; "latin1" and
      "escape" 8-bit characters have been replaced with entities)::

          unicode     \[0-9a-f]{1,4}
          latin1      [&iexcl;-&yuml;]
          escape      {unicode}|\[ -~&iexcl;-&yuml;]
          nmchar      [-a-z0-9]|{latin1}|{escape}
          name        {nmchar}+

    The CSS1 "nmchar" rule does not include underscores ("_"), colons (":"),
    or periods ("."), therefore "class" and "id" attributes should not contain
    these characters. They should be replaced with hyphens ("-"). Combined
    with HTML's requirements (the first character must be a letter; no
    "unicode", "latin1", or "escape" characters), this results in the
    ``[a-z](-?[a-z0-9]+)*`` pattern.

    .. _HTML 4.01 spec: https://www.w3.org/TR/html401
    .. _CSS1 spec: https://www.w3.org/TR/REC-CSS1
    �NFKD�ascii�ignorer�r�r~)r��	translate�_non_id_translate_digraphs�_non_id_translate�unicodedata�	normalize�encode�decode�
_non_id_chars�subr�r��_non_id_at_endsr�)�stringr�s  rr�r��s���F
�����B�	���0�	1�	1�B�	���'�	(�	(�B�
�	��B�
�
���w��1�1�&�&��/�/��
�	�	�3��������� 4� 4�	5�	5�B�	�	�	�R��	$�	$�B��r�7�7�Nrz
[^a-z0-9]+z^[-0-9]+|-+$��oi�di'�hi1r3iB�lig�ti��bi�i�r�i�i��fi��ki�i�r�i�r�i�i�i��yi��zi��gi%i4i5i6i7�ji<i?rwi@iG�eiIiK�qiM�riO�sz�ae�oe�db�qp)����iSi8i9c��|d�|��|d�|��d|_dS)Nr�r�rb)r�r5r�)r`r�s  rrr�s@�������D�!�!�!���M��������D�O�O�Orc�t�d�|��������S)z.Return a case- and whitespace-normalized name.r�)r�r�r��r�s rr;r;�s(���8�8�D�J�J�L�L�&�&�(�(�)�)�)rc�P�d�|�����S)z$Return a whitespace-normalized name.r�)r�r�r�s rr9r9�s���8�8�D�J�J�L�L�!�!�!rc�V�|�dd���dd��S)zDEscape string values that are elements of a list, for serialization.r}z\\r�z\ )r�rs rr�r�	s&���=�=��u�%�%�-�-�c�5�9�9�9rc��d|zS)zQuote attributes for pseudo-xmlz"%s"rr�s rr�r�		s���E�>�r)FF)�rn�
__docformat__�collectionsr�rer�rRrnrr�rrrzr�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r
rVrXrZrSr]r_rarcrergrirkrmrorqr�rurxr}rr�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�r0r�r�r�r�r�r:r�r�r�r�r�r�r�r�rr$r4r�r�r�r�r�r�r�r�r�r�r�rrErr	rr
rrrrrrrrrr!r#r'r)r+r��node_class_namesr-rArCrJrLrNrRrT�	Exceptionr]r;r@r<r=rerAr��compilerrrtrmrlrr;r9r�r�rrr�<module>r�s4����"#�
�������	�	�	�	�
�
�
�
���������^�^�^�^�^�^�^�^�B	�����#����
�
�
�����G7�G7�G7�G7�G7�4��G7�G7�G7�T]
0�]
0�]
0�]
0�]
0�d�]
0�]
0�]
0�@G�G�G�G�G�'�G�G�G�62�2�2�2�2�{�2�2�2���������
'�'�'�'�'�'�'�'�	�	�	�	�	�	�	�	�	�	�	�	�	�	�	�	�G�G�G�G�G�G�G�G�	�	�	�	�	�	�	�	�	�	�	�	�	�!�	�	�	�	�	�	�	�	�	�	�	�	�	�	�	�	�	�	�	�	�	�	�	�	�d�	�	�	�������������������*�*�*�*�*�d�*�*�*�9�9�9�9�9� �9�9�9�	�	�	�	�	�	�	�	�	�	�	�	�	�	�	�	�	�	�	�	�	�*�	�	�	�1�1�1�1�1��1�1�1�3�3�3�3�3�3�3�3�b�b�b�b�b�t�Z��b�b�b�R:�9�9�9�9�G�%�{�9�9�9�<�<�<�<�<�w�(�+�<�<�<�(�(�(�(�(�W�k�(�(�(�F�F�F�F�F��W�F�F�F�,�+�+�+�+�m�W�+�+�+�.�.�.�.�.�]�K�.�.�.�+�+�+�+�+�m�W�+�+�+�4�4�4�4�4�=�+�4�4�4�4�4�4�4�4�m�-�4�4�4�/�/�/�/�/�m�[�/�/�/�/�/�/�/�/�m�[�/�/�/�0�0�0�0�0�}�k�0�0�0�.�.�.�.�.�]�K�.�.�.�,�,�,�,�,�=�+�,�,�,�1�1�1�1�1�
�{�1�1�1�
!�
!�
!�
!�
!��W�
!�
!�
!�(�'�'�'�'�Z��'�'�'�'�'�'�'�'�Z��'�'�'�)�(�(�(�(�j�'�(�(�(������J����������j�'����",�+�+�+�+��W�+�+�+�,�+�+�+�+���+�+�+�&�&�&�&�&�w��&�&�&�'�'�'�'�'���'�'�'�,�,�,�,�,�*�g�,�,�,�0�0�0�0�0�j�'�0�0�0�$�$�$�$�$��g�$�$�$�0�0�0�0�0�j�'�0�0�0�/�/�/�/�/�4��/�/�/�#�#�#�#�#�4��#�#�#�)�)�)�)�)��{�)�)�)�%�%�%�%�%��w�%�%�%�+�+�+�+�+��W�+�+�+� � � � � �D�'� � � �)�)�)�)�)��{�)�)�)�%�%�%�%�%��w�%�%�%������T�7����
E�E�E�E�E�d�K�E�E�E� � � � � �4�� � � �
-�,�,�,�,�*�g�,�,�,� � � � � �t�W� � � �
-�,�,�,�,�D�+�,�,�,�&�&�&�&�&�$��&�&�&�4�4�4�4�4�G�-�4�4�4�4�4�4�4�4�G�-�4�4�4�1�1�1�1�1��*�1�1�1�(�(�(�(�(��'�(�(�(������4�����
*�)�)�)�)�'�7�)�)�)�*�*�*�*�*�$��*�*�*�*�*�*�*�*�
�G�*�*�*�(�(�(�(�(�j�'�(�(�(�'�'�'�'�'�Z��'�'�'�&�&�&�&�&�J��&�&�&�*�*�*�*�*�
�G�*�*�*�%�%�%�%�%�:�w�%�%�%�$�$�$�$�$�*�g�$�$�$�%�%�%�%�%�:�w�%�%�%�(�(�(�(�(�j�'�(�(�(�+�+�+�+�+��W�+�+�+�9�9�9�9�9�g�y�"2�9�9�9�D�D�D�D�D�g�y�+�D�D�D�G�G�G�G�G�W�i���j�G�G�G�I�I�I�I�I�w��g�w�
�I�I�I�I�I�I�I�I�w��g�w�
�I�I�I�$�$�$�$�$�D�+�$�$�$�$�$�$�$�$�W�g�$�$�$�&�&�&�&�&�d�K�&�&�&�!�!�!�!�!�T�7�!�!�!�#�#�#�#�#�G�W�#�#�#�!�!�!�!�!�T�7�!�!�!�"�"�"�"�"�d�G�"�"�"� � � � � �D�'� � � � � � � � �D�'� � � ������$����� � � � � �D�'� � � �K�K�K�K�K�W�l�,<�g�K�K�K�4E�E�E�E�E�g�y�'�E�E�E�P�����'�6�+�-=����*�)�)�)�)�v�{�)�)�)�'�'�'�'�'�V�[�'�'�'�(�(�(�(�(�f�k�(�(�(�@�@�@�@�@����k�@�@�@�@�@�@�@�@���k�@�@�@�@�@�@�@�@���k�@�@�@�7�7�7�7�7�V�[�7�7�7�0�0�0�0�0�f�k�0�0�0�-�-�-�-�-�6�;�-�-�-�(�(�(�(�(�f�k�(�(�(�,�,�,�,�,�&�+�,�,�,�*�*�*�*�*���*�*�*�%�%�%�%�%�6�;�%�%�%�#�#�#�#�#�G�V�W�#�#�#�(�'�'�'�'�V�[�'�'�'�,�,�,�,�,�&�+�,�,�,�*�*�*�*�*���*�*�*��6�u�w�w�7�87�Z=�Z=�Z=�Z=�Z=�Z=�Z=�Z=�z���������"�"�"�"�"��"�"�"�6���!�!�!�	�	�	�<�<�<���&�'�'�'�.�.�.�.�.�(�.�.�.�4�����9���������'���������'���������#���������(���������$���������(����-�-�-�`��
�<�(�(�
��"�*�^�,�,��"�
�C�"�
�C�"��C�"��C�	"�
�C�"��C�
"��C�"��C�"��C�"��C�"��C�"��C�"��C�"��C�"��C�"� �C�!"�"�C�#"�"�$�C�%"�&�C�'"�(�C�)"�*�C�+"�,�C�-"�.�C�/"�0�C�1"�2�C�3"�4�C�5"�6�C�7"�8�C�9"�:�C�;"�<�C�="�>�C�?"�@�C�A"�B�C�C"�"��H
�����������*�*�*�
"�"�"�
:�:�:�
����r

Hacked By AnonymousFox1.0, Coded By AnonymousFox