File: //opt/alt/python37/lib/python3.7/site-packages/markdown_it/__pycache__/tree.cpython-37.pyc
B
��f,+ � @ s� d Z ddlmZ ddlmZmZ ddlZddlmZm Z m
Z
m Z ddl m
Z
ddlmZ G d d
� d
e �Ze
d d d
�ZG dd � d �ZdS )zyA tree representation of a linear markdown-it token stream.
This module is not part of upstream JavaScript markdown-it.
� )� annotations)� Generator�SequenceN)�Any�
NamedTuple�TypeVar�overload� )�Token)�
_removesuffixc @ s e Zd ZU ded< ded< dS )�
_NesterTokensr
�opening�closingN)�__name__�
__module__� __qualname__�__annotations__� r r �A/opt/alt/python37/lib/python3.7/site-packages/markdown_it/tree.pyr s
r � _NodeType�SyntaxTreeNode)�boundc @ sx e Zd ZdZdcdd�dddd�d d
�Zd d �d
d�Zedddd�dd��Zedddd�dd��Zdddd�dd�Zddd�d d �Ze ddd�d d ��Z
e
j dddd �d!d ��Z
e dd"d�d#d$��Z e j dd"dd �d%d$��Z e dd �d&d'��Z
e dd �d(d)��Ze dd*d�d+d,��Ze d d �d-d.��Ze dd"d�d/d0��Ze dd"d�d1d2��Zddd3�d4d5�Zddd3�d6d7�Zd8d9d:d;�dddd d<�d=d>�Zdd?�ddd@dA�dBdC�ZdDd �dEdF�Ze d d �dGdH��Ze dId �dJdK��Zd dLdM�dNdO�Ze dPd �dQdR��Ze dd �dSdT��Z e d d �dUdV��Z e d d �dWdX��Z e d d �dYdZ��Z e d[d �d\d]��Z e dd �d^d_��Z!e dd �d`da��Z"dbS )dr ae A Markdown syntax tree node.
A class that can be used to construct a tree representation of a linear
`markdown-it-py` token stream.
Each node in the tree represents either:
- root of the Markdown document
- a single unnested `Token`
- a `Token` "_open" and "_close" token pair, and the tokens nested in
between
r T)� create_rootzSequence[Token]�bool�None)�tokensr �returnc C s� d| _ d| _d| _g | _|r*| �|� dS |s8td��nbt|�dkrt|d }|jrZtd��|| _ |jr�| �|j� n&t |d |d �| _| �|dd� � dS )z�Initialize a `SyntaxTreeNode` from a token stream.
If `create_root` is True, create a root node for the document.
NzGCan only create root from empty token sequence. Set `create_root=True`.r r z;Unequal nesting level at the start and end of token stream.���)
�token�
nester_tokens�_parent� _children�_set_children_from_tokens�
ValueError�len�nesting�childrenr )�selfr r Z inline_tokenr r r �__init__$ s(
zSyntaxTreeNode.__init__�str)r c C s t | �j� d| j � d�S )N�(�))�typer )r' r r r �__repr__N s zSyntaxTreeNode.__repr__r �int)r' �itemr c C s d S )Nr )r' r/ r r r � __getitem__Q s zSyntaxTreeNode.__getitem__�slicezlist[_NodeType]c C s d S )Nr )r' r/ r r r r0 U s z int | slicez_NodeType | list[_NodeType]c C s
| j | S )N)r& )r' r/ r r r r0 Y s z list[Token])r' r c s( dddd�� fdd� � g }� | |� |S )z Recover the linear token stream.r z list[Token]r )�node�
token_listr c s~ | j dkr&xn| jD ]}� ||� qW nT| jr:|�| j� n@| jsDt�|�| jj� x| jD ]}� ||� qZW |�| jj� d S )N�root)r, r& r �appendr �AssertionErrorr
r )r2 r3 �child)�recursive_collect_tokensr r r8 _ s
z:SyntaxTreeNode.to_tokens.<locals>.recursive_collect_tokensr )r' r r )r8 r � to_tokens\ s
zSyntaxTreeNode.to_tokensc C s | j S )N)r! )r' r r r r& p s zSyntaxTreeNode.children)r' �valuer c C s
|| _ d S )N)r! )r' r: r r r r& t s z_NodeType | Nonec C s | j S )N)r )r' r r r �parentx s zSyntaxTreeNode.parentc C s
|| _ d S )N)r )r' r: r r r r; | s c C s | j p
| j S )z Is the node a special root node?)r r )r' r r r �is_root� s zSyntaxTreeNode.is_rootc C s
t | j�S )z�Is this node nested?.
Returns `True` if the node represents a `Token` pair and tokens in the
sequence between them, where `Token.nesting` of the first `Token` in
the pair is 1 and nesting of the other `Token` is -1.
)r r )r' r r r � is_nested� s zSyntaxTreeNode.is_nestedzSequence[_NodeType]c C s | j s | gS | j jS )z]Get siblings of the node.
Gets the whole group of siblings, including self.
)r; r& )r' r r r �siblings� s zSyntaxTreeNode.siblingsc C s2 | j r
dS | jr| jjS | js"t�t| jjjd�S )a Get a string type of the represented syntax.
- "root" for root nodes
- `Token.type` if the node represents an unnested token
- `Token.type` of the opening token, with "_open" suffix stripped, if
the node represents a nester token pair
r4 �_open)r< r r, r r6 r r
)r' r r r r, � s
zSyntaxTreeNode.typec C s0 | j �| �}|d t| j �k r,| j |d S dS )zlGet the next node in the sequence of siblings.
Returns `None` if this is the last sibling.
r N)r> �indexr$ )r' �
self_indexr r r � next_sibling� s zSyntaxTreeNode.next_siblingc C s* | j �| �}|d dkr&| j |d S dS )zqGet the previous node in the sequence of siblings.
Returns `None` if this is the first sibling.
r r N)r> r@ )r' rA r r r �previous_sibling� s z SyntaxTreeNode.previous_sibling)r r c C s& t | �|dd�}| |_| j�|� dS )z Make a child node for `self`.F)r N)r, r; r& r5 )r' r r7 r r r �
_add_child� s zSyntaxTreeNode._add_childc C s� t t|��}x�|r�|�� }|js.| �|g� q|jdkr@td��|g}d}x(|rr|rr|�� }|�|� ||j7 }qLW |r�td|d � ���| �|� qW dS )zgConvert the token stream to a tree structure and set the resulting
nodes as children of `self`.r zInvalid token nestingzunclosed tokens starting r N)�list�reversed�popr% rD r# r5 )r' r Zreversed_tokensr Z
nested_tokensr% r r r r" � s"
z(SyntaxTreeNode._set_children_from_tokens� Fr )�indent� show_text�_current)rI rJ rK r c C s� d| }|d| j � � }| jsF| jrF|dd�dd� | j�� D �� 7 }|d7 }|r�| js�| j dkr�| jr�|dt�| j|d| � 7 }x*| jD ] }|d|j |||| d� 7 }q�W |S ) z'Create an XML style string of the tree.� �<c s s | ]\}}|� d |��V qdS )�=Nr )�.0�k�vr r r � <genexpr>� s z(SyntaxTreeNode.pretty.<locals>.<genexpr>�>�text�
)rI rJ rK )
r, r< �attrs�join�items�content�textwraprI r& �pretty)r' rI rJ rK �prefixrT r7 r r r r[ � s " zSyntaxTreeNode.pretty)� include_selfz Generator[_NodeType, None, None])r' r] r c c s0 |r
| V x | j D ]}|jdd�E dH qW dS )z�Recursively yield all descendant nodes in the tree starting at self.
The order mimics the order of the underlying linear token
stream (i.e. depth first).
T)r] N)r& �walk)r' r] r7 r r r r^ � s zSyntaxTreeNode.walkr
c C s& | j r | j S | jr| jjS td��dS )z\Return the `Token` that is used as the data source for the
properties defined below.z.Root node does not have the accessed attributeN)r r r
�AttributeError)r' r r r �_attribute_token s
z SyntaxTreeNode._attribute_tokenc C s
| � � jS )zhtml tag name, e.g. "p" )r` �tag)r' r r r ra s zSyntaxTreeNode.tagz dict[str, str | int | float]c C s
| � � jS )zHtml attributes.)r` rV )r' r r r rV s zSyntaxTreeNode.attrszNone | str | int | float)�namer c C s | � � �|�S )z@Get the value of attribute `name`, or null if it does not exist.)r` �attrGet)r' rb r r r rc s zSyntaxTreeNode.attrGetztuple[int, int] | Nonec C s | � � j}|rt|�S dS )z8Source map info. Format: `tuple[ line_begin, line_end ]`N)r` �map�tuple)r' Zmap_r r r rd s
zSyntaxTreeNode.mapc C s
| � � jS )z(nesting level, the same as `state.level`)r` �level)r' r r r rf ' s zSyntaxTreeNode.levelc C s
| � � jS )z]In a case of self-closing tag (code, html, fence, etc.), it
has contents of this tag.)r` rY )r' r r r rY , s zSyntaxTreeNode.contentc C s
| � � jS )z5'*' or '_' for emphasis, fence string for fence, etc.)r` �markup)r' r r r rg 2 s zSyntaxTreeNode.markupc C s
| � � jS )zfence infostring)r` �info)r' r r r rh 7 s zSyntaxTreeNode.info�dictc C s
| � � jS )z/A place for plugins to store an arbitrary data.)r` �meta)r' r r r rj < s zSyntaxTreeNode.metac C s
| � � jS )z5True for block-level tokens, false for inline tokens.)r` �block)r' r r r rk A s zSyntaxTreeNode.blockc C s
| � � jS )zbIf it's true, ignore this element when rendering.
Used for tight lists to hide paragraphs.)r` �hidden)r' r r r rl F s zSyntaxTreeNode.hiddenN)r )#r r r �__doc__r( r- r r0 r9 �propertyr& �setterr; r< r= r> r, rB rC rD r" r[ r^ r` ra rV rc rd rf rY rg rh rj rk rl r r r r r sB )
)rm �
__future__r �collections.abcr r rZ �typingr r r r r r
�utilsr r r r r r r r �<module> s