@suptxt/quickset
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
2q-cache
Imlementation of 2Q Cache Algorithm
simple-node-memory-cache
In-memory object cache written in typescript for Node that supports multiple eviction strategies.