Usage

An LRU cache is a fixed size cache that discards the oldest
(least recently accessed) elements after it fills up. It's
ideally suited to be used in situations where you need to speed up
access to slower data sources (databases, synthetic structures,
etc.). Below is a simple example of using it to cache strings
using integer keys.

More Information

To learn more about LRU caches and caching in general, have a
look at the Wikipedia page on cache
algorithms for a good starting place. There is documenation
and examples (in the form of unit tests) inside the distribution
as well. If you really get stuck, drop me an email.