Module im::ordmap

An ordered map.

An immutable ordered map implemented as a [B-tree] 1.

Most operations on this type of map are O(log n). A HashMap is usually a better choice for performance, but the OrdMap has the advantage of only requiring an Ord constraint on the key, and of being ordered, so that keys always come out from lowest to highest, where a HashMap has no guaranteed ordering.

Structs

ConsumingIter
DiffIter
Iter
Keys
OccupiedEntry	An entry for a mapping that already exists in the map.
OrdMap	An ordered map.
RangedIter
VacantEntry	An entry for a mapping that does not already exist in the map.
Values

Enums

DiffItem
Entry	A handle for a key and its associated value.