File: //usr/local/lib/python3.10/dist-packages/sqlalchemy/util/__pycache__/_collections.cpython-310.pyc
o
���gnN � @ s U d Z ddlmZ ddlZddlZddlZddlZddlmZ ddlmZ ddlm Z ddlm
Z
ddlm Z dd lm Z dd
lm
Z
dd lmZ dd lmZ dd
lmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlZddl m Z ddlm Z ddlm Z dd lm Z ej!s�e s�dd l"m#Z# dd l"m$Z$ dd l"m%Z% dd l"m&Z& dd!l"m'Z' dd"l"m(Z( n$dd l)m%Z% dd l)m&Z& dd l)m#Z# dd l*m$Z$ dd!l*m'Z' dd"l*m(Z( ed#ed$�Z+ed%ed$�Z,ed&ed$�Z-ed'd(d)�Z.e/� Z0d*e1d+< e/dg�Z2d*e1d,< dwd1d2�Z3dxd6d7�Z4e#� Z5d8e1d9< G d:d;� d;e&e,e-f �Z6ed<ed$�Z7ed=ed$�Z8G d>d?� d?e
e+ �Z9G d@dA� dAe9e+ �Z:G dBdC� dCe%e9e+ �Z;dydDdE�Z<e=Z>e<Z?G dFdG� dGee+ �Z@G dHdI� dIe$�ZAG dJdK� dKe e,e-f �ZBG dLdM� dMe e,e-f �ZCeDZEe=ZFe'ZGG dNdO� dOe
e+ �ZHdzdRdS�ZIdyd{dWdX�ZJd|d^d_�ZKd`da� ZLd}dcdd�ZMdydedf�ZNd~didj�ZOG dkdl� dlejPe,e-f �ZQG dmdn� dne e. �ZRG dodp� dpe �ZSG dqdr� dre
e+ �ZTG dsdt� dteTe+ �ZUdudv� ZVdS )z Collection classes and helpers.� )� annotationsN)�Any)�Callable)�cast)� Container)�Dict)� FrozenSet)�Generic)�Iterable)�Iterator)�List)�Mapping)�NoReturn)�Optional)�overload)�Sequence)�Set)�Tuple)�TypeVar)�Union)�
ValuesView� )�HAS_CYEXTENSION)�is_non_string_iterable)�Literal)�Protocol)�
immutabledict)� IdentitySet)�ReadOnlyContainer)�ImmutableDictBase)�
OrderedSet)� unique_list�_T)�bound�_KT�_VT�_T_coT)� covariantzFrozenSet[Any]� EMPTY_SET�NONE_SET�a� List[Any]�b�returnc C sl t | ��|�}g }t| �t|�}} |D ]}||v r'|�|� ||}} n|�|� q|�|� |S q)af merge two lists, maintaining ordering as much as possible.
this is to reconcile vars(cls) with cls.__annotations__.
Example::
>>> a = ["__tablename__", "id", "x", "created_at"]
>>> b = ["id", "name", "data", "y", "created_at"]
>>> merge_lists_w_ordering(a, b)
['__tablename__', 'id', 'name', 'data', 'y', 'x', 'created_at']
This is not necessarily the ordering that things had on the class,
in this case the class is::
class User(Base):
__tablename__ = "users"
id: Mapped[int] = mapped_column(primary_key=True)
name: Mapped[str]
data: Mapped[Optional[str]]
x = Column(Integer)
y: Mapped[int]
created_at: Mapped[datetime.datetime] = mapped_column()
But things are *mostly* ordered.
The algorithm could also be done by creating a partial ordering for
all items in both lists and then using topological_sort(), but that
is too much overhead.
Background on how I came up with this is at:
https://gist.github.com/zzzeek/89de958cf0803d148e74861bd682ebae
)�set� intersection�iter�discard�append�extend)r* r, �overlap�result�current�other�element� r9 �G/usr/local/lib/python3.10/dist-packages/sqlalchemy/util/_collections.py�merge_lists_w_orderingL s #
�r; �d�Mapping[_KT, _VT]�immutabledict[_KT, _VT]c C s | st S t| t�r | S t| �S �N)�
EMPTY_DICT�
isinstancer �r< r9 r9 r: �coerce_to_immutabledict� s
rC zimmutabledict[Any, Any]r@ c @ sB e Zd ZdZddd�Zdd d
�Zdd d �Zddd�Zd dd�ZdS ) �
FacadeDictz*A dictionary that is not publicly mutable.�argsr r- �FacadeDict[Any, Any]c G s t �| �}|S r? )r �__new__)�clsrE �newr9 r9 r: rG � s
zFacadeDict.__new__r c C s t d��)Nz\an immutabledict shouldn't need to be copied. use dict(d) if you need a mutable dictionary.)�NotImplementedError��selfr9 r9 r: �copy� s �zFacadeDict.copyc C s t t| �ffS r? )rD �dictrK r9 r9 r: �
__reduce__� � zFacadeDict.__reduce__�keyr$ �valuer% �Nonec C s t �| ||� dS )z,insert an item into the dictionary directly.N)rN � __setitem__�rL rQ rR r9 r9 r: � _insert_item� � zFacadeDict._insert_item�strc C s dt �| � S )NzFacadeDict(%s))rN �__repr__rK r9 r9 r: rY � rP zFacadeDict.__repr__N)rE r r- rF )r- r �r- r �rQ r$ rR r% r- rS )r- rX ) �__name__�
__module__� __qualname__�__doc__rG rM rO rV rY r9 r9 r9 r: rD � s
rD �_DT�_Fc s e Zd ZU dZdZded< dKdd�ZdLd
d �ZdMd
d�ZdN� fdd� Z dOdd�Z
dPd d �Z dQd d �Z dRd d!�Z
dPd"d#�ZdSd%d&�ZdTd(d)�ZdQd*d+�ZdUd-d.�ZdVd0d1�ZdWd3d4�ZedXd6d7��ZedYd:d7��Z ;dZd[d>d7�ZdNd?d@�Zd\dBdC�Zd]dEdF�ZdUdGdH�Zd^dIdJ�Z� Z S )_�
Propertiesz8Provide a __getattr__/__setattr__ interface over a dict.��_data�
Dict[str, _T]rd �datac C s t �| d|� d S �Nrd ��object� __setattr__)rL rf r9 r9 r: �__init__� � zProperties.__init__r- �intc C �
t | j�S r? ��lenrd rK r9 r9 r: �__len__� �
zProperties.__len__� Iterator[_T]c C s t t| j�� ��S r? )r0 �listrd �valuesrK r9 r9 r: �__iter__� rl zProperties.__iter__� List[str]c s t t� �dd� | j�� D � S )Nc S s g | ]}t |��qS r9 )rX ��.0�kr9 r9 r: �
<listcomp>� s z&Properties.__dir__.<locals>.<listcomp>)�dir�superrd �keysrK �� __class__r9 r: �__dir__� s zProperties.__dir__r7 �Properties[_F]�List[Union[_T, _F]]c C s t | �t |� S r? )rt )rL r7 r9 r9 r: �__add__� � zProperties.__add__rQ rX �objr" rS c C � || j |< d S r? rc �rL rQ r� r9 r9 r: rT � rP zProperties.__setitem__c C s
| j | S r? rc �rL rQ r9 r9 r: � __getitem__� rr zProperties.__getitem__c C � | j |= d S r? rc r� r9 r9 r: � __delitem__� � zProperties.__delitem__c C r� r? rc r� r9 r9 r: rj � rP zProperties.__setattr__�Dict[str, Any]c C s
d| j iS rg rc rK r9 r9 r: � __getstate__� rr zProperties.__getstate__�statec C s t �| d|d � d S rg rh )rL r� r9 r9 r: � __setstate__� s zProperties.__setstate__c C s$ z| j | W S ty t|��w r? )rd �KeyError�AttributeErrorr� r9 r9 r: � __getattr__� s
�zProperties.__getattr__�boolc C �
|| j v S r? rc r� r9 r9 r: � __contains__� rr zProperties.__contains__�ReadOnlyProperties[_T]c C rn )z8Return an immutable proxy for this :class:`.Properties`.)�ReadOnlyPropertiesrd rK r9 r9 r: � as_readonly� s
zProperties.as_readonlyrR c C s | j �|� d S r? )rd �update)rL rR r9 r9 r: r� � r� zProperties.update� Optional[_T]c C � d S r? r9 r� r9 r9 r: �get� � zProperties.get�default�Union[_DT, _T]c C r� r? r9 �rL rQ r� r9 r9 r: r� � r� N�Optional[Union[_DT, _T]]�Optional[Union[_T, _DT]]c C s || v r| | S |S r? r9 r� r9 r9 r: r� � s c C rn r? )rt rd rK r9 r9 r: r~ � rr zProperties.keys�List[_T]c C � t | j�� �S r? )rt rd ru rK r9 r9 r: ru � rP zProperties.values�List[Tuple[str, _T]]c C r� r? )rt rd �itemsrK r9 r9 r: r� � rP zProperties.itemsc C r� r? rc r� r9 r9 r: �has_key� rr zProperties.has_keyc C s | j �� d S r? )rd �clearrK r9 r9 r: r� rP zProperties.clear)rf re �r- rm �r- rs )r- rw )r7 r� r- r� )rQ rX r� r" r- rS )rQ rX r- r" )rQ rX r- rS )r- r� )r� r� r- rS )rQ rX r- r� )r- r� )rR re r- rS )rQ rX r- r� )rQ rX r� r� r- r� r? )rQ rX r� r� r- r� )r- r� )r- r� �r- rS ) r\ r] r^ r_ � __slots__�__annotations__rk rq rv r� r� rT r� r� rj r� r� r� r� r� r� r r� r~ ru r� r� r� �
__classcell__r9 r9 r r: rb � s<
�
rb c @ s e Zd ZdZdZdd� ZdS )�OrderedPropertieszUProvide a __getattr__/__setattr__ interface with an OrderedDict
as backing store.r9 c C s t �| t� � d S r? )rb rk � OrderedDictrK r9 r9 r: rk
rl zOrderedProperties.__init__N)r\ r] r^ r_ r� rk r9 r9 r9 r: r� s r� c @ s e Zd ZdZdZdS )r� zDProvide immutable dict/object attribute to an underlying dictionary.r9 N)r\ r] r^ r_ r� r9 r9 r9 r: r� s r� c s0 � fdd�t � |d�D �}� �� � �|� dS )z Sort an OrderedDict in-place.c s g | ]}|� | f�qS r9 r9 rx rB r9 r: r{ s z,_ordered_dictionary_sort.<locals>.<listcomp>)rQ N)�sortedr� r� )r< rQ r� r9 rB r: �_ordered_dictionary_sort s r� c @ s8 e Zd Zdddd�Zdd� Zdd � Zd
d � Zd d
� ZdS )� WeakSequencer9 �_WeakSequence__elements� Sequence[_T]c s0 t �| �fdd�� � | _� fdd�|D �| _d S )Nc S s" |� }|d ur|j �| � d S d S r? )�_storage�remove)�item�selfrefrL r9 r9 r: �_remove& s �z&WeakSequence.__init__.<locals>._removec s g | ]}t �|� ��qS r9 )�weakref�ref)ry r8 �r� r9 r: r{ , s �z)WeakSequence.__init__.<locals>.<listcomp>)r� r� r� r� )rL r� r9 r� r: rk # s
�zWeakSequence.__init__c C s | j �t�|| j�� d S r? )r� r2 r� r� r� )rL r� r9 r9 r: r2 0 � zWeakSequence.appendc C rn r? )rp r� rK r9 r9 r: rq 3 rr zWeakSequence.__len__c C s dd� dd� | j D �D �S )Nc s s � | ] }|d ur|V qd S r? r9 )ry r� r9 r9 r: � <genexpr>7 s � �z(WeakSequence.__iter__.<locals>.<genexpr>c s s � | ]}|� V qd S r? r9 )ry r� r9 r9 r: r� 8 s � )r� rK r9 r9 r: rv 6 s �zWeakSequence.__iter__c C s. z | j | }W |� S ty td| ��w )NzIndex %s out of range)r� r� �
IndexError)rL �indexr� r9 r9 r: r� ; s � �zWeakSequence.__getitem__N)r9 )r� r� )r\ r] r^ rk r2 rq rv r� r9 r9 r9 r: r� " s
r� c @ s e Zd Zdddd�ZdS )�OrderedIdentitySetN�iterable�Optional[Iterable[Any]]c C s2 t �| � t� | _|r|D ] }| �|� q
d S d S r? )r rk r� �_members�add)rL r� �or9 r9 r: rk E s
�zOrderedIdentitySet.__init__r? )r� r� )r\ r] r^ rk r9 r9 r9 r: r� D s r� c @ �$ e Zd ZdZd dd�Zd
d d
�Zd S )� PopulateDictz�A dict which populates missing values via a creation function.
Note the creation function takes a key, unlike
collections.defaultdict.
�creator�Callable[[_KT], _VT]c C s
|| _ d S r? �r� )rL r� r9 r9 r: rk U rr zPopulateDict.__init__rQ r r- c C s | � |� | |< }|S r? r� �rL rQ �valr9 r9 r: � __missing__X s zPopulateDict.__missing__N)r� r� �rQ r r- r �r\ r] r^ r_ rk r� r9 r9 r9 r: r� M s
r� c @ r� )�WeakPopulateDictzaLike PopulateDict, but assumes a self + a method and does not create
a reference cycle.
�creator_method�types.MethodTypec C s |j | _|j}t�|�| _d S r? )�__func__r� �__self__r� r� �weakself)rL r� r� r9 r9 r: rk c s zWeakPopulateDict.__init__rQ r r- c C s | � | �� |� | |< }|S r? )r� r� r� r9 r9 r: r� h s z WeakPopulateDict.__missing__N)r� r� r� r� r9 r9 r9 r: r� ] s
r� c @ sP e Zd ZU dZdZded< ded< ded< ddd d
�Zddd�Zddd�Zd S )�UniqueAppenderz�Appends items to a collection ensuring uniqueness.
Additional appends() of the same object are ignored. Membership is
determined by identity (``is a``) not equality (``==``).
)rf �_data_appender�_unique�&Union[Iterable[_T], Set[_T], List[_T]]rf zCallable[[_T], None]r� zDict[int, Literal[True]]r� N�via�
Optional[str]c C s\ || _ i | _|rt||�| _d S t|d�r td|�j| _d S t|d�r,td|�j| _d S d S )Nr2 r� r� zSet[_T])rf r� �getattrr� �hasattrr r2 r� )rL rf r� r9 r9 r: rk � s
�zUniqueAppender.__init__r� r" r- rS c C s. t |�}|| jvr| �|� d| j|< d S d S )NT)�idr� r� )rL r� �id_r9 r9 r: r2 � s
�zUniqueAppender.appendrs c C rn r? )r0 rf rK r9 r9 r: rv � rr zUniqueAppender.__iter__r? )rf r� r� r� )r� r" r- rS r� ) r\ r] r^ r_ r� r� rk r2 rv r9 r9 r9 r: r� v s
�
r� �argr c C s2 t | �dkrt| d tj�rt| d �S td| �S )Nr r r+ )rp rA �types�
GeneratorTypert r )r� r9 r9 r: �coerce_generator_arg� s
r� �xr� �Optional[List[Any]]c C s0 | d u r|S t | �s
| gS t| t�r| S t| �S r? )r rA rt )r� r� r9 r9 r: �to_list� s
r� �set_�Container[Any]r� �
Iterable[Any]r� c s t � fdd�|D ��S )z�return True if any items of set\_ are present in iterable.
Goes through special effort to ensure __hash__ is not called
on items in iterable that don't support it.
c 3 s � | ]
}|j r|� v V qd S r? )�__hash__)ry �i�r� r9 r: r� � s � z#has_intersection.<locals>.<genexpr>)�any)r� r� r9 r� r: �has_intersection� s r� c C �( | d u rt � S t| t �st t| ��S | S r? )r. rA r� �r� r9 r9 r: �to_set� �
r� �Set[Any]c C r� r? )�
column_setrA r� r� r9 r9 r: �
to_column_set� r� r� c K s* | � � } |r | �|� | jdi |�� | S )z5Copy the given dict and update with the given values.Nr9 )rM r� )r< �_new�kwr9 r9 r: � update_copy� s
r� � Iterable[_T]rs c c s: � | D ]}t |t�st|d�rt|�E dH q|V qdS )z�Given an iterator of which further sub-elements may also be
iterators, flatten the sub-elements into a single iterator.
rv N)rA rX r� �flatten_iterator)r� �elemr9 r9 r: r� � s ��r� c @ s� e Zd ZU dZdZded< ded< ded<
d2d3d
d�Zdd� Zed4dd��Z ed5dd��Z d6d7dd�Z d8d d �Z
d9d d!�Z d:d"d#�Z d;d%d&�Z
d<d)d*�Zd=d,d-�Zed>d.d/��Zd?d0d1�Zd S )@�LRUCachez�Dictionary with 'squishy' removal of least
recently used items.
Note that either get() or [] should be used here, but
generally its not safe to do an "in" check first as the dictionary
can change subsequent to that call.
)�capacity� threshold�
size_alertrd �_counter�_mutexrm r �floatr z.Optional[Callable[[LRUCache[_KT, _VT]], None]]r �d � �?N� Optional[Callable[..., None]]c C s, || _ || _|| _d| _t�� | _i | _d S )Nr )r r r r � threading�Lockr rd )rL r r r r9 r9 r: rk � s
zLRUCache.__init__c C s | j d7 _ | j S )Nr )r rK r9 r9 r: � _inc_counter s zLRUCache._inc_counterrQ r$ r- �
Optional[_VT]c C r� r? r9 r� r9 r9 r: r� r� z LRUCache.getr� �Union[_VT, _T]c C r� r? r9 r� r9 r9 r: r� r� �Optional[Union[_VT, _T]]c C s0 | j �|�}|d ur| �� |d d< |d S |S �N� r r )rd r� r )rL rQ r� r� r9 r9 r: r� s
r% c C s" | j | }| �� |d d< |d S r )rd r )rL rQ r� r9 r9 r: r� s
zLRUCache.__getitem__�
Iterator[_KT]c C rn r? )r0 rd rK r9 r9 r: rv rr zLRUCache.__iter__c C rn r? ro rK r9 r9 r: rq rr zLRUCache.__len__�ValuesView[_VT]c C s t �dd� | j�� D ��S )Nc S s i | ] \}}||d �qS )r r9 )ry rz r� r9 r9 r: �
<dictcomp>$ s z#LRUCache.values.<locals>.<dictcomp>)�typingr rd r� rK r9 r9 r: ru # r� zLRUCache.valuesrR rS c C s" ||| � � gf| j|< | �� d S r? )r rd � _manage_sizerU r9 r9 r: rT & s zLRUCache.__setitem__� _LRUCache__vc C r� r? rc )rL r r9 r9 r: r� * r� zLRUCache.__delitem__c C s | j | j | j S r? )r r rK r9 r9 r: �size_threshold- rW zLRUCache.size_thresholdc C s� | j �d�sd S z`t| j�}t| �| j| j| j kra|r$d}| �| � t| j� � t
� d�dd�}|| jd � D ]}z| j|d = W q8 t yK Y q8w t| �| j| j| j ksW | j �
� d S W | j �
� d S | j �
� w )NFr T)rQ �reverser )r �acquirer� r rp r r r� rd ru �operator�
itemgetterr� �release)rL r �
by_counterr� r9 r9 r: r 1 s.
� � ��zLRUCache._manage_size)r r N)r rm r r r r )rQ r$ r- r
)rQ r$ r� r r- r r? )rQ r$ r� r r- r )rQ r$ r- r% )r- r r� )r- r r[ )r r$ r- rS )r- r r� )r\ r] r^ r_ r� r� rk r r r� r� rv rq ru rT r� �propertyr r r9 r9 r9 r: r � s4
�
�
r c @ � e Zd Zddd�ZdS )�_CreateFuncTyper- r& c C r� r? r9 rK r9 r9 r: �__call__J � z_CreateFuncType.__call__N)r- r& �r\ r] r^ r" r9 r9 r9 r: r! I � r! c @ r )�_ScopeFuncTyper- r c C r� r? r9 rK r9 r9 r: r" N r# z_ScopeFuncType.__call__NrZ r$ r9 r9 r9 r: r& M r% r& c @ s` e Zd ZU dZdZded< ded< ded< dd d �Zd dd�Zd dd�Zd dd�Z d dd�Z
dS ) �ScopedRegistrya� A Registry that can store one or multiple instances of a single
class on the basis of a "scope" function.
The object implements ``__call__`` as the "getter", so by
calling ``myregistry()`` the contained object is returned
for the current scope.
:param createfunc:
a callable that returns a new object to be placed in the registry
:param scopefunc:
a callable that will return a key to store/retrieve an object.
��
createfunc� scopefunc�registryz_CreateFuncType[_T]r) r& r* r r+ �Callable[[], _T]�Callable[[], Any]c C s || _ || _i | _dS )aV Construct a new :class:`.ScopedRegistry`.
:param createfunc: A creation function that will generate
a new value for the current scope, if none is present.
:param scopefunc: A function that returns a hashable
token representing the current scope (such as, current
thread identifier).
Nr( )rL r) r* r9 r9 r: rk f s
zScopedRegistry.__init__r- r" c C s: | � � }z| j| W S ty | j�|| �� � Y S w r? )r* r+ r� �
setdefaultr) r� r9 r9 r: r" w s �zScopedRegistry.__call__r� c C s | � � | jv S )z9Return True if an object is present in the current scope.)r* r+ rK r9 r9 r: �has~ s zScopedRegistry.hasr� rS c C s || j | �� < dS )z$Set the value for the current scope.N)r+ r* �rL r� r9 r9 r: r. � s zScopedRegistry.setc C s( z | j | �� = W dS ty Y dS w )z Clear the current scope, if any.N)r+ r* r� rK r9 r9 r: r� � s
�zScopedRegistry.clearN)r) r, r* r- �r- r" �r- r� �r� r" r- rS r� ) r\ r] r^ r_ r� r� rk r" r/ r. r� r9 r9 r9 r: r' Q s
r' c @ sB e Zd ZdZddd�Zddd �Zdd d �Zddd�Zddd�ZdS )�ThreadLocalRegistryz\A :class:`.ScopedRegistry` that uses a ``threading.local()``
variable for storage.
r) r, c C s || _ t�� | _d S r? )r) r
�localr+ )rL r) r9 r9 r: rk � s z ThreadLocalRegistry.__init__r- r" c C s2 z| j jW S ty | �� }| j _| Y S w r? )r+ rR r� r) )rL r� r9 r9 r: r" � s
�z ThreadLocalRegistry.__call__r� c C s t | jd�S )NrR )r� r+ rK r9 r9 r: r/ � r� zThreadLocalRegistry.hasr� rS c C s || j _d S r? )r+ rR r0 r9 r9 r: r. � r� zThreadLocalRegistry.setc C s" z| j `W d S ty Y d S w r? )r+ rR r� rK r9 r9 r: r� � s
�zThreadLocalRegistry.clearN)r) r, r1 r2 r3 r� ) r\ r] r^ r_ rk r" r/ r. r� r9 r9 r9 r: r4 � s
r4 c C s0 d}| D ]}||u r|d7 }|dkr dS qdS )zrGiven a sequence and search object, return True if there's more
than one, False if zero or one of them.
r r TFr9 )�sequence�target�cr� r9 r9 r: � has_dupes� s
�r9 )r* r+ r, r+ r- r+ )r< r= r- r> r? )r� r r- r+ )r� r r� r� r- r+ )r� r� r� r� r- r� )r� r r- r� )r� r� r- rs )Wr_ �
__future__r r r
r� r r r r r r r r r
r r r
r r r r r r r r r r� �_has_cyr r r r �
TYPE_CHECKING�_py_collectionsr r r r r r! �$sqlalchemy.cyextension.immutabledict�"sqlalchemy.cyextension.collectionsr" r$ r% r& � frozensetr( r� r) r; rC r@ rD r` ra rb r� r� r� rN r� �sort_dictionaryr� r� r� r� r. r� � column_dict�ordered_column_setr� r� r� r� r� r� r� r� �MutableMappingr r! r& r' r4 r9 r9 r9 r9 r: �<module> s�
8 W
"
%
i@