Simple and fast NodeJS internal caching. Node internal in memory cache like memcached.
Redis store for node-cache-manager
IORedis store for node-cache-manager
file system store for node cache manager
Adapter for using node-cache with type-cacheable
Simple node cache module
Redis store for node-cache-manager
Redis store for the node-cache-manager
simple node cache module
A cluster aware wrapper for node-cache
file system store for node cache manager
Lara-Node cache manager — file, database, and Redis drivers
Flushes the internal node cache, useful (and recommended) when testing apps
Simple axios cache wrapper using node-cache
persistent wrapper over node-cache for recovery
mongoose store for node-cache-manager
open telemetry instrumentation for the `node-cache`
Mongodb store for the node-cache-manager
Simple and fast TypeScript in-memory caching. Modern TypeScript port of node-cache.
A modern SQLite store for node-cache-manager
Simple and Maintained fast NodeJS internal caching
node-cache but instead of callbacks it uses promises
- Graph flatten - Tree diff - Graph coding - Node cache
A node-cache plugin for cache-service.
This gem provides an interface for fetching cluster information from an AWS ElastiCache AutoDiscovery server and configuring a Dalli client to connect to all nodes in the cache cluster.
A self-balancing binary tree optimised for fast access to frequently used nodes. Useful for implementing caches and garbage collection algorithms.
This gem provides an interface for fetching cluster information from an AWS ElastiCache AutoDiscovery server and configuring a Dalli client to connect to all nodes in the cache cluster.
Arboreal is yet another extension to ActiveRecord to support tree-shaped data structures. Internally, Arboreal maintains a computed "ancestry_string" column, which caches the path from the root of a tree to each node, allowing efficient retrieval of both ancestors and descendants. Arboreal surfaces relationships within the tree like "children", "ancestors", "descendants", and "siblings" as scopes, so that additional filtering/pagination can be performed.
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.
Contentful API wrapper library exposing an ActiveRecord-like interface
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.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.