관리-도구
편집 파일: _collections.cpython-38.pyc
U -?�fnN � @ sH 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!�she �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( nHdd 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,< d-d-d-d.�d/d0�Z3d1d2d3�d4d5�Z4e#� Z5d6e1d7< G d8d9� d9e&e,e-f �Z6ed:ed$�Z7ed;ed$�Z8G d<d=� d=e e+ �Z9G d>d?� d?e9e+ �Z:G d@dA� dAe%e9e+ �Z;dtdBdC�Z<e=Z>e<Z?G dDdE� dEee+ �Z@G dFdG� dGe$�ZAG dHdI� dIe e,e-f �ZBG dJdK� dKe e,e-f �ZCeDZEe=ZFe'ZGG dLdM� dMe e+ �ZHdNd-dO�dPdQ�ZIdudNdRd-dS�dTdU�ZJdVdWdXdY�dZd[�ZKd\d]� ZLdNd^d_�d`da�ZMdvdbdc�ZNddded_�dfdg�ZOG dhdi� diejPe,e-f �ZQG djdk� dke e. �ZRG dldm� dme �ZSG dndo� doe e+ �ZTG dpdq� dqeTe+ �ZUdrds� ZVdS )wz 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� List[Any])�a�b�returnc C sj t | ��|�}g }t| �t|� }}|D ].}||krL|�|� || }} q$|�|� q(|�|� qfq$|S )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, Zoverlap�result�current�other�element� r8 �L/opt/hc_python/lib64/python3.8/site-packages/sqlalchemy/util/_collections.py�merge_lists_w_orderingL s # r: zMapping[_KT, _VT]zimmutabledict[_KT, _VT])�dr- c C s" | st S t| t�r| S t| �S d S �N)� EMPTY_DICT� isinstancer �r; r8 r8 r9 �coerce_to_immutabledict� s r@ zimmutabledict[Any, Any]r= c @ s\ e Zd ZdZddd�dd�Zdd�d d �Zdd�d d �Zd ddd�dd�Zdd�dd�ZdS )� FacadeDictz*A dictionary that is not publicly mutable.r zFacadeDict[Any, Any])�argsr- c G s t �| �}|S r< )r �__new__)�clsrB �newr8 r8 r9 rC � s zFacadeDict.__new__r �r- c C s t d��d S )Nz\an immutabledict shouldn't need to be copied. use dict(d) if you need a mutable dictionary.)�NotImplementedError��selfr8 r8 r9 �copy� s �zFacadeDict.copyc C s t t| �ffS r< )rA �dictrH r8 r8 r9 � __reduce__� s zFacadeDict.__reduce__r$ r% �None��key�valuer- c C s t �| ||� dS )z,insert an item into the dictionary directly.N)rK � __setitem__�rI rO rP r8 r8 r9 � _insert_item� s zFacadeDict._insert_item�strc C s dt �| � S )NzFacadeDict(%s))rK �__repr__rH r8 r8 r9 rU � s zFacadeDict.__repr__N) �__name__� __module__� __qualname__�__doc__rC rJ rL rS rU r8 r8 r8 r9 rA � s rA �_DT�_Fc s� e Zd ZU dZdZded< dd�dd�Zdd �d d �Zd d �d d�Zdd �� fdd� Z ddd�dd�Z dddd�dd �Z ddd �d d �Z ddd �d d!�Z dddd�d"d#�Zd$d �d%d&�Zd$dd'�d(d)�Zddd �d*d+�Zdd,d �d-d.�Zd/d �d0d1�Zddd2�d3d4�Zedd5d �d6d7��Zedd8d8d9�d:d7��ZdKdd<d=d9�d>d7�Zdd �d?d@�ZdAd �dBdC�ZdDd �dEdF�Zdd,d �dGdH�Zdd �dIdJ�Z� Z S )L� Propertiesz8Provide a __getattr__/__setattr__ interface over a dict.��_dataz Dict[str, _T]r^ )�datac C s t �| d|� d S �Nr^ ��object� __setattr__)rI r_ r8 r8 r9 �__init__� s zProperties.__init__�intrF c C s t | j�S r< ��lenr^ rH r8 r8 r9 �__len__� s zProperties.__len__� Iterator[_T]c C s t t| j�� ��S r< )r0 �listr^ �valuesrH r8 r8 r9 �__iter__� s zProperties.__iter__z List[str]c s t t� �dd� | j�� D � S )Nc S s g | ] }t |��qS r8 )rT ��.0�kr8 r8 r9 � <listcomp>� s z&Properties.__dir__.<locals>.<listcomp>)�dir�superr^ �keysrH �� __class__r8 r9 �__dir__� s zProperties.__dir__zProperties[_F]zList[Union[_T, _F]])r6 r- c C s t | �t |� S r< )rj )rI r6 r8 r8 r9 �__add__� s zProperties.__add__rT r" rM )rO �objr- c C s || j |< d S r< r] �rI rO rx r8 r8 r9 rQ � s zProperties.__setitem__�rO r- c C s | j | S r< r] �rI rO r8 r8 r9 � __getitem__� s zProperties.__getitem__c C s | j |= d S r< r] r{ r8 r8 r9 � __delitem__� s zProperties.__delitem__c C s || j |< d S r< r] ry r8 r8 r9 rc � s zProperties.__setattr__zDict[str, Any]c C s d| j iS r` r] rH r8 r8 r9 � __getstate__� s zProperties.__getstate__)�stater- c C s t �| d|d � d S r` ra )rI r r8 r8 r9 � __setstate__� s zProperties.__setstate__c C s. z | j | W S tk r( t|��Y nX d S r< )r^ �KeyError�AttributeErrorr{ r8 r8 r9 � __getattr__� s zProperties.__getattr__�boolc C s || j kS r< r] r{ r8 r8 r9 � __contains__� s zProperties.__contains__zReadOnlyProperties[_T]c C s t | j�S )z8Return an immutable proxy for this :class:`.Properties`.)�ReadOnlyPropertiesr^ rH r8 r8 r9 � as_readonly� s zProperties.as_readonly)rP r- c C s | j �|� d S r< )r^ �update)rI rP r8 r8 r9 r� � s zProperties.updatez Optional[_T]c C s d S r< r8 r{ r8 r8 r9 �get� s zProperties.getzUnion[_DT, _T]�rO �defaultr- c C s d S r< r8 �rI rO r� r8 r8 r9 r� � s NzOptional[Union[_DT, _T]]zOptional[Union[_T, _DT]]c C s || kr| | S |S d S r< r8 r� r8 r8 r9 r� � s c C s t | j�S r< )rj r^ rH r8 r8 r9 rs � s zProperties.keys�List[_T]c C s t | j�� �S r< )rj r^ rk rH r8 r8 r9 rk � s zProperties.valueszList[Tuple[str, _T]]c C s t | j�� �S r< )rj r^ �itemsrH r8 r8 r9 r� � s zProperties.itemsc C s || j kS r< r] r{ r8 r8 r9 �has_key� s zProperties.has_keyc C s | j �� d S r< )r^ �clearrH r8 r8 r9 r� s zProperties.clear)N) rV rW rX rY � __slots__�__annotations__rd rh rl rv rw rQ r| r} rc r~ r� r� r� r� r� r r� rs rk r� r� r� � __classcell__r8 r8 rt r9 r\ � s: �r\ c @ s e Zd ZdZdZdd� ZdS )�OrderedPropertieszUProvide a __getattr__/__setattr__ interface with an OrderedDict as backing store.r8 c C s t �| t� � d S r< )r\ rd � OrderedDictrH r8 r8 r9 rd s zOrderedProperties.__init__N)rV rW rX rY r� rd r8 r8 r8 r9 r� s r� c @ s e Zd ZdZdZdS )r� zDProvide immutable dict/object attribute to an underlying dictionary.r8 N)rV rW rX rY r� r8 r8 r8 r9 r� s r� c s0 � fdd�t � |d�D �}� �� � �|� dS )z Sort an OrderedDict in-place.c s g | ]}|� | f�qS r8 r8 rm r? r8 r9 rp s z,_ordered_dictionary_sort.<locals>.<listcomp>)rO N)�sortedr� r� )r; rO r� r8 r? r9 �_ordered_dictionary_sort s r� c @ s< e Zd Zddd�dd�Zdd� Zdd � Zd d � Zd d � ZdS )� WeakSequencer8 z Sequence[_T])�_WeakSequence__elementsc s0 t �| �fdd�� � | _� fdd�|D �| _d S )Nc S s |� }|d k r|j �| � d S r< )�_storage�remove)�item�selfrefrI r8 r8 r9 �_remove& s z&WeakSequence.__init__.<locals>._removec s g | ]}t �|� ��qS r8 )�weakref�ref)rn r7 �r� r8 r9 rp , s z)WeakSequence.__init__.<locals>.<listcomp>)r� r� r� r� )rI r� r8 r� r9 rd # s �zWeakSequence.__init__c C s | j �t�|| j�� d S r< )r� r2 r� r� r� )rI r� r8 r8 r9 r2 0 s zWeakSequence.appendc C s t | j�S r< )rg r� rH r8 r8 r9 rh 3 s zWeakSequence.__len__c C s dd� dd� | j D �D �S )Nc s s | ]}|d k r|V qd S r< r8 )rn rx r8 r8 r9 � <genexpr>7 s z(WeakSequence.__iter__.<locals>.<genexpr>c s s | ] }|� V qd S r< r8 )rn r� r8 r8 r9 r� 8 s )r� rH r8 r8 r9 rl 6 s �zWeakSequence.__iter__c C s: z| j | }W n tk r. td| ��Y nX |� S d S )NzIndex %s out of range)r� r� � IndexError)rI �indexrx r8 r8 r9 r| ; s zWeakSequence.__getitem__N)r8 )rV rW rX rd r2 rh rl r| r8 r8 r8 r9 r� " s r� c @ s e Zd Zddd�dd�ZdS )�OrderedIdentitySetNzOptional[Iterable[Any]])�iterablec C s. t �| � t� | _|r*|D ]}| �|� qd S r< )r rd r� Z_members�add)rI r� �or8 r8 r9 rd E s zOrderedIdentitySet.__init__)N)rV rW rX rd r8 r8 r8 r9 r� D s r� c @ s. e Zd ZdZdd�dd�Zddd�dd �Zd S ) � PopulateDictz�A dict which populates missing values via a creation function. Note the creation function takes a key, unlike collections.defaultdict. zCallable[[_KT], _VT]��creatorc C s || _ d S r< r� )rI r� r8 r8 r9 rd U s zPopulateDict.__init__r rz c C s | � |� | |< }|S r< r� �rI rO �valr8 r8 r9 � __missing__X s zPopulateDict.__missing__N�rV rW rX rY rd r� r8 r8 r8 r9 r� M s r� c @ s. e Zd ZdZdd�dd�Zddd�dd �Zd S ) �WeakPopulateDictzaLike PopulateDict, but assumes a self + a method and does not create a reference cycle. ztypes.MethodType)�creator_methodc C s |j | _|j}t�|�| _d S r< )�__func__r� �__self__r� r� �weakself)rI r� r� r8 r8 r9 rd c s zWeakPopulateDict.__init__r rz c C s | � | �� |� | |< }|S r< )r� r� r� r8 r8 r9 r� h s z WeakPopulateDict.__missing__Nr� r8 r8 r8 r9 r� ] s r� c @ s^ e Zd ZU dZdZded< ded< ded< ddd d �d d �Zddd�dd�Zdd�dd�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 (``==``). )r_ �_data_appender�_uniquez&Union[Iterable[_T], Set[_T], List[_T]]r_ zCallable[[_T], None]r� zDict[int, Literal[True]]r� Nz Optional[str])r_ �viac C sT || _ i | _|r t||�| _n2t|d�r8td|�j| _nt|d�rPtd|�j| _d S )Nr2 r� r� zSet[_T])r_ r� �getattrr� �hasattrr r2 r� )rI r_ r� r8 r8 r9 rd � s zUniqueAppender.__init__r" rM )r� r- c C s* t |�}|| jkr&| �|� d| j|< d S )NT)�idr� r� )rI r� Zid_r8 r8 r9 r2 � s zUniqueAppender.appendri rF c C s t | j�S r< )r0 r_ rH r8 r8 r9 rl � s zUniqueAppender.__iter__)N) rV rW rX rY r� r� rd r2 rl r8 r8 r8 r9 r� v s �r� r )�argr- c C s6 t | �dkr(t| d tj�r(t| d �S td| �S d S )Nr r r* )rg r> �types� GeneratorTyperj r )r� r8 r8 r9 �coerce_generator_arg� s r� zOptional[List[Any]])�xr� r- c C s4 | d kr |S t | �s| gS t| t�r(| S t| �S d S r< )r r> rj )r� r� r8 r8 r9 �to_list� s r� zContainer[Any]z Iterable[Any]r� )�set_r� 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|� kV qd S r< )�__hash__)rn �i�r� r8 r9 r� � s z#has_intersection.<locals>.<genexpr>)�any)r� r� r8 r� r9 �has_intersection� s r� c C s, | d krt � S t| t �s$t t| ��S | S d S r< )r. r> r� �r� r8 r8 r9 �to_set� s r� zSet[Any])r� r- c C s, | d krt � S t| t �s$t t| ��S | S d S r< )� column_setr> r� r� r8 r8 r9 � to_column_set� s r� c K s& | � � } |r| �|� | jf |� | S )z5Copy the given dict and update with the given values.)rJ r� )r; �_new�kwr8 r8 r9 � update_copy� s r� z Iterable[_T]ri c c s8 | D ].}t |t�s,t|d�r,t|�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. rl N)r> rT r� �flatten_iterator)r� �elemr8 r8 r9 r� � s r� c @ s e Zd ZU dZdZded< ded< ded< d3ddd d �dd�Zdd� Zeddd�dd��Z edddd�dd��Z d4dddd�dd�Z dd d�d d �Z d d �d!d"�Z dd �d#d$�Z d%d �d&d'�Z dd d(d)�d*d+�Zdd(d,�d-d.�Zedd �d/d0��Zd(d �d1d2�Zd S )5�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_alertr^ �_counter�_mutexre r� �floatr� z.Optional[Callable[[LRUCache[_KT, _VT]], None]]r� �d � �?Nz$Optional[Callable[(Ellipsis, None)]])r� r� r� c C s, || _ || _|| _d| _t�� | _i | _d S )Nr )r� r� r� r� � threading�Lockr� r^ )rI r� r� r� r8 r8 r9 rd � s zLRUCache.__init__c C s | j d7 _ | j S )Nr )r� rH r8 r8 r9 � _inc_counter s zLRUCache._inc_counterr$ z Optional[_VT]rz c C s d S r< r8 r{ r8 r8 r9 r� s z LRUCache.getzUnion[_VT, _T]r� c C s d S r< r8 r� r8 r8 r9 r� s zOptional[Union[_VT, _T]]c C s4 | j �|�}|d k r,| �� |d d< |d S |S d S �N� r r )r^ r� r� )rI rO r� r� r8 r8 r9 r� s r% c C s" | j | }| �� |d d< |d S r� )r^ r� )rI rO r� r8 r8 r9 r| s zLRUCache.__getitem__z Iterator[_KT]rF c C s t | j�S r< )r0 r^ rH r8 r8 r9 rl s zLRUCache.__iter__c C s t | j�S r< rf rH r8 r8 r9 rh s zLRUCache.__len__zValuesView[_VT]c C s t �dd� | j�� D ��S )Nc S s i | ]\}}||d �qS )r r8 )rn ro r� r8 r8 r9 � <dictcomp>$ s z#LRUCache.values.<locals>.<dictcomp>)�typingr r^ r� rH r8 r8 r9 rk # s zLRUCache.valuesrM rN c C s" ||| � � gf| j|< | �� d S r< )r� r^ � _manage_sizerR r8 r8 r9 rQ & s zLRUCache.__setitem__)� _LRUCache__vr- c C s | j |= d S r< r] )rI r� r8 r8 r9 r} * s zLRUCache.__delitem__c C s | j | j | j S r< )r� r� rH r8 r8 r9 �size_threshold- s zLRUCache.size_thresholdc C s� | j �d�sd S z�t| j�}t| �| j| j| j kr�|rHd}| �| � t| j � � t � d�dd�}|| jd � D ].}z| j |d = W qp t k r� Y qpY qpX qpq W 5 | j �� X d S )NFr� T)rO �reverser )r� �acquire�releaser� r� rg r� r� r� r^ rk �operator� itemgetterr� )rI r� Z by_counterr� r8 r8 r9 r� 1 s& �zLRUCache._manage_size)r� r� N)N)rV rW rX rY r� r� rd r� r r� r| rl rh rk rQ r} �propertyr� r� r8 r8 r8 r9 r� � s2 � � r� c @ s e Zd Zdd�dd�ZdS )�_CreateFuncTyper& rF c C s d S r< r8 rH r8 r8 r9 �__call__J � z_CreateFuncType.__call__N�rV rW rX r� r8 r8 r8 r9 r� I s r� c @ s e Zd Zdd�dd�ZdS )�_ScopeFuncTyper rF c C s d S r< r8 rH r8 r8 r9 r� N r� z_ScopeFuncType.__call__Nr� r8 r8 r8 r9 r� M s r� c @ sx e Zd ZU dZdZded< ded< ded< d d d �d d �Zdd�dd�Zdd�dd�Zddd�dd�Z dd�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]zCallable[[], Any])r� r� 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� )rI r� r� r8 r8 r9 rd f s zScopedRegistry.__init__r" rF c C s@ | � � }z | j| W S tk r: | j�|| �� � Y S X d S r< )r� r� r� � setdefaultr� r{ r8 r8 r9 r� w s zScopedRegistry.__call__r� c C s | � � | jkS )z9Return True if an object is present in the current scope.)r� r� rH r8 r8 r9 �has~ s zScopedRegistry.hasrM �rx r- c C s || j | �� < dS )z$Set the value for the current scope.N)r� r� �rI rx r8 r8 r9 r. � s zScopedRegistry.setc C s* z| j | �� = W n tk r$ Y nX dS )z Clear the current scope, if any.N)r� r� r� rH r8 r8 r9 r� � s zScopedRegistry.clearN) rV rW rX rY r� r� rd r� r� r. r� r8 r8 r8 r9 r� Q s r� c @ sX e Zd ZdZdd�dd�Zdd�dd �Zd d�d d �Zdd d�dd�Zd d�dd�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� )rI r� r8 r8 r9 rd � s z ThreadLocalRegistry.__init__r" rF c C s8 z | j jW S tk r2 | �� }| j _| Y S X d S r< )r� rP r� r� )rI r� r8 r8 r9 r� � s z ThreadLocalRegistry.__call__r� c C s t | jd�S )NrP )r� r� rH r8 r8 r9 r� � s zThreadLocalRegistry.hasrM r� c C s || j _d S r< )r� rP r� r8 r8 r9 r. � s zThreadLocalRegistry.setc C s$ z | j `W n tk r Y nX d S r< )r� rP r� rH r8 r8 r9 r� � s zThreadLocalRegistry.clearN) rV rW rX rY rd r� r� r. r� r8 r8 r8 r9 r� � s r� c C s0 d}| D ]"}||kr|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 TFr8 )�sequence�target�cr� r8 r8 r9 � has_dupes� s r� )N)N)N)WrY � __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� Z_has_cyr r r r � TYPE_CHECKINGZ_py_collectionsr r r r r r! Z$sqlalchemy.cyextension.immutabledictZ"sqlalchemy.cyextension.collectionsr" r$ r% r& � frozensetr( r� r) r: r@ r= rA rZ r[ r\ r� r� r� rK r� Zsort_dictionaryr� r� r� r� r. r� Z column_dictZordered_column_setr� r� r� r� r� r� r� r� �MutableMappingr� r� r� r� r� r� r8 r8 r8 r9 �<module> s� 8 W " % i@