A memory scheduler that uses an lru algorithm.
Simple “Least Recently Used” (LRU) cache
Simple “Least Recently Used” (LRU) cache
Extends LRU base on hashlru
LRU Queue
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.
A cache object that deletes the least-recently-used items.
OpenTelemetry instrumentation for `lru-memoizer` function memoization using lru-cache
simpler faster substitute for LRU
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 =====================
A specification compliant robots.txt parser with wildcard (*) matching support.
🔥 An extremely fast and efficient LRU cache for JavaScript with high compatibility (including Browsers).
JWA implementation (supports all JWS algorithms)
Various cache implementations
Memoize functions results using an lru-cache.
High Performance In-Memory Cache for Node.js
Implementation of JSON Web Signatures
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)
Simple “Least Recently Used” (LRU) cache, forked from sindresorhus/quick-lru for CJS
Extremely simple zero-dependencies ES6 LRU (you probably want lru-cache instead)
finite key-value cache using the Least Recently Used (LRU) algorithm where the most recently used objects are keept in cache while less recently used items are purged