A cache object that deletes the least-recently-used items.
Simple “Least Recently Used” (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.
Create a full Content-Type header given a MIME type or extension and catch the result
Memoize functions results using an lru-cache.
Cache your async lookups and don't fetch the same thing more than necessary.
A tiny, crazy fast memoization library for the 95% use-case
LRU Cache for node.js/browser.
Blazing fast memoization based on all parameters passed
Apply a size limit to a Map class or instance
Extremely simple zero-dependencies ES6 LRU (you probably want lru-cache instead)
redis-backed LRU cache
In memory cache lru cache with ttl support.
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
In-memory cache with high hit rates via LFU eviction. Supports time-based expiration, automatic loading and metrics.
A least-recently-used cache in 35 lines of code