A minimal JS cache: like using an object, except it won't grow forever
Typed GitHub REST client for the Murmuration Harness — rate-limited, cache-aware, secret-safe.
Various cache implementations
walk paths fast and efficiently
Memoize/cache function results
A fast, lightweight LRU (Least Recently Used) cache for JavaScript with O(1) operations and optional TTL support.
LRU Queue
A cache object that deletes the least-recently-used items.
Minimal key-value cache interface
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
Actions cache lib
Require hook for automatic V8 compile cache persistence
Parses Cache-Control and other headers. Helps building correct HTTP caches and proxies
LRU Cache
LRU and FIFO caches for Client or Server
TypeScript definitions for http-cache-semantics
Basic object cache with `get`, `set`, `del`, and `has` methods for node.js/javascript projects.
[](https://www.npmjs.com/package/@aws-sdk/endpoint-cache) [](https://www.npmjs.com/package/@aws-sdk/e
No description provided.
Simple and fast NodeJS internal caching. Node internal in memory cache like memcached.
A generational pseudo-LRU cache with strict maximum size limits.
Create a full Content-Type header given a MIME type or extension and cache the result
Persistent Cache limited to STORAGE_RAM
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.
APICache allows any API client library to be easily wrapped with a robust caching layer. It supports caching (obviously), serving stale data and limits on the number of API calls. It's also got a handy syntax if all you want to do is cache a bothersome url.
A Splay Tree is a self adjusting binary search tree with the additional property that recently accessed elements are quick to access again. This makes it useful for caches because the most commonly accessed elements will be the fastest ones to access. This tree has an additional feature that allows it's maximum size to be restricted. When it exceeds it's maximum size, it will drop all of the nodes which are at the terminal ends of the tree structure, leaving many of the more commonly accessed nodes intact. This implementation is written in C++ with a Ruby wrapper.
Includes a configurable cache to keep your app from tipping over api limits.
Ruby library giving block-buffered and cached read over IO objects with a String-like interface. Ideal to parse big files as Strings, limiting memory consumption.
Capped hash for Throttler cache, flexible limit strategy, etc...
Caching support to Geokit. It prevents from exceeding limit of queres to geocoding services.
Rack middleware for limiting requests based on an parameter
Utilities like caching, rate limiting, ... for usage in combination with the scrobbler gem. These will be not included in the main gem as they provide extra functionality that is not always required.
APICache allows any API client library to be easily wrapped with a robust caching layer. It supports caching (obviously), serving stale data and limits on the number of API calls. It's also got a handy syntax if all you want to do is cache a bothersome url.
Rails memcached store optimized for the thundering herd issue. This limit cache recalculation to a single process while as long as key is not swept by LRU. Drop-in replacement of Rails memcached store.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.