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
A draining
Iterator that will on each iteration return ownership of
the key/value pair of the next entry in the map.A draining
Iterator that will on each iteration call a closure which,
if it returns true, will drain (remove and return) the current key/value
pair.Iterator that removes and returns every element in the LruMap.
A HashMap which maintains an internal least recently used nodes list.