300 packages found
A cache object that deletes the least-recently-used items.
Memoize functions results using an lru-cache.
Fast, small, efficient JavaScript memoization lib to memoize JS functions
Blazing fast memoization based on all parameters passed
An LRU cache of weak references
Simple “Least Recently Used” (LRU) cache
A tiny, crazy fast memoization library for the 95% use-case
LFU cache implementation with a complexity of `O(1)` for all transactions
Finite key-value map using the Least Recently Used (LRU) algorithm where the most recently used objects are keept in the map while less recently used items are evicted to make room for new ones.
node-simple-lru-cache =====================
Fast LRU and TTL cache with upsert and promise option
Resilient and performant in-memory cache for node.js
LRU Cache that is safe for clusters, based on `lru-cache`. Save memory by only caching items on the main thread via a promisified interface.
Curated collection of data structures for the JavaScript/TypeScript.
- bag
- bimap
- bit array
- bit set
- bit vector
- bitset
- bk tree
- burkhard-keller tree
- cache
- circular buffer
- counter
- data structures
- default map
- deque
- View more
Tiny LRU cache for Client or Server
A shared memory cache. This is a wrapper for shm-typed-lru that provides a familiar cache interface.
Varnish-like cache middleware for Express with abilities to read, write, delete and reset the cache while the process is running.
Fast, small, efficient JavaScript memoization lib to memoize JS functions
The highest performance constant complexity cache algorithm.