Search results
1000+ packages found
Sort by: Default
- Default
- Most downloaded this week
- Most downloaded this month
- Most dependents
- Recently published
A cache object that deletes the least-recently-used items.
Simple key-value storage with support for multiple backends
Simple “Least Recently Used” (LRU) cache
Simple “Least Recently Used” (LRU) cache
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
LRU Queue
Fast, small, efficient JavaScript memoization lib to memoize JS functions
Memoize functions results using an 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 cache the result
🔥 An extremely fast and efficient LRU cache for JavaScript with high compatibility (including Browsers) — 6.8KB.
node-simple-lru-cache =====================
A tiny, crazy fast memoization library for the 95% use-case
Apply a size limit to a Map class or instance
redis-backed LRU cache
High Performance Layer 1 / Layer 2 Caching with Keyv Storage
- cacheable
- high performance
- layer 1 caching
- layer 2 caching
- distributed caching
- Keyv storage engine
- memory caching
- LRU cache
- expiration
- CacheableMemory
- offline support
- distributed sync
- secondary store
- primary store
- View more
Blazing fast memoization based on all parameters passed
A cache object that deletes the least-recently-used items.
In memory cache lru cache with ttl support.
A tiny (215B) and fast Least Recently Used (LRU) cache