[e0'ddlmZddlmZmZmZmZmZmZm Z ddl m Z m Z m Z mZmZmZmZmZddlmZGddee e fZdS)) annotations)Callable Collection ItemsViewIteratorKeysViewMutableMapping ValuesView)KTVT NoDefaultZictBasecloseflushlocked nodefault)InsertionSortedSetceZdZUdZded<ded<ded<ded<ded <d ed <d ed <d ed<ded<ded<d ed<ded<ddddd>fdZed?dZed@d#ZdAd&Z edAd'Z dBdCd)Z ee fdDd,Z edEd-ZdFd/ZdGd1ZdHd3ZdId5ZdJd7ZdKd9ZdLd;ZeZdMd<ZdMd=ZxZS)NLRUaEvict Least Recently Used Elements. Parameters ---------- n: int or float Number of elements to keep, or total weight if ``weight`` is used. Any individual key that is heavier than n will be automatically evicted as soon as it is inserted. It can be updated after initialization. See also: ``offset`` attribute. d: MutableMapping Dict-like in which to hold elements. There are no expectations on its internal ordering. Iteration on the LRU follows the order of the underlying mapping. on_evict: callable or list of callables Function:: k, v -> action to call on key/value pairs prior to eviction If an exception occurs during an on_evict callback (e.g a callback tried storing to disk and raised a disk full error) the key will remain in the LRU. on_cancel_evict: callable or list of callables Function:: k, v -> action to call on key/value pairs if they're deleted or updated from a thread while the on_evict callables are being executed in another. If you're not accessing the LRU from multiple threads, ignore this parameter. weight: callable Function:: k, v -> number to determine the size of keeping the item in the mapping. Defaults to ``(k, v) -> 1`` Notes ----- If you call methods of this class from multiple threads, access will be fast as long as all methods of ``d`` are fast. Callbacks are not protected by locks and can be arbitrarily slow. Examples -------- >>> lru = LRU(2, {}, on_evict=lambda k, v: print("Lost", k, v)) >>> lru['x'] = 1 >>> lru['y'] = 2 >>> lru['z'] = 3 Lost x 1 MutableMapping[KT, VT]dzInsertionSortedSet[KT]orderheavyzlist[Callable[[KT, VT], None]]on_evicton_cancel_evictCallable[[KT, VT], float]weightfloatnoffsetzdict[KT, float]weightsboolclosed total_weightzdict[KT, bool] _cancel_evictNcdS)N)kvs (lib/python3.11/site-packages/zict/lru.pyz LRU.]s)rrr@Callable[[KT, VT], None] | list[Callable[[KT, VT], None]] | NonecBt||_|_d|_t |r|g}|pg|_t |r|g}|pg|_|_fd| D|_ t|j |_ t||_tfd|j D|_d|_i|_dS)Nrc0i|]\}}|||Sr(r().0r)r*rs r+ z LRU.__init__..ls)>>>DAq66!Q<<>>>r-c3.K|]\}}|k |VdSNr()r1r)r*rs r+ zLRU.__init__..os,'U'UdaaSTffffff'U'Ur-F)super__init__rrr callablerrritemsr!sumvaluesr$rrrr#r%)selfrrrrr __class__s ` `r+r7z LRU.__init__Rs  H   " zH B O $ $ 0./O.4" >>>>AGGII>>>  3 3 5 566'** ''U'U'U'Udl6H6H6J6J'U'U'UUU  r-keyr returnr c|j|}|j||j||Sr4)rrremoveadd)r<r>results r+ __getitem__zLRU.__getitem__ss< # s r-keysCollection[KT] dict[KT, VT]cfd|D}|D]6}j|j|7|S)a8If all keys exist in the LRU, update their FIFO priority and return their values; this would be the same as ``{k: lru[k] for k in keys}``. If any keys are missing, however, raise KeyError for the first one missing and do not bring any of the available keys to the top of the LRU. c,i|]}|j|Sr(r)r1r>r<s r+r2z*LRU.get_all_or_nothing..s!333s#tvc{333r-)rrArB)r<rErCr>s` r+get_all_or_nothingzLRU.get_all_or_nothingzs_4333d333  C J  c " " " JNN3     r-valueNonec||| |dS#t$r|j|d|jkr_||jvrV t|jdkr,| t|jdk,n#t$rYnwxYwwxYw)Nrr') set_noevictevict_until_below_target Exceptionr!getrrlenrevict)r<r>rLs r+ __setitem__zLRU.__setitem__s e$$$   ) ) + + + + +   |Q''$&00S 5J5Jdf++// df++// D  s..7B=&AB+*B=+ B85B=7B88B=cH|||||}||jvr d|j|<||j|<|j|||jkr|j|||j|<|xj |z c_ dS)a<Variant of ``__setitem__`` that does not evict if the total weight exceeds n. Unlike ``__setitem__``, this method does not depend on the ``on_evict`` functions to be thread-safe for its own thread-safety. It also is not prone to re-raising exceptions from the ``on_evict`` callbacks. TN) discardrr%rrrBrrr!r$)r<r>rLrs r+rOzLRU.set_noevicts SS%(( $$ $ $&*D s #s  s DF?? JNN3   " S V#r- float | Nonec||j}|j|jz|krJ|jsE |n#t $rYdSwxYw|j|jz|kr |jAdSdSdSdS)zEvict key/value pairs until the total weight falls below n Parameters ---------- n: float, optional Total weight threshold to achieve. Defaults to self.n. N)rr$r r#rTKeyError)r<rs r+rPzLRU.evict_until_below_targets 9A$+-11$+1      $+-11$+111111111s: AAKT | NoDefault/tuple[KT, VT, float] | tuple[None, None, float]c|turG tt|jp|j}n#t $rt dwxYw||jvrdS|j|}|j |d|j|< | 5|j D]}||||j|r,|j D]}||| ddd|j|=dS dddn #1swxYwY|j|=n #|j|=wxYw|j|=|j ||j|}|xj|zc_|||fS)a$Evict least recently used key, or least recently inserted key with individual weight > n, if any. You may also evict a specific key. This is typically called from internal use, but can be externally triggered as well. Returns ------- Tuple of (key, value, weight) Or (None, None, 0) if the key that was being evicted was updated or deleted from another thread while the on_evict callbacks were being executed. This outcome is only possible in multithreaded access. zevict(): dictionary is empty)NNrFN)rnextiterrr StopIterationrZr%rrWunlockrrrAr!popr$)r<r>rLcbrs r+rTz LRU.evicts$ )   ?4 8dj99::  ? ? ?=>>> ? $$ $ $ = s  3"'3 ( ) )-##BBsENNNN%c*)"2''3( ) ) ) ) ) )"3''' )  ) ) ) ) ) ) ) ) ) ) ) ) ) ) )"3''"3' ' ' ' ' F3K #!!#&& V#E6!!s?(4AD";C? D3 D?DDDD Dc||jvr d|j|<|j|=|j||j||xj|j|zc_dSNT) r%rrrArrWr$r!rbr<r>s r+ __delitem__zLRU.__delitem__s| $$ $ $&*D s # F3K # 3 T\--c222r- KeysView[KT]c4|jSr4)rrEr<s r+rEzLRU.keyssv{{}}r-ValuesView[VT]c4|jSr4)rr;rjs r+r;z LRU.valuessv}}r-ItemsView[KT, VT]c4|jSr4)rr9rjs r+r9z LRU.itemssv||~~r-intc*t|jSr4)rSrrjs r+__len__z LRU.__len__s46{{r- Iterator[KT]c*t|jSr4)r_rrjs r+__iter__z LRU.__iter__sDF||r-objectc||jvSr4rJrfs r+ __contains__zLRU.__contains__ sdf}r-strct|jtst|jnd}d|j|jzd|jd|dS)Ndictz) isinstancerrzrxr$r r)r<subs r+__str__z LRU.__str__sQ!+DFD!9!9Ec$&kkkvL)DK7LL$&LLcLLLLr-c.t|jdSr4)rrrjs r+rz LRU.flushs df r-c<d|_t|jdSre)r#rrrjs r+rz LRU.closes  df r-) rrrrrr.rr.rr)r>r r?r )rErFr?rG)r>r rLr r?rMr4)rrXr?rM)r>r[r?r\)r>r r?rM)r?rh)r?rk)r?rm)r?ro)r?rr)r>rur?r")r?rx)r?rM)__name__ __module__ __qualname____doc____annotations__r7rrDrKrUrOrPrrTrgrEr;r9rqrtrwr__repr__rr __classcell__)r=s@r+rrs''R!!!!!!!!,,,,3333%%%% HHHMMMLLL!!!!,:N        B  V      V      $$$ V$"  $-8"8"8"8" V8"t 333 V3MMMMHr-rN) __future__rcollections.abcrrrrrr r zict.commonr r r rrrrr zict.utilsrrr(r-r+rs """"""UTTTTTTTTTTTTTTTTTTT))))))HHHHH(2r6 HHHHHr-