LruCache implementations with O(1) complexity
A cache object that deletes the least-recently-used items.
Simple “Least Recently Used” (LRU) cache
OpenTelemetry instrumentation for `lru-memoizer` function memoization using lru-cache
Simple “Least Recently Used” (LRU) cache
http(s) module with power
A fast, lightweight LRU (Least Recently Used) cache for JavaScript with O(1) operations and optional TTL support.
An LRU cache of weak references
node-simple-lru-cache =====================
🔥 An extremely fast and efficient LRU cache for JavaScript with high compatibility (including Browsers).
Extends LRU base on hashlru
LRU Queue
Various cache implementations
Memoize functions results using an lru-cache.
High Performance In-Memory Cache for Node.js
DSN & JDBC string parser with query params support in a tiny and modern package.
A cache object that deletes the least-recently-used items.
The time-based use-recency-unaware cousin of [`lru-cache`](http://npm.im/lru-cache)
LRU-based memoizer for Intl constructors.
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.
Extremely simple zero-dependencies ES6 LRU (you probably want lru-cache instead)
redis-backed LRU cache
A generational pseudo-LRU cache with strict maximum size limits.
simpler faster substitute for LRU