ehg+dZddlmZddlmZmZddlZddlmZm Z m Z m Z ddl m Z Gdd e Ze d d ZGd 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$eZdZUded<ded<dS) _NesterTokensr openingclosingN)__name__ __module__ __qualname____annotations__`/home/jenkins/workspace/simtester-sanitize/venv/lib/python3.11/site-packages/markdown_it/tree.pyr r s"NNNNNNNNrr _NodeTypeSyntaxTreeNode)boundceZdZdZ dIdddJd ZdKd ZedLdZedMdZdNdZdOdZe dPdZ e j dQdZ e dRdZ e j dSd Z e dTd!Z e dTd"Ze dUd$Ze dKd%Ze dRd&Ze dRd'ZdVd(ZdVd)Zd*d+d,d-dWd1Zdd2dXd5ZdYd7Ze dKd8Ze dZd:Zd[d=Ze d\d?Ze d]d@Ze dKdAZe dKdBZe dKdCZe d^dEZ e dTdFZ!e dTdGZ"dHS)_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]rboolreturnNonecd|_d|_d|_g|_|r||dS|st dt |dkrJ|d}|jrt d||_|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_tokens r__init__zSyntaxTreeNode.__init__$s$( 48! %'    * *6 2 2 2 F 9+ [[A  !!9L#  Q&DJ$ F..|/DEEEEE F F"/vay&*!E!ED   * *6!B$< 8 8 8 8 8rstrc@t|jd|jdS)N())typerr-s r__repr__zSyntaxTreeNode.__repr__Ns$t**%44 4444rr-ritemintcdSNrr-r7s r __getitem__zSyntaxTreeNode.__getitem__Qs>Acrslicelist[_NodeType]cdSr:rr;s rr<zSyntaxTreeNode.__getitem__TsFIcr int | slice_NodeType | list[_NodeType]c|j|Sr:)r,r;s rr<zSyntaxTreeNode.__getitem__Ws}T""r list[Token]c0dfd g}|||S) z Recover the linear token stream.noder token_listrCr r!cN|jdkr|jD]}||dS|jr||jdS|jsJ||jj|jD]}||||jjdS)Nroot)r4r,r$appendr%rr)rErFchildrecursive_collect_tokenss rrKz:SyntaxTreeNode.to_tokens..recursive_collect_tokens]syF""!]@@E,,UJ????@@ >!!$*-----))))!!$"4"<===!]@@E,,UJ????!!$"4"<=====r)rErrFrCr r!r)r-rrKs @r to_tokenszSyntaxTreeNode.to_tokensZs@ > > > > > >!  v... rc|jSr:r'r5s rr,zSyntaxTreeNode.childrenns ~rvaluec||_dSr:rNr-rOs rr,zSyntaxTreeNode.childrenrs r_NodeType | Nonec|jSr:r&r5s rparentzSyntaxTreeNode.parentvs |rc||_dSr:rTrQs rrUzSyntaxTreeNode.parentzs  rc |jp|j S)z Is the node a special root node?)r$r%r5s ris_rootzSyntaxTreeNode.is_root~sJ4$"455rc*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%r5s r is_nestedzSyntaxTreeNode.is_nestedsD&'''rSequence[_NodeType]c.|js|gS|jjS)z]Get siblings of the node. Gets the whole group of siblings, including self. )rUr,r5s rsiblingszSyntaxTreeNode.siblingss { 6M{##rc|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 rH_open)rXr$r4r%r removesuffixr5s rr4zSyntaxTreeNode.typesS < 6 : #:? "!!!!!).;;GDDDrc|j|}|dzt|jkr|j|dzSdS)zlGet the next node in the sequence of siblings. Returns `None` if this is the last sibling. r N)r]indexr*r- self_indexs r next_siblingzSyntaxTreeNode.next_siblingsH ]((.. >C .. . .=a0 0trcl|j|}|dz dkr|j|dz SdS)zqGet the previous node in the sequence of siblings. Returns `None` if this is the first sibling. r rN)r]rbrcs rprevious_siblingzSyntaxTreeNode.previous_siblings> ]((.. >Q  =a0 0trc|t||d}||_|j|dS)zMake a child node for `self`.FrN)r4rUr,rI)r-rrJs r _add_childzSyntaxTreeNode._add_childsA T 6u555  U#####rctt|}|r|}|js||g4|jdkrt d|g}d}|r9|r7|}||||jz }|r|7|rt d|d|||dSdS)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+rir)rI)r-rreversed_tokensr$ nested_tokensr+s rr(z(SyntaxTreeNode._set_children_from_tokenss#x//00 +#''))E= (((}!! !8999"GMG! )g )'++--$$U+++5=(" )g ) Q !O]1=M!O!OPPP OOM * * *% + + + + +rFrindent show_text_currentrrrsrtc d|z}|d|jz}|jsC|jr<|ddd|jDzz }|dz }|r=|js6|jdvr-|jr&|dt j|j|d|zzzz }|jD]#}|d| ||||zzz }$|S)z'Create an XML style string of the tree. z(SyntaxTreeNode.pretty..s0"O"ODAqa<)text text_special rq) r4rXattrsjoinitemscontenttextwraprrr,pretty)r-rrrsrtprefixrrJs rrzSyntaxTreeNode.prettysxDI'| P  P C#(("O"ODJ)r-rr7r@r rA)r-rr rC)r-rr r>)r-rrOr>r r!)r-rr rR)r-rrOrRr r!)r r)r-rr r[)rrr r!)rrr8rsrrtr8r r0)r-rrrr r)r r )r r)rr0r r)r r)r r8)r r)#rrr__doc__r/r6r r<rLpropertyr,setterrUrXrZr]r4rergrir(rrrrrrrrrrrrrrrrrrrs  )+(9CG(9(9(9(9(9(9T5555AAAXA IIIXI####(X__X ]]666X6(((X($$$X$ E E EX EXX$$$$++++2 !E1.26 5 5 5 5 5 5,OOOO+++X+---X-5555X---X-///X/ ...X.,,,X,,,,X,---X-...X...r)r __future__rcollections.abcrrrtypingrrrr r$r r rrrrrrs #"""""////////555555555555J GK'7 8 8 8 v.v.v.v.v.v.v.v.v.v.r