관리-도구
편집 파일: _py_collections.cpython-38.pyc
U -?�fJA � @ s� d dl mZ d dlmZ d dlmZ d dlmZ d dlmZ d dlmZ d dlm Z d dlm Z d d lm Z d d lm Z d d lm Z d d lmZ d d lmZ d dlmZ d dlmZ d dlmZ d dlmZ d dlmZ d dlmZ ddlmZ eded�Zeded�Zeded�Zeded�ZG dd � d �Z G d d � d e e eef �Z G d d � d e eef �Z G d!d"� d"ee �Z G d#d$� d$�Z d,d&d'd(d)�d*d+�Z!d%S )-� )� annotations)� filterfalse)� AbstractSet)�Any)�Callable)�cast)� Collection)�Dict)�Iterable)�Iterator)�List)�Mapping)�NoReturn)�Optional)�Set)�Tuple)� TYPE_CHECKING)�TypeVar)�Union� )�Self�_T)�bound�_S�_KT�_VTc @ sh e Zd ZdZdddd�dd�Zdddd�dd�Zddd �d d �Zdddd �d d�Zdddd �dd�ZdS )�ReadOnlyContainer� r r ��arg�kw�returnc O s t d| jj ��d S )Nz&%s object is immutable and/or readonly�� TypeError� __class__�__name__��selfr r r r �O/opt/hc_python/lib64/python3.8/site-packages/sqlalchemy/util/_py_collections.py� _readonly) s �zReadOnlyContainer._readonlyc O s t d| jj ��d S )Nz%s object is immutabler" r& r r r( � _immutable. s z ReadOnlyContainer._immutable��keyr! c C s | � � d S �N�r) �r' r, r r r( � __delitem__1 s z ReadOnlyContainer.__delitem__)r, �valuer! c C s | � � d S r- r. �r' r, r1 r r r( � __setitem__4 s z ReadOnlyContainer.__setitem__�strc C s | � � d S r- r. r2 r r r( � __setattr__7 s z ReadOnlyContainer.__setattr__N) r% � __module__� __qualname__� __slots__r) r* r0 r3 r5 r r r r( r & s r c @ s� e Zd Zer*ddd�dd�Zdd�dd�Zddd d �d d �Zd d �dd�Zdddd d�dd�Zd d �dd�Z d ddd d�dd�Z ddd d �dd�Z dS ) �ImmutableDictBaser r )�argsr! c G s d S r- r ��clsr: r r r( �__new__> � zImmutableDictBase.__new__�r: c G s d S r- r r; r r r( �__init__@ r> zImmutableDictBase.__init__r r c O s | � � d S r- )r* r& r r r( r) B s zImmutableDictBase._readonly�r! c C s | � � d S r- r. �r' r r r( �clearE s zImmutableDictBase.clearNz Optional[Any])r, �defaultr! c C s | � � d S r- r. �r' r, rD r r r( �popH s zImmutableDictBase.popc C s | � � d S r- r. rB r r r( �popitemK s zImmutableDictBase.popitemc C s | � � d S r- r. rE r r r( � setdefaultN s z ImmutableDictBase.setdefaultc O s | � � d S r- r. r& r r r( �updateQ s zImmutableDictBase.update)N)N) r% r6 r7 r r= r@ r) rC rF rG rH rI r r r r( r9 ; s r9 c s� e Zd Zdd� Zdd�dd�Zdd� Zd$d d d �d d�Zd%d dd d�dd�Zd d d�dd�Zdd�dd�Z ddd �d d �Z d d d �� fd d!� Z d d d �� fd"d#� Z � Z S )&� immutabledictc G s t �| �}tj|f|�� |S r- )r9 r= �dictr@ )r< r: �newr r r( r= V s zimmutabledict.__new__z3Union[Mapping[_KT, _VT], Iterable[Tuple[_KT, _VT]]]r? c G s d S r- r )r' r: r r r( r@ [ s zimmutabledict.__init__c C s t t| �ffS r- )rJ rK rB r r r( � __reduce__` s zimmutabledict.__reduce__NzOptional[Mapping[_KT, _VT]]zimmutabledict[_KT, _VT])�_immutabledict__dr! c C s0 |s| S t �| j�}t�|| � t�||� |S r- �r9 r= r$ rK r@ rI )r' rN rL r r r( �unionc s zimmutabledict.unionr )rN r r! c K sD |s |s | S t �| j�}t�|| � |r4t�||� t�||� |S r- rO )r' rN r rL r r r( � _union_w_kwn s zimmutabledict._union_w_kw)�dictsr! c G sN d }|D ]4}|r|d kr0t �| j�}t�|| � t�||� q|d krJ| S |S r- rO )r' rR rL �dr r r( � merge_with| s zimmutabledict.merge_withr4 rA c C s dt �| � S )Nzimmutabledict(%s))rK �__repr__rB r r r( rU � s zimmutabledict.__repr__r r )�_immutabledict__valuer! c C s | � � d S r- r. �r' rV r r r( �__ior__� s zimmutabledict.__ior__zMapping[_KT, _VT]c s t t� �|��S r- )rJ �super�__or__rW �r$ r r( rZ � s �zimmutabledict.__or__c s t t� �|��S r- )rJ rY �__ror__rW r[ r r( r\ � s �zimmutabledict.__ror__)N)N)r% r6 r7 r= r@ rM rP rQ rT rU rX rZ r\ � __classcell__r r r[ r( rJ U s � �rJ c s e Zd ZU dZded< dRddd�� fdd � Zd d �d d �Zddd�� fdd� Zddd�� fdd� Zdd �� fdd� Z dddd�� fdd� Z ddd�� fdd� Z dd �� fd d � Z ddd �d d �Z d!d �d"d#�Zd!d d$�d%d&�Zd'd �d(d)�ZeZd*dd+�� fd,d-� Zd.d/d$�d0d1�Zd2d/d$�d3d4�Zd.d/d$�d5d6�Zd7d d$�d8d9�Zd:d d$�d;d<�Zd*d d$�d=d>�Zd.d/d$�d?d@�Zd7d d$�� fdAdB� ZdCd d$�dDdE�Zd7dd$�� fdFdG� Z d:d d$�dHdI�Z d7dd$�� fdJdK� Z d.d/d$�dLdM�Z d7dd$�� fdNdO� Z dCd d$�dPdQ�Z!� Z"S )S� OrderedSet��_list�List[_T]r` NzOptional[Iterable[_T]]�None)rS r! c s, |d k r"t |�| _t� �| j� ng | _d S r- )� unique_listr` rY rI )r' rS r[ r r( r@ � s zOrderedSet.__init__zOrderedSet[_T]rA c C s& | � � }| j�� |_t�||j� |S r- )r$ r` �copy�setrI )r' �cpr r r( rd � s zOrderedSet.copyr )�elementr! c s$ || kr| j �|� t� �|� d S r- �r` �appendrY �add�r' rg r[ r r( rj � s zOrderedSet.addc s t � �|� | j�|� d S r- )rY �remover` rk r[ r r( rl � s zOrderedSet.removec s> z| j �� }W n tk r, td�d �Y nX t� �|� |S )N�pop from an empty set)r` rF � IndexError�KeyErrorrY rl �r' r1 r[ r r( rF � s zOrderedSet.pop�int)�posrg r! c s& || kr| j �||� t� �|� d S r- )r` �insertrY rj )r' rr rg r[ r r( rs � s zOrderedSet.insertc s$ || kr | j �|� t� �|� d S r- )r` rl rY rk r[ r r( �discard� s zOrderedSet.discardc s t � �� g | _d S r- )rY rC r` rB r[ r r( rC � s zOrderedSet.clearr+ c C s | j | S r- r_ r/ r r r( � __getitem__� s zOrderedSet.__getitem__z Iterator[_T]c C s t | j�S r- )�iterr` rB r r r( �__iter__� s zOrderedSet.__iter__��otherr! c C s | � |�S r- �rP �r' ry r r r( �__add__� s zOrderedSet.__add__r4 c C s d| j j| jf S �Nz%s(%r))r$ r% r` rB r r r( rU � s zOrderedSet.__repr__� Iterable[_T])� iterablesr! c s8 |D ].}|D ]$}|| kr | j �|� t� �|� q qd S r- rh )r' r �iterable�er[ r r( rI � s zOrderedSet.updatezAbstractSet[_S]zOrderedSet[Union[_T, _S]]c C s | � |� | S r- )rI r{ r r r( rX � s zOrderedSet.__ior__z Iterable[_S]c G s | � � }|j|� |S r- )rd rI )r' ry �resultr r r( rP � s zOrderedSet.unionc C s | � |�S r- rz r{ r r r( rZ � s zOrderedSet.__or__� Iterable[Any]c s( t � � � j|� | �� fdd�| D ��S )Nc 3 s | ]}|� kr|V qd S r- r ��.0�a�� other_setr r( � <genexpr>� s z*OrderedSet.intersection.<locals>.<genexpr>)re rI r$ r{ r r� r( � intersection� s zOrderedSet.intersectionzAbstractSet[object]c C s | � |�S r- )r� r{ r r r( �__and__� s zOrderedSet.__and__c sp t |t�r| }� n(t |t�r,|}t|�� nt|�}t|�� ��� fdd��D ��}|��fdd�|D �� |S )Nc 3 s | ]}|� kr|V qd S r- r r� r� r r( r� s z2OrderedSet.symmetric_difference.<locals>.<genexpr>c 3 s | ]}|� kr|V qd S r- r r� rB r r( r� s )� isinstancere r �listr$ rI )r' ry � collectionr� r )r� r' r( �symmetric_difference� s z OrderedSet.symmetric_differencec C s t ttttf | ��|�S r- )r r^ r r r r� r{ r r r( �__xor__ s �zOrderedSet.__xor__c s& t � j|� � | �� fdd�| jD ��S )Nc 3 s | ]}|� kr|V qd S r- r r� r� r r( r� s z(OrderedSet.difference.<locals>.<genexpr>)rY � differencer$ r` r{ r[ r� r( r� s zOrderedSet.differencezAbstractSet[Optional[_T]]c C s | � |�S r- )r� r{ r r r( �__sub__ s zOrderedSet.__sub__c s& t � j|� � fdd�� jD �� _d S )Nc s g | ]}|� kr|�qS r r r� rB r r( � <listcomp> s z2OrderedSet.intersection_update.<locals>.<listcomp>)rY �intersection_updater` r{ r[ rB r( r� s z OrderedSet.intersection_updatec C s | � |� | S r- )r� r{ r r r( �__iand__ s zOrderedSet.__iand__c sX t |t�r|nt|�}t� �|� � fdd�� jD �� _� j� fdd�|D �7 _d S )Nc s g | ]}|� kr|�qS r r r� rB r r( r� s z:OrderedSet.symmetric_difference_update.<locals>.<listcomp>c s g | ]}|� kr|�qS r r r� rB r r( r� ! s )r� r r� rY �symmetric_difference_updater` )r' ry r� r[ rB r( r� s z&OrderedSet.symmetric_difference_updatec C s | � |� tttttf | �S r- )r� r r^ r r r r{ r r r( �__ixor__# s zOrderedSet.__ixor__c s& t � j|� � fdd�� jD �� _d S )Nc s g | ]}|� kr|�qS r r r� rB r r( r� ) s z0OrderedSet.difference_update.<locals>.<listcomp>)rY �difference_updater` r{ r[ rB r( r� ' s z OrderedSet.difference_updatec C s | � |� | S r- )r� r{ r r r( �__isub__+ s zOrderedSet.__isub__)N)#r% r6 r7 r8 �__annotations__r@ rd rj rl rF rs rt rC ru rw r| rU �__str__rI rX rP rZ r� r� r� r� r� r� r� r� r� r� r� r� r] r r r[ r( r^ � s> r^ c @ sP e Zd ZU dZded< d[dd�dd�Zd d d �d d �Zd dd �dd�Zd d d �dd�Zd d d �dd�Z d d�dd�Z d d�dd�Z d dd�dd �Z d dd�d d �Z d dd �d!d"�Zd dd�d#d$�Zd dd�d%d&�Zd dd �d'd(�Zd dd�d)d*�Zd dd�d+d,�Zd d d �d-d.�Zd d d�d/d0�Zd d d �d1d2�Zd d d�d3d4�Zd d d �d5d6�Zd d d�d7d8�Zd d d �d9d:�Zd d d�d;d<�Zd d d �d=d>�Z d d d�d?d@�Z d d d �dAdB�Z d d d�dCdD�Z d d d �dEdF�Z d d d�dGdH�Z!d d d �dIdJ�Z"d d d�dKdL�Z#d d�dMdN�Z$e$Z%dOd�dPdQ�Z&dRd�dSdT�Z'dUd�dVdW�Z(dXd�dYdZ�Z)dS )\� IdentitySetz�A set that considers only object id() for uniqueness. This strategy has edge cases for builtin types- it's possible to have two 'foo' strings in one of these sets, for example. Use sparingly. zDict[int, Any]�_membersNzOptional[Iterable[Any]])r� c C s t � | _|r| �|� d S r- )rK r� rI �r' r� r r r( r@ : s zIdentitySet.__init__r rb )r1 r! c C s || j t|�< d S r- �r� �idrp r r r( rj ? s zIdentitySet.add�boolc C s t |�| jkS r- )r� r� rp r r r( � __contains__B s zIdentitySet.__contains__c C s | j t|�= d S r- r� rp r r r( rl E s zIdentitySet.removec C s( z| � |� W n tk r" Y nX d S r- )rl ro rp r r r( rt H s zIdentitySet.discardrA c C s6 z| j �� }|d W S tk r0 td��Y nX d S )N� rm )r� rG ro )r' �pairr r r( rF N s zIdentitySet.popc C s | j �� d S r- )r� rC rB r r r( rC U s zIdentitySet.clearrx c C s t |t�r| j|jkS dS d S )NF�r� r� r� r{ r r r( �__eq__X s zIdentitySet.__eq__c C s t |t�r| j|jkS dS d S )NTr� r{ r r r( �__ne__^ s zIdentitySet.__ne__r� )r� r! c C sV t || j�r|}n | �|�}t| �t|�kr0dS t|jjt| j�� ��D ]} dS dS �NFT�r� r$ �lenr r� r� rv �keys�r' r� ry �mr r r( �issubsetd s �zIdentitySet.issubsetc C s t |t�stS | �|�S r- )r� r� �NotImplementedr� r{ r r r( �__le__r s zIdentitySet.__le__c C s( t |t�stS t| �t|�k o&| �|�S r- )r� r� r� r� r� r{ r r r( �__lt__w s zIdentitySet.__lt__c C sV t || j�r|}n | �|�}t| �t|�k r0dS t| jjt|j�� ��D ]} dS dS r� r� r� r r r( � issuperset| s �zIdentitySet.issupersetc C s t |t�stS | �|�S r- )r� r� r� r� r{ r r r( �__ge__� s zIdentitySet.__ge__c C s( t |t�stS t| �t|�ko&| �|�S r- )r� r� r� r� r� r{ r r r( �__gt__� s zIdentitySet.__gt__c C s4 | � � }| j}|j�|� |j�dd� |D �� |S )Nc s s | ]}t |�|fV qd S r- �r� �r� �objr r r( r� � s z$IdentitySet.union.<locals>.<genexpr>)r$ r� rI )r' r� r� �membersr r r( rP � s zIdentitySet.unionc C s t |t�stS | �|�S r- )r� r� r� rP r{ r r r( rZ � s zIdentitySet.__or__c C s | j �dd� |D �� d S )Nc s s | ]}t |�|fV qd S r- r� r� r r r( r� � s z%IdentitySet.update.<locals>.<genexpr>)r� rI r� r r r( rI � s zIdentitySet.updatec C s t |t�stS | �|� | S r- )r� r� r� rI r{ r r r( rX � s zIdentitySet.__ior__c sL | � | j�}t|| j�r |j� ndd� |D �� � fdd�| j�� D �|_|S )Nc S s h | ] }t |��qS r r� r� r r r( � <setcomp>� s z)IdentitySet.difference.<locals>.<setcomp>c s i | ]\}}|� kr||�qS r r �r� �k�v�ry r r( � <dictcomp>� s z*IdentitySet.difference.<locals>.<dictcomp>�r= r$ r� r� �items�r' r� r� r r� r( r� � s �zIdentitySet.differencec C s t |t�stS | �|�S r- )r� r� r� r� r{ r r r( r� � s zIdentitySet.__sub__c C s | � |�j| _d S r- )r� r� r� r r r( r� � s z IdentitySet.difference_updatec C s t |t�stS | �|� | S r- )r� r� r� r� r{ r r r( r� � s zIdentitySet.__isub__c sL | � | j�}t|| j�r |j� ndd� |D �� � fdd�| j�� D �|_|S )Nc S s h | ] }t |��qS r r� r� r r r( r� � s z+IdentitySet.intersection.<locals>.<setcomp>c s i | ]\}}|� kr||�qS r r r� r� r r( r� � s z,IdentitySet.intersection.<locals>.<dictcomp>r� r� r r� r( r� � s �zIdentitySet.intersectionc C s t |t�stS | �|�S r- )r� r� r� r� r{ r r r( r� � s zIdentitySet.__and__c C s | � |�j| _d S r- )r� r� r� r r r( r� � s z IdentitySet.intersection_updatec C s t |t�stS | �|� | S r- )r� r� r� r� r{ r r r( r� � s zIdentitySet.__iand__c sj �� �j�}t|�j�r |j� ndd� |D �� � fdd��j�� D �|_|j��fdd�� �� D �� |S )Nc S s i | ]}t |�|�qS r r� r� r r r( r� � s z4IdentitySet.symmetric_difference.<locals>.<dictcomp>c s i | ]\}}|� kr||�qS r r r� r� r r( r� � s c 3 s$ | ] \}}|� j kr||fV qd S r- )r� r� rB r r( r� � s z3IdentitySet.symmetric_difference.<locals>.<genexpr>)r= r$ r� r� r� rI r� r )ry r' r( r� � s ��z IdentitySet.symmetric_differencec C s t |t�stS | �|�S r- �r� r� r� r� r{ r r r( r� � s zIdentitySet.__xor__c C s | � |�j| _d S r- )r� r� r� r r r( r� � s z'IdentitySet.symmetric_difference_updatec C s t |t�stS | �|� | S r- r� r{ r r r( r� � s zIdentitySet.__ixor__c C s | � | j�}| j�� |_|S r- )r= r$ r� rd )r' r� r r r( rd � s zIdentitySet.copyrq c C s t | j�S r- )r� r� rB r r r( �__len__ s zIdentitySet.__len__z Iterator[Any]c C s t | j�� �S r- )rv r� �valuesrB r r r( rw s zIdentitySet.__iter__r c C s t d��d S )Nzset objects are unhashable)r# rB r r r( �__hash__ s zIdentitySet.__hash__r4 c C s dt | �jt| j�� �f S r} )�typer% r� r� r� rB r r r( rU s zIdentitySet.__repr__)N)*r% r6 r7 �__doc__r� r@ rj r� rl rt rF rC r� r� r� r� r� r� r� r� rP rZ rI rX r� r� r� r� r� r� r� r� r� r� r� r� rd �__copy__r� rw r� rU r r r r( r� 0 sN r� Nr~ z Optional[Callable[[_T], int]]ra )�seq�hashfuncr! c s> t � ��j�� s$��fdd�| D �S � ��fdd�| D �S d S )Nc s g | ]}|� kr�|�s|�qS r r �r� �x)�seen�seen_addr r( r� s z unique_list.<locals>.<listcomp>c s( g | ] }� |��kr�� |��s|�qS r r r� �r� r� r� r r( r� s �)re rj )r� r� r r� r( rc s �rc )N)"� __future__r � itertoolsr �typingr r r r r r r r r r r r r r r r r Z util.typingr r r r r r r9 rJ r^ r� rc r r r r( �<module> s@ L c �