Module im::ordmap
[−]
[src]
An ordered map.
An immutable ordered map implemented as a balanced 2-3 tree.
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
Iter | |
Keys | |
OrdMap | |
OrdMapLens | |
Values |