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

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

LRU LFU cache

javascript实现各种数据结构：堆、优先队列、字典树、LFU缓存……

In-memory cache with high hit rates via LFU eviction. Supports time-based expiration, automatic loading and metrics.

LFU (Least Frequently Used) implementation, written in Rust provided as WebAssembly module, using a min-heap, that is, a basic vector, and a hashmap for storage of indices to keep track of cache blocks to allow for constant-time searches.

A fast in-memory cache. Includes LRU, MRU, SLRU, LFU, FIFO and RR.

Simple LFU cache. put and get.

LFU Map Implementation of KeeVee Store.

implement LFU O(1) time

Lfu cache implementation for rethink dns

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.

a lfu-storage plugin

Implementation of LFU from Leetcode with tests

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)

An LRU cache of weak references

This repository is a wrapper to any [lfu cache](https://github.com/serverless-dns/lfu-cache) implementation, it exposes only get and put operation to implemented module.

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

Lfu cache implementation for rethink dns