hyperlru-map
hyperlru implementation backed in an Map
Found 60 results for least
hyperlru implementation backed in an Map
```
Least recently used cached generator
hyperlru implementation backed in an Object
Return the minimum safe integer capable of being represented by a numeric real type.
A small set of functions to await at least a certain amount of time before resolving a promise.
Least Recently Used (LRU) cache algorithm
Return the smallest positive normal value capable of being represented by a numeric real type.
Simple “Least Recently Used” (LRU) cache
A finite key-value cache using the Least Recently Used (LRU) cache algorithm where the most recently used objects are keept in cache while less recently used items are purged.
LRU and FIFO caches for Client or Server
A set API for the LRU package
Better binary searching
asleep-fruit
A tiny LRU implementation that strives for simplicity and performance.
Simple “Least Recently Used” (LRU) cache
Simple “Least Recently Used” (LRU) cache
An NPM module for running a least significant digit radix sorting algorithm.
> You cache the results you know when to flush'em
Better binary searching, safe for the web (without eval)