"n ji6f%SrSSKJr SSKrSSKrSSKrSSKJrJr SSK J r SSK J r J r JrJrJrJrJr \ (aSSKJr SSKJs Jr \"S5r/S QrS \S 'S rS r\S-r\S-\-r\R>"\S-5r \S-\-r!\S-\-r"\R>"\"S-5r#\S-\-r$Sr%\"SS9S5r&S(S)Sjjr'S*S+Sjjr(S,Sjr)S(S-Sjjr*S.Sjr+"SS\,5r-"SS5r.\ (a "S S!\5r/"S"S#5r0"S$S%\5r1"S&S'\ \5r2g)/zv 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_T):addressarticleaside blockquotedetailsdivdlfieldset figcaptionfigurefooterformh1h2h3h4h5h6headerhgrouphrmainmenunavolppresectiontableulcanvascolgroupddbodydtgrouphtmliframelilegendmathmapnoscriptoutputobjectoptionprogressscriptstylesummarytbodytdtextareatfootththeadtrvideoz list[str]BLOCK_LEVEL_ELEMENTSzklzzwxh:z%sz([0-9]+)ampz wzxhzdk:%sz hzzhzkh:%s))u֐u߿)uⴰu⵿)maxsizec^[RS:aSSKJn OSSKnUR SS9$)z^[T5UUU4Sj5nU$)Nch>[R"STRST3[TS9 T"U0UD6$)N'z' is deprecated. )category stacklevel)warningswarn__name__DeprecationWarning)argskwargsfuncmessageras rYdeprecated_func4deprecated..wrapper..deprecated_func~s< MMDMM?"3G9=+%  (( (r[)r)rhrjriras` rYwrapperdeprecated..wrapper}s! t )  )r[)rirarls`` rY deprecatedroqs  Nr[c[U[5(dU(aUcU$[U5$U(aUR5S:XagUR5S;agUR5S;agU(a[ SU-5eg)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`.Nnone)trueyesyon1T)falsenonoff0rqFzCannot parse bool value: %r) isinstancestrboollower ValueError)valuefail_on_errors preserve_nones rYparseBoolValuersw eS ! ! U]LE{ 5;;=F2 9 9 B B 6>?? r[cSU;aURSS5nSU;aURSS5nSU;aURSS5nU$)zHTML escape a string of code.&z&z>)replace)texts rY code_escapersL d{||C) d{||C( d{||C( Kr[c[R"U5n[U5HnURnU(aMUs $ g)z+Get current stack depth, performantly. N)rT _getframerf_back)sizeframes rY_get_stack_depthrs3 MM$ Ed  uKr[cH[R"5[5- S:$)zBReturn true if current stack depth is within 100 of maximum limit.d)rTgetrecursionlimitrrnr[rYnearing_recursion_limitrs  "%5%7 7# ==r[c\rSrSrSrSrg) AtomicStringz/A string which should not be further processed.rnN)rd __module__ __qualname____firstlineno____doc____static_attributes__rnr[rYrrs9r[rc&\rSrSrSrSSSjjrSrg) 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. NcXlgNmd)selfrs rY__init__Processor.__init__sr[rr)rzMarkdown | None)rdrrrrrrrnr[rYrrsr[rc>\rSrSr%S\S'S\S'S\S'S\S'S rg ) TagDatar}tagdict[str, str]attrsint left_index right_indexrnNrdrrr__annotations__rrnr[rYrrs r[rcF\rSrSrSrSrS SjrS SjrS SjrS Sjr Sr g ) HtmlStashzo This class is used for stashing HTML objects that we extract in the beginning and replace with place-holders. c<SUl/UlSUl/Ulg)zCreate an `HtmlStash`. rN html_counter rawHtmlBlocks tag_countertag_datars rYrHtmlStash.__init__s!8:') r[cURRU5 URUR5nU=RS- slU$)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)rr4 placeholders rYstoreHtmlStash.storesE !!$'**4+<+<=  Qr[c SUl/Ulg)zClear the stash. rN)rrrs rYresetHtmlStash.resetsr[c[U-$r)HTML_PLACEHOLDERrkeys rYrHtmlStash.get_placeholders #%%r[cURRXUUS.5 [[UR5-nU=RS- slU$)z(Store tag data and return a placeholder.)rrrrr)rrTAG_PLACEHOLDERr}r)rrrrrrs rY store_tagHtmlStash.store_tagsO S,6-8: ;&D,<,<(==  Ar[rN)r4zstr | etree.Elementreturnr}rNone)rrrr}) rr}rrrrrrrr}) rdrrrrrrrrrrrnr[rYrrs  *$ &r[rc*\rSrSr%S\S'S\S'Srg) _PriorityItemi r}namefloatpriorityrnNrrnr[rYrr s IOr[rc\rSrSrSrSrSSjrSSjr\SSj5r \SSj5r SSjr SS jr S r SS jr SS jr SSS jjrSSjrSrg)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.0Ul/UlSUlg)NF)_data _priority _is_sortedrs rYrRegistry.__init__8s$& .0r[c[U[5(aXRR5;$XRR 5;$r)r|r}rkeysvalues)ritems rY __contains__Registry.__contains__=s9 dC ::??,, ,zz((***r[cUR5 [URVVs/sHupURUPM snn5$s snnfr)_sortiterrr)rkr)s rY__iter__Registry.__iter__Ds6 t~~>~tqTZZ]~>??>sA cgrrnrs rY __getitem__Registry.__getitem__H r[cgrrnrs rYrrLrr[cfUR5 [U[5(aC[5nURUH$up4UR UR UX45 M& U$[U[5(a&UR URUR$UR U$r) rr|slicerrregisterrrr)rrdatarr)s rYrrPs c5 ! !!)Ds+ djjmQ2,K c3  ::dnnS1667 7zz#r[c,[UR5$r)lenrrs rY__len__Registry.__len__[s4>>""r[c`SRURR[U55$)Nz<{}({})>)format __class__rdlistrs rY__repr__Registry.__repr__^s#  !8!8$t*EEr[cX;aZUR5 URRURVs/sHo"RU:XdMUPM snS5$[ SR U55es snf)z% Return the index of the given name. rzNo item named "{}" exists.)rrindexrrr)rrxs rYget_index_for_nameRegistry.get_index_for_nameasj < JJL>>'' NN=NqffnN=a@ 5<s A:A:cX ;aURU5 SUlXRU'URR [ X#55 g)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.registerls? < OOD ! 4 mD; Registry._sort..sr[T)rreverseN)rrsortrs rYrRegistry._sorts/  NN  $>  M"DOr[)rrrN)rzstr | _Trr~)rz Iterator[_T])rz str | intrr)rrrz Registry[_T])rzstr | int | slicerz_T | Registry[_T])rr)rr}rr)rrrr}rrrr)T)rr}rr~rrr)rdrrrrrrrr rrrrrrrrrnr[rYrrse%N +@     #F D=, #r[r))rir}rar)TF)rz str | Nonerr~rr~rz bool | None)rr}rr})rrrr)rr~)3r __future__rrerTrb functoolsrr itertoolsrtypingrrr r r r r markdownrxml.etree.ElementTreeetree ElementTreerrJrSTXETXINLINE_PLACEHOLDER_PREFIXINLINE_PLACEHOLDERcompileINLINE_PLACEHOLDER_REAMP_SUBSTITUTErHTML_PLACEHOLDER_RErRTL_BIDI_RANGESrZrorrrrr}rrrrrrrnr[rYr$sv( # &]]]!)) T] #i 97 N/.5;5 #5 #CD=U3/%+*jj!1K!?@; $s*&  4>>2@&> 3  )..hJ H#wr{H#r[