Search results
21 packages found
The highest performance constant complexity cache algorithm.
A fast and performant *Least Frequently Used* (LFU) sorted set implementation for working with reasonably sized integers (unsigned). Trades memory for performance, optimised for frequently updating and counting a relatively small set of integers (integer
A simple and extensible caching library built on top of a plain database.
- cache
- caching
- plaindb
- key-value
- storage
- LRU
- LFU
- eviction
- strategy
- size-based
- pruning
- event-driven
- extensible
- customizable
data structure
- data-footstone
- data
- footstone
- structure
- construction
- stack
- queue
- PriorityQueue
- chain
- SingleChain
- DoublyChain
- SingleCircleChain
- DoublyCircleChain
- hashMap
- View more
Maps and Sets with cache replacement policies, TC39 proposal-policy-map-set implementation
LFU cache implementation with a complexity of `O(1)` for all transactions
Implementation of LFU from Leetcode with tests
Library of building blocks for TypeScript
In-memory cache with high hit rates via LFU eviction. Supports time-based expiration, automatic loading and metrics.
In-memory cache with high hit rates via LFU eviction. Supports time-based expiration, automatic loading and metrics.
A cache object that deletes the least-frequently-used items.
In-memory object cache written in typescript for Node that supports multiple eviction strategies.
Imlementation of 2Q Cache Algorithm
a javascript data cache plugin
Offers different types of caches with limited size or limited entry count