See all uluru's items
A simple, fast, least-recently-used (LRU) cache.
LRUCache uses a fixed-capacity array for storage. It provides O(1) insertion, and O(n)
lookup. It does not require an allocator and can be used in no_std crates.
See the LRUCache docs for details.
Iterator over values in an LRUCache, from most-recently-used to least-recently-used.
A LRU cache using a statically-sized array for storage.