o i'@sddlmZddlmZddlmZddlmZmZm Z m Z ddl m Z erPddl Z ddlmZmZmZmZmZddl mZe jd krJdd lmZndd lmZe d Ze d Ze d ZGdddeeefZdS)) annotations) OrderedDict)MutableMapping) TYPE_CHECKINGAnyTypeVaroverload) no_defaultN) ItemsViewIterableIteratorKeysView ValuesView) NoDefault) )SelfDKVc@seZdZdEddZdFdd ZdGd d ZdHddZdIddZdJddZdKddZ dLddZ dMddZ dNdd Z e dOdPd$d%Ze dQdRd)d%ZdOdSd,d%ZedTd0d1ZdUd3d4ZdVd6d7ZedKd8d9ZejdWd;d9ZefdXd=d>ZdYd@dAZdZdCdDZd!S)[LRUCachemaxsizeintreturnNonecCst|_||_dS)a Initialize an LRU (Least Recently Used) cache with a specified maximum size. Parameters ---------- maxsize : int The maximum number of items the cache can hold. Examples -------- >>> from polars._utils.cache import LRUCache >>> cache = LRUCache[str, int](maxsize=3) >>> cache["a"] = 1 >>> cache["b"] = 2 >>> cache["c"] = 3 >>> cache["d"] = 4 # evicts the least recently used item ("a"), as maxsize=3 >>> print(cache["b"]) # accessing "b" marks it as recently used 2 >>> print(list(cache.keys())) # show the current keys in LRU order ['c', 'd', 'b'] >>> cache.get("xyz", "not found") 'not found' N)r_itemsr)selfrrJ/home/app/Keep/.python/lib/python3.10/site-packages/polars/_utils/cache.py__init__s zLRUCache.__init__boolcC t|jS)z8Returns True if the cache is not empty, False otherwise.)r rrrrr__bool__5 zLRUCache.__bool__keyrcCs ||jvS)z!Check if the key is in the cache.r)rr%rrr __contains__9r$zLRUCache.__contains__rcCs(||jvr|d}t||j|=dS)z6Remove the item with the specified key from the cache. not found in cacheN)rKeyErrorrr%msgrrr __delitem__=s   zLRUCache.__delitem__rcCs2||jvr|d}t||j||j|S)z(Raises KeyError if the key is not found.r()rr) move_to_endr*rrr __getitem__Ds    zLRUCache.__getitem__ Iterator[K]ccs|jEdHdS)z#Iterate over the keys in the cache.Nr&r"rrr__iter__NszLRUCache.__iter__cCr!)zNumber of items in the cache.)lenrr"rrr__len__Rr$zLRUCache.__len__valuecCsT|jdkrdSt||jkr|t||jks||vr#|j|||j|<dS)zInsert a value into the cache.rN) _max_sizer1popitemrr-)rr%r3rrr __setitem__Vs  zLRUCache.__setitem__strcCst|j}t|dkr,ddd|ddDdddd|d dD}n dd d|D}|jjd |d |jd t|dS)z,Return a string representation of the cache.z, cs"|] \}}|d|VqdSz: Nr.0kvrrr f z$LRUCache.__repr__..Nz ..., csr9r:rr;rrrr?hr@csr9r:rr;rrrr?kr@z({z }, maxsize=z , currsize=))listritemsr1join __class____name__r4)rZ all_itemsrErrr__repr__as &zLRUCache.__repr__cCs|jdS)z$Clear the cache, removing all items.N)rclearr"rrrrJnzLRUCache.clearNdefaultV | NonecCdSNrrr%rLrrrgetrz LRUCache.get.rV | DcCrNrOrrPrrrrQurR D | V | None V | D | NonecCs"||vr|j||j|S|S)zJReturn value associated with `key` if present, otherwise return `default`.)rr-rPrrrrQxs  keys Iterable[K]rcCs||}|D]}|||<q|S)zGInitialize cache with keys from an iterable, all set to the same value.r)clsrrVr3cacher%rrrfromkeyss zLRUCache.fromkeysItemsView[K, V]cC |jS)z?Return an iterable view of the cache's items (keys and values).)rrEr"rrrrEr$zLRUCache.items KeysView[K]cCr\)z,Return an iterable view of the cache's keys.)rrVr"rrrrVr$z LRUCache.keyscCs|jSrO)r4r"rrrrszLRUCache.maxsizencCsD|dkr d|}t|t||kr|t||ks||_dS)zASet new maximum cache size; cache is trimmed if value is smaller.rz$`maxsize` cannot be negative; found N) ValueErrorr1r5r4)rr^r+rrrrs    D | NoDefaultcCs,|j||}tur|d}t||S)z Remove specified key from the cache and return the associated value. If the key is not found, `default` is returned (if given). Otherwise, a KeyError is raised. r()rpopr r))rr%rLitemr+rrrras z LRUCache.pop tuple[K, V]cCs|jjddS)zHRemove the least recently used value; raises KeyError if cache is empty.F)last)rr5r"rrrr5rKzLRUCache.popitem ValuesView[V]cCr\)z.Return an iterable view of the cache's values.)rvaluesr"rrrrfr$zLRUCache.values)rrrr)rr )r%rrr )r%rrr)r%rrr)rr/)rr)r%rr3rrr)rr7)rrrO)r%rrLrrrM).)r%rrLrrrS)r%rrLrTrrU)rrrVrWr3rrr)rr[)rr])r^rrr)r%rrLr`rrS)rrc)rre)rH __module__ __qualname__rr#r'r,r.r0r2r6rIrJrrQ classmethodrZrErVpropertyrsetterr rar5rfrrrrrs6               r) __future__r collectionsrcollections.abcrtypingrrrrZpolars._utils.variousr sysr r r r rr version_inforZtyping_extensionsrrrrrrrrs