Order Preserving map; as map, but f must be order preserving; i.e. if a < b then f a < f b. This allows the tree structure to be maintained internally, resulting in O(n) work instead of O(n log n).

• since 2.1