"n jDSrSSKJr SSKrSSKJs Jr SSKJrJ r SSK J r SSK J r \(aSSK Jr SS jrSS jr"S S \ R"5r"S S\5r"SS\5r"SS\5rg)z Tree processors manipulate the tree created by block processors. They can even create an entirely new `ElementTree` object. This is an excellent place for creating summaries, adding collected references, or last minute adjustments. ) annotationsN) TYPE_CHECKINGAny)util)inlinepatterns)Markdownc [R"5nUR[U5SS5 UR[ U5SS5 UR[ U5SS5 U$)z2Build the default `treeprocessors` for Markdown. inlineprettify unescaper)rRegistryregisterInlineProcessorPrettifyTreeprocessorUnescapeTreeprocessor)mdkwargstreeprocessorss 9/usr/lib/python3/dist-packages/markdown/treeprocessors.pybuild_treeprocessorsr'sZ]]_NOB/2>1"5z2F1"5z1E cb[U[R5(d[U[5$g)z^Return `True` if object is a string but not an [`AtomicString`][markdown.util.AtomicString]. F) isinstancer AtomicStringstr)ss risStringr 0s% a** + +!S!! rc"\rSrSrSrSSjrSrg) Treeprocessor7z `Treeprocessor`s are run on the `ElementTree` object before serialization. Each `Treeprocessor` implements a `run` method that takes a pointer to an `Element` and modifies it as necessary. `Treeprocessors` must extend `markdown.Treeprocessor`. cg)z Subclasses of `Treeprocessor` should implement a `run` method, which takes a root `Element`. This method can return another `Element` object, and the existing root `Element` will be replaced, or it can modify the current tree and return `None`. N)selfroots rrunTreeprocessor.runAs rr%N)r' etree.Elementreturnetree.Element | None)__name__ __module__ __qualname____firstlineno____doc__r(__static_attributes__r%rrr"r"7s  rr"c\rSrSrSrSSjrSSjrSSjrSSjrSSSjjr SSSjjr SSS jjr SSS jjr SS jr SSS jjrSrg )rKzD A `Treeprocessor` that traverses a tree, applying inline patterns. c$[RUl[RUlS[ UR5-[ UR5-Ul[RUlXl URUl /Ul g)N) rINLINE_PLACEHOLDER_PREFIX$_InlineProcessor__placeholder_prefixETX$_InlineProcessor__placeholder_suffixlen$_InlineProcessor__placeholder_lengthINLINE_PLACEHOLDER_RE _InlineProcessor__placeholder_rerinlinePatterns ancestors)r&rs r__init__InlineProcessor.__init__Psp$($B$B!$(HH!$%D,E,E(F$F(+D,E,E(F%G! $ : : //$&rc^S[UR5-n[RU-nX24$)zGenerate a placeholder z%04d)r; stashed_nodesrINLINE_PLACEHOLDER)r&typeidhashs r__makePlaceholder!InlineProcessor.__makePlaceholderZs. c$,,- -&&+xrcURRX5nU(a!URS5UR54$SUS-4$)z Extract id from data string, start from index. Arguments: data: String. index: Index, from which we start search. Returns: Placeholder id and string index, after the found placeholder. rN)r>searchgroupend)r&dataindexms r__findPlaceholder!InlineProcessor.__findPlaceholder`sD  ! ! ( ( 5 771:quuw& &? "rcHURU5up4XRU'U$)zAdd node to stash. )!_InlineProcessor__makePlaceholderrD)r&noderF placeholderrGs r __stashNodeInlineProcessor.__stashNoders(006 !%2rc[U[R5(dRSn[UR5nX$:a6UR URUXU5upnU(dUS- nX$:aM6U$)z Process string with inline patterns and replace it with placeholders. Arguments: data: A line of Markdown text. patternIndex: The index of the `inlinePattern` to start with. Returns: String with placeholders. rr)rrrr;r?_InlineProcessor__applyPattern)r&rO patternIndex startIndexcountmatcheds r__handleInlineInlineProcessor.__handleInlinexsw$ 1 122J++,E&,0,?,?'' 5t:-)z A%L &  rc4U(aURnSUlOURnSUlURXBU5nU(d"XLa[U5R U5S-nOSnUR 5 UHnUR XgS5 M g)z Process placeholders in `Element.text` or `Element.tail` of Elements popped from `self.stashed_nodes`. Arguments: node: Parent node. subnode: Processing node. isText: Boolean variable, True - it's text, False - it's a tail. Nrr)texttail%_InlineProcessor__processPlaceholderslistrPreverseinsert)r&rVsubnodeisTextrc childResultposnewChilds r__processElementText$InlineProcessor.__processElementTexts <U(aT(aATSSR(aTSS=RU- slgUTSSlgT(d/TR(aT=RU- slgUTlgTR(aT=RU- slgUTlgg)Nr)rdrc)rcrjparentresults rlinkText7InlineProcessor.__processPlaceholders..linkTextsbz!}))r 1 **d2*-1r 1 *{{ t+ &* {{ t+ &* rrrrFN)rc str | Noner+None)findr8!_InlineProcessor__findPlaceholderrDgetrrrfrdstrip$_InlineProcessor__processElementTextrcappendr@r;rr)r&rOrsrjru strartIndexrPrG phEndIndexrVrcchildrNrts `` @r__processPlaceholders%InlineProcessor.__processPlaceholderss$ + +" IId77EE{!%!7!7!D+++--11"5Dqy#6 %dC00&*Vd4j%8E$zz#(::#3#3#5#5$($=$=(,U%& %zzz#(::#3#3#5#5$($=$=e$K&9!&0  ",KMM4):";< #d&?&?"@@CTc23"%KL)dD$5$566,,T2DQdT rcx[U[R5nURH(nUR 5UR ;dM#USS4s $ U(aZSnUR 5RX$5H4nURXr5upn U bU cXGRS5- nSnM4 O) O&UR 5RX$S5nUSUn U(dUSS4$U(d3URU5nURS5n URS5n WcUSW 4$[U[5(Gd[UR[R5(dU/[!U5-Hn [#U5(aMU R(aqUR R%U R&R 55 UR)U RUS-5U l UR R+5 U R,(dMUR)U R,U5U lM UR/XR155n U(aSR3USW XW S5SS4$SR3W UR5S5XR75S5SS4$) ak Check if the line fits the pattern, create the necessary elements, add it to `stashed_nodes`. Arguments: data: The text to be processed. pattern: The pattern to be checked. patternIndex: Index of current pattern. startIndex: String index, from which we start searching. Returns: String with placeholders instead of `ElementTree` elements. FrNTrz{}{}{}z{}{}{}{}rr)rrrANCESTOR_EXCLUDESlowerr@getCompiledRegExpfinditer handleMatchrNmatchstartrrcrrrfr rtag_InlineProcessor__handleInlinepoprd_InlineProcessor__stashNoderFformatrMgroups)r&patternrOr\r] new_styleexcluderrVrrNleftDatarrWs r__applyPatternInlineProcessor.__applyPatternsc*w(F(FG 00G}}$..0UA~%1 E!224==dO#*#6#6u#C S=CK))A,.J E P--/55d;6GHEKZ(H> !&&u-DKKNE))A,C <s? "$$$dii):):;;"Vd4j0E#D>> :: NN11%))//2CD)-)<)< % L1,<*EJ!NN..0 :::)-)<)< % L*EJ1&&t\\^< ??4<#.ST <=A1E E$$X%*[[^%0,,.2DFGKQO Orc/nUbLUb)URURR55 URR U5nUbMLUR 5 UR U5 g)zBuild the ancestor list.N)rrr parent_mapr|rgextend)r&rsparentsr@s r__build_ancestors!InlineProcessor.__build_ancestorsMsd  !  !1!1!34__((0F  y!rNc0UlUc/OUSSnUR5VVs0sHoDHoUU_M M snnUlX4/nU(GaUR5upxXlUR XpR5 /n UGHn U R (a[U R [R5(dURRU RR55 U R n SU lURURU 5U 5n U Hn XRU S'M Xl- nU RX45 URR5 U R(aURU R5n[ R""S5nSU lURXS5nUR(aURU l[%U5R'U 5S-nUR)5 UH)nXpRUS'UR+UUS5 M+ [-U 5(dGMXpRU 'URXRSS45 GM U H2unn [/U 5HunnUSnUR+UU5 M M4 U(aGMU$s snnf)a_Apply inline patterns to a parsed Markdown tree. Iterate over `Element`, find elements with inline tag, apply inline patterns and append newly created Elements to tree. To avoid further processing of string with inline patterns, instead of normal string, use subclass [`AtomicString`][markdown.util.AtomicString]: node.text = markdown.util.AtomicString("This will not be processed.") Arguments: tree: `Element` object, representing Markdown tree. ancestors: List of parent tag names that precede the tree node (if needed). Returns: An element tree object with applied inline patterns. NrdFr)rDiterrrr@!_InlineProcessor__build_ancestorsrcrrrrrrrerrdetreeElementrfrPrgrhr; enumerate)r&treer@ tree_parentspcstack currElementr insertQueuerrclstitemrddumby tailResultrlrmelementiobjs rr(InlineProcessor.runWsb$>@'.rIaL )-@Aaa4a1@%&#(99; K$N  " "; ?K$::jJJ 1 1''NN))%))//*;< ::D!%EJ44++D15C!$38Q0!$LE&&|4NN&&(::..uzz:D!MM#.E!%EJ!%!;!;D!OJzz%*ZZ {+11%81!, 'nFAs"1vHNN1h/-!,MeT [AsK) __placeholder_length__placeholder_prefix__placeholder_re__placeholder_suffixr@r?rrrD)rr )rFrr+ztuple[str, str])rOrrPintr+ztuple[str | None, int])rVzetree.Element | strrFrr+r)r)rOrr\rr+r)T)rVr*rir*rjboolr+ry)rOrxrsr*rjrr+z%list[tuple[etree.Element, list[str]]]) rzinlinepatterns.PatternrOrr\rr]rr+ztuple[str, bool, int])rsr,rz list[str]r+ryN)rr*r@zlist[str] | Noner+r*)r-r.r/r0r1rArUr{rrr~rer[rr(r2r%rrrrKs' #$ .*B OOO O / Ol NO'NONO NO  NO  NO`"EErrc,\rSrSrSrSSjrSSjrSrg) riz&Add line breaks to the html document. c\SnURRUR5(aURS;aUR(aURR 5(dC[ U5(a3URRUSR5(aX!lUH@nURRUR5(dM/UR U5 MB UR(aURR 5(dX!lgg)z7Recursively add line breaks to `ElementTree` children.  )codeprerN)ris_block_levelrrcr}r;_prettifyETreerd)r&elemres rr$PrettifyTreeprocessor._prettifyETrees  77 ! !$(( + +0OIITYY__%6%6D dgg&<&>400rcUR5HnUR(a0URS:Xd URUR5UlUR(a URUR5UlUR 5H%up4UR X0RU55 M' M g)z.Loop over all elements and unescape all text. rN)rrcrrrditemsset)r&r'rkeyvalues rr(UnescapeTreeprocessor.runszIIKDyyV!3 MM$))4 yy MM$))4 "jjl mmE23+ rr%N)rQz re.Match[str]r+r)rcrr+rr)r-r.r/r0r1recompilerrSTXr9rrrr(r2r%rrrrs7! L''$((; rsk(# %%%! DNN (QmQh $MM$MN4M4r