a Sicp?@sdZddlZddlmmZddlmZddlmZddZdd Z Gd d d ej Z Gd d d e Z Gddde Z Gddde ZdS)a Python Markdown A Python implementation of John Gruber's Markdown. Documentation: https://python-markdown.github.io/ GitHub: https://github.com/Python-Markdown/markdown/ PyPI: https://pypi.org/project/Markdown/ Started by Manfred Stienstra (http://www.dwerg.net/). Maintained for a few years by Yuri Takhteyev (http://www.freewisdom.org). Currently maintained by Waylan Limberg (https://github.com/waylan), Dmitry Shachnev (https://github.com/mitya57) and Isaac Muse (https://github.com/facelessuser). Copyright 2007-2018 The Python Markdown Project (v. 1.7 and later) Copyright 2004, 2005, 2006 Yuri Takhteyev (v. 0.2-1.6b) Copyright 2004 Manfred Stienstra (the original version) License: BSD (see LICENSE.md for details). N)util)inlinepatternscKsBt}|t|dd|t|dd|t|dd|S)z0 Build the default treeprocessors for Markdown. inlineZprettify unescaper)rRegistryregisterInlineProcessorPrettifyTreeprocessorUnescapeTreeprocessor)mdkwargstreeprocessorsrS/var/www/html/django/DPS/env/lib/python3.9/site-packages/markdown/treeprocessors.pybuild_treeprocessorss rcCst|tjst|tSdS)z Check if it's string F) isinstancer AtomicStringstr)srrrisString%s  rc@seZdZdZddZdS) Treeprocessora' Treeprocessors are run on the ElementTree object before serialization. Each Treeprocessor implements a "run" method that takes a pointer to an ElementTree, modifies it as necessary and returns an ElementTree object. Treeprocessors must extend markdown.Treeprocessor. cCsdS)a  Subclasses of Treeprocessor should implement a `run` method, which takes a root ElementTree. This method can return another ElementTree object, and the existing root ElementTree will be replaced, or it can modify the current tree and return None. Nr)selfrootrrrrun7szTreeprocessor.runN)__name__ __module__ __qualname____doc__rrrrrr,s rc@sjeZdZdZddZddZddZdd Zdd d ZdddZ dddZ dddZ ddZ dddZ dS)r zJ A Treeprocessor that traverses a tree, applying inline patterns. cCsJtj|_tj|_dt|jt|j|_tj|_||_ |j |_ g|_ dS)N) rINLINE_PLACEHOLDER_PREFIX$_InlineProcessor__placeholder_prefixETXZ$_InlineProcessor__placeholder_suffixlenZ$_InlineProcessor__placeholder_lengthINLINE_PLACEHOLDER_RE _InlineProcessor__placeholder_rerinlinePatterns ancestors)rrrrr__init__Fs zInlineProcessor.__init__cCs dt|j}tj|}||fS)z Generate a placeholder z%04d)r% stashed_nodesrINLINE_PLACEHOLDER)rtypeidhashrrrZ__makePlaceholderPs z!InlineProcessor.__makePlaceholdercCs4|j||}|r$|d|fSd|dfSdS)z Extract id from data string, start from index Keyword arguments: * data: string * index: index, from which we start search Returns: placeholder id and string index, after the found placeholder. rN)r'searchgroupend)rdataindexmrrrZ__findPlaceholderVs z!InlineProcessor.__findPlaceholdercCs||\}}||j|<|S)z Add node to stash )!_InlineProcessor__makePlaceholderr+)rnoder- placeholderr.rrrZ __stashNodehs zInlineProcessor.__stashNodercCsPt|tjsLd}t|j}||krL||j||||\}}}|s|d7}q|S)a Process string with inline patterns and replace it with placeholders Keyword 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)rr3 patternIndex startIndexcountmatchedrrrZ__handleInlinens    zInlineProcessor.__handleInlineTcCsv|r|j}d|_n |j}d|_||||}|sL||urLt||d}nd}||D]}|||dq\dS)a4 Process placeholders in Element.text or Element.tail of Elements popped from self.stashed_nodes. Keywords arguments: * node: parent node * subnode: processing node * isText: bool variable, True - it's text, False - it's tail Returns: None Nrr)texttail%_InlineProcessor__processPlaceholderslistr4reverseinsert)rr7subnodeisTextr>Z childResultposnewChildrrrZ__processElementTexts z$InlineProcessor.__processElementTextc sVfdd}gd}|rR||j|}|dkr |||\}}||jvr|j|} |dkrx|||} || t| s| gt| D]>} | jr| jr| | | d| j r| j r| | | qn|| |}q|} | |j ddfn"|t |j} |||| | }q||d} t|tjrDt| } || d}qS)aI Process string with placeholders and generate ElementTree tree. Keyword arguments: * data: string with placeholders instead of ElementTree elements. * parent: Element, which contains processing inline data Returns: list with ElementTree elements with applied inline patterns. cs|r|r>ddjr.ddj|7_q||dd_n>s`jrXj|7_q||_njrvj|7_n|_dS)Nr)r?r>)r>rEparentresultrrlinkTextsz7InlineProcessor.__processPlaceholders..linkTextrrHFN)findr#!_InlineProcessor__findPlaceholderr+getrrAr?strip$_InlineProcessor__processElementTextr>appendr)r%rrr) rr3rJrErLZ strartIndexr4r.Z phEndIndexr7r>childr2rrIrZ__processPlaceholderssH         z%InlineProcessor.__processPlaceholderscCst|tj}|jD] }||jvr|ddfSq|rd}|||D]>}|||\}} } | dusr| dur|| d7}d}qLqqLn"| ||d}|d|} |s|ddfS|s||}| d} | d} |dur|d| fSt |s|t|j tjs||gt|D]`} t |s| j r`|j| j|| j |d| _ |j| jr|| j|| _q|||} |rd|d| | || dddfSd| |d| |dddfSdS) a Check if the line fits the pattern, create the necessary elements, add it to stashed_nodes. Keyword 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{}{}{}{}rH)rrr ZANCESTOR_EXCLUDESlowerr)ZgetCompiledRegExpfinditerZ handleMatchr2matchstartrr>rrrArStag_InlineProcessor__handleInlinepopr?_InlineProcessor__stashNoder-formatr1groups)rpatternr3r:r;Z new_styleexcluderWr7rXr2ZleftDatarTr8rrrZ__applyPatternsd               zInlineProcessor.__applyPatterncCsHg}|dur2|dur$||j|j|}q|||dS)zBuild the ancestor list.N)rSrYrU parent_maprPrBextend)rrJparentsr)rrrZ__build_ancestors;sz!InlineProcessor.__build_ancestorsNcCsi|_|durgn |dd}dd|D|_||fg}|r|\}}||_|||jg}|D]0}|jrt|jtj s|j |j |j} d|_| || |} | D]} ||j| d<q|| 7}| || f|j|jrr||j} td} d|_| | | d}| jr.| j|_t||d}||D]$}||j|d<|||dqLt|rj||j|<| ||jddfqj|D]2\}} t| D]\}}|d}|||qqq<|S)aApply inline patterns to a parsed Markdown tree. Iterate over ElementTree, find elements with inline tag, apply inline patterns and append newly created Elements to tree. If you don't want to process your data with inline patterns, instead of normal string, use subclass AtomicString: node.text = markdown.AtomicString("This will not be processed.") Arguments: * tree: ElementTree object, representing Markdown tree. * ancestors: List of parent tag names that precede the tree node (if needed). Returns: ElementTree object with applied inline patterns. NcSsi|]}|D] }||q qSrr).0pcrrr ]z'InlineProcessor.run..rdFr)r+iterrar[r)!_InlineProcessor__build_ancestorsr>rrrrSrYrUr@rZr?etreeElementrAr4rBrCr% enumerate)rtreer)Z tree_parentsstackZ currElementrcZ insertQueuerTr>lstitemr?ZdumbyZ tailResultrFrGelementiobjrrrrEsX         zInlineProcessor.run)r)T)T)r)N)rrrr r*r6rOr\rZrRr@r9rkrrrrrr As   K J r c@s eZdZdZddZddZdS)r z& Add linebreaks to the html document. cCsd}|j|jrn|jdvrn|jr,|jsLt|rL|j|djrL||_|D]}|j|jrP||qP|jr~|js||_dS)z5 Recursively add linebreaks to ElementTree children.  )codeprerN)ris_block_levelrYr>rQr%_prettifyETreer?)relemrterrrrzs z$PrettifyTreeprocessor._prettifyETreecCs|||d}|D](}|jr,|js4d|_qd|j|_q|d}|D]J}t|rP|djdkrP|d}t|sP|jdurPt|j d|_qPdS)z, Add linebreaks to ElementTree root object. brrvz %srxrrwN) rzrjr?rQr%rYr>rrrstrip)rrZbrsr}Zpresrxrwrrrrs   zPrettifyTreeprocessor.runN)rrrr rzrrrrrr sr c@s>eZdZdZedejej Z ddZ ddZ ddZ d S) r z Restore escaped chars z {}(\d+){}cCstt|dS)Nr)chrintr1)rr5rrr _unescapeszUnescapeTreeprocessor._unescapecCs|j|j|S)N)REsubr)rr>rrrrszUnescapeTreeprocessor.unescapecCsh|D]Z}|jr*|jdks*||j|_|jr>||j|_|D]\}}||||qFqdS)z/ Loop over all elements and unescape all text. rwN)rjr>rYrr?itemsset)rrr{keyvaluerrrrs zUnescapeTreeprocessor.runN)rrrr recompiler]rSTXr$rrrrrrrrr s r )r rxml.etree.ElementTreerl ElementTreerMrrrr Processorrr r r rrrrs   N'