LRU cache implementation. It uses hash map and doubly-linked list under the hood.
Just for learning purposes, and certainly not fast.
It offers standard insert and get methods for insertion and retrieval of cache items.
LRU cache implementation. It uses hash map and doubly-linked list under the hood.
Just for learning purposes, and certainly not fast.
It offers standard insert and get methods for insertion and retrieval of cache items.