a 'j,@sdZddlmZddlmZmZddlZddlmZm Z m Z m Z ddl m Z Gdd d e Ze d d d ZGd d d ZddddddZdS)zyA tree representation of a linear markdown-it token stream. This module is not part of upstream JavaScript markdown-it. ) annotations) GeneratorSequenceN)Any NamedTupleTypeVaroverload)Tokenc@seZdZUded<ded<dS) _NesterTokensr openingclosingN)__name__ __module__ __qualname____annotations__rr6E:\soccer\ml_env\Lib\site-packages\markdown_it/tree.pyr s r _NodeTypeSyntaxTreeNode)boundc@sxeZdZdZdcddddddd d Zd d d dZeddddddZeddddddZddddddZdddddZe dddddZ e j dddd d!dZ e dd"dd#d$Z e j dd"dd d%d$Z e dd d&d'Z e dd d(d)Ze dd*dd+d,Ze d d d-d.Ze dd"dd/d0Ze dd"dd1d2Zddd3d4d5Zddd3d6d7Zd8d9d:d;dddd d<d=d>Zdd?ddd@dAdBdCZdDd dEdFZe d d dGdHZe dId dJdKZd dLdMdNdOZe dPd dQdRZe dd dSdTZe d d dUdVZe d d dWdXZe d d dYdZZe d[d d\d]Z e dd d^d_Z!e dd d`daZ"dbS)draeA 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 rT create_rootzSequence[Token]boolNone)tokensrreturncCsd|_d|_d|_g|_|r*||dS|s8tdnbt|dkrt|d}|jrZtd||_|jr||jn&t |d|d|_||dddS)zInitialize 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 rz;Unequal nesting level at the start and end of token stream.) token nester_tokens_parent _children_set_children_from_tokens ValueErrorlennestingchildrenr )selfrrZ inline_tokenrrr__init__#s,  zSyntaxTreeNode.__init__str)rcCst|jd|jdS)N())typerr'rrr__repr__MszSyntaxTreeNode.__repr__rint)r'itemrcCsdSNrr'r0rrr __getitem__PszSyntaxTreeNode.__getitem__slicezlist[_NodeType]cCsdSr1rr2rrrr3Tsz int | slicez_NodeType | list[_NodeType]cCs |j|Sr1)r&r2rrrr3Xs list[Token])r'rcs(ddddfdd g}|||S)z Recover the linear token stream.rr5r)node token_listrcsv|jdkr"|jD]}||qnP|jr6||jn<|js@J||jj|jD]}||qT||jjdS)Nroot)r,r&rappendrr r )r6r7childrecursive_collect_tokensrrr<^s     z:SyntaxTreeNode.to_tokens..recursive_collect_tokensr)r'rrr;r to_tokens[s  zSyntaxTreeNode.to_tokenscCs|jSr1r!r-rrrr&oszSyntaxTreeNode.children)r'valuercCs ||_dSr1r>r'r?rrrr&ssz_NodeType | NonecCs|jSr1r r-rrrparentwszSyntaxTreeNode.parentcCs ||_dSr1rAr@rrrrB{scCs|jp |j S)z Is the node a special root node?)rrr-rrris_rootszSyntaxTreeNode.is_rootcCs t|jS)zIs 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. )rrr-rrr is_nestedszSyntaxTreeNode.is_nestedzSequence[_NodeType]cCs|js |gS|jjS)z]Get siblings of the node. Gets the whole group of siblings, including self. )rBr&r-rrrsiblingsszSyntaxTreeNode.siblingscCs2|jr dS|jr|jjS|js"Jt|jjjdS)aGet 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 r8_open)rCrr,r _removesuffixr r-rrrr,s  zSyntaxTreeNode.typecCs0|j|}|dt|jkr,|j|dSdS)zlGet the next node in the sequence of siblings. Returns `None` if this is the last sibling. r N)rEindexr$r'Z self_indexrrr next_siblings zSyntaxTreeNode.next_siblingcCs*|j|}|ddkr&|j|dSdS)zqGet the previous node in the sequence of siblings. Returns `None` if this is the first sibling. r rN)rErHrIrrrprevious_siblings  zSyntaxTreeNode.previous_sibling)rrcCs&t||dd}||_|j|dS)zMake a child node for `self`.FrN)r,rBr&r9)r'rr:rrr _add_childszSyntaxTreeNode._add_childcCstt|}|r|}|js,||gq |jdkr>td|g}d}|rn|rn|}||||j7}qH|rtd|d||q dS)zgConvert the token stream to a tree structure and set the resulting nodes as children of `self`.r zInvalid token nestingzunclosed tokens starting rN)listreversedpopr%rLr#r9)r'rZreversed_tokensrZ nested_tokensr%rrrr"s"     z(SyntaxTreeNode._set_children_from_tokensFrindent show_text_current)rRrSrTrcCsd|}|d|j}|jsF|jrF|dddd|jD7}|d7}|r|js|jdvr|jr|dt|j|d|7}|jD] }|d|j ||||d7}q|S) z'Create an XML style string of the tree. z(SyntaxTreeNode.pretty..>)textZ text_special rQ) r,rCattrsjoinitemscontenttextwraprRr&pretty)r'rRrSrTprefixr^r:rrrres& "  zSyntaxTreeNode.pretty include_selfz Generator[_NodeType, None, None])r'rhrccs,|r |V|jD]}|jddEdHqdS)zRecursively 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). TrgN)r&walk)r'rhr:rrrris zSyntaxTreeNode.walkr cCs&|jr |jS|jr|jjStddS)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)rrr AttributeErrorr-rrr_attribute_token s zSyntaxTreeNode._attribute_tokencCs |jS)zhtml tag name, e.g. "p" )rktagr-rrrrlszSyntaxTreeNode.tagzdict[str, str | int | float]cCs |jS)zHtml attributes.)rkr`r-rrrr`szSyntaxTreeNode.attrszNone | str | int | float)namercCs||S)z@Get the value of attribute `name`, or null if it does not exist.)rkattrGet)r'rmrrrrnszSyntaxTreeNode.attrGetztuple[int, int] | NonecCs|j}|rt|SdS)z8Source map info. Format: `tuple[ line_begin, line_end ]`N)rkmaptuple)r'Zmap_rrrro"s zSyntaxTreeNode.mapcCs |jS)z(nesting level, the same as `state.level`)rklevelr-rrrrq+szSyntaxTreeNode.levelcCs |jS)z]In a case of self-closing tag (code, html, fence, etc.), it has contents of this tag.)rkrcr-rrrrc0szSyntaxTreeNode.contentcCs |jS)z5'*' or '_' for emphasis, fence string for fence, etc.)rkmarkupr-rrrrr6szSyntaxTreeNode.markupcCs |jS)zfence infostring)rkinfor-rrrrs;szSyntaxTreeNode.infozdict[Any, Any]cCs |jS)z/A place for plugins to store an arbitrary data.)rkmetar-rrrrt@szSyntaxTreeNode.metacCs |jS)z5True for block-level tokens, false for inline tokens.)rkblockr-rrrruEszSyntaxTreeNode.blockcCs |jS)zbIf it's true, ignore this element when rendering. Used for tight lists to hide paragraphs.)rkhiddenr-rrrrvJszSyntaxTreeNode.hiddenN)r)#rrr__doc__r(r.rr3r=propertyr&setterrBrCrDrEr,rJrKrLr"rerirkrlr`rnrorqrcrrrsrtrurvrrrrrsx *      r))stringsuffixrcCs$|r ||r |dt| S|S)zRemove a suffix from a string. Replace this with str.removesuffix() from stdlib when minimum Python version is 3.9. N)endswithr$)rzr{rrrrGQsrG)rw __future__rcollections.abcrrrdtypingrrrrrr r rrrGrrrrs   =