Search results

@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

• fast
• quick
• set
• Set object
• performant
• frequency
• counter
• count
• top-k
• rank
• math
• LFU
• FIFO
• LIFO
• View more

suptxt

published 0.4.6 • 9 months agopublished 0.4.6 9 months ago

redcircle

Implementation of an append-only, capped circular buffer using Redis

• redis
• circular
• buffer
• queue
• list
• ioredis
• append-only
• capped
• cache
• lifo

aranwmurphy

published 1.0.0 • 4 years agopublished 1.0.0 4 years ago

simple-node-memory-cache

In-memory object cache written in typescript for Node that supports multiple eviction strategies.

• in-memory
• cache
• LRU
• FIFO
• LIFO
• LFU
• MRU
• RR

ruud-verhoef

published 1.0.4 • 5 years agopublished 1.0.4 5 years ago