Expand description
The LruMap is a data structure that mimics a small subset of the standard
HashMap but with the added feature that it keeps track of the least
recently used nodes and optionally supports setting a Time-To-Live duration
which can be used to drain nodes that have timed out.
Structs
Iterator that removes and returns every element in the LruMap.
A HashMap which maintains an internal last recently used node list.