+ Hjw6a0t$Rt^RIHt^RIt^RIt^RIt^RIHtH t ^RI H t ^RI H t HtHtHtHtHtHt] 'd^RIHt^RIHuHt]!R4t.RNR NR NR NR NR NRNRNRNRNRNRNRNRNRNRNRNRNRNRNRNRNRNRNR NR!NR"NR#NR$NR%NR&NR'NR(NR)NR*NR+NR,NR-NR.NR/NR0NR1NR2NR3NR4NR5NR6NR7NR8NR9NR:NR;NRNR?NR@NRANRBNtRC]RD&REtRFt]RG,t]RH,],t]P@!]RI,4t!]RJ,],t"]RK,],t#]P@!]#RI,4t$]RL,],t%Ret&] !RRM7RN4t'RfRORPllt(RgRQRRllt)RSRTlt*RfRURVllt+RWRXlt,!RYRZ]-4t.!R[R\4t/] 'd !R]R^]4t0!R_R`4t1!RaRb]4t2!RcRd]],4t3R#)hzv This module contains various contacts, classes and functions which get referenced and used throughout the code base. ) annotationsN)wraps lru_cache)count) TYPE_CHECKINGGenericIterator NamedTupleTypeVar TypedDictoverload)Markdown_Taddressarticleaside blockquotedetailsdivdlfieldset figcaptionfigurefooterformh1h2h3h4h5h6headerhgrouphrmainmenunavolppresectiontableulcanvascolgroupddbodydtgrouphtmliframelilegendmathmapnoscriptoutputobjectoptionprogressscriptstylesummarytbodytdtextareatfootththeadtrvideocenterz list[str]BLOCK_LEVEL_ELEMENTSzklzzwxh:z%sz([0-9]+)ampz wzxhzdk:%sz hzzhzkh:%s)maxsizecf\PR8d^RIHpM^RIpVP RR7#)z.wrapper..deprecated_funcs< MMDMM?"3G9=+%  (( (r[)r)rprqr^r`sf rYwrapperdeprecated..wrapper~s! t )  )r[rb)r^r`rssff rY deprecatedrurs  Nr[c(V^8dQhRRRRRRRR/#)r]valuez str | Nonefail_on_errorsbool preserve_nonereturnz bool | Nonerb)rcs"rYrdrds0@@*@d@RV@cn@r[c2\V\4'gV'dVfV#\V4#V'dVP4R8XdR#VP4R9dR#VP4R9dR#V'd\ RV,4hR#)aParses a string representing a boolean value. If parsing was successful, returns `True` or `False`. If `preserve_none=True`, returns `True`, `False`, or `None`. If parsing was not successful, raises `ValueError`, or, if `fail_on_errors=False`, returns `None`.NnoneTFzCannot parse bool value: %r)trueyesyon1)falsenonoff0r}) isinstancer_rylower ValueError)rwrxrzs&&&rYparseBoolValuersw eS ! ! U]LE{ 5;;=F2 9 9 B B 6>?? r[c V^8dQhRRRR/#)r]textr_r{rb)rcs"rYrdrdsccr[cRV9dVPRR4pRV9dVPRR4pRV9dVPRR4pV#)zHTML escape a string of code.&z&z>)replace)rs&rY code_escapersL d{||C) d{||C( d{||C( Kr[c V^8dQhRRRR/#)r]sizerar{rb)rcs"rYrdrds3sr[c\P!V4p\V4FpVPpV'dKVu# R#)z+Get current stack depth, performantly. N)rT _getframerf_back)rframes& rY_get_stack_depthrs3 MM$ Ed  uKr[cV^8dQhRR/#)r]r{ryrb)rcs"rYrdrds>>>r[cP\P!4\4, ^d8#)zBReturn true if current stack depth is within 100 of maximum limit.)rTgetrecursionlimitrrbr[rYnearing_recursion_limitrs  "%5%7 7# ==r[c]tRt^tRtRtR#) AtomicStringz/A string which should not be further processed.rbN)rl __module__ __qualname____firstlineno____doc____static_attributes__rbr[rYrrs9r[rc*]tRt^tRtRRRlltRtR#) ProcessorzThe base class for all processors. Attributes: Processor.md: The `Markdown` instance passed in an initialization. Arguments: md: The `Markdown` instance this processor is a part of. NcV^8dQhRR/#)r]mdzMarkdown | Nonerb)rcs"rYrdProcessor.__annotate__s?r[c WnR#Nr)selfrs&&rY__init__Processor.__init__sr[rr)rlrrrrrrrbr[rYrrsr[rc@]tRt^t$R]R&R]R&R]R&R]R&RtR #) TagDatar_tagdict[str, str]attrsra left_index right_indexrbNrlrrr__annotations__rrbr[rYrrs r[rcP]tRt^tRtRtRRltRRltRRltR R lt R t R #) HtmlStashzo This class is used for stashing HTML objects that we extract in the beginning and replace with place-holders. c >^Vn.Vn^Vn.VnR#)zCreate an `HtmlStash`. N html_counter rawHtmlBlocks tag_countertag_datars&rYrHtmlStash.__init__s!8:') r[c V^8dQhRRRR/#)r]r3zstr | etree.Elementr{r_rb)rcs"rYrdHtmlStash.__annotate__s-#r[c VPPV4VPVP4pV;P^, unV#)z Saves an HTML segment for later reinsertion. Returns a placeholder string that needs to be inserted into the document. Keyword arguments: html: An html segment. Returns: A placeholder string. )rappendget_placeholderr)rr3 placeholders&& rYstoreHtmlStash.storesE !!$'**4+<+<=  Qr[cV^8dQhRR/#r]r{Nonerb)rcs"rYrdrs  t r[c "^Vn.VnR#)zClear the stash. N)rrrs&rYresetHtmlStash.resetsr[c V^8dQhRRRR/#)r]keyrar{r_rb)rcs"rYrdrs&&3&3&r[c \V,#r)HTML_PLACEHOLDERrrs&&rYrHtmlStash.get_placeholders #%%r[c ,V^8dQhRRRRRRRRRR/#) r]rr_rrrrarr{rb)rcs"rYrdrs1SSWZ_br[c  VPPRVRVRVRV/4\\VP4,pV;P^, unV#)z(Store tag data and return a placeholder.rrrr)rrTAG_PLACEHOLDERr_r)rrrrrrs&&&&& rY store_tagHtmlStash.store_tagsY eS'5*J+[: ;&D,<,<(==  Ar[rN) rlrrrrrrrrrrrbr[rYrrs% *$ &r[rc,]tRtRt$R]R&R]R&RtR#) _PriorityItemi r_namefloatpriorityrbNrrbr[rYrr s IOr[rc]tRtRtRtRtRRltRRlt]RR l4t ]R R l4t R R lt RRlt Rt RRlt RRlt RRRlltRRltRtR#)Registryia A priority sorted registry. A `Registry` instance provides two public methods to alter the data of the registry: `register` and `deregister`. Use `register` to add items and `deregister` to remove items. See each method for specifics. When registering an item, a "name" and a "priority" must be provided. All items are automatically sorted by "priority" from highest to lowest. The "name" is used to remove ("deregister") and get items. A `Registry` instance it like a list (which maintains order) when reading data. You may iterate over the items, get an item and get a count (length) of all items. You may also check that the registry contains an item. When getting an item you may use either the index of the item or the string-based "name". For example: registry = Registry() registry.register(SomeItem(), 'itemname', 20) # Get the item by index item = registry[0] # Get the item by name item = registry['itemname'] When checking that the registry contains an item, you may use either the string-based "name", or a reference to the actual item. For example: someitem = SomeItem() registry.register(someitem, 'itemname', 20) # Contains the name assert 'itemname' in registry # Contains the item instance assert someitem in registry The method `get_index_for_name` is also available to obtain the index of an item using that item's assigned "name". c 0/Vn.VnRVnR#)FN)_data _priority _is_sortedrs&rYrRegistry.__init__9s$& .0r[c V^8dQhRRRR/#)r]itemzstr | _Tr{ryrb)rcs"rYrdRegistry.__annotate__>s+++d+r[c \V\4'dWPP49#WPP 49#r)rr_rkeysvalues)rrs&&rY __contains__Registry.__contains__>s9 dC ::??,, ,zz((***r[cV^8dQhRR/#)r]r{z Iterator[_T]rb)rcs"rYrdrEs@@,@r[c VP4\VPUUu.uFwrVPV,NK upp4#uuppir)_sortiterrr)rkr(s& rY__iter__Registry.__iter__Es8 t~~>~tqTZZ]]~>??>sA c V^8dQhRRRR/#)r]rz str | intr{rrb)rcs"rYrdrJs  y R r[c R#rrbrs&&rY __getitem__Registry.__getitem__I r[c V^8dQhRRRR/#)r]rslicer{z Registry[_T]rb)rcs"rYrdrNs  u  r[c R#rrbrs&&rYrrMrr[c V^8dQhRRRR/#)r]rzstr | int | slicer{z_T | Registry[_T]rb)rcs"rYrdrQs  0 5F r[c VP4\V\4'dL\4pVPV,F(wr4VP VP V,W44K* V#\V\4'd/VP VPV,P,#VP V,#r) rrrrrregisterrrar)rrdatarr(s&& rYrrQs c5 ! !!)Ds++ djjmQ2,K c3  ::dnnS1667 7zz#r[cV^8dQhRR/#)r]r{rarb)rcs"rYrdr\s###r[c ,\VP4#r)lenrrs&rY__len__Registry.__len__\s4>>""r[c `RPVPP\V44#)z<{}({})>)rc __class__rllistrs&rY__repr__Registry.__repr___s#  !8!8$t*EEr[c V^8dQhRRRR/#)r]rr_r{rarb)rcs"rYrdrbs D Ds Ds Dr[c W9d_VP4VPPVPUu.uFq"PV8XgKVNK up^,4#\ RP V44huupi)z% Return the index of the given name. zNo item named "{}" exists.)rrindexrrrc)rrxs&& rYget_index_for_nameRegistry.get_index_for_namebsl < JJL>>'' NN=NqffnN=a@ 5<s A?A?c(V^8dQhRRRRRRRR/#) r]rrrr_rrr{rrb)rcs"rYrdrms(==R=s=e==r[c W 9dVPV4RVnWPV&VPP \ W#44R#)a Add an item to the registry with the given name and priority. Arguments: item: The item being registered. name: A string used to reference the item. priority: An integer or float used to sort against all items. If an item is registered with a "name" which already exists, the existing item is replaced with the new item. Treat carefully as the old item is lost with no way to recover it. The new item will be sorted according to its priority and will **not** retain the position of the old item. FN) deregisterrrrrr)rrrrs&&&&rYrRegistry.registerms? < OOD ! 4 mD; Registry._sort..sr[T)rreverseN)rrsortrs&rYrRegistry._sorts1  NN  $>  M"DOr[)rrrN)T)rlrrrrrrrr rrr rrrrrrbr[rYrrsj%N +@     #F D=, ##r[r))u֐u߿)uⴰu⵿)r])TF)4__conditional_annotations__r __future__rrerTrj functoolsrr itertoolsrtypingrrrr r r r markdownr xml.etree.ElementTreeetree ElementTreerrJrSTXETXINLINE_PLACEHOLDER_PREFIXINLINE_PLACEHOLDERcompileINLINE_PLACEHOLDER_REAMP_SUBSTITUTErHTML_PLACEHOLDER_RErRTL_BIDI_RANGESrZrurrrrr_rrrrrr)r$s@rYr7s( # &]]]!)) T] # # #" #$0 #2; #=B #DH # # #' #)1 #39 #;? #AE #GK #  #  #  #  # !) # +/ # 17 # 9? # AF # HL #  #  #  # # # %) #  # # #!' #)- #/6 #8> #@H #JN #PX #  #  # # ( #*2 #4< #>H #JR #  # #  #"& #(2 #4; #=A #CJ #LP #RY #  #i 97 N/.5;5 #5 #CD=U3/%+*jj!1K!?@; $s*&  4>>2@&> 3  )..hJ H#wr{H#r[