관리-도구
편집 파일: _py_util.cpython-38.pyc
U -?�f} � @ 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 ZdZddd�dd�ZdS )�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 �G/opt/hc_python/lib64/python3.8/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 ZdZdZddd�dd�Zdd 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 H 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 �