https://t.me/RX1948
Server : Apache
System : Linux iad1-shared-b8-43 6.6.49-grsec-jammy+ #10 SMP Thu Sep 12 23:23:08 UTC 2024 x86_64
User : dh_edsupp ( 6597262)
PHP Version : 8.2.26
Disable Function : NONE
Directory :  /lib/python3/dist-packages/docutils/__pycache__/

Upload File :
current_dir [ Writeable ] document_root [ Writeable ]

 

Current File : //lib/python3/dist-packages/docutils/__pycache__/nodes.cpython-310.pyc
o

�-$`@�@s0dZddlmZddlmZdZddlZddlZddlZddl	Z	ddl
Z
ejdkr-eZ
eZGdd�de�ZGd	d
�d
e�ZejdkrKGdd�de
�Zne
Zd
d�Z�djdd�ZGdd�dee�ZGdd�de�ZGdd�de�ZGdd�de�ZGdd�de�ZGdd�de�ZGdd�de�ZGd d!�d!e�ZGd"d#�d#e�ZGd$d%�d%e�ZGd&d'�d'e�Z Gd(d)�d)e�Z!Gd*d+�d+e�Z"Gd,d-�d-e"�Z#Gd.d/�d/e"�Z$Gd0d1�d1e"�Z%Gd2d3�d3e"�Z&Gd4d5�d5e�Z'Gd6d7�d7e�Z(Gd8d9�d9e�Z)Gd:d;�d;e�Z*Gd<d=�d=e�Z+Gd>d?�d?e�Z,Gd@dA�dAee!e�Z-GdBdC�dCeee�Z.GdDdE�dEeee�Z/GdFdG�dGee�Z0GdHdI�dIee�Z1GdJdK�dKee�Z2GdLdM�dMee�Z3GdNdO�dOee�Z4GdPdQ�dQee�Z5GdRdS�dSee�Z6GdTdU�dUee�Z7GdVdW�dWee�Z8GdXdY�dYee�Z9GdZd[�d[ee�Z:Gd\d]�d]ee�Z;Gd^d_�d_e e�Z<Gd`da�dae e�Z=Gdbdc�dce e�Z>Gddde�dee!e�Z?Gdfdg�dge!e�Z@Gdhdi�die!e�ZAGdjdk�dke!e�ZBGdldm�dme#e�ZCGdndo�doe#e�ZDGdpdq�dqe#e�ZEGdrds�dse$e�ZFGdtdu�due$e�ZGGdvdw�dwe(e�ZHGdxdy�dye$e�ZIGdzd{�d{e(e�ZJGd|d}�d}e(e�ZKGd~d�de(e�ZLGd�d��d�e(e�ZMGd�d��d�e$e�ZNGd�d��d�e(e�ZOGd�d��d�e(e�ZPGd�d��d�e(e�ZQGd�d��d�e(e�ZRGd�d��d�e(e�ZSGd�d��d�e(e�ZTGd�d��d�e$e�ZUGd�d��d�e(e�ZVGd�d��d�e(e�ZWGd�d��d�e(e�ZXGd�d��d�e#e�ZYGd�d��d�e#e�ZZGd�d��d�e#e�Z[Gd�d��d�e#e�Z\Gd�d��d�e(e�Z]Gd�d��d�e#e�Z^Gd�d��d�e(e�Z_Gd�d��d�e%e�Z`Gd�d��d�e%e�ZaGd�d��d�e%e�ZbGd�d��d�e%e�ZcGd�d��d�e%e�ZdGd�d��d�e%e�ZeGd�d��d�e%e�ZfGd�d��d�e%e�ZgGd�d��d�e%e�ZhGd�d��d�e%e�ZiGd�d��d�e&e'e�ZjGd�d��d�e&e'e�ZkGd�d��d�e&e'e)ee+�ZlGd�d��d�e#eee,e+�ZmGd�dÄd�e#eee,e+�ZnGd�dńd�e(e�ZoGd�dDŽd�e#e�ZpGd�dɄd�e(e�ZqGd�d˄d�e(e�ZrGd�d̈́d�e#e�ZsGd�dτd�e(e�ZtGd�dфd�e(e�ZuGd�dӄd�e(e�ZvGd�dՄd�e(e�ZwGd�dׄd�e(e�ZxGd�dلd�e(e�ZyGd�dۄd�e&eee�ZzGd�d݄d�e&e'e�Z{Gd�d߄d�e&e)ee�Z|Gd�d�d�e)e�Z}Gd�d�d�e)e�Z~Gd�d�d�e)e�ZGd�d�d�e#e)e*e�Z�Gd�d�d�e)e*e�Z�Gd�d�d�e)e*e�Z�Gd�d�d�e)e�Z�Gd�d�d�e)e�Z�Gd�d�d�e)e�Z�Gd�d�d�e)e�Z�Gd�d��d�e)e�Z�Gd�d��d�e)e�Z�Gd�d��d�e)e�Z�Gd�d��d�e#e)e�Z�Gd�d��d�e)e�Z�Gd�d��d�e)e�Z�G�d�d��de)e�Z��d���Z�	G�d�d��de�Z�G�d�d��de��Z�G�d�d��de��Z��d	�d
�Z��d�d�Z��d
�d�Z��d�d�Z�e�e��G�d�d��de��Z�G�d�d��de��Z�G�d�d��de��Z�G�d�d��de��Z�G�d�d��de��Z�G�d�d��de��Z�G�d�d��de��Z�G�d�d ��d e��Z��d!�d"�Z�e���d#�Z�e���d$�Z�i�d%�d&��d'�d(��d)�d*��d+�d,��d-�d.��d/�d0��d1�d2��d3�d2��d4�d5��d6�d(��d7�d8��d9�d:��d;�d.��d<�d=��d>�d?��d@�d0��dA�d0�i�dB�dC��dD�dE��dF�dG��dH�dE��dI�d.��dJ�d=��dK�d0��dL�dM��dN�d5��dO�dP��dQ�dE��dR�dS��dT�dM��dU�dV��dW�dX��dY�dC��Z��dZ�d[�d\�d]�d^�d_�Z��d`�da�Z��db�dc�Z��dd�de�Z��df�dg�Z��dh�di�Z�dS(ka�
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: http://docutils.sourceforge.net/docs/ref/docutils.dtd
�)�print_function)�Counter�reStructuredTextN��rc@s�eZdZdZdd�Zeej�Zeej�Zeej�Zeej	�Z	eej
�Z
eej�Zeej�Zeej
�Z
eej�Zeej�Zeej�Zeej�ZdS)�_traversal_listFcsd���fdd�}|S)Nzm
   The iterable returned by Node.traverse()
   will become an iterator instead of a list in Docutils > 0.16.cs2|jstj�tdd�d|_�|g|�Ri|��S)N���
stacklevelT)�done�warnings�warn�
FutureWarning)�self�args�kwargs��fun�msg��0/usr/lib/python3/dist-packages/docutils/nodes.py�wrapper,sz3_traversal_list._warning_decorator.<locals>.wrapperr)rrrrr�_warning_decorator(sz"_traversal_list._warning_decoratorN)�__name__�
__module__�__qualname__rr�list�__add__�__contains__�__getitem__�__reversed__�__setitem__�append�count�extend�index�insert�pop�reverserrrrr%s










rc@s�eZdZdZdZ	dZ	dZ	dZedd��Z	e	j
dd��Z	dd�Zej
dkr)eZej
dkr2d	d
�Zd)dd�Zd*dd�Zdd�Zdd�Zdd�Zdd�Zdd�Zdd�Zdd�Zdd �Z	!	"d+d#d$�Z	!	"d+d%d&�Z	!	"d,d'd(�ZdS)-�Nodez0Abstract base class of nodes in a document tree.NcCs&z|jp|jjWStyYdSw)zZ
        Return the `document` node at the root of the tree containing this Node.
        N)�	_document�parent�document�AttributeError�rrrrr,Ts
�z
Node.documentcC�
||_dS�N)r*)r�valuerrrr,^s
cCsdS)a8
        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.  Use `None` to represent a boolean
        false value.
        Trr.rrr�__bool__bs	z
Node.__bool__rcCst|��d�S)N�raw_unicode_escape)�unicode�encoder.rrr�__str__s�zNode.__str__cCs,|dur
ddlmm}|��}|�|�S)z6Return a DOM **fragment** representation of this Node.Nr)�xml.dom.minidom�dom�minidom�Document�	_dom_node�rr9�domrootrrr�asdomvs
z
Node.asdom�    rcC�t�)zs
        Return an indented pseudo-XML representation, for test purposes.

        Override in subclasses.
        ��NotImplementedError�r�indent�levelrrr�pformat}szNode.pformatcCrA)zReturn a copy of self.rBr.rrr�copy��z	Node.copycCrA)z3Return a deep copy of self (also copying children).rBr.rrr�deepcopy�rIz
Node.deepcopycCrA)z,Return a string representation of this Node.rBr.rrr�astext�rIzNode.astextcCsH||_|jr |j|_|jdur|jj|_|jdur"|jj|_dSdSdSr0)r+r,�source�current_source�line�current_line)r�childrrr�setup_child�s


�zNode.setup_childc	Cs�d}|jj�d|jj�zGz|�|�Wnttfy#|YWSty+Ynw|j	}z|dd�D]}|�
|�rAd}nq6WW|SWW|StyTYW|Swty`d}Y|Sw)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__r�dispatch_visit�SkipChildren�SkipNode�
SkipDeparture�children�walk�SkipSiblings�
StopTraversal)r�visitor�stoprYrPrrrrZ�sB��
�
������z	Node.walkcCs�d}d}|jj�d|jj�zAz|�|�Wnty#|YWSty-d}Ynw|j}z|dd�D]}|�	|�rCd}nq8Wn	t
yNYnwWntyYYntycd}Ynw|rv|jj�d|jj�|�
|�|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,rRrSrTrrUrWrXrY�	walkaboutr[rVr\�dispatch_departure)rr]�call_departr^rYrPrrrr_�sP��
�
�������
zNode.walkaboutccs8�t||�r	|V|jD]
}|�|�D]}|VqqdS)z3Return iterator that only supports instance checks.N)�
isinstancerY�_fast_traverse)r�clsrP�subnoderrrrc�s�

��zNode._fast_traverseccs,�|V|jD]}|��D]}|Vq
qdS)z3Return iterator that doesn't check for a condition.N)rY�
_all_traverse)rrPrerrrrf�s�
��zNode._all_traverseTFcCst|�|||||��S)a
        Return an iterable containing

        * self (if include_self is true)
        * all descendants in tree traversal order (if descend is true)
        * all siblings (if siblings is true) and their descendants (if
          also descend is true)
        * the 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 iterable contains 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.

        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 list(emphasis.traverse()) equals ::

            [<emphasis>, <strong>, <#text: Foo>, <#text: Bar>]

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

            [<strong>, <#text: Foo>, <#text: Bar>, <reference>, <#text: Baz>]
        )r�	_traverse)r�	condition�include_self�descend�siblings�ascendrrr�traverses
)�z
Node.traverseccs<�|rd}|r-|r-|s-|dur|��D]}|VqdSt|t�r-|�|�D]}|Vq%dSt|t�r:|}|fdd�}|rG|dusD||�rG|V|rct|j�rc|D]}|j|ddddd�D]}|Vq\qP|sg|r�|}	|	jr�|	j�|	�}
|	j|
dd�D]}|j|d|ddd�D]}|Vq�q{|s�dS|	j}	|	jsldSdSdS)z>Return iterator over nodes following `self`. See `traverse()`.TNcSs
t||�Sr0)rb)�node�
node_classrrrrhB�
z!Node._traverse.<locals>.conditionF)rhrirjrkrl�)	rfrb�typerc�lenrYrgr+r%)rrhrirjrkrlrerorPrnr%�siblingrrrrg.sT�


��
��
��zNode._traversecCs2|�|||||�}zt|�WStyYdSw)z�
        Return the first node in the iterable returned by traverse(),
        or None if the iterable is empty.

        Parameter list is the same as of traverse.  Note that
        include_self defaults to False, though.
        N)rg�next�
StopIteration)rrhrirjrkrl�
node_iteratorrrr�	next_node\s	�
�zNode.next_noder0�r@r)NTTFF)NFTFF)rrr�__doc__r+rLrNr*�propertyr,�setterr2�sys�version_info�__nonzero__r6r?rGrHrJrKrQrZr_rcrfrmrgrxrrrrr)EsJ
	




	.+
�,
�.�r)c@seZdZdZdd�ZdS)�reprunicodezU
        A unicode sub-class that removes the initial u from unicode's repr.
        cCst�|�dd�S�Nrq)r4�__repr__r.rrrr�r�zreprunicode.__repr__N)rrrrzr�rrrrr�msr�cCs$tjdkrt|t�r|�dd�S|S)z4
    Failsave conversion of `unicode` to `str`.
    r�ascii�backslashreplace)r}r~rbr4r5)�srrr�
ensure_strxsr�FcCs.|r|�dd�SdD]
}d�|�|��}q
|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�seprrr�unescape�s
r�c@s�eZdZdZdZdZ	ejdkrd!dd�Znd!dd�Zd"d
d�Z	d#d
d�Z
dd�Zdd�Zdd�Z
dd�Zdd�Zd$dd�Zd!dd�Zd!dd �ZdS)%�Textz�
    Instances are terminal nodes (leaves) containing text only; no child
    nodes or attributes.  Initialize by passing a string to the constructor.
    Access the text itself with the `astext` method.
    z#textrrNcCst|t�r	td��t�||�S)�7Prevent the rawsource argument from propagating to str.zexpecting str data, not bytes)rb�bytes�	TypeErrorr��__new__�rd�data�	rawsourcerrrr��s
zText.__new__cCst�||�S)r�)r�r�r�rrrr��sr�cCs
||_dSr0�r�)rr�r�rrr�__init__�sz
Text.__init__�cCs6|}t|�|kr|d|d�d}d|jt|�fS)N�� ...z<%s: %r>)rs�tagnamer�)r�maxlenr�rrr�	shortrepr�szText.shortreprcCs|jdd�S)N�D)r�)r�r.rrrr���z
Text.__repr__cCs|�t|��Sr0)�createTextNoder4)rr>rrrr<�r7zText._dom_nodecCstt|��Sr0)r�r�r.rrrrK�r�zText.astextcCs|jt|�|jd�S)Nr�)rTr�r�r.rrrrH�sz	Text.copycCs|��Sr0)rHr.rrrrJ�sz
Text.deepcopyr@rcs�z&|jjjr%d��dfg��fdd�|jdd�D�}d�|�dWSWn	ty/Ynw����fdd�|����D�}|sEd	Sd�|�dS)
Nz%s%sz<#text>cs g|]}��dt|��qS�rq)�repr��.0rN�rErFrr�
<listcomp>�s�z Text.pformat.<locals>.<listcomp>T)�keepends�
csg|]}�|�qSrrr�)rErrr���r�)r,�settings�	detailled�
splitlinesr�r-rK)rrErF�linesrr�rrG�s"

����zText.pformatcC�|�t�||�|j�Sr0)rTr��rstripr��r�charsrrrr���zText.rstripcCr�r0)rTr��lstripr�r�rrrr��r�zText.lstripr0�r�)r�ry)rrrrzr�rYr}r~r�r�r�r�r<rKrHrJrGr�r�rrrrr��s$





r�c@sVeZdZdZdZ	dZ	eeZ	edZ	dZ	dZ		d~dd	�Z
d
d�Zdd
�Zdd�Z
dd�Zejdkr8eZddd�Zdd�Zdd�Zdd�Zdd�Zdd�Zdd �Zd!d"�Zd#d$�Zd%d&�Zd'd(�Zd)d*�Zd+d,�Zd-d.�Zdd/d0�Z d1d2�Z!d3d4�Z"dd5d6�Z#e!Z$d~d7d8�Z%d9d:�Z&d;d<�Z'd=d>�Z(d�d@dA�Z)dBdC�Z*dDdE�Z+dFdG�Z,dHdI�Z-dJdK�Z.dLdM�Z/d�dOdP�Z0d�dQdR�Z1dSdT�Z2dUdV�Z3dWdX�Z4e4dNdYfdZd[�Z5	N	Yd�d\d]�Z6	N	Yd�d^d_�Z7	N	Yd�d`da�Z8d�dbdc�Z9ddde�Z:dfdg�Z;dhdi�Z<djej=fdkdl�Z>djej=fdmdn�Z?d�dpdq�Z@drds�ZAdtdu�ZBdvdw�ZCd�dxdy�ZDeEdzd{��ZFeEd|d}��ZGdS)��Elementa�
    `Element` is the superclass to all specific elements.

    Elements contain attributes and child nodes.  Elements emulate
    dictionaries for attributes, indexing by attribute name (a string).  To
    set the attribute 'att' to 'value', do::

        element['att'] = 'value'

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

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

        element[0]

    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)rLr�Nz

r�cOs�||_	g|_	|�|�i|_	|jD]}g|j|<q|��D]\}}|��}||jvr7|dd�|j|<q ||j|<q |jdurI|jj	|_dSdSr0)
r�rYr$�
attributes�list_attributes�items�lowerr�rTr)rr�rYr��attr1rrrr� s"



�zElement.__init__cCsl|�|j�}|��D]\}}t|t�rd�dd�|D��}|�|d|�q
|jD]
}|�|�	|��q)|S)N� cS�g|]	}td|f��qS��%s��
serial_escape�r��vrrrr�B�z%Element._dom_node.<locals>.<listcomp>r�)
�
createElementr��attlistrbrr��setAttributerY�appendChildr<)rr>�element�	attributer1rPrrrr<>s

zElement._dom_nodecCszd}|jD]}||��7}t|�dkr|dd�d}nq|dr5d|jjd�dd	�|dD��|fSd
|jj|fS)Nr��<�8r�r�z
<%s "%s": %s>�; cS�g|]}t|��qSr�r��r��nrrrr�Qr�z$Element.__repr__.<locals>.<listcomp>z<%s: %s>)rYr�rsrTrr�)rr��crrrr�Hs
��zElement.__repr__cCs6|drd|jjd�dd�|dD��fSd|jS)Nr�z<%s "%s"...>r�cSr�rr�r�rrrr�Xr�z%Element.shortrepr.<locals>.<listcomp>z<%s...>)rTrr�r�r.rrrr�Us
�
zElement.shortreprcCs6|jrd|��d�dd�|jD��|��fS|��S)Nz%s%s%sr�cSr�r)r4)r�r�rrrr�_r�z'Element.__unicode__.<locals>.<listcomp>)rY�starttagr��endtag�emptytagr.rrr�__unicode__\s�zElement.__unicode__rcCs�|durt}|jg}|��D]3\}}|dur|�d|�qt|t�r0dd�|D�}d�|�}nt|�}||�}|�d||f�qdd�|�S)Nz	%s="True"cSr�r�r�r�rrrr�qr�z$Element.starttag.<locals>.<listcomp>r�z%s=%sz<%s>)�pseudo_quoteattrr�r�r"rbrr�r4)r�	quoteattr�parts�namer1�valuesrrrr�gs
zElement.starttagcCs
d|jS)Nz</%s>)r�r.rrrr�yrpzElement.endtagcCs$dd�|jgdd�|��D��S)Nz<%s/>r�cSsg|]
\}}d||f�qS)z%s="%s"r)r�r�r�rrrr�~s�z$Element.emptytag.<locals>.<listcomp>)r�r�r�r.rrrr�|s
��zElement.emptytagcCs
t|j�Sr0)rsrYr.rrr�__len__�rpzElement.__len__cCst|t�r
||jvS||jvSr0)rb�
basestringr�rY�r�keyrrrr�s


zElement.__contains__cCs^t|t�r
|j|St|t�r|j|St|t�r+|jdvs"Jd��|j|j|j�St	d���Nr��cannot handle slice with stridezFelement index must be an integer, a slice, or an attribute name string�
rbr�r��intrY�slice�step�startr^r�r�rrrr�s




zElement.__getitem__cCs�t|t�r||jt|�<dSt|t�r|�|�||j|<dSt|t�rB|jdvs-Jd��|D]}|�|�q/||j|j	|j
�<dStd��r�)rbr�r��strr�rQrYr�r�r�r^r�)rr��itemrnrrrr!�s



zElement.__setitem__cCsdt|t�r|j|=dSt|t�r|j|=dSt|t�r.|jdvs$Jd��|j|j|j�=dSt	d��)Nr�r�zMelement index must be an integer, a simple slice, or an attribute name stringr�r�rrr�__delitem__�s


zElement.__delitem__cCs
|j|Sr0�rY�r�otherrrrr�rpzElement.__add__cCs
||jSr0r�r�rrr�__radd__�rpzElement.__radd__cCs.t|t�r|�|�|S|dur|�|�|S)z4Append a node or a list of nodes to `self.children`.N)rbr)r"r$r�rrr�__iadd__�s

�
zElement.__iadd__cCs|j�dd�|jD��S)NcS�g|]}|���qSr)rK�r�rPrrrr��r�z"Element.astext.<locals>.<listcomp>)�child_text_separatorr�rYr.rrrrK�s�zElement.astextcCs.i}|j��D]
\}}|�|�r|||<q|Sr0)r�r��is_not_default)r�attsr�r1rrr�non_default_attributes�s
�zElement.non_default_attributescCst|�����}|Sr0)�sortedr�r�)rr�rrrr��szElement.attlistcC�|j�||�Sr0)r��get�rr��failobjrrrr�r7zElement.getcC�
||jvSr0�r��r�attrrrr�hasattr�rpzElement.hasattrcCs||jvr|j|=dSdSr0rrrrr�delattr�s
�zElement.delattrcCr�r0)r��
setdefaultrrrrr	�r7zElement.setdefaultcCsR|�dg�D]}|�d�r|dd�Sqz|j�|�WSty(|YSw)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�fallbackrdrrr�get_language_code�s
��zElement.get_language_codecC�|�|�|j�|�dSr0)rQrYr"�rr�rrrr"��
zElement.appendcCs|D]}|�|�qdSr0�r")rr�rnrrrr$�s�zElement.extendcCsBt|t�r|�|�|j�||�dS|dur||||�<dSdSr0)rbr)rQrYr&)rr%r�rrrr&�s

�zElement.insert���cC�|j�|�Sr0)rYr')r�irrrr'�r�zElement.popcC�|j�|�dSr0)rY�removerrrrr��zElement.removecCrr0)rYr%rrrrr%r�z
Element.indexcCs||gkr
||jvr
dSdS)Nrrq�r�r�rrrr�szElement.is_not_defaultcCs4t|t�r|j}|jD]}|�||�|g��qdS)z�
        Update basic attributes ('ids', 'names', 'classes',
        'dupnames', but not 'source') from node or dictionary `dict_`.
        N)rbr)r��basic_attributes�append_attr_listr)r�dict_r�rrr�update_basic_atts
s


�zElement.update_basic_attscCs(|D]}|||vr||�|�qdS)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)rrr�r1rrrrs
	��zElement.append_attr_listcCs>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)rbrrr)rrr1rrr�coerce_append_attr_list!s
	
zElement.coerce_append_attr_listTcCs"|s	|�|�dur|||<dSdS)z�
        If self[attr] does not exist or force is True or omitted, set
        self[attr] to value, otherwise do nothing.
        N�r)rrr1�forcerrr�replace_attr0s�zElement.replace_attrcCs"|�|�|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)rr�rrr1r�rrr�copy_attr_convert9s�zElement.copy_attr_convertcCsN|�|�|ur%t|�|�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)rrbrrr!r"rrr�copy_attr_coerceDs	��zElement.copy_attr_coercecCsN|�|�|ur%t|�|�t�rt|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)rrbrrr!r"rrr�copy_attr_concatenateTs��zElement.copy_attr_concatenatecCs$|�|�|ur|�|||�dSdS)zz
        If replace is True or self[attr] is None, replace self[attr] with
        value.  Otherwise, do nothing.
        N)rr!r"rrr�copy_attr_consistentcs�zElement.copy_attr_consistentFcCsRt|t�r|j}|r|j}n|j}|�|�t||�D]}||||||�qdS)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)rbr)r��is_not_list_attribute�is_not_known_attributer�filter)rr�
update_funr��
and_source�
filter_funr�rrr�update_all_attsks

�zElement.update_all_attscC�|�|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)r-r�r&�rrr�r+rrr�update_all_atts_consistantly�s�z$Element.update_all_atts_consistantlycCr.)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)r-r�r%r/rrr�update_all_atts_concatenating�s�z%Element.update_all_atts_concatenatingcCr.)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)r-r�r$r/rrr�update_all_atts_coercion�s�z Element.update_all_atts_coercioncCs|j|tj|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_ 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.
        )r+N)r-r�r#)rrr+rrr�update_all_atts_convert�s

�zElement.update_all_atts_convertcCs
g|_dSr0r�r.rrr�clear�rpz
Element.clearcCsJ|�|�}t|t�r|�|�|||<dS|dur#||||d�<dSdS)z8Replace one child `Node` with another child or children.Nrq)r%rbr)rQ)r�old�newr%rrrr��s


�zElement.replacecCs�|}t|t�sz|d}Wntyd}Ynwt|t�r$|�|�n|jD]}||r7Jd|||f��q'|j�||�dS)zc
        Replace `self` node with `new`, where `new` is a node or a
        list of nodes.
        rNzLosing "%s" attribute: %s)rbr)�
IndexErrorr�rrr+r�)rr6�updater�rrr�replace_self�s
�


�zElement.replace_selfrcCsRt|t�s|f}t|tt|�|��D]}|D]}t|||�r%|SqqdS)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)rb�tuple�range�minrs�r�
childclassr��endr%r�rrr�first_child_matching_classs
��z"Element.first_child_matching_classcCsTt|t�s|f}t|tt|�|��D]}|D]}t|j||�r"nq|SqdS)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)rbr:r;r<rsrYr=rrr�first_child_not_matching_class!s
��z&Element.first_child_not_matching_classr@cs2d�d��|��fg��fdd�|jD��S)Nr�z%s%s
csg|]
}|���d��qSr�)rGr�r�rrr�9��z#Element.pformat.<locals>.<listcomp>)r�r�rYrDrr�rrG7s
��zElement.pformatcCs4|jdd|ji|j��}|j|_|j|_|j|_|S)Nr�r)rTr�r�r*rLrN�r�objrrrrH<s
zElement.copycCs"|��}|�dd�|jD��|S)NcSr�r)rJr�rrrr�Er�z$Element.deepcopy.<locals>.<listcomp>)rHr$rY)rrHrrrrJCszElement.deepcopycCs2tjdtdd�d|vsJ�|d�|���dS)z+Add a new class to the "classes" attribute.zadocutils.nodes.Element.set_class deprecated; append to Element['classes'] list attribute directlyrr	r�r�N)rr
�DeprecationWarningr"r��rr�rrr�	set_classHs
�zElement.set_classcCs^d|_t|di��|�}t|di��|�}|r |dusJ�d|_|r-|dus(J�d|_dSdS)zQNote that this Element has been referenced by its name
        `name` or id `id`.rq�expect_referenced_by_name�expect_referenced_by_idN)�
referenced�getattrr)rr��id�by_name�by_idrrr�note_referenced_byPs
�zElement.note_referenced_bycC�
||jvS)z�
        Returns True if and only if the given attribute is NOT one of the
        basic list attributes defined for all Elements.
        r�rdrrrrr'a�
zElement.is_not_list_attributecCrP)zj
        Returns True if and only if the given attribute is NOT recognized by
        this class.
        )�known_attributesrQrrrr(irRzElement.is_not_known_attributer�r0)r)T)TF)Fry�NN)Hrrrrzr�local_attributesr�rSr�r�r�r<r�r�r�r}r~r6r�r�r�r�rrr!r�rr�r�rKr�r�rrrr	�has_keyrr"r$r&r'rr%r�rrrr!r#r$r%r&r-r0r1r2r3r4r�r9�maxsizer@rArGrHrJrGrO�classmethodr'r(rrrrr��s�#











	
�&
�
�
�
	
�


r�c@s eZdZdZdZ	ddd�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�cOsN|dkrt|�}tj|||g|�Ri|��dStj||g|�Ri|��dS�Nr�)r�r�r�)rr�r�rYr��textnoderrrr��s
�zTextElement.__init__N�r�r�)rrrrzr�r�rrrrrYrs

rYc@seZdZdZddd�ZdS)�FixedTextElementz5An element which directly contains preformatted text.r�cOs*tj|||g|�Ri|��d|jd<dS)N�preservez	xml:space)rYr�r�)rr�r�rYr�rrrr��szFixedTextElement.__init__Nr\)rrrrzr�rrrrr]�sr]c@�eZdZdZdS)�
ResolvablerN)rrr�resolvedrrrrr`��r`c@�eZdZdd�ZdS)�BackLinkablecCs|d�|�dS)Nr�r)r�refidrrr�add_backref�r�zBackLinkable.add_backrefN)rrrrfrrrrrd��rdc@�eZdZdS)�RootN�rrrrrrrri��ric@rh)�TitularNrjrrrrrl�rkrlc@r_)�PreBibliographicz<Category of Node which may occur before Bibliographic Nodes.N�rrrrzrrrrrm��rmc@rh)�
BibliographicNrjrrrrrp�rkrpc@rh)�
DecorativeNrjrrrrrq�rkrqc@rh)�
StructuralNrjrrrrrr�rkrrc@rh)�BodyNrjrrrrrs�rkrsc@rh)�GeneralNrjrrrrrt�rkrtc@r_)�
SequentialzList-like elements.Nrnrrrrru�roruc@rh)�
AdmonitionNrjrrrrrv��rvc@r_)�SpecialzSpecial internal body elements.Nrnrrrrrx�rorxc@r_)�	Invisiblez.Internal elements that don't appear in output.Nrnrrrrry�roryc@rh)�PartNrjrrrrrz�rkrzc@rh)�InlineNrjrrrrr{�rkr{c@rh)�ReferentialNrjrrrrr|�rkr|c@seZdZdZdZdS)�
TargetablerN)rrrrJ�indirect_reference_namerrrrr}�sr}c@r_)�Labeledz(Contains a `label` as its first element.Nrnrrrrr�rorc@seZdZdZdd�Zdd�Zd>dd�Zd?d
d�Zd@dd
�Zdd�Z	dd�Z
d>dd�Zd>dd�Zdd�Z
dd�Zdd�Zdd�Zdd�Zd d!�Zd"d#�Zd$d%�Zd&d'�Zd(d)�Zd*d+�Zd,d-�Zd>d.d/�Zd0d1�Zd>d2d3�Zd4d5�Zd6d7�Zd8d9�Zd:d;�Zd<d=�Z dS)Ar,z�
    The document root element.

    Do not instantiate this class directly; use
    `docutils.utils.new_document()` instead.
    cOstj|g|�Ri|��d|_	d|_	||_	||_	g|_	i|_	i|_	i|_		i|_
	i|_	i|_	i|_
	i|_	i|_	g|_	g|_	g|_	g|_	g|_	g|_	d|_	d|_	t�|_	g|_	g|_	ddl}|j�|�|_	g|_ 	d|_!	||_"dS)Nrqr)#r�r�rMrOr�rR�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*)rr�rRrr�docutilsrrrr��sv
zdocument.__init__cCs|j��}d|d<d|d<|S)zB
        Return dict with unpicklable references removed.
        NrRr�)�__dict__rH)r�staterrr�__getstate__Zs
zdocument.__getstate__NcCs6|dur
ddlmm}|��}|�|�|��|S)z-Return a DOM representation of this document.Nr)r8r9r:r;r�r<r=rrrr?cs
zdocument.asdomr�cCs6|dr+|dD] }|j�||�|j||ur(|j�d|�}|dkr(||7}q|S|jj}|jj}d}d}|dD]}	t|	�}||}|rN||jvrNn?q;|r[|�d�r[|d}
n||}
|
�d�rsd|
dd�|ppt|j	�f}
	|j
|
d
7<d|
|j
|
f}||jvr�nqt|d�|�||j|<|S)Nr�zDuplicate ID: "%s".r�r��%�-z%s%s-rTrqz%s%d)r�r	rR�severer��	id_prefix�auto_id_prefix�make_id�endswithr�r�r")rrn�msgnode�suggested_prefixrLrr�r��base_idr��prefixrrr�set_idksF��

�
�
zdocument.set_idcCsD|dD]}||jvr|�|||||�q||j|<||j|<qdS)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` ("ids")
        and `self.nametypes` ("types") 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
        -----------  --------  -----------------  -----------  -----
        ids   types  new type  sys.msg.  dupname  ids   types
        ====  =====  ========  ========  =======  ====  =====  =====
        -     -      explicit  -         -        new   True
        -     -      implicit  -         -        new   False
        None  False  explicit  -         -        new   True
        old   False  explicit  implicit  old      new   True
        None  True   explicit  explicit  new      None  True
        old   True   explicit  explicit  new,old  None  True   [#]_
        None  False  implicit  implicit  new      None  False
        old   False  implicit  implicit  new,old  None  False
        None  True   implicit  implicit  new      None  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)r��set_duplicate_name_idr�)rrnrLr��explicitr�rrr�set_name_id_map�s 

�zdocument.set_name_id_mapcCsf|j|}|j|}|p
||j|<|ru|rad}|durF|j|}	d|vr8|d}
|	dr8d|	vr8|	d|
kr8d}|dkrFt|	|�d|j|<|jj|d||g|d�}|dkr[||7}t||�n.||j|<|durt|j|}	t|	|�n|dur�|s�d|j|<|j|}	t|	|�t||�|r�|s�|dur�|jjd||g|d�}|dkr�||7}dSdSdSdS)Nr�refurir�rqz%Duplicate explicit target name: "%s".)r��	base_nodez%Duplicate implicit target name: "%s".)r�r�r��dupnamerR�system_message�info)rrnrLr�r�r��old_id�old_explicitrF�old_noder�rrrrr��sV




�


�



���zdocument.set_duplicate_name_idcCrr0)r�rFrrr�has_name�rpzdocument.has_namecCs"|�||�}|j|||dd�dS)N�r��r�r��r�targetr�rLrrr�note_implicit_target��zdocument.note_implicit_targetcCs"|�||�}|j|||dd�dS)NTr�r�r�rrr�note_explicit_target�r�zdocument.note_explicit_targetcC�|j�|dg��|�dS�N�refname)r�r	r"�rrnrrr�note_refname��zdocument.note_refnamecCr�)Nre)r�r	r"r�rrr�
note_refid�r�zdocument.note_refidcCs&|j�|�|dr|�|�dSdS)Nr�)r�r"r��rr�rrr�note_indirect_target�s�zdocument.note_indirect_targetcC�|�|�dSr0)r�r�rrr�note_anonymous_target�r7zdocument.note_anonymous_targetcCrr0)r�r�r"�r�footnoterrr�note_autofootnote�rzdocument.note_autofootnotecCrr0)r�r�r"�r�refrrr�note_autofootnote_refrzdocument.note_autofootnote_refcCrr0)r�r�r"r�rrr�note_symbol_footnoterzdocument.note_symbol_footnotecCrr0)r�r�r"r�rrr�note_symbol_footnote_refrz!document.note_symbol_footnote_refcCrr0)r�r�r"r�rrr�
note_footnoterzdocument.note_footnotecC�0|�|�|j�|dg��|�|�|�dSr�)r�r�r	r"r�r�rrr�note_footnote_ref�
zdocument.note_footnote_refcCrr0)r�r")r�citationrrr�
note_citationrzdocument.note_citationcCr�r�)r�r�r	r"r�r�rrr�note_citation_refr�zdocument.note_citation_refcCsft|�}||jvr%|jjd||d�}|dkr||7}|j|}t||�||j|<||jt|�<dS)Nz-Duplicate substitution definition name: "%s".)r�)�whitespace_normalize_namer�rR�errorr�r��fully_normalize_name)r�subdef�def_namer�r�r�oldnoderrr�note_substitution_def s
�


zdocument.note_substitution_defcCst|�|d<dSr�)r�)r�subrefr�rrr�note_substitution_ref/rzdocument.note_substitution_refcCs|j�||�dSr0)r��add_pending)r�pending�priorityrrr�note_pending2r�zdocument.note_pendingcCrr0)r�r"�r�messagerrr�note_parse_message5rzdocument.note_parse_messagecCrr0)r�r"r�rrr�note_transform_message8rzdocument.note_transform_messagecCs&||_|dur||_dS|d|_dSr�)rMrO)rrL�offsetrrr�note_source;s
zdocument.note_sourcecCs.|j|j|jfi|j��}|j|_|j|_|Sr0)rTr�rRr�rLrNrCrrrrHBs�z
document.copycCsF|js t�|_|�t�}|dur|�|j�|jS|�||j�|jSr0)r�rArlr"r&)rr%rrr�get_decorationIs
�zdocument.get_decorationr0rZrT)!rrrrzr�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�rHr�rrrrr,�s>\
	

)'*



r,c@rh)�titleNrjrrrrr�Xrwr�c@rh)�subtitleNrjrrrrr�Yrwr�c@rh)�rubricNrjrrrrr�Zrwr�c@rh)�docinfoNrjrrrrr�arwr�c@rh)�authorNrjrrrrr�brwr�c@rh)�authorsNrjrrrrr�crwr�c@rh)�organizationNrjrrrrr�drwr�c@rh)�addressNrjrrrrr�erwr�c@rh)�contactNrjrrrrr�frwr�c@rh)�versionNrjrrrrr�grwr�c@rh)�revisionNrjrrrrr�hrwr�c@rh)�statusNrjrrrrr�irwr�c@rh)�dateNrjrrrrr�jrwr�c@rh)�	copyrightNrjrrrrr�krwr�c@seZdZdd�Zdd�ZdS)r�cCs2t|j�r
t|jdt�s|�dt��|jdS�Nr)rsrYrb�headerr&r.rrr�
get_headerts
zdecoration.get_headercCs0t|j�r
t|jdt�s|�t��|jdS)Nr)rsrYrb�footerr"r.rrr�
get_footerys
zdecoration.get_footerN)rrrr�r�rrrrr�rsr�c@rh)r�Nrjrrrrr�rwr�c@rh)r�Nrjrrrrr��rwr�c@rh)�sectionNrjrrrrr��rwr�c@r_)�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.
    Nrnrrrrr��rbr�c@r_)�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.
    Nrnrrrrr�rbrc@rh)�
transitionNrjrrrrr�rwrc@rh)�	paragraphNrjrrrrr�rwrc@rh)�compoundNrjrrrrr�rwrc@rh)�	containerNrjrrrrr�rwrc@rh)�bullet_listNrjrrrrr�rwrc@rh)�enumerated_listNrjrrrrr�rwrc@rh)�	list_itemNrjrrrrr�rwrc@rh)�definition_listNrjrrrrr�rwrc@rh)�definition_list_itemNrjrrrrr	�rwr	c@rh)�termNrjrrrrr
�rwr
c@rh)�
classifierNrjrrrrr�rwrc@rh)�
definitionNrjrrrrr�rwrc@rh)�
field_listNrjrrrrr
�rwr
c@rh)�fieldNrjrrrrr�rwrc@rh)�
field_nameNrjrrrrr�rwrc@rh)�
field_bodyNrjrrrrr�rwrc@r_)�optionr�N�rrrr�rrrrr�rbrc@rc)�option_argumentcCs|�dd�t�|�S)N�	delimiterr�)rrYrKr.rrrrK�r�zoption_argument.astextN�rrrrKrrrrr�rgrc@r_)�option_groupz, Nrrrrrr�rbrc@rh)�option_listNrjrrrrr�rwrc@r_)�option_list_itemz  Nrrrrrr�rbrc@rh)�
option_stringNrjrrrrr�rwrc@rh)�descriptionNrjrrrrr�rwrc@rh)�
literal_blockNrjrrrrr�rwrc@rh)�
doctest_blockNrjrrrrr�rwrc@rh)�
math_blockNrjrrrrr�rwrc@rh)�
line_blockNrjrrrrr�rwrc@seZdZdZdS)rNN)rrrrErrrrrN�rbrNc@rh)�block_quoteNrjrrrrr�rwrc@rh)�attributionNrjrrrrr �rwr c@rh)�	attentionNrjrrrrr!�rwr!c@rh)�cautionNrjrrrrr"�rwr"c@rh)�dangerNrjrrrrr#�rwr#c@rh)r�Nrjrrrrr��rwr�c@rh)�	importantNrjrrrrr$�rwr$c@rh)�noteNrjrrrrr%�rwr%c@rh)�tipNrjrrrrr&�rwr&c@rh)�hintNrjrrrrr'�rwr'c@rh)�warningNrjrrrrr(�rwr(c@rh)�
admonitionNrjrrrrr)�rwr)c@rh)�commentNrjrrrrr*�rwr*c@rh)�substitution_definitionNrjrrrrr+�rwr+c@rh)r�Nrjrrrrr��rwr�c@rh)r�Nrjrrrrr��rwr�c@rh)r�Nrjrrrrr��rwr�c@rh)�labelNrjrrrrr,�rwr,c@rh)�figureNrjrrrrr-�rwr-c@rh)�captionNrjrrrrr.�rwr.c@rh)�legendNrjrrrrr/�rwr/c@rh)�tableNrjrrrrr0�rwr0c@rh)�tgroupNrjrrrrr1�rwr1c@rh)�colspecNrjrrrrr2�rwr2c@rh)�theadNrjrrrrr3�rwr3c@rh)�tbodyNrjrrrrr4�rwr4c@rh)�rowNrjrrrrr5rwr5c@rh)�entryNrjrrrrr6rwr6c@s"eZdZdZddd�Zdd�ZdS)r�z�
    System message element.

    Do not instantiate this class directly; use
    ``document.reporter.info/warning/error/severe()`` instead.
    NcOs\|�dd�}|rtd|�}|f|}ztj||g|�Ri|��WdStd|f��)Nr�r�zsystem_message: children=%r)r'rr�r��print)rr�rYr�r��prrrr�
s

 zsystem_message.__init__cCs0|�dd�}d|d||d|dt�|�fS)NrNr�z%s:%s: (%s/%s) %srLrrrF)rr�rK)rrNrrrrKs�zsystem_message.astextr0)rrrrzr�rKrrrrr�s
r�c@s0eZdZdZ		ddd�Zd
dd	�Zd
d�ZdS)r�aF
    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�cOs0tj||g|�Ri|��||_	|pi|_dSr0)r�r��	transform�details)rr9r:r�rYr�rrrr�:s

zpending.__init__r@rcsdd|jj|jjfdg}t|j���}|D]V\}}t|t�r7|�dd|f�|�	dd�|�
���D��q|rbt|t�rbt|dt�rb|�dd|f�|D]}|�	d	d�|�
���D��qPq|�d
d||f�qt
�
|���d���fdd�|D��S)Nz.. internal attributes:z     .transform: %s.%sz     .details:z%7s%s:r�cS�g|]}dd|f�qS�z%9s%sr�rr�rrrr�O��z#pending.pformat.<locals>.<listcomp>rcSr;r<rr�rrrr�Ur=z	%7s%s: %rcsg|]
}d��|f�qS)z	    %s%s
rr�r�rrr�ZrB)r9rrr�r:r�rbr)r"r$rGr�rr�r�)rrErF�	internalsr:r�r1r�rr�rrGEs8��



��


����zpending.pformatcCs:|j|j|j|jfi|j��}|j|_|j|_|j|_|Sr0)rTr9r:r�r�r*rLrNrCrrrrH]s�zpending.copyrZry)rrrrzr�rGrHrrrrr�s
�
r�c@r_)�rawz@
    Raw data that is to be passed untouched to the Writer.
    Nrnrrrrr?fsr?c@rh)�emphasisNrjrrrrr@srwr@c@rh)�strongNrjrrrrrAtrwrAc@rh)�literalNrjrrrrrBurwrBc@rh)�	referenceNrjrrrrrCvrwrCc@rh)�footnote_referenceNrjrrrrrDwrwrDc@rh)�citation_referenceNrjrrrrrExrwrEc@rh)�substitution_referenceNrjrrrrrFyrwrFc@rh)�title_referenceNrjrrrrrGzrwrGc@rh)�abbreviationNrjrrrrrH{rwrHc@rh)�acronymNrjrrrrrI|rwrIc@rh)�superscriptNrjrrrrrJ}rwrJc@rh)�	subscriptNrjrrrrrK~rwrKc@rh)�mathNrjrrrrrLrwrLc@rc)�imagecCs|�dd�S)N�altr�rr.rrrrK�r�zimage.astextNrrrrrrM�rgrMc@rh)�inlineNrjrrrrrO�rwrOc@rh)�problematicNrjrrrrrP�rwrPc@rh)�	generatedNrjrrrrrQ�rwrQa<
    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
    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@s>eZdZdZdZ	dd�Zdd�Zdd�Zd	d
�Zdd�Z	d
S)�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 should be implemented for *all* node types encountered (such as
    for `docutils.writers.Writer` subclasses).  Unimplemented methods will
    raise exceptions.

    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.
    rcCr/r0)r,�rr,rrrr��rpzNodeVisitor.__init__cC�:|jj}t|d||j�}|jj�d|j|f�||�S)z�
        Call self."``visit_`` + node class name" with `node` as
        parameter.  If the ``visit_...`` method does not exist, call
        self.unknown_visit.
        �visit_z;docutils.nodes.NodeVisitor.dispatch_visit calling %s for %s)rTrrK�
unknown_visitr,rRrS�rrn�	node_name�methodrrrrU����zNodeVisitor.dispatch_visitcCrT)z�
        Call self."``depart_`` + node class name" with `node` as
        parameter.  If the ``depart_...`` method does not exist, call
        self.unknown_departure.
        �depart_z?docutils.nodes.NodeVisitor.dispatch_departure calling %s for %s)rTrrK�unknown_departurer,rRrSrWrrrr`�rZzNodeVisitor.dispatch_departurecC�2|jjjs|jj|jvrtd|j|jjf��dS)zk
        Called when entering unknown `Node` types.

        Raise an exception unless overridden.
        z!%s visiting unknown node type: %sN�r,r��strict_visitorrTr�optionalrCr�rrrrV��
���zNodeVisitor.unknown_visitcCr])zi
        Called before exiting unknown `Node` types.

        Raise exception unless overridden.
        z"%s departing unknown node type: %sNr^r�rrrr\razNodeVisitor.unknown_departureN)
rrrrzr`r�rUr`rVr\rrrrrR�s	

rRc@r_)�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.
    Nrnrrrrrb
rbrbc@s eZdZdZdd�Zdd�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.
    cCrA�z)Override for generic, uniform traversals.rBr�rrr�
default_visit)rIz GenericNodeVisitor.default_visitcCrArdrBr�rrr�default_departure-rIz$GenericNodeVisitor.default_departureN)rrrrzrerfrrrrrcsrccCr�r0)rer�rrr�_call_default_visit1r7rgcCr�r0)rfr�rrr�_call_default_departure4r7rhcCsdSr0rr�rrr�_nop7sricCsN|D]"}ttd|t�ttd|t�ttd|t�ttd|t�qdS)z%Save typing with dynamic assignments:rUr[N)�setattrrcrgrhrbri)r��_namerrr�_add_node_class_names:s�rlc@s0eZdZdZdd�Zdd�Zdd�Zdd	�Zd
S)�TreeCopyVisitorzQ
    Make a complete copy of a tree or branch, including element attributes.
    cCst�||�g|_g|_dSr0)rcr��parent_stackr+rSrrrr�Ks
zTreeCopyVisitor.__init__cCs
|jdSr�)r+r.rrr�
get_tree_copyPrpzTreeCopyVisitor.get_tree_copycCs,|��}|j�|�|j�|j�||_dS)z9Copy the current node, and make it the new acting parent.N)rHr+r"rn)rrn�newnoderrrreSs
zTreeCopyVisitor.default_visitcCs|j��|_dS)z#Restore the previous acting parent.N)rnr'r+r�rrrrfZsz!TreeCopyVisitor.default_departureN)rrrrzr�rorerfrrrrrmEsrmc@r_)�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.
    Nrnrrrrrq_�rqc@r_)rVz�
    Do not visit any children of the current node.  The current node's
    siblings and ``depart_...`` method are not affected.
    NrnrrrrrVl�rVc@r_)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.
    Nrnrrrrr[vrsr[c@r_)rWzq
    Do not visit the current node's children, and do not call the current
    node's ``depart_...`` method.
    NrnrrrrrW�rsrWc@r_)rXz
    Do not call the current node's ``depart_...`` method.  The current node's
    children and siblings are not affected.
    NrnrrrrrX�rsrXc@r_)�	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.
    Nrnrrrrrt�srtc@r_)r\a=
    Stop the traversal alltogether.  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.
    Nrnrrrrr\�rrr\cCsr|��}t|t�s
|��}|�t�}|�t�}t�d|��	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: http://www.w3.org/TR/html401
    .. _CSS1 spec: http://www.w3.org/TR/REC-CSS1
    �NFKDr��ignorer�r�r�)r�rbr4�decode�	translate�_non_id_translate_digraphs�_non_id_translate�unicodedata�	normalizer5�
_non_id_chars�subr�r��_non_id_at_endsr�)�stringrLrrrr��s#



�r�z
[^a-z0-9]+z^[-0-9]+|-+$��oi�di'�hi1riB�lig�ti��bi�i�r�i�i��fi��ki�i�r�i�r8i�i�i��yi��zi��gi%i4i5i6i7�ji<i?r�i@iG�eiIiK�qiM�riO�sz�ae�oe�db�qp)����iSi8i9cCs&|d�|�|d�|�d|_dS)Nr�r�rq)r"rrJ)rnr�rrrr�
	s
r�cCsd�|�����S)z.Return a case- and whitespace-normalized name.r�)r�r�r��r�rrrr�	sr�cCsd�|���S)z$Return a whitespace-normalized name.r�)r�r�r�rrrr�	sr�cCs|�dd��dd�S)zDEscape string values that are elements of a list, for serialization.r�z\\r�z\ )r��r1rrrr�	sr�cCsd|S)zQuote attributes for pseudo-xmlz"%s"rr�rrrr�	sr�)FF)�rz�
__future__r�collectionsr�
__docformat__r}�os�rerr{r~r�r4r�rr�objectr)r�r�r�r�r�rYr]r`rdrirlrmrprqrrrsrtrurvrxryrzr{r|r}rr,r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�rrrrrrrrrr	r
rrr
rrrrrrrrrrrrrrrNrr r!r"r#r�r$r%r&r'r(r)r*r+r�r�r�r,r-r.r/r0r1r2r3r4r5r6r�r�r?r@rArBrCrDrErFrGrHrIrJrKrLrMrOrPrQr��node_class_namesrRrbrcrgrhrirlrm�	ExceptionrqrVr[rWrXrtr\r��compiler}rrzryr�r�r�r�r�rrrr�<module>s�
 
)	S

	e
H
�]






1��������	�
���
������������������� �!�$�

https://t.me/RX1948 - 2025