HEX

File: //usr/local/lib/python3.9/site-packages/celery/utils/__pycache__/collections.cpython-39.pyc
a

X>hXc�@s�dZddlZddlmZddlmZddlmZmZm	Z	m
Z
mZddlm
Z
mZmZddlmZmZddlmZdd	lmZmZmZmZd
dlmZmZd
dlmZzdd
lm Z!Wne"y�dZ!Yn0zddl#m$Z$m%Z%Wn&e"�yGdd�d�Z$e$Z%Yn0dZ&dZ'dd�Z(dd�Z)Gdd�de�ZGdd�d�Z*Gdd�de+e*�Z,Gdd�d�Z-e	�.e-�Gdd �d e	�Z/Gd!d"�d"e/e*�Z0Gd#d$�d$�Z1e
�.e1�Gd%d&�d&�Z2Gd'd(�d(e2�Z3e�.e3�Gd)d*�d*ee2�Z4dS)+z8Custom maps, sets, sequences, and other data structures.�N)�OrderedDict)�deque)�Callable�Mapping�MutableMapping�
MutableSet�Sequence)�heapify�heappop�heappush)�chain�count)�Empty)�Any�Dict�Iterable�List�)�first�uniq)�
match_case)�
reversed_dict)�
LazyObject�LazySettingsc@seZdZdS)rN)�__name__�
__module__�__qualname__�rr�B/usr/local/lib/python3.9/site-packages/celery/utils/collections.pyrsr)�AttributeDictMixin�
AttributeDict�	BufferMap�ChainMap�ConfigurationView�
DictAttribute�	Evictable�
LimitedSet�
Messagebufferr�
force_mapping�lpmergezK<{name}({size}): maxlen={0.maxlen}, expires={0.expires}, minlen={0.minlen}>cCs*t|ttf�r|j}t|t�s&t|�S|S)z?Wrap object into supporting the mapping interface if necessary.)�
isinstancerrZ_wrappedrr$��mrrrr('sr(cs |j��fdd�|��D�|S)zpIn place left precedent dictionary merge.

    Keeps values from `L`, if the value in `R` is :const:`None`.
    cs"g|]\}}|dur�||��qS�Nr)�.0�k�v��setitemrr�
<listcomp>6�zlpmerge.<locals>.<listcomp>)�__setitem__�items)�L�Rrr1rr)/sr)c@s<eZdZdZdd�Zeed�s8er.d
dd�Zn
ddd�Zd	S)rz#Dict where insertion order matters.cCstt|����Sr-)�next�iter�keys��selfrrr�_LRUkey=szOrderedDict._LRUkey�move_to_endTcCs|std��|�|�||<dS)Nzno last=True on PyPy)�NotImplementedError�pop)r=�key�lastrrrr?FszOrderedDict.move_to_endcCs�|j|}|d}|d}||d<||d<|j}|r^|d}||d<||d<||d<|d<n(|d}||d<||d<||d<|d<dS�Nrr)Z_OrderedDict__mapZ_OrderedDict__root)r=rBrC�linkZ	link_prevZ	link_next�rootZ
first_noderrrr?Qs
N)T)T)	rrr�__doc__r>�hasattr�_OrderedDict�_dict_is_orderedr?rrrrr:s
rc@s(eZdZdZdd�Zedd�dd�ZdS)rz[Mixin for Mapping interface that adds attribute access.

    I.e., `d.key -> d[key]`).
    cCs:z
||WSty4tt|�j�d|����Yn0dS)z`d.key -> d[key]`.z object has no attribute N)�KeyError�AttributeError�typer)r=r/rrr�__getattr__ks
�zAttributeDictMixin.__getattr__N)rB�returncCs|||<dS)z"`d[key] = value -> d.key = value`.Nr�r=rB�valuerrr�__setattr__tszAttributeDictMixin.__setattr__)rrrrGrN�strrRrrrrres	rc@seZdZdZdS)r z$Dict subclass with attribute access.N)rrrrGrrrrr ysr c@s�eZdZdZdZdd�Zdd�Zdd�Zdd	d
�Zddd�Z	d
d�Z
dd�Zdd�Zdd�Z
e
Zdd�Zdd�ZeZdd�ZeZeZe
ZeZdS)r$z[Dict interface to attributes.

    `obj[k] -> obj.k`
    `obj[k] = val -> obj.k = val`
    NcCst�|d|�dS)N�obj)�objectrR)r=rTrrr�__init__�szDictAttribute.__init__cCst|j|�Sr-)�getattrrT�r=rBrrrrN�szDictAttribute.__getattr__cCst|j||�Sr-��setattrrTrPrrrrR�szDictAttribute.__setattr__cCs&z
||WSty |YS0dSr-�rK�r=rB�defaultrrr�get�s
zDictAttribute.getcCs||vr|||<dSr-rr\rrr�
setdefault�szDictAttribute.setdefaultcCs.zt|j|�WSty(t|��Yn0dSr-)rWrTrLrKrXrrr�__getitem__�szDictAttribute.__getitem__cCst|j||�dSr-rYrPrrrr5�szDictAttribute.__setitem__cCst|j|�Sr-)rHrTrXrrr�__contains__�szDictAttribute.__contains__cCstt|j��Sr-)r:�dirrTr<rrr�
_iterate_keys�szDictAttribute._iterate_keyscCs|��Sr-�rcr<rrr�__iter__�szDictAttribute.__iter__ccs$|��D]}|t|j|�fVqdSr-�rcrWrTrXrrr�_iterate_items�szDictAttribute._iterate_itemsccs |��D]}t|j|�VqdSr-rfrXrrr�_iterate_values�szDictAttribute._iterate_values)N)N)rrrrGrTrVrNrRr^r_r`r5rarc�iterkeysrerg�	iteritemsrh�
itervaluesr6r;�valuesrrrrr$}s(

r$c@seZdZdZdZdZdZdZdZdd�Z	dd�Z
dd	�Zd
d�Zdd
�Z
dd�Zdd�Zdd�Zdd�Zd4dd�Zdd�Zdd�Zdd�Zdd�ZeZd5d d!�Zd"d#�Zd$d%�Zed&d'��Zd(d)�ZeZd*d+�Zd,d-�Z e Z!d.d/�Z"e"Z#d0d1�Z$e$Z%d2d3�Z&e Z'e"Z(e$Z)dS)6r"z!Key lookup on a sequence of maps.NrcOs:t|p
ig�}|jj|�d�||d|dd�gd�dS)N�key_trr)rm�maps�changes�defaults�
_observers)�list�__dict__�updater^)r=rn�kwargsrrrrV�s
�zChainMap.__init__cCs(t|�}|j�d|�|j�d|�dSrD)r(rp�insertrn)r=�drrr�add_defaults�szChainMap.add_defaultscGs@z|jdj|g|�R�WSty:td|����Yn0dS)Nrz$Key not found in the first mapping: )rnrArKr\rrrrA�s�zChainMap.popcCst|��dSr-r[rXrrr�__missing__�szChainMap.__missing__cCs|jdur|�|�S|Sr-)rmrXrrr�_key�sz
ChainMap._keyc	CsB|�|�}|jD]&}z||WSty4Yq0q|�|�Sr-)rzrnrKry)r=rBrz�mappingrrrr`�s

zChainMap.__getitem__cCs||j|�|�<dSr-�rorzrPrrrr5�szChainMap.__setitem__cCs8z|j|�|�=Wn ty2td|����Yn0dS)Nz Key not found in first mapping: )rorzrKrXrrr�__delitem__szChainMap.__delitem__cCs|j��dSr-�ro�clearr<rrrr	szChainMap.clearcCs,z||�|�WSty&|YS0dSr-)rzrKr\rrrr^
szChainMap.getcCstt�j|j��Sr-)�len�set�unionrnr<rrr�__len__szChainMap.__len__cCs|��Sr-rdr<rrrreszChainMap.__iter__cs"|����t�fdd�|jD��S)Nc3s|]}�|vVqdSr-r)r.r,�rBrr�	<genexpr>r4z(ChainMap.__contains__.<locals>.<genexpr>)rz�anyrnrXrr�rras
zChainMap.__contains__cCs
t|j�Sr-)r�rnr<rrr�__bool__ szChainMap.__bool__cCs|�|�}||vr|||<dSr-)rzr\rrrr_%s
zChainMap.setdefaultcOs0|jj|i|��}|jD]}||i|��q|Sr-)rortrq)r=�argsru�result�callbackrrrrt+s
zChainMap.updatecCsd�|d�tt|j���S)Nz{0.__class__.__name__}({1})z, )�format�join�map�reprrnr<rrr�__repr__2s�zChainMap.__repr__cGs|tj|g|�R��S)z?Create a ChainMap with a single dict created from the iterable.)�dict�fromkeys)�cls�iterabler�rrrr�7szChainMap.fromkeyscCs&|j|jd��g|jdd��R�SrD)�	__class__rn�copyr<rrrr�=sz
ChainMap.copycst�fdd�t|j�D��S)Nc3s|]}�|�VqdSr-r)r.rw��oprrr�Hr4z!ChainMap._iter.<locals>.<genexpr>)r�reversedrn)r=r�rr�r�_iterBszChainMap._itercCst|�dd���S)NcSs|��Sr-�r;)rwrrr�<lambda>Lr4z(ChainMap._iterate_keys.<locals>.<lambda>)rr�r<rrrrcJszChainMap._iterate_keyscs�fdd��D�S)Nc3s|]}|�|fVqdSr-r�r.rBr<rrr�Qr4z*ChainMap._iterate_items.<locals>.<genexpr>rr<rr<rrgOszChainMap._iterate_itemscs�fdd��D�S)Nc3s|]}�|VqdSr-rr�r<rrr�Vr4z+ChainMap._iterate_values.<locals>.<genexpr>rr<rr<rrhTszChainMap._iterate_valuescCs|j�|�dSr-)rq�append)r=r�rrr�bind_toYszChainMap.bind_to)N)N)*rrrrGrmrorprnrqrVrxrAryrzr`r5r}rr^r�rerar��__nonzero__r_rtr��classmethodr�r��__copy__r�rcrirgrjrhrkr�r;r6rlrrrrr"�sN



r"csheZdZdZd�fdd�	Zdd�Z�fdd�Zd	d
�Zdd�Zdd
d�Z	dd�Z
dd�Zdd�Z�Z
S)r#a�A view over an applications configuration dictionaries.

    Custom (but older) version of :class:`collections.ChainMap`.

    If the key does not exist in ``changes``, the ``defaults``
    dictionaries are consulted.

    Arguments:
        changes (Mapping): Map of configuration changes.
        defaults (List[Mapping]): List of dictionaries containing
            the default configuration.
    NcsJ|durgn|}t�j|g|�R�|jj|r<|�d�dn||d�dS)N�_)�prefix�_keys)�superrVrsrt�rstrip)r=rorpr;r��r�rrrVos�zConfigurationView.__init__cCs4|j}|r.|�|�s||n|}t||�|fS|fSr-)r��
startswithr)r=rBr��pkeyrrr�_to_keysxs
zConfigurationView._to_keysc	s�|���}t�j}||jr2t�fdd�|jD��ndD]&}z||�WSty\Yq80q8z|���WSty�t|�dkr�tdj|����Yn0dS)Nc3s|]}|��VqdSr-r)r.�fr�rrr��r4z0ConfigurationView.__getitem__.<locals>.<genexpr>rrz)Key not found: {0!r} (with prefix: {0!r}))	r�r�r`r��tuplerKryr�r�)r=rBr;�getitemr/r�r�rr`�s"
 ��zConfigurationView.__getitem__cCs||j|�|�<dSr-r|rPrrrr5�szConfigurationView.__setitem__cstd�fdd�|D��S)Nc3s|]}��|�VqdSr-)r^r�r<rrr��r4z*ConfigurationView.first.<locals>.<genexpr>)r)r=r;rr<rr�szConfigurationView.firstcCs&z
||WSty |YS0dSr-r[r\rrrr^�s
zConfigurationView.getcCs|j��dS)z&Remove all changes, but keep defaults.Nr~r<rrrr�szConfigurationView.clearcs"|�|��t�fdd�|jD��S)Nc3s$|]�t�fdd��D��VqdS)c3s|]}|�vVqdSr-r)r.r/r+rrr��r4z;ConfigurationView.__contains__.<locals>.<genexpr>.<genexpr>N)r�)r.r�r+rr��r4z1ConfigurationView.__contains__.<locals>.<genexpr>)r�r�rnrXrr�rra�s
zConfigurationView.__contains__cCs@|jd}|jd}|jj|||jd|jd|g|d�dS)Nrorprmr�)rorprmr�rn)rsrt)r=�otherrorprrr�	swap_with�s

�zConfigurationView.swap_with)NNN)N)rrrrGrVr�r`r5rr^rrar��
__classcell__rrr�rr#as
	
r#c@s�eZdZdZdZd*dd�Zdd�Zd	d
�Zdd�Zd+d
d�Z	dd�Z
dd�ZeZd,dd�Z
d-eed�dd�Zdd�Zdd�Zdd�Zdd�Zd d!�Zd"d#�Zd$d%�Zd&d'�ZeZed(d)��ZdS).r&a/Kind-of Set (or priority queue) with limitations.

    Good for when you need to test for membership (`a in set`),
    but the set should not grow unbounded.

    ``maxlen`` is enforced at all times, so if the limit is reached
    we'll also remove non-expired items.

    You can also configure ``minlen``: this is the minimal residual size
    of the set.

    All arguments are optional, and no limits are enabled by default.

    Arguments:
        maxlen (int): Optional max number of items.
            Adding more items than ``maxlen`` will result in immediate
            removal of items sorted by oldest insertion time.

        expires (float): TTL for all items.
            Expired items are purged as keys are inserted.

        minlen (int): Minimal residual size of this set.
            .. versionadded:: 4.0

            Value must be less than ``maxlen`` if both are configured.

            Older expired items will be deleted, only after the set
            exceeds ``minlen`` number of items.

        data (Sequence): Initial data to initialize set with.
            Can be an iterable of ``(key, value)`` pairs,
            a dict (``{key: insertion_time}``), or another instance
            of :class:`LimitedSet`.

    Example:
        >>> s = LimitedSet(maxlen=50000, expires=3600, minlen=4000)
        >>> for i in range(60000):
        ...     s.add(i)
        ...     s.add(str(i))
        ...
        >>> 57000 in s  # last 50k inserted values are kept
        True
        >>> '10' in s  # '10' did expire and was purged from set.
        False
        >>> len(s)  # maxlen is reached
        50000
        >>> s.purge(now=time.monotonic() + 7200)  # clock + 2 hours
        >>> len(s)  # now only minlen items are cached
        4000
        >>>> 57000 in s  # even this item is gone now
        False
    �rNcCs�|durdn||_|durdn||_|dur0dn||_i|_g|_|rP|�|�|j|jkrhdksrntd��|jdkr�td��dS)Nrz:minlen must be a positive number, less or equal to maxlen.zexpires cannot be negative!)�maxlen�minlen�expires�_data�_heaprt�
ValueError)r=r�r��datar�rrrrV�s
�
zLimitedSet.__init__cCs,dd�|j��D�|jdd�<t|j�dS)z=Time consuming recreating of heap.  Don't run this too often.cSsg|]}|�qSrr)r.�entryrrrr3r4z,LimitedSet._refresh_heap.<locals>.<listcomp>N)r�rlr�r	r<rrr�
_refresh_heapszLimitedSet._refresh_heapcCs|j|jkr|��dSr-)�_heap_overload�max_heap_percent_overloadr�r<rrr�_maybe_refresh_heap	szLimitedSet._maybe_refresh_heapcCs|j��g|jdd�<dS)z)Clear all data, start from scratch again.N)r�rr�r<rrrrs
zLimitedSet.clearcCs`|p
t��}||jvr |�|�||f}||j|<t|j|�|jr\t|j�|jkr\|��dS)z=Add a new item, or reset the expiry time of an existing item.N)	�time�	monotonicr��discardrr�r�r��purge)r=�item�nowr�rrr�adds


zLimitedSet.addcCs�|sdSt|t�r2|j�|j�|��|��nvt|t�r�|��D]L\}}t|tt	f�rb|d}t|t
�s�tdt|��d|����|�
||�qDn|D]}|�
|�q�dS)z8Update this set from other LimitedSet, dict or iterable.Nrz$Expecting float timestamp, got type z
 with value: )r*r&r�rtr�r�r�r6r�rr�floatr�rMr�)r=r�rB�insertedrTrrrrt s*



���zLimitedSet.updatecCs|j�|d�|��dSr-)r�rAr��r=r�rrrr�:szLimitedSet.discardcCs�|p
t��}t|t�r|�n|}|jr@t|j�|jkr@|��q&|jr�t|j�|j	krbdkr�nn(|j
d\}}||j|kr�q�|��qFdS)z�Check oldest items and remove them if needed.

        Arguments:
            now (float): Time of purging -- by default right now.
                This can be useful for unit testing.
        rN)r�r�r*rr�r�r�rAr�r�r�)r=r�Z
inserted_timer�rrrr�As
 zLimitedSet.purge)r]rOcCsB|jr>t|j�\}}z|j�|�Wnty6Yq0|Sq|S)z?Remove and return the oldest item, or :const:`None` when empty.)r�r
r�rArK)r=r]r�r�rrrrAVszLimitedSet.popcCsdd�|j��D�S)a6Whole set as serializable dictionary.

        Example:
            >>> s = LimitedSet(maxlen=200)
            >>> r = LimitedSet(maxlen=200)
            >>> for i in range(500):
            ...     s.add(i)
            ...
            >>> r.update(s.as_dict())
            >>> r == s
            True
        cSsi|]\}}||�qSrr)r.r�rBrrr�
<dictcomp>pr4z&LimitedSet.as_dict.<locals>.<dictcomp>)r�rlr<rrr�as_dictbszLimitedSet.as_dictcCs|j|jkSr-�r�)r=r�rrr�__eq__rszLimitedSet.__eq__cCstj|t|�jt|�d�S)N)�name�size)�REPR_LIMITED_SETr�rMrr�r<rrrr�vs�zLimitedSet.__repr__cCsdd�t|j���D�S)Ncss|]\}}|VqdSr-r)r.r��irrrr�~r4z&LimitedSet.__iter__.<locals>.<genexpr>)�sortedr�rlr<rrrre|szLimitedSet.__iter__cCs
t|j�Sr-)r�r�r<rrrr��szLimitedSet.__len__cCs
||jvSr-r�rXrrrra�szLimitedSet.__contains__cCs|j|j|j|��|jffSr-)r�r�r�r�r�r<rrr�
__reduce__�s�zLimitedSet.__reduce__cCs
t|j�Sr-)�boolr�r<rrrr��szLimitedSet.__bool__cCs"t|j�dtt|j�d�dS)z5Compute how much is heap bigger than data [percents].�dr)r�r��maxr�r<rrrr��szLimitedSet._heap_overload)rrNr)N)N)N)rrrrGr�rVr�r�rr�rtr�Z	pop_valuer�rrAr�r�r�rer�rar�r�r��propertyr�rrrrr&�s.5


r&c@sFeZdZdZeZdd�dd�Zdefedd�dd	�Zdd�d
d�Z	dS)r%z2Mixin for classes supporting the ``evict`` method.N�rOcCs|jtd�dS)z&Force evict until maxsize is enforced.)�rangeN)�_evictr
r<rrr�evict�szEvictable.evictr�)�limitrOcs2z�fdd�||�D�Wnty,Yn0dS)Ncsg|]}����qSr)�_evict1)r.r�r<rrr3�r4z$Evictable._evict.<locals>.<listcomp>)�
IndexError)r=r�r�rr<rr��szEvictable._evictcCs>|j|jkrt��z|��Wn|jy8t��Yn0dSr-)�_evictcount�maxsizer��
_pop_to_evictrr<rrrr��szEvictable._evict1)
rrrrGrr�r��intr�r�rrrrr%�s
r%c@s�eZdZdZeZdefdd�Zdd�Zdd�Zd	d
�Z	dd�Z
d
d�Zdd�Zdd�Z
ed�dd�Zdd�Zdd�Zedd��ZdS)r'zA buffer of pending messages.NcCs@||_||pg�|_|jj|_|jj|_|jj|_|jj|_	dSr-)
r�r�r��_append�popleft�_popr��_len�extend�_extend)r=r�r�rrrrrV�s


zMessagebuffer.__init__cCs|�|�|jo|��dSr-)r�r�r�r�rrr�put�s
zMessagebuffer.putcCs|�|�|jo|��dSr-)r�r�r�)r=�itrrrr��s
zMessagebuffer.extendcGs:z
|��WSty4|r(|dYS|���Yn0dS)Nr)r�r�r�r=r]rrr�take�s
zMessagebuffer.takecCs|��Sr-)r�r<rrrr��szMessagebuffer._pop_to_evictcCs$dt|�j�dt|��d|j�d�S�N�<z: �/�>)rMrr�r�r<rrrr��szMessagebuffer.__repr__ccs,z|��VWqty$Yq(Yq0qdSr-)r�r�r<rrrre�szMessagebuffer.__iter__cCs|��Sr-)r�r<rrrr��szMessagebuffer.__len__r�cCs
||jvSr-�r�r�rrrra�szMessagebuffer.__contains__cCs
t|j�Sr-)r�r�r<rrr�__reversed__�szMessagebuffer.__reversed__cCs
|j|Sr-r�)r=�indexrrrr`�szMessagebuffer.__getitem__cCst|�Sr-�r�r<rrrr��szMessagebuffer._evictcount)rrrrGrrrVr�r�r�r�r�rer�r�rar�r`r�r�rrrrr'�s		r'cs�eZdZdZeZeZdZdZdZ	d�fdd�	Z
dd�Zd	d
�Zdd�Z
d
d�Zdd�Zdd�Zdd�Zdd�Zedd��Z�ZS)r!zMap of buffers.Nr��cs@t���||_d|_|r$|�|�tdd�|��D��|_dS)Nr�css|]}t|�VqdSr-r�)r.�bufrrrr�r4z%BufferMap.__init__.<locals>.<genexpr>)r�rVr��
bufmaxsizert�sumr6�total)r=r�r�r�r�rrrVs

zBufferMap.__init__cCs:|�|��|�|jd7_|�|�|jo4|��dS)Nr)�_get_or_create_bufferr�r�r?r�r�)r=rBr�rrrr�s
z
BufferMap.putcCs4|�|��|�|jt|�7_|jo.|��dSr-)r�r�r�r�r�r�)r=rBr�rrrr�szBufferMap.extendcGs�d\}}z||}Wnty*d}Yn@0z|��}|jd8_Wn|jy^d}Yn0|�|�|r�|rz|dS|���|S)N)NFTrr)rKr�r�rr?)r=rBr]r��throwr�rrrr�s 


zBufferMap.takecCs6z
||WSty0|��}||<|YS0dSr-)rK�_new_buffer)r=rBr�rrrr�3s

zBufferMap._get_or_create_buffercCs|j|jd�S)N)r�)�Bufferr�r<rrrr�;szBufferMap._new_buffercGs||��j|�Sr-)r>r�r�rrr�_LRUpop?szBufferMap._LRUpopc
Cs�td�D]t}|��}||}z|��Wn"t|jfyJ|�|�Yq0|jd8_t|�sn|�|�n
|�|�q~qdS)Nr�r)	r�r>r�r�rrAr�r�r?)r=r�rBr�rrrr�Cs
zBufferMap._pop_to_evictcCs"dt|�j�d|j�d|j�d�Sr�)rMrr�r�r<rrrr�XszBufferMap.__repr__cCs|jSr-)r�r<rrrr�\szBufferMap._evictcount)Nr�)rrrrGr'r�rr�r�r�rVr�r�r�r�r�r�r�r�r�r�r�rrr�rr!�s"	r!)5rGr��collectionsrrIr�collections.abcrrrrr�heapqr	r
r�	itertoolsrr
�queuer�typingrrrrZ
functionalrr�textrZ__pypy__rrJ�ImportErrorZdjango.utils.functionalrr�__all__r�r(r)rr�r r$�registerr"r#r&r%r'r!rrrr�<module>sL

+J
Xa
F