0FieddlmZddlZddlZddlZddlmZmZddlm Z m Z m Z m Z m Z mZddlmZmZmZede Zede Zed ZGd d eeefZGd d eeZddZdS)) annotationsN) OrderedDictUserDict)CallableHashableIterableIteratorMapping MutableSet)AnyTypeVarcastT)boundKVc<eZdZdZd fd Zdfd Zdfd ZxZS)LRUzILimited size mapping, evicting the least recently looked-up key when fullmaxsizefloatreturnNonec|tt|_||_dSN)super__init__rdatar)selfr __class__s 7lib/python3.11/site-packages/distributed/collections.pyrz LRU.__init__s/ MM  keyrrct|}tt|j||Sr)r __getitem__rrr move_to_endrr"valuers r r$zLRU.__getitem__s?##C(( [$)$$00555 r!r'ct||jkr.tt|jdt ||dS)NF)last)lenrrrrpopitemr __setitem__r&s r r,zLRU.__setitem__sY t99 $ $ di ( ( 0 0e 0 < < < C'''''r!)rrrr)r"rrr)r"rr'rrr)__name__ __module__ __qualname____doc__rr$r, __classcell__)rs@r rrsSS  ((((((((((r!rceZdZUdZdZded<ded<ded<d ed <d ed <d+d Zd,dZd-dZe d.dZ d/dZ d0dZ d1dZ d1dZd2d Zd3d#Zd2d$Zd2d%Zd2d&Zd4d'Zd4d(Zd5d)Zd*S)6HeapSetaA set-like where the `pop` method returns the smallest item, as sorted by an arbitrary key function. Ties are broken by oldest first. Values must be compatible with :mod:`weakref`. Parameters ---------- key: Callable A function that takes a single element of the collection as a parameter and returns a sorting key. The key does not need to be hashable and does not need to support :mod:`weakref`. Note ---- The key returned for each element should not to change over time. If it does, the position in the heap won't change, even if the element is re-added, and it *may* not change even if it's discarded and then re-added later. )r"_data_heap_inc_sortedCallable[[T], Any]r"zset[T]r4z%list[tuple[Any, int, weakref.ref[T]]]r5intr6boolr7cd||_t|_d|_g|_d|_dS)NrT)r"setr4r6r5r7)rr"s r rzHeapSet.__init__=s-UU    r!rstrcRdt|jdt|dS)N)typer-r*rs r __repr__zHeapSet.__repr__Ds*<4::&<<#d))<<<z&HeapSet.__reduce__..Hs;VVVjaD;14::U:UAq :U:U:Ur!)r5r3 _unpickler"r6)rheaprLs` @r __reduce__zHeapSet.__reduce__Gs;VVVVVDJVVV 48TY"===r!incrOlist[tuple[Any, int, T]] HeapSet[T]ctt}||_d|D|_||_d|D|_tj|j| |_ |S)Nch|]\}}}| SrFrF)rH_rLs r z$HeapSet._unpickle..Qs,,,GAq!a,,,r!cDg|]\}}}||tj|fSrF)weakrefref)rHrIrJrLs r rMz%HeapSet._unpickle..Ss-AAAAqq!W[^^,AAAr!) object__new__r3r"r4r6r5heapqheapifyr7)r"rQrOrs r rNzHeapSet._unpickleKsm~~g&&,,t,,,  AADAAA  dj!!!x  r!r'r[c||jvSrrGrr's r __contains__zHeapSet.__contains__Xs ""r!c*t|jSr)r*r4rAs r __len__zHeapSet.__len__[s4:r!rrc||jvrdS||}tj|}t j|j||j|fd|_|j ||xjdz c_dS)NF) r4r"rYrZr]heappushr5r6r7add)rr'rIrKs r rgz HeapSet.add^s} DJ   F HHUOO{5!! tzAty$#7888  u Q r!ct|j||js|dSdSr)r4discardclearr`s r rizHeapSet.discardhs= 5!!!z  JJLLLLL  r!c|jstd |jdd}||jvr|Stj|jd|_G)z/Return the smallest element without removing itpeek into empty setTrF)r4KeyErrorr5r]heappopr7r`s r peekz HeapSet.peekmshz 2011 1 !$DJqM!$&&E "" M$* % % % DL  !r!n Iterator[T]c#K|dks|sdS|dkr|VdStj||Ed{VdS)zzIterate over the n smallest elements without removing them. This is O(1) for n == 1; O(n*logn) otherwise. rNre)rp itertoolsislicesorted)rrqs r peeknz HeapSet.peeknxsr 666 F 66))++     !' q99 9 9 9 9 9 9 9 9 9r!c|jstd tj|j\}}}d|_|}||jvr7|j||js||So)Npop from an empty setTF)r4rnr]ror5r7rirjrrVrKr's r popz HeapSet.popsz 4233 3 tz22JAq$ DLDFFE "" ""5)))z!JJLLL  r!c|jstd |jdd}||jvr|S|jd=/)zReturn one of the largest elements (not necessarily the largest!) without removing it. It's guaranteed that ``self.peekright() >= self.peek()``. rlTrm)r4rnr5r`s r peekrightzHeapSet.peekrightsZz 2011 1 %DJrN1%''E ""  2  r!c|jstd |j\}}}|}||jvr7|j||js||Sh)zRemove and return one of the largest elements (not necessarily the largest!) It's guaranteed that ``self.popright() >= self.peek()``. ry)r4rnr5r{rirjrzs r poprightzHeapSet.poprightsz 4233 3 ))JAq$DFFE "" ""5)))z!JJLLL  r!c*t|jS)zwIterate over all elements. This is a O(n) operation which returns the elements in pseudo-random order. )iterr4rAs r __iter__zHeapSet.__iter__sDJr!c#K|js |jd|_t}|jD]6\}}}|}||jvr||vr|V||7dS)zIterate over all elements. This is a O(n*logn) operation which returns the elements in order, from smallest to largest according to the key and insertion order. TN)r7r5sortr<r4rg)rseenrVrKr's r rvzHeapSet.sorteds | JOO   DLuu*  JAq$DFFE ""uD'8'8    r!cx|j|jd|_dS)NT)r4rjr5r7rAs r rjz HeapSet.clears5   r!N)r"r8)rr=)rrC)r"r8rQr9rOrRrrS)r'r[rr:)rr9)r'rrr)rr)rqr9rrr)rrr)rr)r-r.r/r0 __slots____annotations__rrBrP staticmethodrNrarcrgrirprwr{r~rrrvrjrFr!r r3r3"s&=IMMM0000 IIIMMM====>>>>   \ #### ! ! ! !::::                    r!r3ds/Iterable[Mapping[K, V] | Iterable[tuple[K, V]]]r dict[K, V]ci}|D]Y}t|tr|}|D]+\}} ||xx|z cc<#t$r|||<Y(wxYwZ|S)z0Sum the values of the given mappings, key by key) isinstancer itemsrn)routdrIrLs r sum_mappingsrsC  a ! !  A  DAq A!    A   JsA  AA)rrrr) __future__rr]rtrY collectionsrrcollections.abcrrrr r r typingr r rrrrrr3rrFr!r rsW"""""" --------WWWWWWWWWWWWWWWW%%%%%%%%%% GCx    GCx    GCLL((((((1a4.(((&fffffjmfffR      r!