U
|
¸ý°dÊ ã @ sª d dl mZ d dlZd dlmZ d dlmZ d dlmZ d dlmZ ddlmZ ej rbd d
|
l
|
m Z G d d d ee e f Z G d d deeedf eed e f f ZdS )é )Ú annotationsN)ÚAny)ÚDict)ÚTuple)ÚUnioné )ÚLiteralé )Ú
|
CacheConstc @ s e Zd ZdZdddddZdS )Úprefix_anon_mapaf A map that creates new keys for missing key access.
|
|
Considers keys of the form "<ident> <name>" to produce
|
new symbols "<name>_<index>", where "index" is an incrementing integer
|
corresponding to <name>.
|
|
Inlines the approach taken by :class:`sqlalchemy.util.PopulateDict` which
|
is otherwise usually used for this type of operation.
|
|
Ústr©ÚkeyÚreturnc C sB | dd¡\}}| |d¡}|d | |< | d| }|| |< |S )Nú r Ú_)ÚsplitÚget)Úselfr ÚidentZderivedZanonymous_counterÚvalue© r úNd:\z\workplace\vscode\pyvenv\venv\Lib\site-packages\sqlalchemy/sql/_py_util.pyÚ __missing__" s zprefix_anon_map.__missing__N)Ú__name__Ú
|
__module__Ú __qualname__Ú__doc__r r r r r r s r c @ s4 e Zd ZdZdZdddddZdd d
|
d d Zd S )Úcache_anon_mapaU A map that creates new keys for missing key access.
|
|
Produces an incrementing sequence given a series of unique keys.
|
|
This is similar to the compiler prefix_anon_map class although simpler.
|
|
Inlines the approach taken by :class:`sqlalchemy.util.PopulateDict` which
|
is otherwise usually used for this type of operation.
|
|
r r zTuple[str, bool])Úobject_r c C sX t |}|| kr,| | }|dk s$t|dfS t| j | |< }| jd7 _|dfS d S )NTr F)ÚidÚAssertionErrorr Ú_index)r r ZidselfZs_valZid_r r r Úget_anon; s zcache_anon_map.get_anonÚintr r c C s$ t | j | |< }| jd7 _|S )Nr )r r" )r r Úvalr r r r I s zcache_anon_map.__missing__N)r r r r r" r# r r r r r r + s r z Literal[CacheConst.NO_CACHE]T)Ú
|
__future__r Útypingr r r r Z util.typingr Ú TYPE_CHECKINGÚ cache_keyr
|
r r r$ r r r r r Ú<module> s
|
ÿ
|
