fast-lru
A cache module that deletes the least-recently-used items, inspired by lru-cache and implementing GeeksForGeeks' algorithm
A fast doubly-linked list implementation of LRU capable of handling hundreds of thousands of items quickly.
A cache module that deletes the least-recently-used items, inspired by lru-cache and implementing GeeksForGeeks' algorithm
A fast doubly-linked list implementation of LRU capable of handling hundreds of thousands of items quickly.
MIT License