)ig+SrSSKJr SSKJrJr SSKrSSKJrJ r J r J r SSK J r "SS \ 5r\ "S S S 9r"S S 5rg)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*\rSrSr%S\S'S\S'Srg) _NesterTokensr openingclosingN)__name__ __module__ __qualname____firstlineno____annotations____static_attributes__rP/var/www/html/land-doc-ocr/venv/lib/python3.13/site-packages/markdown_it/tree.pyr r s N Nrr _NodeTypeSyntaxTreeNode)boundc\rSrSrSrS,SS.S-SjjjrS.Sjr\S/Sj5r\S0Sj5rS1S jrS2S jr \ S3S j5r \ RS4S j5r \ S5S j5r \ RS6Sj5r \ S7Sj5r\ S7Sj5r\ S8Sj5r\ S.Sj5r\ S5Sj5r\ S5Sj5rS9SjrS9SjrSSSS.S:SjjrSS.S;SjjrSS!jr\ S?S"j5r\ S@S#j5r\ S.S$j5r\ S.S%j5r\ S.S&j5r \ SAS'j5r!\ S7S(j5r"\ S7S)j5r#S*r$g+)BraEA 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 T create_rootcSUlSUlSUl/UlU(aUR U5 gU(d [ S5e[ U5S:XaUUSnUR(a [ S5eX0lUR(aUR UR5 gg[USUS5UlUR USS5 g)zsInitialize 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 )selftokensr inline_tokens r__init__SyntaxTreeNode.__init__$s$( 48! %'   * *6 2 + [A !!9L## Q&J$$..|/D/DE%"/vay&*!ED   * *6!B< 8rcL[U5RSURS3$)N())typerr,s r__repr__SyntaxTreeNode.__repr__Ns$t*%%&a {!44rcgNrr,items r __getitem__SyntaxTreeNode.__getitem__Qs>Arcgr9rr:s rr<r=TsFIrc URU$r9)r+r:s rr<r=Ws}}T""rc,^SU4Sjjm/nT"X5 U$)z Recover the linear token stream.c>URS:XaURH nT"X!5 M gUR(aURUR5 gUR(deURURR 5 URH nT"X!5 M URURR 5 g)Nroot)r4r+r#appendr$rr)node token_listchildrecursive_collect_tokenss rrG:SyntaxTreeNode.to_tokens..recursive_collect_tokens]syyF"!]]E,U?+!!$**-))))!!$"4"4"<"<=!]]E,U?+!!$"4"4"<"<=r)rDrrE list[Token]returnNoner)r,r-rGs @r to_tokensSyntaxTreeNode.to_tokensZs >! . rcUR$r9r&r5s rr+SyntaxTreeNode.childrenns ~~rcXlgr9rOr,values rr+rPrsrcUR$r9r%r5s rparentSyntaxTreeNode.parentvs ||rcXlgr9rUrRs rrVrWzs rcJUR=(d UR(+$)z Is the node a special root node?)r#r$r5s ris_rootSyntaxTreeNode.is_root~sJJ4$"4"455rc,[UR5$)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. )boolr$r5s r is_nestedSyntaxTreeNode.is_nestedsD&&''rcVUR(dU/$URR$)zMGet siblings of the node. Gets the whole group of siblings, including self. )rVr+r5s rsiblingsSyntaxTreeNode.siblingss" {{6M{{###rcUR(agUR(aURR$UR(deURRRR S5$)zGet 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 rB_open)rZr#r4r$r removesuffixr5s rr4SyntaxTreeNode.typesU << ::::?? "!!!!!!))..;;GDDrcURRU5nUS-[UR5:aURUS-$g)z\Get the next node in the sequence of siblings. Returns `None` if this is the last sibling. r N)raindexr)r, self_indexs r next_siblingSyntaxTreeNode.next_siblingsC ]]((. >C . .==a0 0rcpURRU5nUS- S:aURUS- $g)zaGet the previous node in the sequence of siblings. Returns `None` if this is the first sibling. r rN)rarhris rprevious_siblingSyntaxTreeNode.previous_siblings: ]]((. >Q ==a0 0rcf[U5"USS9nXlURRU5 g)zMake a child node for `self`.FrN)r4rVr+rC)r,r-rFs r _add_childSyntaxTreeNode._add_childs+ T 6u5  U#rc[[U55nU(aUR5nUR(dUR U/5 M<URS:wa [ S5eU/nSnU(aFU(a?UR5nUR U5 XSR- nU(a U(aM?U(a[ SUS35eUR U5 U(aMgg)z_Convert the token stream to a tree structure and set the resulting nodes as children of `self`.r zInvalid token nestingzunclosed tokens starting rN)listreversedpopr*rqr(rC)r,r-reversed_tokensr# nested_tokensr*s rr'(SyntaxTreeNode._set_children_from_tokenssx/0#'')E==(}}! !899"GMG!g'++-$$U+==("gg #<]1=MUR (a-US[ R"UR USU--5-- nURHnUSURXX1-S9-- nM U$)z'Create an XML style string of the tree. (SyntaxTreeNode.pretty..s"O)text text_special r{) r4rZattrsjoinitemscontenttextwrapr|r+pretty)r,r|r}r~prefixrrFs rrSyntaxTreeNode.prettysx!DII;'|| C#(("ODJJrsE #/55J K'7 8 v.v.r