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
An entry for a mapping that already exists in the map.
An ordered map.
An entry for a mapping that does not already exist in the map.