ember-cli addon tree cache key builder
No description provided.
TypeScript definitions for http-cache-semantics
Require hook for automatic V8 compile cache persistence
Require hook for automatic V8 compile cache persistence
walk paths fast and efficiently
Cache requires to be lazy-loaded when needed.
A cache object that deletes the least-recently-used items.
Filter for wFiles provider's that works with provided files tree cache as real file system
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
TypeScript-based caching decorators
A simple key/value storage using files to persist the data
Find and load configuration from a package.json property, rc file, TypeScript module, and more!
Adaptive tree cache for GraphQL and Javascript
Simple persistence for all Apollo cache implementations
Actions cache lib
 
Parses Cache-Control and other headers. Helps building correct HTTP caches and proxies
TypeScript definitions for cache-manager-ioredis
Basic object cache with `get`, `set`, `del`, and `has` methods for node.js/javascript projects.
Debounce hook for react
LRU and FIFO caches for Client or Server
TypeScript definitions for memory-cache
Find and fix unused dependencies, exports and files in your TypeScript and JavaScript projects
Cache based on btrees, for large ammounts of cache.
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.
A self-balancing binary tree optimised for fast access to frequently used nodes. Useful for implementing caches and garbage collection algorithms.
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.
Ruby implementations of a Stack, Queue, Linked List, Binary Tree, LRU Cache, Heap, Priority Queue, Graph and Weighted Graph. More to come!
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.