LRU (least recently used)

Also written: LRU

A rule for a full cache: evict the entry that has gone unread for the longest time. In C++ it can be built from a `std::list` that keeps entries in order of use plus a `std::unordered_map` that finds any entry's place in the list at once.