A doubly linked hashmap implementation of a Least Recently Used (LRU) cache in C++
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
example
src
.gitignore
LICENSE
README.md

README.md

Least Recently Used (LRU) Cache

A finite key-value cache data structure that implements the Least Recently Used (LRU) caching algorithm. Entries within the cache are stored in order by time last accessed, and as the cache reaches maximum capacity, the lest recently accessed entries are evicted.

Still under development

API Reference

Examples

License

MIT

Copyright (c) 2015 Nick Zuber