hl)`dZddlZddlZddlZddlmZmZddlmZm Z ddl m Z m Z ddl mZm Z ddlmZdd lmZd ZeZGd d ZGd deZddefdZGddZdZe efeffdZe effdZd%dZdZ d&dZ!d'dZ" d(dZ#d)d!Z$d*d#Z%d$Z&eZ'eZ(dS)+zFunctional Utilities.N) OrderedDictUserDict)IterableMapping)countrepeat)sleeptime)wraps) safe_repr)LRUCachememoizelazymaybe_evaluateis_list maybe_list dictfilterretry_over_timec eZdZdZdZdZdS)ChannelPromisec||_dSN) __contract__)selfcontracts R/var/www/html/Sam_Eipo/venv/lib/python3.11/site-packages/kombu/utils/functional.py__init__zChannelPromise.__init__s$cl |jS#t$r |x}|_|cYSwxYwr) __value__AttributeErrorr)rvalues r__call__zChannelPromise.__call__sK > !   %)%6%6%8%8 8EDNLLL s  '33c~ t|jS#t$rdt|jddcYSwxYw)Nz )reprr!r"idrrs r__repr__zChannelPromise.__repr__#sW ='' ' = = =<"T%6"7"7<<<< < < < =s #<<N)__name__ __module__ __qualname__rr$r+rrrrsA%%%=====rrcxeZdZdZddZdZdZddZdZd Z d Z e Z d Z e Z d ZeZddZdZdZeZe Ze ZdS)ra?LRU Cache implementation using a doubly linked list to track access. Arguments: limit (int): The maximum number of keys to keep in the cache. When a new key is inserted and the limit has been exceeded, the *Least Recently Used* key will be discarded from the cache. Ncj||_tj|_t |_dSr)limit threadingRLockmutexrdata)rr2s rrzLRUCache.__init__4s' _&& MM rc|j5|j|x}||<|cdddS#1swxYwYdSr)r5r6poprkeyr#s r __getitem__zLRUCache.__getitem__9s Z   $ c 2 2 2EDI                  s !6::c|j5|j|j}}|j|i||rKt ||kr8t t ||z D]}|dddddS#1swxYwYdS)NF)last)r5r6r2updatelenrangepopitem)rargskwargsr6r2_s rr>zLRUCache.update>s Z - -)TZ%D DK ( ( ( ( -TU**s4yy5011--ALLeL,,,,  - - - - - - - - - - - - - - - - - -sA)A>>BBTcx|j5|j|cdddS#1swxYwYdSr)r5r6rA)rr=s rrAzLRUCache.popitemGs Z + +9$$T** + + + + + + + + + + + + + + + + + +s /33c|j5|jrVt|j|jkr9|jt t |j||j|<ddddS#1swxYwYdSr)r5r2r?r6r8nextiterr9s r __setitem__zLRUCache.__setitem__Ks Z # #z 5c$)nn :: d4 ??33444"DIcN # # # # # # # # # # # # # # # # # #sA(A==BBc*t|jSr)rHr6r*s r__iter__zLRUCache.__iter__RsDIrc#K|j5|D]$} ||j|fV#t$rY!wxYw ddddS#1swxYwYdSrr5r6KeyErrorrks r_iterate_itemszLRUCache._iterate_itemsUs Z    dil+++++D                   s,A"A /A/AAAc#K|j5|D]"} |j|V#t$rYwxYw ddddS#1swxYwYdSrrMrOs r_iterate_valueszLRUCache._iterate_values^s Z    )A,&&&&D                   s'> > ->->AAcv|j5|jcdddS#1swxYwYdSr)r5r6keysr*s r _iterate_keyszLRUCache._iterate_keyshs} Z $ $9>>## $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $s .22r c|j5t|j||z}t |||<|cdddS#1swxYwYdSr)r5intr6r8str)rr:deltanewvals rincrz LRUCache.incrns Z  s++,,u4FF DI                   s>AAAchtt|}|d|S)Nr5)dictvarsr8)rds r __getstate__zLRUCache.__getstate__vs) d   grcD||_tj|_dSr)__dict__r3r4r5)rstates r __setstate__zLRUCache.__setstate__{s _&& rr)T)r )r,r-r.__doc__rr;r>rArIrKrQ iteritemsrS itervaluesrViterkeysr\rarerUvaluesitemsr/rrrr*s""""  ---++++###I!J$$$H ''' D F EEErrcfd}|S)z)Decorator to cache function return value.ctjtfdfd}dx__|__S)N)r2cr ||}n:|tfztt|z} 5|}dddn #1swxYwYxjdz c_nG#t $r:|i|}xjdz c_5||<dddn #1swxYwYYnwxYw|S)Nr ) KEYWORD_MARKtuplesortedrkhitsrNmisses) rBrCr:r#_Mcachefunkeyfunr5s rrtz%memoize.._memoize.._Msq MfT6**l_,uVFLLNN5K5K/L/LL ''!#JE'''''''''''''''1   ' ' 'T,V,, Q ''!&E#J''''''''''''''' 'LsZ A? A# A?#A''A?*A'+A??$C#B5) C5B9 9C<B9 =CCcLdx__dS)z+Clear the cache and reset cache statistics.rN)clearrrrs)rtrusrryz(memoize.._memoize..clears" KKMMM"# #BGbiiirr)r3Lockr rrrsry original_func)rvryrtrur5Cacherwmaxsizes` @@@r_memoizezmemoize.._memoizes  G$$$ s          " $ $ $ $ $ $  ") rr/)r}rwr|r~s``` rrrs0@ OrcHeZdZdZdZdZdZdZdZdZ dZ d Z d Z d S) ra Holds lazy evaluation. Evaluated when called or if the :meth:`evaluate` method is called. The function is re-evaluated on every call. Overloaded operations that will evaluate the promise: :meth:`__str__`, :meth:`__repr__`, :meth:`__cmp__`. c0||_||_||_dSr_fun_args_kwargs)rrvrBrCs rrz lazy.__init__s   rc*|Sr)evaluater*s rr$z lazy.__call__s}}rc0|j|ji|jSrrr*s rrz lazy.evaluatesty$*5 555rc0t|Sr)rYr*s r__str__z lazy.__str__s4466{{rc0t|Sr)r(r*s rr+z lazy.__repr__sDDFF||rc||kSrr/rrhss r__eq__z lazy.__eq__tvv}rc||kSrr/rs r__ne__z lazy.__ne__rrc*||t|<|Sr)r))rmemos r __deepcopy__zlazy.__deepcopy__sRXX rc<|j|jf|j|jdfS)N)rr) __class__rrrr*s r __reduce__zlazy.__reduce__s.  :>,/H/HI IrN) r,r-r.rfrr$rrr+rrrrr/rrrrs 666IIIIIrrcXt|tr|S|S)z9Evaluate value only if value is a :class:`lazy` instance.) isinstancerr)r#s rrrs)% ~~ LrcHt||ot||pd S)znReturn true if the object is iterable. Note: Returns false if object is a mapping or string. r/)r)objscalarsiterss rrrs* c5 ! ! H*S'-R*H*H&HHrc0|t||r|n|gS)z0Return list of one element if ``l`` is a scalar.)r)rrs rrrs +g!6!6+33SEArc h||n|r t|fi|n|}d|DS)z=Remove all keys from dict ``d`` whose value is :const:`None`.Nci|] \}}||| Srr/).0rPvs r zdictfilter..s 8 8 8TQ!-Aq---r)r^rk)r`kws rrrs@ir8d1mmmmmqA 8 8QWWYY 8 8 88rc#Kt|}tj}tdD]}|||dVdS)Nr)listrandomshuffler)itrrDs r shufflecyclersS bBnG D\\ e r?Fc#NK|dz} |r||kr |V||z }n |sdS||z V)Nrr/)startstopstep repeatlastcurs rfxrangersZ #+C sd{{III 4KCC *   rY@c#pKd|dz}} ||krdS|V|rt||z|}n||z }||z }-)Nrr)min)rrrmaxsum_rs r fxrangemaxrsc53;#D 3;; E  cDj$''CC 4KC  rc H|sin|}|sgn|}t|||z|d} | rt| znd} tD]} ||i|cS#|$r}|| |kr| rt| kr| r | t|r ||| | nt | }|rft t |D]}| r | tdttt ||z Yd}~d}~wwxYwdS)aRetry the function over and over until max retries is exceeded. For each retry we sleep a for a while before we try again, this interval is increased for every retry until the max seconds is reached. Arguments: fun (Callable): The function to try catch (Tuple[BaseException]): Exceptions to catch, can be either tuple or a single exception class. Keyword Arguments: args (Tuple): Positional arguments passed on to the function. kwargs (Dict): Keyword arguments passed on to the function. errback (Callable): Callback for when an exception in ``catch`` is raised. The callback must take three arguments: ``exc``, ``interval_range`` and ``retries``, where ``exc`` is the exception instance, ``interval_range`` is an iterator which return the time in seconds to sleep next, and ``retries`` is the number of previous retries. max_retries (int): Maximum number of retries before we give up. If neither of this and timeout is set, we will retry forever. If one of this and timeout is reached, stop. interval_start (float): How long (in seconds) we start sleeping between retries. interval_step (float): By how much the interval is increased for each retry. interval_max (float): Maximum number of seconds to sleep between retries. timeout (int): Maximum seconds waiting before we give up. T)rNr) rr rfloatrGr@rXr abs)rvcatchrBrCerrback max_retriesinterval_start interval_step interval_maxcallbacktimeoutinterval_rangeendretriesexcttsrDs rrrsB )RR6F #22tD^)N:*t===N& /$&&7  4C77++ +3''' ' ' ' + + +&7k+A+A tvv||  2^W===!.1133C +s3xxA#  #JJJJc#c((S.))*** +++s ADB=DD, {0}={1}cj|fd|DS)Nc3dK|]*\}}|t|V+dSr)format _safe_repr)rrPrfmts r zreprkwargs..Ls;LLTQCJJq*Q--00LLLLLLr)joinrk)rCseprs `r reprkwargsrKs2 88LLLLV\\^^LLL L LLrr/c |sin|}d||tt|pd|r|r|pdt ||S)Nz {}({}{}{})r/)rrmaprr)namerBrCrs rreprcallrOse )RR6F    chhs:tzr2233 &!c'R63  rcNtj|}||jvp||jvSr)inspectgetfullargspecrB kwonlyargs)func argument_name argument_specs raccepts_argumentrXs2*400M++ 211rr)rNrF)rNrr) NNNNrrrNN)rr)r/Nr))rfrrr3 collectionsrrcollections.abcrr itertoolsrrr r vine.utilsr encodingr r__all__objectrorrrrrrYrrrrrrrrrrpromise maybe_promiser/rrrsx ----------------########------  vxx ========&WWWWWxWWWtX""""J'I'I'I'I'I'I'I'IT"3{IIII%cNBBBB 9999         AEFG<@9+9+9+9+xMMMM  r