o DfXc@sdZddlZddlmZddlmZddlmZmZm Z m Z m Z ddl m Z mZmZddlmZmZddlmZdd lmZmZmZmZd d lmZmZd d lmZzdd lm Z!Wn e"yedZ!Ynwz ddl#m$Z$m%Z%Wne"yGdddZ$e$Z%YnwdZ&dZ'ddZ(ddZ)GdddeZGdddZ*Gddde+e*Z,GdddZ-e .e-Gdd d e Z/Gd!d"d"e/e*Z0Gd#d$d$Z1e .e1Gd%d&d&Z2Gd'd(d(e2Z3e .e3Gd)d*d*ee2Z4dS)+z8Custom maps, sets, sequences, and other data structures.N) OrderedDict)deque)CallableMappingMutableMapping MutableSetSequence)heapifyheappopheappush)chaincount)Empty)AnyDictIterableList)firstuniq) match_case) reversed_dict) LazyObject LazySettingsc@s eZdZdS)rN)__name__ __module__ __qualname__rrQ/home/ubuntu/webapp/venv/lib/python3.10/site-packages/celery/utils/collections.pyrsr) AttributeDictMixin AttributeDict BufferMapChainMapConfigurationView DictAttribute Evictable LimitedSet Messagebufferr force_mappinglpmergezK<{name}({size}): maxlen={0.maxlen}, expires={0.expires}, minlen={0.minlen}>cCs*t|ttfr |j}t|tst|S|S)z?Wrap object into supporting the mapping interface if necessary.) isinstancerr_wrappedrr$mrrrr('sr(cs |jfdd|D|S)zpIn place left precedent dictionary merge. Keeps values from `L`, if the value in `R` is :const:`None`. cs"g|] \}}|dur||qSNr).0kvsetitemrr 6s"zlpmerge..) __setitem__items)LRrr2rr)/sr)c@sBeZdZdZddZeedserd ddZd Sd ddZd Sd S) rz#Dict where insertion order matters.cCstt|Sr.)nextiterkeysselfrrr_LRUkey=szOrderedDict._LRUkey move_to_endTcCs|std||||<dS)Nzno last=True on PyPy)NotImplementedErrorpop)r=keylastrrrr?FszOrderedDict.move_to_endcCs|j|}|d}|d}||d<||d<|j}|r0|d}||d<||d<||d<|d<dS|d}||d<||d<||d<|d<dSNrr)_OrderedDict__map_OrderedDict__root)r=rBrClink link_prev link_nextroot first_noderrrr?Qs N)T) rrr__doc__r>hasattr _OrderedDict_dict_is_orderedr?rrrrr:s  rc@s*eZdZdZddZdeddfddZdS) rz[Mixin for Mapping interface that adds attribute access. I.e., `d.key -> d[key]`). cCs2z||WStytt|jd|w)z`d.key -> d[key]`.z object has no attribute )KeyErrorAttributeErrortyper)r=r0rrr __getattr__ks  zAttributeDictMixin.__getattr__rBreturnNcCs |||<dS)z"`d[key] = value -> d.key = value`.Nrr=rBvaluerrr __setattr__t zAttributeDictMixin.__setattr__)rrrrLrSstrrWrrrrres rc@seZdZdZdS)r z$Dict subclass with attribute access.N)rrrrLrrrrr ysr c@seZdZdZdZddZddZddZdd d Zdd d Z d dZ ddZ ddZ ddZ e ZddZddZeZddZeZeZe ZeZdS)r$z[Dict interface to attributes. `obj[k] -> obj.k` `obj[k] = val -> obj.k = val` NcCst|d|dS)Nobj)objectrW)r=rZrrr__init__zDictAttribute.__init__cC t|j|Sr.)getattrrZr=rBrrrrSrXzDictAttribute.__getattr__cCst|j||Sr.setattrrZrUrrrrWzDictAttribute.__setattr__cC"z||WSty|YSwr.rPr=rBdefaultrrrget   zDictAttribute.getcCs||vr |||<dSdSr.rrfrrr setdefaults zDictAttribute.setdefaultcCs&zt|j|WStyt|wr.)r_rZrQrPr`rrr __getitem__s  zDictAttribute.__getitem__cCst|j||dSr.rarUrrrr5r]zDictAttribute.__setitem__cCr^r.)rMrZr`rrr __contains__rXzDictAttribute.__contains__cCstt|jSr.)r:dirrZr<rrr _iterate_keysrczDictAttribute._iterate_keyscC|Sr.rnr<rrr__iter__zDictAttribute.__iter__ccs&|D] }|t|j|fVqdSr.rnr_rZr`rrr_iterate_itemss zDictAttribute._iterate_itemsccs"|D] }t|j|VqdSr.rsr`rrr_iterate_valuess zDictAttribute._iterate_valuesr.)rrrrLrZr\rSrWrhrjrkr5rlrniterkeysrqrt iteritemsru itervaluesr6r;valuesrrrrr$}s*  r$c@s eZdZdZdZdZdZdZdZddZ ddZ dd Z d d Z d d Z ddZddZddZddZd4ddZddZddZddZddZeZd4d d!Zd"d#Zd$d%Zed&d'Zd(d)ZeZd*d+Zd,d-Z e Z!d.d/Z"e"Z#d0d1Z$e$Z%d2d3Z&e Z'e"Z(e$Z)dS)5r"z!Key lookup on a sequence of maps.NrcOs:t|pig}|jj|d||d|ddgddS)Nkey_trr)rzmapschangesdefaults _observers)list__dict__updaterh)r=r{kwargsrrrr\s  zChainMap.__init__cCs(t|}|jd||jd|dSrD)r(r}insertr{)r=drrr add_defaultsszChainMap.add_defaultscGs8z |jdj|g|RWStytd|w)Nrz$Key not found in the first mapping: )r{rArPrfrrrrAs z ChainMap.popcCst|r.rer`rrr __missing__rrzChainMap.__missing__cCs|jdur ||S|Sr.)rzr`rrr_keyz ChainMap._keyc Cs@||}|jD]}z||WStyYqw||Sr.)rr{rPr)r=rBrmappingrrrrks    zChainMap.__getitem__cC||j||<dSr.r|rrUrrrr5zChainMap.__setitem__cCs2z |j||=WdStytd|w)Nz Key not found in first mapping: )r|rrPr`rrr __delitem__s  zChainMap.__delitem__cCs|jdSr.r|clearr<rrrr rczChainMap.clearcCs(z|||WSty|YSwr.)rrPrfrrrrh s  z ChainMap.getcCsttj|jSr.)lensetunionr{r<rrr__len__r]zChainMap.__len__cCror.rpr<rrrrqszChainMap.__iter__cs"|tfdd|jDS)Nc3s|]}|vVqdSr.r)r/r-rBrr z(ChainMap.__contains__..)ranyr{r`rrrrl zChainMap.__contains__cC t|jSr.)rr{r<rrr__bool__  zChainMap.__bool__cCs"||}||vr|||<dSdSr.)rrfrrrrj%s  zChainMap.setdefaultcOs0|jj|i|}|jD] }||i|q |Sr.)r|rr~)r=argsrresultcallbackrrrr+s zChainMap.updatecCsd|dtt|jS)Nz{0.__class__.__name__}({1})z, )formatjoinmapreprr{r<rrr__repr__2szChainMap.__repr__cGs|tj|g|RS)z?Create a ChainMap with a single dict created from the iterable.)dictfromkeys)clsiterablerrrrr7szChainMap.fromkeyscCs&|j|jdg|jddRSrD) __class__r{copyr<rrrr=s&z ChainMap.copycstfddt|jDS)Nc3s|]}|VqdSr.r)r/roprrrHrz!ChainMap._iter..)r reversedr{)r=rrrr_iterBszChainMap._itercCst|ddS)NcSror.r;)rrrrLsz(ChainMap._iterate_keys..)rrr<rrrrnJr]zChainMap._iterate_keyscfddDS)Nc3s|] }||fVqdSr.rr/rBr<rrrQsz*ChainMap._iterate_items..rr<rr<rrtOr]zChainMap._iterate_itemscr)Nc3s|]}|VqdSr.rrr<rrrVrz+ChainMap._iterate_values..rr<rr<rruTr]zChainMap._iterate_valuescCs|j|dSr.)r~append)r=rrrrbind_toYszChainMap.bind_tor.)*rrrrLrzr|r}r{r~r\rrArrrkr5rrrhrrqrlr __nonzero__rjrr classmethodrr__copy__rrnrvrtrwrurxrr;r6ryrrrrr"sP     r"csheZdZdZdfdd ZddZfddZd d Zd d Zdd dZ ddZ ddZ ddZ Z S)r#aA 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|}tj|g|R|jj|r|ddn||ddS)N_)prefix_keys)superr\rrrstrip)r=r|r}r;rrrrr\os  zConfigurationView.__init__cCs4|j}|r||s||n|}t|||fS|fSr.)r startswithr)r=rBrpkeyrrr_to_keysxs zConfigurationView._to_keysc s|}tj}||jrtfdd|jDndD]}z||WSty.Yqwz|WStyJt|dkrItdj|w)Nc3s|]}|VqdSr.r)r/frrrrrz0ConfigurationView.__getitem__..rrz)Key not found: {0!r} (with prefix: {0!r})) rrrkrtuplerPrrr)r=rBr;getitemr0rrrrks&      zConfigurationView.__getitem__cCrr.rrUrrrr5rzConfigurationView.__setitem__cstdfdd|DS)Nc3s|]}|VqdSr.)rhrr<rrrsz*ConfigurationView.first..)r)r=r;rr<rrrzConfigurationView.firstcCrdr.rerfrrrrhrizConfigurationView.getcCs|jdS)z&Remove all changes, but keep defaults.Nrr<rrrrszConfigurationView.clearcs"||tfdd|jDS)Nc3s&|]tfddDVqdS)c3s|]}|vVqdSr.r)r/r0r,rrrrz;ConfigurationView.__contains__...N)r)r/rr,rrs$z1ConfigurationView.__contains__..)rrr{r`rrrrlrzConfigurationView.__contains__cCs@|jd}|jd}|jj|||jd|jd|g|ddS)Nr|r}rzr)r|r}rzrr{)rr)r=otherr|r}rrr swap_withs   zConfigurationView.swap_with)NNNr.)rrrrLr\rrkr5rrhrrlr __classcell__rrrrr#as   r#c@seZdZdZdZd+ddZddZd d Zd d Zd,d dZ ddZ ddZ e Z d,ddZ d,dedefddZddZddZddZdd 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||_|durdn||_i|_g|_|r(|||j|jkr7dks.N)rryrr r<rrr _refresh_heapszLimitedSet._refresh_heapcCs|j|jkr |dSdSr.)_heap_overloadmax_heap_percent_overloadrr<rrr_maybe_refresh_heap s  zLimitedSet._maybe_refresh_heapcCs|jg|jdd<dS)z)Clear all data, start from scratch again.N)rrrr<rrrrs zLimitedSet.clearcCsh|pt}||jvr||||f}||j|<t|j||jr0t|j|jkr2|dSdSdS)z=Add a new item, or reset the expiry time of an existing item.N) time monotonicrdiscardr rrrpurge)r=itemnowrrrradds      zLimitedSet.addcCs|sdSt|tr|j|j||dSt|trL|D]&\}}t|tt fr2|d}t|t sCt dt |d|| ||q#dS|D]}| |qNdS)z8Update this set from other LimitedSet, dict or iterable.Nrz$Expecting float timestamp, got type z with value: )r*r&rrrrrr6rrfloatrrRr)r=rrBinsertedrZrrrr s.     zLimitedSet.updatecCs|j|d|dSr.)rrArr=rrrrr:s zLimitedSet.discardcCs|pt}t|tr|n|}|jr't|j|jkr'|t|j|jks|jrat|j|j kr8dkrcndS|j d\}}||j|krKdS|t|j|j kr^dks;dSdSdSdS)zCheck 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) rrr*rrrrrArrr)r=r inserted_timerrrrrAs "$zLimitedSet.purgergrTcCsD|jr t|j\}}z |j|W|StyYnw|js|S)z?Remove and return the oldest item, or :const:`None` when empty.)rr rrArP)r=rgrrrrrrAVs zLimitedSet.popcCsdd|jDS)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/rrBrrr psz&LimitedSet.as_dict..)rryr<rrras_dictbszLimitedSet.as_dictcCs |j|jkSr.r)r=rrrr__eq__rrXzLimitedSet.__eq__cCstj|t|jt|dS)N)namesize)REPR_LIMITED_SETrrRrrr<rrrrvszLimitedSet.__repr__cCsddt|jDS)Ncss|]\}}|VqdSr.r)r/rirrrr~rz&LimitedSet.__iter__..)sortedrryr<rrrrq|rzLimitedSet.__iter__cCrr.)rrr<rrrrrzLimitedSet.__len__cC ||jvSr.rr`rrrrlrzLimitedSet.__contains__cCs|j|j|j||jffSr.)rrrrrr<rrr __reduce__szLimitedSet.__reduce__cCrr.)boolrr<rrrrrzLimitedSet.__bool__cCs"t|jdtt|jddS)z5Compute how much is heap bigger than data [percents].dr)rrmaxrr<rrrrs"zLimitedSet._heap_overload)rrNrr.)rrrrLrr\rrrrrr pop_valuerrrArrrrqrrlrrrpropertyrrrrrr&s05     r&c@s@eZdZdZeZd ddZdefdeddfdd Zd d d Z dS) r%z2Mixin for classes supporting the ``evict`` method.rTNcCs|jtddS)z&Force evict until maxsize is enforced.)rangeN)_evictr r<rrrevictszEvictable.evictrlimitcs2zfdd||DWdStyYdSw)Ncsg|]}qSr)_evict1)r/rr<rrr4sz$Evictable._evict..) IndexError)r=rrrr<rrs  zEvictable._evictcCs8|j|jkr tz|WdS|jytwr.) _evictcountmaxsizer _pop_to_evictrr<rrrrs zEvictable._evict1)rTN) rrrrLrrrintrrrrrrr%s  r%c@seZdZdZeZdefddZddZddZd d Z d d Z d dZ ddZ ddZ defddZddZddZeddZdS)r'zA buffer of pending messages.NcCs@||_||pg|_|jj|_|jj|_|jj|_|jj|_ dSr.) rrr_appendpopleft_popr_lenextend_extend)r=rrrrrrr\s    zMessagebuffer.__init__cC"|||jo|dSdSr.)rrrrrrrputrzMessagebuffer.putcCrr.)rrr)r=itrrrrrzMessagebuffer.extendcGs2z|WSty|r|dYS|w)Nr)rrrr=rgrrrtakes   zMessagebuffer.takecCror.)rr<rrrrrrzMessagebuffer._pop_to_evictcCs$dt|jdt|d|jdSN)rRrrrr<rrrrs$zMessagebuffer.__repr__ccs* z|VWn tyYdSwqr.)rrr<rrrrqs zMessagebuffer.__iter__cCror.)rr<rrrrrrzMessagebuffer.__len__rTcCrr.rrrrrrls zMessagebuffer.__contains__cCrr.)rrr<rrr __reversed__rzMessagebuffer.__reversed__cCs |j|Sr.r)r=indexrrrrkrzMessagebuffer.__getitem__cCst|Sr.rr<rrrrszMessagebuffer._evictcount)rrrrLrrr\rrrrrrqrrrlrrkrrrrrrr's   r'cseZdZdZeZeZdZdZdZ dfdd Z ddZ d d Z d d Z d dZddZddZddZddZeddZZS)r!zMap of buffers.Nrcs@t||_d|_|r||tdd|D|_dS)Nr css|]}t|VqdSr.r )r/bufrrrrrz%BufferMap.__init__..)rr\r bufmaxsizersumr6total)r=rrr rrrr\s  zBufferMap.__init__cCs@||||jd7_|||jo|dSdS)Nr)_get_or_create_bufferrrr?rr)r=rBrrrrrs z BufferMap.putcCs:||||jt|7_|jo|dSdSr.)rrrrrr)r=rBrrrrrszBufferMap.extendcGsd\}}z||}Wn tyd}Yn wz |}|jd8_Wn |jy/d}Ynw|||rA|r=|dS||S)N)NFTrr)rPrrrr?)r=rBrgrthrowr rrrrs$   zBufferMap.takecCs2z||WSty|}||<|YSwr.)rP _new_buffer)r=rBr rrrr3s   zBufferMap._get_or_create_buffercCs|j|jdS)N)r)Bufferr r<rrrr;rczBufferMap._new_buffercGs||j|Sr.)r>rrrrr_LRUpop?r]zBufferMap._LRUpopc CstdD]<}|}||}z|Wnt|jfy%||Yqw|jd8_t|s9||dS||dSdS)Nrr) rr>rrrrArrr?)r=rrBr rrrrCs    zBufferMap._pop_to_evictcCs"dt|jd|jd|jdSr)rRrrrr<rrrrXs"zBufferMap.__repr__cCs|jSr.)rr<rrrr\szBufferMap._evictcount)Nr )rrrrLr'rrrrr r\rrrrrrrrrrrrrrrr!s$ r!)5rLr collectionsrrNrcollections.abcrrrrrheapqr r r itertoolsr r queuertypingrrrr functionalrrtextr__pypy__rrO ImportErrordjango.utils.functionalrr__all__rr(r)rrr r$registerr"r#r&r%r'r!rrrrsR       + JX a F