A finite key-value cache using the Least Recently Used (LRU) cache algorithm where the most recently used objects are keept in cache while less recently used items are purged.
Implementation of async LRU and ARC cache.
benchmark the least-recently-used caches which are available on npm.
lru-func
Data structures for the web
SculeJS data structure server
A cache that holds a limited number of key-value pairs
A procedural macro for automatically caching the output of functions.
Efficient LRU cache with zero-allocation alternatives / 高效LRU缓存与零分配替代方案
A procedural macro for automatically caching the output of functions.
A LRU cache implementation
A procedural macro for automatically caching the output of functions.
LRU Cache that only stores items recently seen more than once.
A LRU cache implementation
An LRU cache implementation using intrusive data structures
lru cache
Fastest size-aware LRU cache with highest hit rate via LHD algorithm / 最快的大小感知 LRU 缓存，基于 LHD 算法实现最高命中率
Efficient file handle caching for WAL random reads / 高效 WAL 随机读取的文件句柄缓存
its performant / constant o(1)
LRU cache
Basic least-recently-used cache implementation
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.