a xd0d@sdZddlZddlmZddlmZddlmZmZm Z m Z m Z ddl m Z mZmZddlmZmZddlmZd d lmZmZd d lmZzdd lmZWneydZYn0zdd lmZm Z Wn$eyGdddZeZ Yn0dZ!dZ"ddZ#ddZ$GdddeZGdddZ%Gddde&e%Z'GdddZ(e )e(Gddde Z*Gd d!d!e*e%Z+Gd"d#d#Z,e )e,Gd$d%d%Z-Gd&d'd'e-Z.e )e.Gd(d)d)ee-Z/dS)*z8Custom maps, sets, sequences, and other data structures.N) OrderedDict)deque)CallableMappingMutableMapping MutableSetSequence)heapifyheappopheappush)chaincount)Empty)firstuniq) match_case) reversed_dict) LazyObject LazySettingsc@s eZdZdS)rN)__name__ __module__ __qualname__rrP/var/www/html/Ranjet/env/lib/python3.9/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|ts&t|S|S)z?Wrap object into supporting the mapping interface if necessary.) isinstancerrZ_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 6zlpmerge..) __setitem__items)LRrr-rr%/sr%c@s<eZdZdZddZeeds8er.d ddZn d ddZd S) rz#Dict where insertion order matters.cCstt|Sr))nextiterkeysselfrrr_LRUkey=szOrderedDict._LRUkey move_to_endTcCs|s td||||<dS)Nzno last=True on PyPy)NotImplementedErrorpop)r9keylastrrrr;FszOrderedDict.move_to_endcCs|j|}|d}|d}||d<||d<|j}|r^|d}||d<||d<||d<|d<n(|d}||d<||d<||d<|d<dSNrr)Z_OrderedDict__mapZ_OrderedDict__root)r9r>r?linkZ link_prevZ link_nextrootZ first_noderrrr;Qs N)T)T) rrr__doc__r:hasattr _OrderedDict_dict_is_orderedr;rrrrr:s   rc@s eZdZdZddZddZdS)rz[Mixin for Mapping interface that adds attribute access. I.e., `d.key -> d[key]`). cCs:z ||WSty4tt|jd|Yn0dS)z`d.key -> d[key]`.z object has no attribute N)KeyErrorAttributeErrortyper)r9r+rrr __getattr__ks   zAttributeDictMixin.__getattr__cCs |||<dS)z"`d[key] = value -> d.key = value`.Nrr9r>valuerrr __setattr__tszAttributeDictMixin.__setattr__N)rrrrCrJrMrrrrres rc@seZdZdZdS)rz$Dict subclass with attribute access.N)rrrrCrrrrrzsrc@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)objectrM)r9rNrrr__init__szDictAttribute.__init__cCs t|j|Sr))getattrrNr9r>rrrrJszDictAttribute.__getattr__cCst|j||Sr)setattrrNrKrrrrMszDictAttribute.__setattr__cCs&z ||WSty |YS0dSr)rGr9r>defaultrrrgets  zDictAttribute.getcCs||vr|||<dSr)rrVrrr setdefaultszDictAttribute.setdefaultcCs.zt|j|WSty(t|Yn0dSr))rQrNrHrGrRrrr __getitem__s zDictAttribute.__getitem__cCst|j||dSr)rSrKrrrr1szDictAttribute.__setitem__cCs t|j|Sr))rDrNrRrrr __contains__szDictAttribute.__contains__cCstt|jSr))r6dirrNr8rrr _iterate_keysszDictAttribute._iterate_keyscCs|Sr)r]r8rrr__iter__szDictAttribute.__iter__ccs$|D]}|t|j|fVqdSr)r]rQrNrRrrr_iterate_itemss zDictAttribute._iterate_itemsccs |D]}t|j|VqdSr)r`rRrrr_iterate_valuess zDictAttribute._iterate_values)N)N)rrrrCrNrPrJrMrXrYrZr1r[r]iterkeysr_ra iteritemsrb itervaluesr2r7valuesrrrrr ~s(  r c@s eZdZdZdZdZdZdZgZddZ ddZ ddZ d d Z d d Z d dZddZddZddZd3ddZddZddZddZddZeZd4dd Zd!d"Zd#d$Zed%d&Zd'd(ZeZd)d*Zd+d,Z e Z!d-d.Z"e"Z#d/d0Z$e$Z%d1d2Z&e Z'e"Z(e$Z)dS)5rz!Key lookup on a sequence of maps.NcOs8t|p ig}|jj|d||d|ddddS)Nkey_trr)rgmapschangesdefaults)list__dict__updaterX)r9rhkwargsrrrrPs zChainMap.__init__cCs(t|}|jd||jd|dSr@)r$rjinsertrh)r9drrr add_defaultsszChainMap.add_defaultscGs@z|jdj|g|RWSty:td|Yn0dS)Nrz$Key not found in the first mapping: )rhr=rGrVrrrr=s  z ChainMap.popcCs t|dSr)rUrRrrr __missing__szChainMap.__missing__cCs|jdur||S|Sr))rgrRrrr_keysz ChainMap._keyc CsB||}|jD]&}z||WSty4Yq0q||Sr))rsrhrGrr)r9r>rsmappingrrrrZs   zChainMap.__getitem__cCs||j||<dSr)rirsrKrrrr1szChainMap.__setitem__cCs8z|j||=Wn ty2td|Yn0dS)Nz Key not found in first mapping: )rirsrGrRrrr __delitem__s zChainMap.__delitem__cCs|jdSr)riclearr8rrrrx szChainMap.clearcCs,z|||WSty&|YS0dSr))rsrGrVrrrrX s z ChainMap.getcCsttj|jSr))lensetunionrhr8rrr__len__szChainMap.__len__cCs|Sr)r^r8rrrr_szChainMap.__iter__cs"|tfdd|jDS)Nc3s|]}|vVqdSr)r)r*r(r>rr r0z(ChainMap.__contains__..)rsanyrhrRrr}rr[s zChainMap.__contains__cCs t|jSr))rrhr8rrr__bool__ szChainMap.__bool__cCs||}||vr|||<dSr))rsrVrrrrY%s zChainMap.setdefaultcOs0|jj|i|}|jD]}||i|q|Sr))rirm _observers)r9argsrnresultcallbackrrrrm+s zChainMap.updatecCsd|dtt|jS)Nz{0.__class__.__name__}({1})z, )formatjoinmapreprrhr8rrr__repr__2szChainMap.__repr__cGs|tj|g|RS)z?Create a ChainMap with a single dict created from the iterable.)dictfromkeys)clsiterablerrrrr7szChainMap.fromkeyscCs&|j|jdg|jddRSr@) __class__rhcopyr8rrrr=sz ChainMap.copycstfddt|jDS)Nc3s|]}|VqdSr)r)r*rpoprrr~Hr0z!ChainMap._iter..)r reversedrh)r9rrrr_iterBszChainMap._itercCst|ddS)NcSs|Sr)r7)rprrrLr0z(ChainMap._iterate_keys..)rrr8rrrr]JszChainMap._iterate_keyscsfddDS)Nc3s|]}||fVqdSr)rr*r>r8rrr~Qr0z*ChainMap._iterate_items..rr8rr8rraOszChainMap._iterate_itemscsfddDS)Nc3s|]}|VqdSr)rrr8rrr~Vr0z+ChainMap._iterate_values..rr8rr8rrbTszChainMap._iterate_valuescCs|j|dSr))rappend)r9rrrrbind_toYszChainMap.bind_to)N)N)*rrrrCrgrirjrhrrPrqr=rrrsrZr1rvrxrXr|r_r[r __nonzero__rYrmr classmethodrr__copy__rr]rcrardrbrerr7r2rfrrrrrsN     rcsheZdZdZdfdd ZddZfddZd d Zd d Zdd dZ ddZ ddZ ddZ Z S)raA 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|dur gn|}tj|g|R|jj|r<|ddn||ddS)N_)prefix_keys)superrPrlrmrstrip)r9rirjr7rrrrrPos zConfigurationView.__init__cCs4|j}|r.||s||n|}t|||fS|fSr))r startswithr)r9r>rZpkeyrrr_to_keysxs zConfigurationView._to_keysc s|}tj}||jr2tfdd|jDndD]&}z||WSty\Yq80q8z |WStyt|dkrtdj|Yn0dS)Nc3s|]}|VqdSr)r)r*fr}rrr~r0z0ConfigurationView.__getitem__..rrz)Key not found: {0!r} (with prefix: {0!r})) rrrZrtuplerGrrryr)r9r>r7getitemr+rr}rrZs"      zConfigurationView.__getitem__cCs||j||<dSr)rurKrrrr1szConfigurationView.__setitem__cstdfdd|DS)Nc3s|]}|VqdSr))rXrr8rrr~r0z*ConfigurationView.first..)r)r9r7rr8rrszConfigurationView.firstcCs&z ||WSty |YS0dSr)rUrVrrrrXs  zConfigurationView.getcCs|jdS)z&Remove all changes, but keep defaults.Nrwr8rrrrxszConfigurationView.clearcs"||tfdd|jDS)Nc3s$|]tfddDVqdS)c3s|]}|vVqdSr)r)r*r+r'rrr~r0z;ConfigurationView.__contains__...N)r)r*rr'rr~r0z1ConfigurationView.__contains__..)rrrhrRrrrr[s zConfigurationView.__contains__cCs@|jd}|jd}|jj|||jd|jd|g|ddS)Nrirjrgr)rirjrgrrh)rlrm)r9otherrirjrrr swap_withs  zConfigurationView.swap_with)NNN)N)rrrrCrPrrZr1rrXrxr[r __classcell__rrrrras    rc@seZdZdZdZd+ddZddZd d Zd d Zd,d dZ ddZ ddZ e Z d-ddZ d.ddZddZddZddZddZdd 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|dur dn||_|durdn||_|dur0dn||_i|_g|_|rP|||j|jkrhdksrntd|jdkrtddS)Nrz:minlen must be a positive number, less or equal to maxlen.zexpires cannot be negative!)maxlenminlenexpires_data_heaprm ValueError)r9rrdatarrrrrPs  zLimitedSet.__init__cCs,dd|jD|jdd<t|jdS)z=Time consuming recreating of heap. Don't run this too often.cSsg|]}|qSrr)r*entryrrrr/r0z,LimitedSet._refresh_heap..N)rrfrr r8rrr _refresh_heapszLimitedSet._refresh_heapcCs|j|jkr|dSr))_heap_overloadmax_heap_percent_overloadrr8rrr_maybe_refresh_heap s zLimitedSet._maybe_refresh_heapcCs|jg|jdd<dS)z)Clear all data, start from scratch again.N)rrxrr8rrrrxs 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 monotonicrdiscardr rrrypurge)r9itemnowrrrradds     zLimitedSet.addcCs|sdSt|tr2|j|j||nvt|tr|D]L\}}t|tt frb|d}t|t st dt |d|| ||qDn|D]}| |qdS)z8Update this set from other LimitedSet, dict or iterable.Nrz$Expecting float timestamp, got type z with value: )r&r"rrmrrrr2rrkfloatrrIr)r9rr>insertedrNrrrrm s*    zLimitedSet.updatecCs|j|d|dSr))rr=rr9rrrrr:szLimitedSet.discardcCs|p t}t|tr|n|}|jr@t|j|jkr@|q&|jrt|j|j krbdkrnn(|j d\}}||j|krq|qFdS)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&rrryrr=rrr)r9rZ inserted_timerrrrrAs   zLimitedSet.purgecCsB|jr>t|j\}}z|j|Wnty6Yq0|Sq|S)z?Remove and return the oldest item, or :const:`None` when empty.)rr rr=rG)r9rWrrrrrr=Vs 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*rr>rrr qr0z&LimitedSet.as_dict..)rrfr8rrras_dictcszLimitedSet.as_dictcCs |j|jkSr)rr9rrrr__eq__sszLimitedSet.__eq__cCs || Sr))rrrrr__ne__wszLimitedSet.__ne__cCstj|t|jt|dS)N)namesize)REPR_LIMITED_SETrrIrryr8rrrr{szLimitedSet.__repr__cCsddt|jDS)Ncss|]\}}|VqdSr)r)r*rirrrr~r0z&LimitedSet.__iter__..)sortedrrfr8rrrr_szLimitedSet.__iter__cCs t|jSr))ryrr8rrrr|szLimitedSet.__len__cCs ||jvSr)rrRrrrr[szLimitedSet.__contains__cCs|j|j|j||jffSr))rrrrrr8rrr __reduce__szLimitedSet.__reduce__cCs t|jSr))boolrr8rrrrszLimitedSet.__bool__cCs"t|jdtt|jddS)z5Compute how much is heap bigger than data [percents].dr)ryrmaxrr8rrrrszLimitedSet._heap_overload)rrNr)N)N)N)rrrrCrrPrrrxrrmrZ pop_valuerr=rrrrr_r|r[rrrpropertyrrrrrr"s05    r"c@s2eZdZdZeZddZdefddZddZd S) r!z2Mixin for classes supporting the ``evict`` method.cCs|jtddS)z&Force evict until maxsize is enforced.)rangeN)_evictr r8rrrevictszEvictable.evictrcs2zfdd||DWnty,Yn0dS)Ncsg|] }qSr)_evict1)r*rr8rrr/r0z$Evictable._evict..) IndexError)r9limitrrr8rrs zEvictable._evictcCs>|j|jkrtz |Wn|jy8tYn0dSr)) _evictcountmaxsizer _pop_to_evictrr8rrrrs   zEvictable._evict1N) rrrrCrrrrrrrrrr!s r!c@s~eZdZdZeZdefddZddZddZd d Z d d Z d dZ ddZ ddZ ddZddZddZeddZdS)r#zA buffer of pending messages.NcCs@||_||pg|_|jj|_|jj|_|jj|_|jj|_ dSr)) rrr_appendpopleft_popr|_lenextend_extend)r9rrrrrrrPs    zMessagebuffer.__init__cCs|||jo|dSr))rrrrrrrputs zMessagebuffer.putcCs|||jo|dSr))rrr)r9itrrrrs zMessagebuffer.extendcGs:z |WSty4|r(|dYS|Yn0dS)Nr)rrrr9rWrrrtakes    zMessagebuffer.takecCs|Sr))rr8rrrrszMessagebuffer._pop_to_evictcCs$dt|jdt|d|jdSN)rIrryrr8rrrrszMessagebuffer.__repr__ccs,z|VWqty$Yq(Yq0qdSr))rrr8rrrr_s zMessagebuffer.__iter__cCs|Sr))rr8rrrr|szMessagebuffer.__len__cCs ||jvSr)rrrrrr[szMessagebuffer.__contains__cCs t|jSr))rrr8rrr __reversed__szMessagebuffer.__reversed__cCs |j|Sr)r)r9indexrrrrZszMessagebuffer.__getitem__cCst|Sr)ryr8rrrrszMessagebuffer._evictcount)rrrrCrrrPrrrrrr_r|r[rrZrrrrrrr#s  r#cseZdZdZeZeZdZdZdZ dfdd Z ddZ d d Z d d Z d dZddZddZddZddZeddZZS)rzMap of buffers.Nrcs@t||_d|_|r$||tdd|D|_dS)Nrcss|]}t|VqdSr)r)r*bufrrrr~r0z%BufferMap.__init__..)rrPr bufmaxsizermsumr2total)r9rrrrrrrPs   zBufferMap.__init__cCs:||||jd7_|||jo4|dS)Nr)_get_or_create_bufferrrr;rr)r9r>rrrrrs z BufferMap.putcCs4||||jt|7_|jo.|dSr))rrrryrr)r9r>rrrrr szBufferMap.extendcGsd\}}z ||}Wnty*d}Yn@0z|}|jd8_Wn|jy^d}Yn 0|||r|rz|dS||S)N)NFTrr)rGrrrr;)r9r>rWrthrowrrrrr&s      zBufferMap.takecCs6z ||WSty0|}||<|YS0dSr))rG _new_buffer)r9r>rrrrr<s   zBufferMap._get_or_create_buffercCs|j|jdS)N)r)Bufferrr8rrrrDszBufferMap._new_buffercGs||j|Sr))r:rrrrr_LRUpopHszBufferMap._LRUpopc CstdD]t}|}||}z |Wn"t|jfyJ||Yq0|jd8_t|sn||n ||q~qdS)Nrr) rr:rrrr=rryr;)r9rr>rrrrrLs    zBufferMap._pop_to_evictcCs"dt|jd|jd|jdSr)rIrrrr8rrrraszBufferMap.__repr__cCs|jSr))rr8rrrreszBufferMap._evictcount)Nr)rrrrCr#rrrrrrPrrrrrrrrrrrrrrrrs" r)0rCr collectionsrrErcollections.abcrrrrrheapqr r r itertoolsr r queuerZ functionalrrtextrZ__pypy__rrF ImportErrorZdjango.utils.functionalrr__all__rr$r%rrrr registerrrr"r!r#rrrrrsJ         +J Xf G