?????????? ????????? - ??????????????? - /home/agenciai/.local/lib/python3.9/site-packages/sqlalchemy/util/__pycache__/_collections.cpython-39.pyc
???????
a ��Jh�N � @ sT 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;dwdBdC�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�ZIdxdNdRd-dS�dTdU�ZJdVdWdXdY�dZd[�ZKd\d]� ZLdNd^d_�d`da�ZMdydbdcdNdbdd�dedf�ZNdgdhd_�didj�ZOG dkdl� dlejPe,e-f �ZQG dmdn� dne e. �ZRG dodp� dpe �ZSG dqdr� dre e+ �ZTG dsdt� dteTe+ �ZUdudv� ZVdS )zz 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 ].}||v rL|�|� || }} 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, �overlap�result�current�other�element� r9 �Q/home/agenciai/.local/lib/python3.9/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< r9 r9 r: �coerce_to_immutabledict� s rA 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__)�clsrC �newr9 r9 r: rD � 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��selfr9 r9 r: �copy� s �zFacadeDict.copyc C s t t| �ffS r= )rB �dictrI r9 r9 r: � __reduce__� s zFacadeDict.__reduce__r$ r% �None��key�valuer- c C s t �| ||� dS )z,insert an item into the dictionary directly.N)rL � __setitem__�rJ rP rQ r9 r9 r: � _insert_item� s zFacadeDict._insert_item�strc C s dt �| � S )NzFacadeDict(%s))rL �__repr__rI r9 r9 r: rV � s zFacadeDict.__repr__N) �__name__� __module__� __qualname__�__doc__rD rK rM rT rV r9 r9 r9 r: rB � s rB �_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__)rJ r` r9 r9 r: �__init__� s zProperties.__init__�intrG c C s t | j�S r= ��lenr_ rI r9 r9 r: �__len__� s zProperties.__len__� Iterator[_T]c C s t t| j�� ��S r= )r0 �listr_ �valuesrI r9 r9 r: �__iter__� s zProperties.__iter__z List[str]c s t t� �dd� | j�� D � S )Nc S s g | ] }t |��qS r9 )rU ��.0�kr9 r9 r: � <listcomp>� � z&Properties.__dir__.<locals>.<listcomp>)�dir�superr_ �keysrI �� __class__r9 r: �__dir__� s zProperties.__dir__zProperties[_F]zList[Union[_T, _F]])r7 r- c C s t | �t |� S r= )rk )rJ r7 r9 r9 r: �__add__� s zProperties.__add__rU r" rN )rP �objr- c C s || j |< d S r= r^ �rJ rP rz r9 r9 r: rR � s zProperties.__setitem__�rP r- c C s | j | S r= r^ �rJ rP r9 r9 r: � __getitem__� s zProperties.__getitem__c C s | j |= d S r= r^ r} r9 r9 r: � __delitem__� s zProperties.__delitem__c C s || j |< d S r= r^ r{ r9 r9 r: rd � s zProperties.__setattr__zDict[str, Any]c C s d| j iS ra r^ rI r9 r9 r: � __getstate__� s zProperties.__getstate__)�stater- c C s t �| d|d � d S ra rb )rJ r� r9 r9 r: � __setstate__� s zProperties.__setstate__c C s, z | j | W S ty& t|��Y n0 d S r= )r_ �KeyError�AttributeErrorr} r9 r9 r: � __getattr__� s zProperties.__getattr__�boolc C s || j v S r= r^ r} r9 r9 r: � __contains__� s zProperties.__contains__zReadOnlyProperties[_T]c C s t | j�S )z8Return an immutable proxy for this :class:`.Properties`.)�ReadOnlyPropertiesr_ rI r9 r9 r: � as_readonly� s zProperties.as_readonly)rQ r- c C s | j �|� d S r= )r_ �update)rJ rQ r9 r9 r: r� � s zProperties.updatez Optional[_T]c C s d S r= r9 r} r9 r9 r: �get� s zProperties.getzUnion[_DT, _T]�rP �defaultr- c C s d S r= r9 �rJ rP r� r9 r9 r: r� � s NzOptional[Union[_DT, _T]]zOptional[Union[_T, _DT]]c C s || v r| | S |S d S r= r9 r� r9 r9 r: r� � s c C s t | j�S r= )rk r_ rI r9 r9 r: ru � s zProperties.keys�List[_T]c C s t | j�� �S r= )rk r_ rl rI r9 r9 r: rl � s zProperties.valueszList[Tuple[str, _T]]c C s t | j�� �S r= )rk r_ �itemsrI r9 r9 r: r� � s zProperties.itemsc C s || j v S r= r^ r} r9 r9 r: �has_key� s zProperties.has_keyc C s | j �� d S r= )r_ �clearrI r9 r9 r: r� s zProperties.clear)N) rW rX rY rZ � __slots__�__annotations__re ri rm rx ry rR r~ r rd r� r� r� r� r� r� r r� ru rl r� r� r� � __classcell__r9 r9 rv r: r] � s: �r] 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= )r] re � OrderedDictrI r9 r9 r: re s zOrderedProperties.__init__N)rW rX rY rZ r� re r9 r9 r9 r: r� s r� c @ s e Zd ZdZdZdS )r� zDProvide immutable dict/object attribute to an underlying dictionary.r9 N)rW rX rY rZ 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 rn r@ r9 r: rq rr z,_ordered_dictionary_sort.<locals>.<listcomp>)rP N)�sortedr� r� )r< rP r� r9 r@ r: �_ordered_dictionary_sort s r� c @ s< e Zd Zddd�dd�Zdd� Zdd � Zd d � Zd d � ZdS )� WeakSequencer9 z Sequence[_T])�_WeakSequence__elementsc s0 t �| �fdd�� � | _� fdd�|D �| _d S )Nc S s |� }|d ur|j �| � d S r= )�_storage�remove)�item�selfrefrJ r9 r9 r: �_remove& s z&WeakSequence.__init__.<locals>._removec s g | ]}t �|� ��qS r9 )�weakref�ref)ro r8 �r� r9 r: rq , s z)WeakSequence.__init__.<locals>.<listcomp>)r� r� r� r� )rJ r� r9 r� r: re # s �zWeakSequence.__init__c C s | j �t�|| j�� d S r= )r� r2 r� r� r� )rJ r� r9 r9 r: r2 0 s zWeakSequence.appendc C s t | j�S r= )rh r� rI r9 r9 r: ri 3 s zWeakSequence.__len__c C s dd� dd� | j D �D �S )Nc s s | ]}|d ur|V qd S r= r9 )ro rz r9 r9 r: � <genexpr>7 s z(WeakSequence.__iter__.<locals>.<genexpr>c s s | ] }|� V qd S r= r9 )ro r� r9 r9 r: r� 8 rr )r� rI r9 r9 r: rm 6 s �zWeakSequence.__iter__c C s8 z| j | }W n ty, td| ��Y n0 |� S d S )NzIndex %s out of range)r� r� � IndexError)rJ �indexrz r9 r9 r: r~ ; s zWeakSequence.__getitem__N)r9 )rW rX rY re r2 ri rm r~ r9 r9 r9 r: r� " s r� c @ s e Zd Zddd�dd�ZdS )�OrderedIdentitySetNzOptional[Iterable[Any]])�iterablec C s. t �| � t� | _|r*|D ]}| �|� qd S r= )r re r� Z_members�add)rJ r� �or9 r9 r: re E s zOrderedIdentitySet.__init__)N)rW rX rY re r9 r9 r9 r: 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� )rJ r� r9 r9 r: re U s zPopulateDict.__init__r r| c C s | � |� | |< }|S r= r� �rJ rP �valr9 r9 r: � __missing__X s zPopulateDict.__missing__N�rW rX rY rZ re r� r9 r9 r9 r: 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)rJ r� r� r9 r9 r: re c s zWeakPopulateDict.__init__r r| c C s | � | �� |� | |< }|S r= )r� r� r� r9 r9 r: r� h s z WeakPopulateDict.__missing__Nr� r9 r9 r9 r: 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� )rJ r` r� r9 r9 r: re � s zUniqueAppender.__init__r" rN )r� r- c C s* t |�}|| jvr&| �|� d| j|< d S )NT)�idr� r� )rJ r� Zid_r9 r9 r: r2 � s zUniqueAppender.appendrj rG c C s t | j�S r= )r0 r` rI r9 r9 r: rm � s zUniqueAppender.__iter__)N) rW rX rY rZ r� r� re r2 rm r9 r9 r9 r: 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* )rh r? �types� GeneratorTyperk r )r� r9 r9 r: �coerce_generator_arg� s r� zOptional[List[Any]])�xr� r- c C s4 | d u r |S t | �s| gS t| t�r(| S t| �S d S r= )r r? rk )r� r� r9 r9 r: �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|� v V qd S r= )�__hash__)ro �i�r� r9 r: r� � rr z#has_intersection.<locals>.<genexpr>)�any)r� r� r9 r� r: �has_intersection� s r� c C s, | d u rt � S t| t �s$t t| ��S | S d S r= )r. r? r� �r� r9 r9 r: �to_set� s r� zSet[Any])r� r- c C s, | d u rt � S t| t �s$t t| ��S | S d S r= )� column_setr? r� r� r9 r9 r: � to_column_set� s r� zDict[Any, Any]zOptional[Dict[Any, Any]])r< �_new�kwr- c K s* | � � } |r| �|� | jf i |�� | S )z5Copy the given dict and update with the given values.)rK r� )r< r� r� r9 r9 r: � update_copy� s r� z Iterable[_T]rj 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. rm N)r? rU r� �flatten_iterator)r� �elemr9 r9 r: 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�_mutexrf r� �floatr� z.Optional[Callable[[LRUCache[_KT, _VT]], None]]r� �d � �?Nz Optional[Callable[..., None]])r� r� r� c C s, || _ || _|| _d| _t�� | _i | _d S )Nr )r� r� r� r� � threading�Lockr� r_ )rJ r� r� r� r9 r9 r: re � s zLRUCache.__init__c C s | j d7 _ | j S )Nr )r� rI r9 r9 r: � _inc_counter s zLRUCache._inc_counterr$ z Optional[_VT]r| c C s d S r= r9 r} r9 r9 r: r� s z LRUCache.getzUnion[_VT, _T]r� c C s d S r= r9 r� r9 r9 r: r� s zOptional[Union[_VT, _T]]c C s4 | j �|�}|d ur,| �� |d d< |d S |S d S �N� r r )r_ r� r� )rJ rP r� r� r9 r9 r: r� s r% c C s" | j | }| �� |d d< |d S r� )r_ r� )rJ rP r� r9 r9 r: r~ s zLRUCache.__getitem__z Iterator[_KT]rG c C s t | j�S r= )r0 r_ rI r9 r9 r: rm s zLRUCache.__iter__c C s t | j�S r= rg rI r9 r9 r: ri " s zLRUCache.__len__zValuesView[_VT]c C s t �dd� | j�� D ��S )Nc S s i | ]\}}||d �qS )r r9 )ro rp r� r9 r9 r: � <dictcomp>& rr z#LRUCache.values.<locals>.<dictcomp>)�typingr r_ r� rI r9 r9 r: rl % s zLRUCache.valuesrN rO c C s" ||| � � gf| j|< | �� d S r= )r� r_ � _manage_sizerS r9 r9 r: rR ( s zLRUCache.__setitem__)� _LRUCache__vr- c C s | j |= d S r= r^ )rJ r� r9 r9 r: r , s zLRUCache.__delitem__c C s | j | j | j S r= )r� r� rI r9 r9 r: �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 y� Y qpY qp0 qpq W | j � � n | j � � 0 d S )NFr� T)rP �reverser )r� �acquirer� r� rh r� r� r� r_ rl �operator� itemgetterr� �release)rJ r� Z by_counterr� r9 r9 r: r� 3 s& � zLRUCache._manage_size)r� r� N)N)rW rX rY rZ r� r� re r� r r� r~ rm ri rl rR r �propertyr� r� r9 r9 r9 r: r� � s2 � � r� c @ s e Zd Zdd�dd�ZdS )�_CreateFuncTyper& rG c C s d S r= r9 rI r9 r9 r: �__call__L rr z_CreateFuncType.__call__N�rW rX rY r� r9 r9 r9 r: r� K s r� c @ s e Zd Zdd�dd�ZdS )�_ScopeFuncTyper rG c C s d S r= r9 rI r9 r9 r: r� P rr z_ScopeFuncType.__call__Nr� r9 r9 r9 r: r� O 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� )rJ r� r� r9 r9 r: re h s zScopedRegistry.__init__r" rG c C s> | � � }z | j| W S ty8 | j�|| �� � Y S 0 d S r= )r� r� r� � setdefaultr� r} r9 r9 r: r� y s zScopedRegistry.__call__r� c C s | � � | jv S )z9Return True if an object is present in the current scope.)r� r� rI r9 r9 r: �has� s zScopedRegistry.hasrN �rz r- c C s || j | �� < dS )z$Set the value for the current scope.N)r� r� �rJ rz r9 r9 r: r. � s zScopedRegistry.setc C s( z| j | �� = W n ty" Y n0 dS )z Clear the current scope, if any.N)r� r� r� rI r9 r9 r: r� � s zScopedRegistry.clearN) rW rX rY rZ r� r� re r� r� r. r� r9 r9 r9 r: r� S 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� )rJ r� r9 r9 r: re � s z ThreadLocalRegistry.__init__r" rG c C s6 z | j jW S ty0 | �� }| j _| Y S 0 d S r= )r� rQ r� r� )rJ r� r9 r9 r: r� � s z ThreadLocalRegistry.__call__r� c C s t | jd�S )NrQ )r� r� rI r9 r9 r: r� � s zThreadLocalRegistry.hasrN r� c C s || j _d S r= )r� rQ r� r9 r9 r: r. � s zThreadLocalRegistry.setc C s" z | j `W n ty Y n0 d S r= )r� rQ r� rI r9 r9 r: r� � s zThreadLocalRegistry.clearN) rW rX rY rZ re r� r� r. r� r9 r9 r9 r: r� � s r� 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 r� )N)N)N)WrZ � __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; rA r> rB r[ r\ r] r� r� r� rL 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� r9 r9 r9 r: �<module> s� 8 W " % � i@
| ver. 1.6 |
Github
|
.
| PHP 8.2.30 | ??????????? ?????????: 0 |
proxy
|
phpinfo
|
???????????