LRU LFU cache

An LRU cache of weak references

Tiny, dependency-free typed cache with pluggable eviction policy (LRU / LFU), TTL, size limits and eviction callbacks. Works in browsers, Node, Deno, Bun and Web Workers.

Zero-dependency data structures: linked lists (doubly/singly linked, circular), deques, ring buffers, unrolled lists, caches (LRU, LFU, SLRU, Clock, FIFO), heaps (binary, indexed, pairing), timer wheels, object pools, queues, stacks, splay trees, skip lis

Multi-tier caching module for Titan framework (LRU, LFU, TTL)

LRU, LFU, and TTL in-memory cache implementations sharing one interface, each tracking hits/misses/evictions. LRU correctly refreshes recency on get(). Zero runtime dependencies.

Memory key/value cache (lru, lfu, fifo)

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

In-memory LRU / LFU / TTL cache with a getOrSet helper.

Simple “Least Recently Used” (LRU) cache

Simple “Least Recently Used” (LRU) cache

OpenTelemetry instrumentation for `lru-memoizer` function memoization using lru-cache

LRU/LFU Cache

A fast, lightweight LRU (Least Recently Used) cache for JavaScript with O(1) operations and optional TTL support.

node-simple-lru-cache =====================

🔥 An extremely fast and efficient LRU cache for JavaScript with high compatibility (including Browsers).

Extends LRU base on hashlru

LRU Queue

Memoize functions results using an lru-cache.

Ultra-ligero cache in-memory (TTL/LRU/LFU) con persistencia opcional, TTL adaptativo y estrategia pluggable.