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§
- ordmap
- Construct a map from a sequence of key/value pairs.
Structs§
- Consuming
Iter - A consuming iterator over an ordered set.
- Diff
Iter - An iterator over the differences between two maps.
- Iter
- An iterator over the key/value pairs of a map.
- Keys
- An iterator ove the keys of a map.
- Node
Diff Iter - An iterator over the differences between two ordered sets.
- Occupied
Entry - An entry for a mapping that already exists in the map.
- OrdMap
- An ordered map.
- OrdMap
Pool - A memory pool for the appropriate node type.
- Ranged
Iter - An iterator over an ordered set.
- Vacant
Entry - An entry for a mapping that does not already exist in the map.
- Values
- An iterator over the values of a map.
Enums§
- Diff
Item - A description of a difference between two ordered maps.
- Entry
- A handle for a key and its associated value.
- Node
Diff Item - A description of a difference between two ordered sets.