Memoize functions results using an lru-cache.
OpenTelemetry instrumentation for `lru-memoizer` function memoization using lru-cache
OpenTelemetry instrumentation for `lru-memoizer` function memoization using lru-cache (with updated dependencies)
OpenTelemetry automatic instrumentation package for lru-memoizer
A cache object that deletes the least-recently-used items.
Simple “Least Recently Used” (LRU) cache
Simple “Least Recently Used” (LRU) cache
Faster than fast, smaller than micro ... a nano speed and nano size memoizer.
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 =====================
Memoize functions results using an lru-cache. (with updated dependencies)
🔥 An extremely fast and efficient LRU cache for JavaScript with high compatibility (including Browsers).
Extends LRU base on hashlru
LRU Queue
Various cache implementations
High Performance In-Memory Cache for Node.js
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)
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.
redis-backed LRU cache
Extremely simple zero-dependencies ES6 LRU (you probably want lru-cache instead)
A generational pseudo-LRU cache with strict maximum size limits.
simpler faster substitute for LRU
Memoize methods with a simple decorator. Supports TTL expiration, LRU eviction, thread-safe per-instance caches, hit/miss stats, and proper nil/false handling.
Adds memoization to methods with optional time-to-live and LRU eviction
SafeMemoize is a production-ready, zero-dependency memoization library for Ruby. It uses Ruby's prepend mechanism to wrap methods with a thread-safe cache (Mutex + double-check locking) that correctly handles nil and false return values — fixing the silent bug in the common ||= pattern. Results are cached per unique argument combination, so parameterized methods only compute each variant once. Additional features include TTL expiration, LRU cache size limiting, conditional caching via if:/unless: predicates, lifecycle hooks for hit/eviction/expiration events, per-instance metrics (hit rate, miss rate, computation time), targeted cache invalidation, custom cache key generators, and introspection helpers. Method visibility (public, protected, private) is fully preserved.
No description provided.
No description provided.