A collection of advanced cache design algorithms including LRU, LFU, ARC, TinyLFU, Count-Min Sketch, and Segmented LRU, implemented in TypeScript.
-
Updated
Nov 19, 2025 - JavaScript
#
lfu-cache
Here are 4 public repositories matching this topic...
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 lists.
lists list linked-list stack queue cache priority-queue heap ring-buffer lru-cache deque min-heap fifo-cache lfu-cache singly-linked-list doubly-linked-list circular-list skip-list splay-tree unrolled-list
-
Updated
Jul 28, 2026 - JavaScript
A performance‑focused tool for analyzing caching strategies and memory usage. SmartCacheAnalyzer helps evaluate cache efficiency, detect bottlenecks, and optimize resource management with clear insights. Built using modern development practices to support learning and experimentation in system optimization.
-
Updated
Apr 11, 2026 - JavaScript
Node module that offers different caches
-
Updated
Aug 3, 2021 - JavaScript
Add this topic to your repo
To associate your repository with the lfu-cache topic, visit your repo's landing page and select "manage topics."