Crate intrusive_lru_cache

Intrusive LRU Cache

This crate provides an LRU Cache implementation that is based on combining an intrusive doubly linked list and an intrusive red-black tree, in the same node. Both data structures share the same allocations, which makes it quite efficient for a linked structure.

Structs

• IntoIter
  An owning iterator over the key-value pairs in the cache, in order of most recently used to least recently used.
• LRUCache
  LRU Cache implementation using intrusive collections.

Enums

• InsertOrGetResult
  The result of LRUCache::insert_or_get.