156 lines
16 KiB
Plaintext
156 lines
16 KiB
Plaintext
|
Ë
|
|||
|
|
KÀjw6 ã óH — U d Z ddlmZ ddlZddlZddlZddlmZmZ ddl m
|
|||
|
|
Z
|
|||
|
|
ddl m Z m
|
|||
|
|
Z
|
|||
|
|
mZmZmZmZmZ e rddlmZ ddlmc mZ ed« Z g d ¢Zd
|
|||
|
|
ed < d Z d
|
|||
|
|
Z edz Z e dz e z Z ej> e dz « Z edz e z Z! edz e z Z" ej> e"dz « Z# edz e z Z$ dZ% ed¬« d„ « Z&d(d)d„Z'd*d+d„Z(d,d„Z)d(d-d„Z*d.d„Z+ G d „ d e,« Z- G d „ d « Z.e r G d „ d!e« Z/ G d"„ d#« Z0 G d$„ d%e« Z1 G d&„ d'e
|
|||
|
|
e « Z2y)/zv
|
|||
|
|
This module contains various contacts, classes and functions which get referenced and used
|
|||
|
|
throughout the code base.
|
|||
|
|
é )Ú annotationsN)ÚwrapsÚ lru_cache)Úcount)Ú
|
|||
|
|
TYPE_CHECKINGÚGenericÚIteratorÚ
|
|||
|
|
NamedTupleÚTypeVarÚ TypedDictÚoverload)ÚMarkdownÚ_T);ÚaddressÚarticleÚasideÚ
|
|||
|
|
blockquoteÚdetailsÚdivÚdlÚfieldsetÚ
|
|||
|
|
figcaptionÚfigureÚfooterÚformÚh1Úh2Úh3Úh4Úh5Úh6ÚheaderÚhgroupÚhrÚmainÚmenuÚnavÚolÚpÚpreÚsectionÚtableÚulÚcanvasÚcolgroupÚddÚbodyÚdtÚgroupÚhtmlÚiframeÚliÚlegendÚmathÚmapÚnoscriptÚoutputÚobjectÚoptionÚprogressÚscriptÚstyleÚsummaryÚtbodyÚtdÚtextareaÚtfootÚthÚtheadÚtrÚvideoÚcenterz list[str]ÚBLOCK_LEVEL_ELEMENTSúúzklzzwxh:z%sz([0-9]+)Úampz
|
|||
|
|
wzxhzdk:%sz
|
|||
|
|
hzzhzkh:%s))u Ö�u ß¿)u â´°u ⵿)Úmaxsizec ób — t j dk\ rddlm} nddl} | j d¬« S )z= Return all entry_points in the `markdown.extensions` group. )é é
|
|||
|
|
r ©ÚmetadataNzmarkdown.extensions)r3 )ÚsysÚ version_infoÚ importlibrT Úimportlib_metadataÚ entry_pointsrS s úP/home/antigravity/intellecton/venv/lib/python3.12/site-packages/markdown/util.pyÚget_installed_extensionsr[ g s- € ô ×ј7Ò"Þ&ã-à × Ñ Ð'<Ð Ó =Ð=ó c ó ‡ ‡— ˆ ˆfd„}|S )zå
|
|||
|
|
Raise a [`DeprecationWarning`][] when wrapped function/method is called.
|
|||
|
|
|
|||
|
|
Usage:
|
|||
|
|
|
|||
|
|
```python
|
|||
|
|
@deprecated("This method will be removed in version X; use Y instead.")
|
|||
|
|
def some_method():
|
|||
|
|
pass
|
|||
|
|
```
|
|||
|
|
c ó4 •‡ — t ‰ « ˆ ˆˆfd„« }|S )Nc ól •— t j d‰j › d‰› �t ‰¬« ‰| i |¤ŽS )Nú'z' is deprecated. )ÚcategoryÚ
|
|||
|
|
stacklevel)ÚwarningsÚwarnÚ__name__ÚDeprecationWarning)ÚargsÚkwargsÚfuncÚmessagerb s €€€rZ Údeprecated_funcz4deprecated.<locals>.wrapper.<locals>.deprecated_func s< ø€ ä �M‰MØ�D—M‘M�?Ð"3°G°9Ð=Ü+Ø%õ
|
|||
|
|
ñ
|
|||
|
|
˜Ð( Ñ(Ð (r\ )r )ri rk rj rb s ` €€rZ Úwrapperzdeprecated.<locals>.wrapper~ s! ù€ Ü ˆt‹õ )ó
|
|||
|
|
ð )ð Ð r\ © )rj rb rl s `` rZ Ú
|
|||
|
|
deprecatedrn r s ù€ õ ð €Nr\ c óÞ — t | t « s|r| €| S t | « S |r| j « dk( ry| j « dv ry| j « dv ry|rt d| z « ‚y)a Parses 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`.NÚnone)ÚtrueÚyesÚyÚonÚ1T)ÚfalseÚnoÚnÚoffÚ0rp FzCannot parse bool value: %r)Ú
|
|||
|
|
isinstanceÚstrÚboolÚlowerÚ
|
|||
|
|
ValueError)ÚvalueÚfail_on_errorsÚ
|
|||
|
|
preserve_nones rZ ÚparseBoolValuerƒ ‹ st € ô
|
|||
|
|
�eœSÔ !Ù ˜U˜]؈LÜ�E‹{ÐÙ ˜5Ÿ;™;›=¨FÒ2ØØ �‰‹ Ð9Ñ 9ØØ �‰‹ ÐBÑ BØÙ ÜÐ6¸Ñ>Ó?Ð?ð
|
|||
|
|
r\ c óŠ — d| v r| j dd« } d| v r| j dd« } d| v r| j dd« } | S )z HTML escape a string of code.ú&z&ú<z<ú>z>)Úreplace)Útexts rZ Ú code_escaperŠ ž sL € à
|
|||
|
|
ˆd�{Ø�|‰|˜C Ó)ˆØ
|
|||
|
|
ˆd�{Ø�|‰|˜C Ó(ˆØ
|
|||
|
|
ˆd�{Ø�|‰|˜C Ó(ˆØ €Kr\ c ór — t j | « }t | « D ] } |j }|rŒ| c S y)z+Get current stack depth, performantly.
|
|||
|
|
N)rU Ú _getframer Úf_back)ÚsizeÚframes rZ Ú_get_stack_depthr� © s6 € ô
|
|||
|
|
�M‰M˜$Ó €Eä�d“ ò ˆØ— ‘ ˆÚØŠKñr\ c óF — t j « t « z
|
|||
|
|
dk S )zBReturn true if current stack depth is within 100 of maximum limit.éd )rU Úgetrecursionlimitr� rm r\ rZ Únearing_recursion_limitr” ´ s € ä × Ñ Ó "Ô%5Ó%7Ñ 7¸#Ñ =Ð=r\ c ó — e Zd ZdZy)Ú AtomicStringz/A string which should not be further processed.N)re Ú
|
|||
|
|
__module__Ú __qualname__Ú__doc__rm r\ rZ r– r– ½ s „ Ù9Ør\ r– c ó — e Zd ZdZddd„Zy)Ú ProcessorzÖ The 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.
|
|||
|
|
|
|||
|
|
Nc ó — || _ y ©N)Úmd)Úselfrž s rZ Ú__init__zProcessor.__init__Ì s € ؈�r\ r� )rž zMarkdown | None)re r— r˜ r™ r rm r\ rZ r› r›  s „ ñõr\ r› c ó6 — e Zd ZU ded< ded< ded< ded< y) ÚTagDatar| Útagúdict[str, str]ÚattrsÚintÚ
|
|||
|
|
left_indexÚ right_indexN©re r— r˜ Ú__annotations__rm r\ rZ r¢ r¢ Ñ s … Ø
|
|||
|
|
‹Ø Ó Ø‹ØÔr\ r¢ c ó6 — e Zd ZdZd„ Zdd„Zd d„Zd
|
|||
|
|
d„Zd d„Zy) Ú HtmlStashz{
|
|||
|
|
This class is used for stashing HTML objects that we extract
|
|||
|
|
in the beginning and replace with place-holders.
|
|||
|
|
c ó< — d| _ g | _ d| _ g | _ y)z Create an `HtmlStash`. r N)Ú html_counterÚ
|
|||
|
|
rawHtmlBlocksÚ tag_counterÚtag_data©rŸ s rZ r zHtmlStash.__init__Þ s! € à ˆÔØ8:ˆÔØ ˆÔØ')ˆ�
|
|||
|
|
r\ c óœ — | j j |« | j | j « }| xj dz
|
|||
|
|
c_ |S )a
|
|||
|
|
|
|||
|
|
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.
|
|||
|
|
|
|||
|
|
é )r¯ ÚappendÚget_placeholderr® )rŸ r4 Ú placeholders rZ ÚstorezHtmlStash.storeå sE € ð
|
|||
|
|
×Ñ×!Ñ! $Ô'Ø×*Ñ*¨4×+<Ñ+<Ó=ˆ Ø ×Ò˜QÑ ÕØÐr\ c ó — d| _ g | _ y)z Clear the stash. r N)r® r¯ r² s rZ ÚresetzHtmlStash.reset÷ s € à ˆÔØ ˆÕr\ c ó — t |z S r� )ÚHTML_PLACEHOLDER©rŸ Úkeys rZ r¶ zHtmlStash.get_placeholderü s
|
|||
|
|
€ Ü #Ñ%Ð%r\ c ó¨ — | j j ||||dœ« t t | j « z }| xj dz
|
|||
|
|
c_ |S )z(Store tag data and return a placeholder.)r£ r¥ r§ r¨ r´ )r± rµ ÚTAG_PLACEHOLDERr| r° )rŸ r£ r¥ r§ r¨ r· s rZ Ú store_tagzHtmlStash.store_tagÿ sQ € à �
|
|||
|
|
‰
|
|||
|
|
× Ñ S°5Ø,6Ø-8ñ :ô ;ô &¬¨D×,<Ñ,<Ó(=Ñ=ˆ Ø ×Ò˜AÑ ÕØÐr\ N)r4 zstr | etree.ElementÚreturnr| ©r ÚNone)r¾ r¦ r r| )
|
|||
|
|
r£ r| r¥ r¤ r§ r¦ r¨ r¦ r r| ) re r— r˜ r™ r r¸ rº r¶ rÁ rm r\ rZ r¬ r¬ Ø s „ ñò
|
|||
|
|
*óó$ ó
|
|||
|
|
&ôr\ r¬ c ó" — e Zd ZU ded< ded< y)Ú
|
|||
|
|
_PriorityItemr| ÚnameÚfloatÚpriorityNr© rm r\ rZ rÆ rÆ s … Ø
|
|||
|
|
|
|||
|
|
ƒIØ„Or\ rÆ c ó‚ — e Zd ZdZd„ Zdd„Zdd„Zedd„« Zedd„« Zdd„Zdd„Z d „ Z
|
|||
|
|
dd
|
|||
|
|
„Z dd „Z ddd „Z
|
|||
|
|
dd
|
|||
|
|
„Zy)ÚRegistryaô
|
|||
|
|
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 ó. — i | _ g | _ d| _ y )NF)Ú_dataÚ _priorityÚ
|
|||
|
|
_is_sortedr² s rZ r zRegistry.__init__9 s € Ø$&ˆŒ
|
|||
|
|
Ø.0ˆŒØ ˆ�r\ c ó’ — t |t « r || j j « v S || j j « v S r� )r{ r| rÍ ÚkeysÚvalues)rŸ Úitems rZ Ú __contains__zRegistry.__contains__> s: € Ü �dœCÔ à˜4Ÿ:™:Ÿ?™?Ó,Ð,Ð ,à�t—z‘z×(Ñ(Ó*Ð*Ð*r\ c ó˜ — | j « t | j D ��cg c] \ }}| j | ‘Œ c}}« S c c}}w r� )Ú_sortÚiterrÎ rÍ )rŸ Úkr) s rZ Ú__iter__zRegistry.__iter__E s4 € Ø �
|
|||
|
|
‰
|
|||
|
|
Œ ܨt¯~©~×>¡t q¨!�T—Z‘Z “]Ó>Ó?Ð?ùÓ>s ¥A
|
|||
|
|
c ó — y r� rm r½ s rZ Ú __getitem__zRegistry.__getitem__I ó € à r\ c ó — y r� rm r½ s rZ rÛ zRegistry.__getitem__M rÜ r\ c óR — | j « t |t « rCt « }| j | D ]% \ }}|j | j | ||« Œ' |S t |t « r&| j | j | j S | j | S r� ) rÖ r{ ÚslicerË rÎ ÚregisterrÍ r¦ rÇ )rŸ r¾ ÚdatarØ r) s rZ rÛ zRegistry.__getitem__Q s‹ € Ø �
|
|||
|
|
‰
|
|||
|
|
Œ Ü �cœ5Ô !Ü!)£ˆDØ Ÿ™ sÑ+ò
|
|||
|
|
3‘��1Ø—
|
|||
|
|
‘
|
|||
|
|
˜dŸj™j¨™m¨Q°Õ2ð
|
|||
|
|
3àˆKÜ �cœ3Ô Ø—:‘:˜dŸn™n¨SÑ 1× 6Ñ 6Ñ7Ð 7Ø�z‰z˜#‰Ð r\ c ó, — t | j « S r� )ÚlenrÎ r² s rZ Ú__len__zRegistry.__len__\ s € Ü�4—>‘>Ó"Ð"r\ c ó` — dj | j j t | « « S )Nz<{}({})>)ÚformatÚ __class__re Úlistr² s rZ Ú__repr__zRegistry.__repr___ s# € Ø× Ñ § ¡ ×!8Ñ!8¼$¸t»*ÓEÐEr\ c óô — || v rV| j « | j j | j D �cg c] }|j |k( sŒ|‘Œ c}d « S t dj |« « ‚c c}w )z5
|
|||
|
|
Return the index of the given name.
|
|||
|
|
r zNo item named "{}" exists.)rÖ rÎ ÚindexrÇ r ræ )rŸ rÇ Úxs rZ Úget_index_for_namezRegistry.get_index_for_nameb sj € ð �4‰<Ø �J‰JŒLØ—>‘>×'Ñ'Ø ŸN™NÖ=�q¨a¯f©f¸«n’Ò=¸aÑ@óð
|
|||
|
|
ô Ð5×<Ñ<¸TÓBÓCÐCùò >s ¸A5Á
|
|||
|
|
A5c ó¤ — || v r| j |« d| _ || j |< | j j t ||« « y)aW
|
|||
|
|
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
|