+ i,Rt^RIHt^RIHtHt^RIt^RIHtH t H t H t ^RI H t !RR] 4t] !RR R 7t!R R 4tR R ltR#)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,]tRt^t$R]R&R]R&RtR#) _NesterTokensr openingclosingN)__name__ __module__ __qualname____firstlineno____annotations____static_attributes__r2/usr/lib/python3/dist-packages/markdown_it/tree.pyr r s N Nrr _NodeTypeSyntaxTreeNode)boundc]tRt^tRtRKRR/RRllltRRlt]RR l4t]R R l4tR R ltRRlt ] RRl4t ] PRRl4t ] RRl4t ] PRRl4t ] RRl4t] RRl4t] RRl4t] RRl4t] R R!l4t] R"R#l4tR$R%ltR&R'ltR(^R)R*R+^/R,R-lltR.R/R/R0lltR1R2lt] R3R4l4t] R5R6l4tR7R8lt] R9R:l4t] R;R<l4t] R=R>l4t] R?R@l4t] RARBl4t ] RCRDl4t!] RERFl4t"] RGRHl4t#RIt$RJ#)LraEA 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 create_rootTc$V^8dQhRRRRRR/#)tokensSequence[Token]rboolreturnNoner)formats"r __annotate__SyntaxTreeNode.__annotate__#s$(9(9%(9<@(9 (9rc RVnRVnRVn.VnV'dVP V4R#V'g \ R4h\ V4^8Xd^V^,pVP'd \ R4hW0nVP'dVP VP4R#R#\V^,VR,4VnVP V^R4R#)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`.z;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__SyntaxTreeNode.__init__#s$( 48! %'   * *6 2 + [A !!9L### Q&J$$$..|/D/DE%"/vay&*!ED   * *6!B< 8rcV^8dQhRR/#rr!strr)r#s"rr$r%Ms55#5rc L\V4P RVP R2#)())typerr1s&r__repr__SyntaxTreeNode.__repr__Ms$t*%%&a {!44rc$V^8dQhRRRRRR/#)rr1ritemintr!r)r#s"rr$r%Qs!  ) 3 9 rc R#Nrr1r@s&&r __getitem__SyntaxTreeNode.__getitem__P rc$V^8dQhRRRRRR/#)rr1rr@slicer!list[_NodeType]r)r#s"rr$r%Us!  ) 5 _ rc R#rCrrDs&&rrErFTrGrc$V^8dQhRRRRRR/#)rr1rr@z int | slicer!z_NodeType | list[_NodeType]r)r#s"rr$r%Xs"##)#;#;V#rc (VPV,#rC)r0rDs&&rrErFXs}}T""rc V^8dQhRRRR/#)rr1rr! list[Token]r)r#s"rr$r%[s krc .aRV3Rllo.pS!W4V#)z Recover the linear token stream.c$V^8dQhRRRRRR/#)rnoder token_listrOr!r"r)r#s"rr$.SyntaxTreeNode.to_tokens..__annotate__^s" > >9 >+ >RV >rc<VPR8XdVPF pS!W!4K R#VP'dVPVP4R#VP'gQhVPVPP 4VPF pS!W!4K VPVPP 4R#)rootN)r;r0r(appendr)r r )rRrSchildrecursive_collect_tokenss&& rrY:SyntaxTreeNode.to_tokens..recursive_collect_tokens^syyF"!]]E,U?+!!$**-)))))!!$"4"4"<"<=!]]E,U?+!!$"4"4"<"<=rr)r1rrYs& @r to_tokensSyntaxTreeNode.to_tokens[s! > >! . rc V^8dQhRRRR/#)rr1rr!rJr)r#s"rr$r%psy_rc VP#rCr+r<s&rr0SyntaxTreeNode.childrenos ~~rc$V^8dQhRRRRRR/#)rr1rvaluerJr!r"r)r#s"rr$r%ts!yTrc WnR#rCr_r1rbs&&rr0r`ssrc V^8dQhRRRR/#rr1rr!_NodeType | Noner)r#s"rr$r%xsY#3rc VP#rCr*r<s&rparentSyntaxTreeNode.parentws ||rc$V^8dQhRRRRRR/#)rr1rrbrgr!r"r)r#s"rr$r%|s"Y'7Drc WnR#rCrirds&&rrjrk{s rcV^8dQhRR/#rr!r r)r#s"rr$r%s666rc LVP;'g VP'*#)z Is the node a special root node?)r(r)r<s&ris_rootSyntaxTreeNode.is_rootsJJ44$"4"455rcV^8dQhRR/#ror)r#s"rr$r%s((4(rc ,\VP4#)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. )r r)r<s&r is_nestedSyntaxTreeNode.is_nestedsD&&''rc V^8dQhRRRR/#)rr1rr!zSequence[_NodeType]r)r#s"rr$r%s$$y$%8$rc XVP'gV.#VPP#)zMGet siblings of the node. Gets the whole group of siblings, including self. )rjr0r<s&rsiblingsSyntaxTreeNode.siblingss$ {{{6M{{###rcV^8dQhRR/#r6r)r#s"rr$r%s G Gc Grc VP'dR#VP'dVPP#VP'gQh\ VPP PR4#)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 rV_open)rqr(r;r) _removesuffixr r<s&rr;SyntaxTreeNode.typesX <<< :::::?? "!!!!!T//77<C . .==a0 0rc V^8dQhRRRR/#rfr)r#s"rr$r%sy-=rc VPPV4pV^, ^8dVPV^, ,#R#)zaGet the previous node in the sequence of siblings. Returns `None` if this is the first sibling. N)ryrrs& rprevious_siblingSyntaxTreeNode.previous_siblings: ]]((. >Q ==a0 0rc V^8dQhRRRR/#rrrr!r"r)r#s"rr$r%s$$$ $rc n\V4!VRR7pWnVPPV4R#)zMake a child node for `self`.F)rN)r;rjr0rW)r1rrXs&& r _add_childSyntaxTreeNode._add_childs+ T 6u5  U#rc V^8dQhRRRR/#rr)r#s"rr$r%s+++D+rc \\V44pV'dVP4pVP'gVP V.4K>VP^8wd \ R4hV.p^pV'd>V'd6VP4pVP V4WSP, pKEV'd\ RV^, 24hVP V4KR#)z_Convert the token stream to a tree structure and set the resulting nodes as children of `self`.zInvalid token nestingzunclosed tokens starting N)listreversedpopr/rr-rW)r1rreversed_tokensr( nested_tokensr/s&& rr,(SyntaxTreeNode._set_children_from_tokenssx/0#'')E===(}}! !899"GMG!g'++-$$U+==( #<]1=MVR\ P!VP VRV,,4,, pVPF*pVRVPWW1,R7,, pK, V#)z'Create an XML style string of the tree. (SyntaxTreeNode.pretty..s"O )rrr)text text_special) r;rqattrsjoinitemscontenttextwraprr0pretty)r1rrrprefixrrXs&$$$ rrSyntaxTreeNode.prettysx!DII;'||| C#(("ODJJ AcV^8dQhRR/#)rr!r r)r#s"rr$r% sOO%Orc VP'd VP#VP'dVPP#\R4h)zTReturn the `Token` that is used as the data source for the properties defined below.z.Root node does not have the accessed attribute)r(r)r AttributeErrorr<s&r_attribute_tokenSyntaxTreeNode._attribute_token sA :::::     %%-- -MNNrcV^8dQhRR/#r6r)r#s"rr$r%s++S+rc 6VP4P#)zhtml tag name, e.g. "p" )rtagr<s&rrSyntaxTreeNode.tags$$&***rcV^8dQhRR/#)rr!zdict[str, str | int | float]r)r#s"rr$r%s--3-rc 6VP4P#)zHtml attributes.)rrr<s&rrSyntaxTreeNode.attrs$$&,,,rc V^8dQhRRRR/#)rnamer7r!zNone | str | int | floatr)r#s"rr$r%s55C5$<5rc @VP4PV4#)z@Get the value of attribute `name`, or null if it does not exist.)rattrGet)r1rs&&rrSyntaxTreeNode.attrGets$$&..t44rcV^8dQhRR/#)rr!ztuple[int, int] | Noner)r#s"rr$r%#s+rc `VP4PpV'd \V4#R#)z8Source map info. Format: `tuple[ line_begin, line_end ]`N)rmaptuple)r1map_s& rrSyntaxTreeNode.map"s($$&** ; rcV^8dQhRR/#)rr!rAr)r#s"rr$r%,s--s-rc 6VP4P#)z(nesting level, the same as `state.level`)rlevelr<s&rrSyntaxTreeNode.level+rrcV^8dQhRR/#r6r)r#s"rr$r%1s///rc 6VP4P#)zUIn a case of self-closing tag (code, html, fence, etc.), it has contents of this tag.)rrr<s&rrSyntaxTreeNode.content0s$$&...rcV^8dQhRR/#r6r)r#s"rr$r%7s...rc 6VP4P#)z5'*' or '_' for emphasis, fence string for fence, etc.)rmarkupr<s&rrSyntaxTreeNode.markup6s$$&---rcV^8dQhRR/#r6r)r#s"rr$r%<s,,c,rc 6VP4P#)zfence infostring)rinfor<s&rrSyntaxTreeNode.info;$$&+++rcV^8dQhRR/#)rr!zdict[Any, Any]r)r#s"rr$r%As,,n,rc 6VP4P#)z/A place for plugins to store an arbitrary data.)rmetar<s&rrSyntaxTreeNode.meta@rrcV^8dQhRR/#ror)r#s"rr$r%Fs--t-rc 6VP4P#)z5True for block-level tokens, false for inline tokens.)rblockr<s&rrSyntaxTreeNode.blockErrcV^8dQhRR/#ror)r#s"rr$r%Ks...rc 6VP4P#)zZIf it's true, ignore this element when rendering. Used for tight lists to hide paragraphs.)rhiddenr<s&rrSyntaxTreeNode.hiddenJs$$&---r)r+r*r)r(N)r)%rrrr__doc__r3r=rrEr[propertyr0setterrjrqruryr;rrrr,rrrrrrrrrrrrrrrrrrrrs* (9CG(9(9T5    #(__ ]]66(($$ G G$+0 49KL, 515 5,O++--5--// ..,,,,--..rc$V^8dQhRRRRRR/#)rstringr7suffixr!r)r#s"rr$r$Qs!#ssrcbV'd'VPV4'dVR\V4)#V#)zuRemove a suffix from a string. Replace this with str.removesuffix() from stdlib when minimum Python version is 3.9. N)endswithr.)rrs&&rr~r~Qs- &//&))nV %% Mr)r __future__rcollections.abcrrrtypingrrrrr(r r rrr~rrrrsK#/55J K'7 8 x.x.v r