/usr/lib/python2.6/site-packages/markdown
Edit: /usr/lib/python2.6/site-packages/markdown/treeprocessors.pyo (11083B)
Ñò
«QsXc @ sz d d k Z d d k Z d „ Z d f d „ ƒ YZ d e f d „ ƒ YZ d e f d „ ƒ YZ d e f d
„ ƒ YZ d S( iÿÿÿÿNc C s t | t ƒ p
t | t ƒ S( s Check if it's string ( t
isinstancet unicodet str( t s( ( s; /usr/lib/python2.6/site-packages/markdown/treeprocessors.pyt isString s t Processorc B s e Z d d „ Z RS( c C s | o
| | _ n d S( N( t markdown( t selft markdown_instance( ( s; /usr/lib/python2.6/site-packages/markdown/treeprocessors.pyt __init__ s N( t __name__t
__module__t NoneR ( ( ( s; /usr/lib/python2.6/site-packages/markdown/treeprocessors.pyR s t
Treeprocessorc B s e Z d Z d „ Z RS( s'
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.
c C s d S( s"
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.
N( ( R t root( ( s; /usr/lib/python2.6/site-packages/markdown/treeprocessors.pyt run s ( R
R t __doc__R ( ( ( s; /usr/lib/python2.6/site-packages/markdown/treeprocessors.pyR
s
t InlineProcessorc B sh e Z d Z d „ Z d „ Z d „ Z d „ Z d d „ Z e d „ Z d „ Z
d d „ Z d
„ Z RS( sJ
A Treeprocessor that traverses a tree, applying inline patterns.
c C sa t i | _ t i | _ d t | i ƒ t | i ƒ | _ t i t i d ƒ | _
| | _ d S( Ni s
([0-9]{4})( R t INLINE_PLACEHOLDER_PREFIXt$ _InlineProcessor__placeholder_prefixt ETXt$ _InlineProcessor__placeholder_suffixt lent$ _InlineProcessor__placeholder_lengtht ret compilet INLINE_PLACEHOLDERt _InlineProcessor__placeholder_re( R t md( ( s; /usr/lib/python2.6/site-packages/markdown/treeprocessors.pyR ' s
#c C s* d t | i ƒ } t i | } | | f S( s Generate a placeholder s %04d( R t
stashed_nodesR R ( R t typet idt hash( ( s; /usr/lib/python2.6/site-packages/markdown/treeprocessors.pyt __makePlaceholder/ s
c C sH | i i | | ƒ } | o | i d ƒ | i ƒ f Sd | d f Sd S( sö
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.
i N( R t searcht groupt endR ( R t datat indext m( ( s; /usr/lib/python2.6/site-packages/markdown/treeprocessors.pyt __findPlaceholder5 s c C s& | i | ƒ \ } } | | i | <| S( s Add node to stash ( t! _InlineProcessor__makePlaceholderR ( R t nodeR t placeholderR ( ( s; /usr/lib/python2.6/site-packages/markdown/treeprocessors.pyt __stashNodeG s
i c C s‡ t | t i ƒ pp d } xg | t | i i ƒ j oI | i | i i i | ƒ | | | ƒ \ } } } | p | d 7} q q Wn | S( s
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.
i i ( R R t AtomicStringR t inlinePatternst _InlineProcessor__applyPatternt value_for_index( R R% t patternIndext
startIndext matched( ( s; /usr/lib/python2.6/site-packages/markdown/treeprocessors.pyt __handleInlineM s
c C s± | o | i } d | _ n | i } d | _ | i | | ƒ } | o3 | | j o& | i ƒ i | ƒ } | i | ƒ n d } | i ƒ x | D] } | i | | ƒ q“ Wd S( s4
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
i N( t textR t tailt% _InlineProcessor__processPlaceholderst getchildrenR& t removet reverset insert( R R* t subnodet isTextR5 t childResultt post newChild( ( s; /usr/lib/python2.6/site-packages/markdown/treeprocessors.pyt __processElementTextd s
c sº ‡ ‡ f d † } g ‰ d } x•| o| i | i | ƒ } | d j oM| i | | ƒ \ } } | | i j oú | i i | ƒ } | d j o | | | !} | | ƒ n t | ƒ p‰ x™ | g | i ƒ D]m }
|
i o+ |
i i ƒ o | i | |
t
ƒ qn |
i o( |
i i ƒ o | i |
|
ƒ q:qÍ qÍ Wn | | ƒ | } q! | } ˆ i | ƒ q±| t
t ƒ } | | | | !ƒ | } q! | | } | | ƒ d } q! Wˆ S( sH
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.
c sr | og ˆ o6 ˆ d i o ˆ d i | 7_ qj | ˆ d _ qn ˆ i o ˆ i | 7_ qn | ˆ _ n d S( Niÿÿÿÿ( R6 R5 ( R5 ( t resultt parent( s; /usr/lib/python2.6/site-packages/markdown/treeprocessors.pyt linkText s
i iÿÿÿÿt ( t findR t! _InlineProcessor__findPlaceholderR t getR R8 R6 t stript$ _InlineProcessor__processElementTextt FalseR5 t appendR t prefix( R R% RC RD t strartIndexR& R t
phEndIndexR* R5 t childR$ ( ( RC RB s; /usr/lib/python2.6/site-packages/markdown/treeprocessors.pyt __processPlaceholders… sD
c
C sw | i ƒ i | | ƒ } | | } | p | t d f S| i | ƒ } | d j o1 | t t | ƒ | i t | i ƒ ƒ ƒ d f St | ƒ p t
| i t i
ƒ pƒ x€ | g | i ƒ D]g } t | ƒ pT | i o | i | i | d ƒ | _ n | i o | i | i | ƒ | _ q#q¼ q¼ Wq/n | i | | i ƒ ƒ } d | | i d ƒ | | i ƒ d f t d f S( s¨
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 starting search
Returns: String with placeholders instead of ElementTree elements.
i i s %s%s%s%siÿÿÿÿN( t getCompiledRegExpt matchRK t handleMatchR t TrueR t spant groupsR R R5 R R- R8 t _InlineProcessor__handleInlineR6 t _InlineProcessor__stashNodeR R# (
R t patternR% R1 R2 RS t leftDataR* RP R+ ( ( s; /usr/lib/python2.6/site-packages/markdown/treeprocessors.pyt __applyPatternÆ s,
1
c C sž h | _ | g } x…| o}| i ƒ } g } x¡ | i ƒ D]“ } | i oe t | i t i ƒ oN | i } d | _ | i | i | ƒ | ƒ } | | 7} | i
| | f ƒ n | i ƒ o | i
| ƒ q; q; WxÀ | D]¸ \ } } | i o t i i | i | ƒ | _ n d } xz | D]r }
|
i
o t i i |
i
| ƒ |
_
n |
i o t i i |
i |
ƒ |
_ n | i | |
ƒ | d 7} qWqÙ Wq W| S( sC Apply 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 process your data with inline paterns, instead of normal string,
use subclass AtomicString:
node.text = markdown.AtomicString("data won't be processed with inline patterns")
Arguments:
* markdownTree: ElementTree object, representing Markdown tree.
Returns: ElementTree object with applied inline patterns.
i i N( R t popR8 R5 R R R- R R7 RX RL t inlinepatternst handleAttributesR6 R; ( R t treet stackt currElementt insertQueueRP R5 t lstt elementt iR@ ( ( s; /usr/lib/python2.6/site-packages/markdown/treeprocessors.pyR ò sD
!
(
R
R R R R) RG RY RX RU RJ R7 R/ R ( ( ( s; /usr/lib/python2.6/site-packages/markdown/treeprocessors.pyR " s ! A ,t PrettifyTreeprocessorc B s e Z d Z d „ Z d „ Z RS( s& Add linebreaks to the html document. c C s d } t i | i ƒ o¿ | i d j o¯ | i p | i i ƒ o1 t | ƒ o$ t i | d i ƒ o
| | _ n x2 | D]* } t i | i ƒ o | i | ƒ q} q} W| i p | i i ƒ o
| | _ qØ n | i p | i i ƒ o
| | _ n d S( s5 Recursively add linebreaks to ElementTree children. s
t codet prei N( s codeRi ( R t isBlockLevelt tagR5 RI R t _prettifyETreeR6 ( R t elemRf t e( ( s; /usr/lib/python2.6/site-packages/markdown/treeprocessors.pyRl . s # $
c C sj | i | ƒ | i d ƒ } xG | D]? } | i p | i i ƒ o
d | _ q# d | i | _ q# Wd S( s, Add linebreaks to ElementTree root object. t brs
s
%sN( Rl t getiteratorR6 RI ( R R t brsRo ( ( s; /usr/lib/python2.6/site-packages/markdown/treeprocessors.pyR > s
( R
R R Rl R ( ( ( s; /usr/lib/python2.6/site-packages/markdown/treeprocessors.pyRg + s ( R R R R R
R Rg ( ( ( s; /usr/lib/python2.6/site-packages/markdown/treeprocessors.pyt
s ÿ