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	A consuming iterator over an ordered set.
DiffIter	An iterator over the differences between two ordered sets.
Iter	An iterator over the key/value pairs of a map.
Keys	An iterator ove the keys of a map.
OccupiedEntry	An entry for a mapping that already exists in the map.
OrdMap	An ordered map.
OrdMapPool	A memory pool for the appropriate node type.
RangedIter	An iterator over an ordered set.
VacantEntry	An entry for a mapping that does not already exist in the map.
Values	An iterator over the values of a map.

Enums

DiffItem	A description of a difference between two ordered sets.
Entry	A handle for a key and its associated value.