An ordered map.
An immutable ordered map implemented as a B-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
Ord constraint on the key, and of being
ordered, so that keys always come out from lowest to highest,
HashMap has no guaranteed ordering.