keen/col/sorted-map

Source
sorted-map[k, v] record (has private fields)
list-new[k, v] (k, v) sorted-map(pairs (k, v)[]) k sorted-key
named-new[v] (symbol, v) sorted-map(names symbol[], values v[])
any[k, v] bool(a (k, v) sorted-map) k sorted-key
size[k, v] nat32(a (k, v) sorted-map)
to[k, v] (k, v) sorted-map(a (k, v)[]) k sorted-key
to[k, v] (k, v)[](a (k, v) sorted-map)
subscript[k, v] v option(a (k, v) sorted-map, key k) k sorted-key
~[k, v] (k, v) sorted-map(a (k, v) sorted-map, (key k, value v)) k sorted-key
~~[k, v] (k, v) sorted-map(a (k, v) sorted-map, b (k, v) sorted-map) k sorted-key
Adds all pairs in b to a. Values in b overwrite those in a. For a more customizable version, see merge.
-[k, v] (k, v) sorted-map(a (k, v) sorted-map, key k) k sorted-key
remove[k, v] (v, (k, v) sorted-map) option(a (k, v) sorted-map, key k) k sorted-key
merge[k, v] (k, v) sorted-map(a (k, v) sorted-map, b (k, v) sorted-map, f v mut((k, v, v) tuple3)) k sorted-key
Returns a map containing keys that are in either a or b. Calls f when the same key appears in both; otherwise uses the value from whichever one has the key.
intersect[k, v] (k, v) sorted-map(a (k, v) sorted-map, b (k, v) sorted-map, f v mut((k, v, v) tuple3)) k sorted-key
Returns a map containing only keys that are in both a and b. Calls f on values with the same key.
some[k, v] bool(a (k, v) sorted-map, f bool mut((k, v)))
some-reverse[k, v] bool(a (k, v) sorted-map, f bool mut((k, v)))
min-key[k, v] k option(a (k, v) sorted-map) k sorted-key
max-key[k, v] k option(a (k, v) sorted-map) k sorted-key