⚠️ This implementation is NOT thread safe!
Simple and reliable LRU (Least Recently Used) cache for c++ 17 based on hashmap and linkedlist. The library is header only, simple test and example are included. It includes standard components and very little own logics that guarantees reliability.
Example:
/**Creates cache with maximum size of three. When the
size in achieved every next element will replace the
least recently used one */
lru_cache<std::string, std::string, 3> cache;
cache.put("one", "one");
cache.put("two", "two");
const std::string& from_cache_1 = cache.get("one").value();
/**For objects too expensive or impossible to copy
you can get them by reference, however, no guarantees
are given about the underlying object lifetime
when modifying the cache, so use with caution */
const std::string& from_cache_2 = cache.get_ref("two")->get();How to run tests:
cd build
cmake ..
# cmake -DCMAKE_BUILD_TYPE=Debug -DCPPCHECK=ON ..
make test
# make sanitize