Expand description
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.
Macros
Construct a map from a sequence of key/value pairs.
Structs
A consuming iterator over an ordered set.
An iterator over the differences between two maps.
An iterator over the key/value pairs of a map.
An iterator ove the keys of a map.
An iterator over the differences between two ordered sets.
An entry for a mapping that already exists in the map.
An ordered map.
A memory pool for the appropriate node type.
An iterator over an ordered set.
An entry for a mapping that does not already exist in the map.
An iterator over the values of a map.
Enums
A description of a difference between two ordered maps.
A handle for a key and its associated value.
A description of a difference between two ordered sets.