Expand description
A linked hash map ordered by insertion which can be reordered by swapping, useful as a simple priority queue (e.g. an LFU or LRU cache).
Note: LinkedHashMap
is indexed by keys.
For indexing by cardinal order, use a super::List
instead.
Structs
- An iterator over the contents of a
LinkedHashMap
- An iterator over the entries in a
LinkedHashMap
- An iterator over the keys in a
LinkedHashMap
- A hash map in insertion order which can be reordered using
Self::bump
andSelf::swap
. - An iterator over the values in a
LinkedHashMap