o ٭jf+@szdZddlmZddlmZmZddlZddlmZm Z m Z m Z ddl m Z Gdd d e Ze d d d ZGd d d ZdS)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__rrM/var/www/html/CropPilot/venv/lib/python3.10/site-packages/markdown_it/tree.pyr s  r _NodeTypeSyntaxTreeNode)boundc@seZdZdZ dedddfd d ZdgddZedhddZediddZdjddZdkddZe dldd Z e j dmd"d Z e dnd$d%Z e j dod&d%Z e dpd'd(Z e dpd)d*Ze dqd,d-Ze dgd.d/Ze dnd0d1Ze dnd2d3Zdrd4d5Zdrd6d7Zd8d9d:d;dsd?d@ZddAdtdDdEZdudGdHZe dgdIdJZe dvdLdMZdwdPdQZe dxdSdTZe dydUdVZe dgdWdXZe dgdYdZZe dgd[d\Ze dzd^d_Z e dpd`daZ!e dpdbdcZ"ddS){raeA 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_roottokensSequence[Token]rboolreturnNonecCsd|_d|_d|_g|_|r||dS|stdt|dkr<|d}|jr,td||_|jr:||jdSdSt |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 )selfrr inline_tokenrrr__init__$s.  zSyntaxTreeNode.__init__strcCst|jd|jdS)N())typerr(rrr__repr__NszSyntaxTreeNode.__repr__r(ritemintcCdSNrr(r1rrr __getitem__QzSyntaxTreeNode.__getitem__slicelist[_NodeType]cCr3r4rr5rrrr6Tr7 int | slice_NodeType | list[_NodeType]cCs |j|Sr4)r'r5rrrr6Ws  list[Token]cs d fdd g}|||S) z Recover the linear token stream.noder token_listr<rrcsz|jdkr|jD]}||qdS|jr||jdS|js"J||jj|jD]}||q,||jjdS)Nroot)r.r'rappendr r r )r=r>childrecursive_collect_tokensrrrC]s      z:SyntaxTreeNode.to_tokens..recursive_collect_tokensN)r=rr>r<rrr)r(rrrBr to_tokensZs zSyntaxTreeNode.to_tokenscC|jSr4r"r/rrrr'nzSyntaxTreeNode.childrenvaluecC ||_dSr4rFr(rHrrrr'r _NodeType | NonecCrEr4r!r/rrrparentvrGzSyntaxTreeNode.parentcCrIr4rMrJrrrrNzrKcCs|jp|j S)z Is the node a special root node?)rr r/rrris_root~szSyntaxTreeNode.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. )rr r/rrr is_nesteds zSyntaxTreeNode.is_nestedSequence[_NodeType]cCs|js|gS|jjS)z]Get siblings of the node. Gets the whole group of siblings, including self. )rNr'r/rrrsiblingsszSyntaxTreeNode.siblingscCs2|jrdS|jr |jjS|jsJ|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 r?_open)rOrr.r r removesuffixr/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)rRindexr%r( 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)rRrUrVrrrprevious_siblings  zSyntaxTreeNode.previous_siblingcCs&t||dd}||_|j|dS)zMake a child node for `self`.FrN)r.rNr'r@)r(rrArrr _add_childszSyntaxTreeNode._add_childcCstt|}|rN|}|js||gq|jdkrtd|g}d}|r:|r:|}||||j7}|r:|s(|rEtd|d|||sdSdS)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&rZr$r@)r(rreversed_tokensr nested_tokensr&rrrr#s&       z(SyntaxTreeNode._set_children_from_tokensFrindent show_text_currentrbrcrdcCsd|}|d|j}|js#|jr#|dddd|jD7}|d7}|rC|jsC|jdvrC|jrC|dt|j|d|7}|jD]}|d|j ||||d7}qF|S) z'Create an XML style string of the tree. s z(SyntaxTreeNode.pretty..>)text text_special ra) r.rOattrsjoinitemscontenttextwraprbr'pretty)r(rbrcrdprefixrmrArrrrus$ "    zSyntaxTreeNode.pretty include_selfrx Generator[_NodeType, None, None]ccs.|r|V|jD] }|jddEdHq dS)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). TrwN)r'walk)r(rxrArrrrzs  zSyntaxTreeNode.walkr cCs"|jr|jS|jr |jjStd)z\Return the `Token` that is used as the data source for the properties defined below.z.Root node does not have the accessed attribute)rr r AttributeErrorr/rrr_attribute_token s zSyntaxTreeNode._attribute_tokencC |jS)zhtml tag name, e.g. "p")r|tagr/rrrr~ zSyntaxTreeNode.tagdict[str, str | int | float]cCr})zHtml attributes.)r|rpr/rrrrprzSyntaxTreeNode.attrsnameNone | str | int | floatcCs||S)z@Get the value of attribute `name`, or null if it does not exist.)r|attrGet)r(rrrrrszSyntaxTreeNode.attrGettuple[int, int] | NonecCs|j}|r t|SdS)z8Source map info. Format: `tuple[ line_begin, line_end ]`N)r|maptuple)r(map_rrrr!s zSyntaxTreeNode.mapcCr})z(nesting level, the same as `state.level`)r|levelr/rrrr*rzSyntaxTreeNode.levelcCr})z]In a case of self-closing tag (code, html, fence, etc.), it has contents of this tag.)r|rsr/rrrrs/ zSyntaxTreeNode.contentcCr})z5'*' or '_' for emphasis, fence string for fence, etc.)r|markupr/rrrr5rzSyntaxTreeNode.markupcCr})zfence infostring)r|infor/rrrr:rzSyntaxTreeNode.infodict[Any, Any]cCr})z/A place for plugins to store an arbitrary data.)r|metar/rrrr?rzSyntaxTreeNode.metacCr})z5True for block-level tokens, false for inline tokens.)r|blockr/rrrrDrzSyntaxTreeNode.blockcCr})zbIf it's true, ignore this element when rendering. Used for tight lists to hide paragraphs.)r|hiddenr/rrrrIrzSyntaxTreeNode.hiddenN)r)rrrrrr)rr+)r(rr1r2rr)r(rr1r8rr9)r(rr1r:rr;)r(rrr<)r(rrr9)r(rrHr9rr)r(rrrL)r(rrHrLrr)rr)r(rrrQ)rrrr)rbr2rcrrdr2rr+)r(rrxrrry)rr )rr)rr+rr)rr)rr2)rr)#rrr__doc__r*r0rr6rDpropertyr'setterrNrOrPrRr.rXrYrZr#rurzr|r~rprrrrsrrrrrrrrrrsz  *                          )r __future__rcollections.abcrrrttypingrrrrrr r rrrrrrs