Sorted map backed by a sorted array with O(log n) lookup via binary search.

Example

{ BTreeMap } :: import "std/collections/btree_map";

m := BTreeMap(String, i32).new();
m.set(String.from("b"), 2);
m.set(String.from("a"), 1);
// Iteration order: a, b