An in-memory caching module which holds similar calls and fulfils all with the same result. Supports Promises and periodical cache updates.
A generational pseudo-LRU cache with strict maximum size limits.
Improved deep equality testing for Node.js and the browser.
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.
A lightweight cache for file metadata, ideal for processes that work on a specific set of files and only need to reprocess files that have changed since the last run
Require hook for automatic V8 compile cache persistence
A simple key/value storage using files to persist the data
https://en.wikipedia.org/wiki/Trie
Parses Cache-Control and other headers. Helps building correct HTTP caches and proxies
Require hook for automatic V8 compile cache persistence
TypeScript definitions for http-cache-semantics
Basic object cache with `get`, `set`, `del`, and `has` methods for node.js/javascript projects.
LRU and FIFO caches for Client or Server
Efficient JavaScript cache implementation that is safe for concurrent reads and writes
Create a full Content-Type header given a MIME type or extension and cache the result
CLI for installing React Grab and configuring its activation behavior.
[](https://www.npmjs.com/package/@aws-sdk/endpoint-cache) [](https://www.npmjs.com/package/@aws-sdk/e
Provides key hold-start, holding, hold-end and other events.
An LRU cache of weak references
A super-fast, promise-based cache that reads and writes to the file-system.
No description provided.
Simple and fast NodeJS internal caching. Node internal in memory cache like memcached.
The time-based use-recency-unaware cousin of [`lru-cache`](http://npm.im/lru-cache)
A dead simple RAM keystore
SynCache stores cached objects in a Hash that is protected by an advanced two-level locking mechanism which ensures that: * Multiple threads can add and fetch objects in parallel. * While one thread is working on a cache entry, other threads can access the rest of the cache with no waiting on the global lock, no race conditions nor deadlock or livelock situations. * While one thread is performing a long and resource-intensive operation, other threads that request the same data will be put on hold, and as soon as the first thread completes the operation, the result will be returned to all threads.
No description provided.
No description provided.
No description provided.
No description provided.