📁 File Manager Pro
v10.0.3 | PHP: 8.2.31
Server: LiteSpeed
2026-06-28 20:08:24
📂
/ (Root)
/
opt
/
hc_python
/
lib
/
python3.12
/
site-packages
/
sqlalchemy
/
sql
/
__pycache__
📍 /opt/hc_python/lib/python3.12/site-packages/sqlalchemy/sql/__pycache__
🔄 Refresh
✏️
Editing: _py_util.cpython-312.pyc
Read Only
� S��g} � �� � d dl mZ d dlZd dlmZ d dlmZ d dlmZ d dlmZ ddlmZ ej rd d l m Z G d � d ee e f � Z G d � deeedf eed e f f � Zy)� )� annotationsN)�Any)�Dict)�Tuple)�Union� )�Literal� )� CacheConstc � � e Zd ZdZdd�Zy)�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. c �| � |j dd� \ }}| j |d� }|dz | |< |� d|� �}|| |< |S )N� r �_)�split�get)�self�key�ident�derived�anonymous_counter�values �H/opt/hc_python/lib64/python3.12/site-packages/sqlalchemy/sql/_py_util.py� __missing__zprefix_anon_map.__missing__" sV � � �9�9�S�!�,���� �H�H�W�a� 0��)�A�-��W� ��)�1� .� /�0����S� �� � N)r �str�returnr )�__name__� __module__� __qualname__�__doc__r � r r r r s � � �r r c �$ � e Zd ZdZdZdd�Zdd�Zy)�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 c � � t |� }|| v r| | }|dusJ �|dfS t | j � x| |< }| xj dz c_ |dfS )NTr F)�idr �_index)r �object_�idself�s_val�id_s r �get_anonzcache_anon_map.get_anon; sd � ��G��� �T�>���L�E���$� $�$��$�;� � "%�T�[�[�!1� 1�D��L�3� �K�K�1� �K���:� r c �d � t | j � x| |< }| xj dz c_ |S )Nr )r r' )r r �vals r r zcache_anon_map.__missing__H s, � � �d�k�k�*�*��S� �C� � � �q�� �� r N)r( r r zTuple[str, bool])r �intr r )r r r r! r' r, r r" r r r$ r$ + s � � � �F� �r r$ z Literal[CacheConst.NO_CACHE]T)� __future__r �typingr r r r � util.typingr � TYPE_CHECKING� cache_keyr r r r/ r$ r" r r �<module>r5 sl �� #� � � � � � !� ���%��d�3��8�n� �* ���s�2�2� 3�U�7�4�=�#�;M�5N� N�O� r
💾 Save Changes
❌ Cancel