dw-cache

The highest performance constant complexity cache algorithm.

@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

cache-mapset

Maps and Sets with cache replacement policies, TC39 proposal-policy-map-set implementation