Various cache implementations

A cache object that deletes the least-frequently-used items.

High Performance In-Memory Cache for Node.js

The time-based use-recency-unaware cousin of [`lru-cache`](http://npm.im/lru-cache)

A simple, fast, and flexible cache library for Deno and JavaScript, supporting LRU, LFU, FIFO, and EXPIRE strategies. Works great with TypeScript and is published on jsr.io.

Zero-dependency multi-strategy cache: LRU, LFU, TTL, TLRu (TTL+LRU). TypeScript port of Python cachetools. Decorator support for memoization.

Finite key-value map using the Least Recently Used (LRU) algorithm where the most recently used objects are keept in the map while less recently used items are evicted to make room for new ones.

A cache object that deletes the least-recently-used items.

Extremely simple zero-dependencies ES6 LRU (you probably want lru-cache instead)

Simple LRU cache with ordered eviction, built on btree-core.

redis-backed LRU cache

A generational cache with strict entry-count limits and payload validation.

LFU cache implementation with a complexity of `O(1)` for all transactions

A utility to provide lru memoization for any js function

LRU Cache

simpler faster substitute for LRU

Check license info for a package

High-performance isomorphic in-memory cache for JavaScript/TypeScript, implementing the Window-TinyLFU admission policy. Beats LRU/LFU hit ratios. Zero dependencies. Works in Node, browsers, Deno, Bun, and edge runtimes.

A simple O(1) LRU cache

LRU and FIFO caches for Client or Server