U /e=@sddlmZddlZddlZddlZddlmZmZddlm Z m Z m Z ddl m Z ddl mZmZmZede dZGd d d eZGd d d e eZdS) ) annotationsN) OrderedDictUserDict)CallableHashableIterator) MutableSet)AnyTypeVarcastT)boundcs>eZdZdZddfdd ZfddZfdd ZZS) LRUzILimited size mapping, evicting the least recently looked-up key when fullfloat)maxsizecstt|_||_dSN)super__init__rdatar)selfr __class__;/tmp/pip-unpacked-wheel-g426oqom/distributed/collections.pyrs z LRU.__init__cs"t|}tt|j||Sr)r __getitem__r rr move_to_endrkeyvaluerrrrs zLRU.__getitem__cs4t||jkr"tt|jjddt||dS)NF)last)lenrr rrpopitemr __setitem__rrrrr"szLRU.__setitem__)__name__ __module__ __qualname____doc__rrr" __classcell__rrrrrs rc@s0eZdZUdZdZded<ded<ded<d ed <d ed <dd ddZddddZddddZe dd dddddZ dd dddZ d dd d!Z d"d#dd$d%Z d"d#dd&d'Zd"dd(d)Zd d*d+d,d-Zd"dd.d/Zd"dd0d1Zd"dd2d3Zd*dd4d5Zd*dd6d7Zd#dd8d9Zd:S);HeapSetaA 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_sortedzCallable[[T], Any]rzset[T]r)z%list[tuple[Any, int, weakref.ref[T]]]r*intr+boolr,)rcCs$||_t|_d|_g|_d|_dS)NrT)rsetr)r+r*r,)rrrrrr=s zHeapSet.__init__str)returncCsdt|jdt|dS)N)typer#r rrrr__repr__DszHeapSet.__repr__ztuple[Callable, tuple]cs*fddjD}tjjj|ffS)Ncs,g|]$\}}}|jkr||fqSrr)).0kivrefrvrr Hsz&HeapSet.__reduce__..)r*r( _unpicklerr+)rheaprr;r __reduce__GszHeapSet.__reduce__zlist[tuple[Any, int, T]]z HeapSet[T])rincr?r1cCsNtt}||_dd|D|_||_dd|D|_t|j| |_ |S)NcSsh|]\}}}|qSrr)r7_r<rrr Qsz$HeapSet._unpickle..cSs"g|]\}}}||t|fqSr)weakrefref)r7r8r9r<rrrr=Ssz%HeapSet._unpickle..) object__new__r(rr)r+r*heapqheapifyr,)rrAr?rrrrr>Ks  zHeapSet._unpicklerF)rr1cCs ||jkSrr6rrrrr __contains__XszHeapSet.__contains__cCs t|jSr)r r)r4rrr__len__[szHeapSet.__len__r NonecCs\||jkrdS||}t|}t|j||j|fd|_|j ||jd7_dS)NF) r)rrDrErHheappushr*r+r,add)rrr8r:rrrrP^s    z HeapSet.addcCs|j||js|dSr)r)discardclearrJrrrrQhs zHeapSet.discardcCsD|jstd|jdd}||jkr,|St|jd|_qdS)z/Return the smallest element without removing itpeek into empty setrFN)r)KeyErrorr*rHheappopr,rJrrrpeekms  z HeapSet.peekz Iterator[T])nr1ccs>|dks |sdS|dkr$|Vnt||EdHdS)zzIterate over the n smallest elements without removing them. This is O(1) for n == 1; O(n*logn) otherwise. rNrN)rW itertoolsislicesorted)rrXrrrpeeknxs   z HeapSet.peekncCsZ|jstdt|j\}}}d|_|}||jkr|j||jsP||SqdS)Npop from an empty setF)r)rUrHrVr*r,rQrRrrBr:rrrrpops  z HeapSet.popcCs:|jstd|jdd}||jkr,|S|jd=qdS)zReturn one of the largest elements (not necessarily the largest!) without removing it. It's guaranteed that ``self.peekright() >= self.peek()``. rSrTN)r)rUr*rJrrr peekrights  zHeapSet.peekrightcCsR|jstd|j\}}}|}||jkr|j||jsH||SqdS)zRemove and return one of the largest elements (not necessarily the largest!) It's guaranteed that ``self.popright() >= self.peek()``. r]N)r)rUr*r_rQrRr^rrrpoprights  zHeapSet.poprightcCs t|jS)zwIterate over all elements. This is a O(n) operation which returns the elements in pseudo-random order. )iterr)r4rrr__iter__szHeapSet.__iter__ccsZ|js|jd|_t}|jD]2\}}}|}||jkr"||kr"|V||q"dS)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)r,r*sortr/r)rP)rseenrBr:rrrrr[s zHeapSet.sortedcCs|j|jd|_dS)NT)r)rRr*r,r4rrrrRs  z HeapSet.clearN)r#r$r%r& __slots____annotations__rr5r@ staticmethodr>rKrLrPrQrWr\r_rarbrdr[rRrrrrr("s0      r() __future__rrHrYrD collectionsrrcollections.abcrrrtypingrr r r r rr(rrrrs