def snap_kv

bend-collections@1.0.0.0 · src/containers/balanced_search_tree.bend:341

import Base
import bend-collections@1.0.0.0/src/containers/dynamic_array.bend as D

341def snap_kv(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, +n: Nat, +root: Nat, +lo: Nat, +hi: Nat, +free: Nat, payloads: D.DynArray<&2, Maybe<&2, V>>, nodes: NodeStore<K>, mk: Maybe<&2, K>, mv: Maybe<&2, V>) -> TreeMap<K, V, cmp> & Maybe<&2, Entry<K, V>>:
342  match mk mv:
343    case Some{key} Some{v}:
344      (TM{n, root, lo, hi, free, nodes, payloads}, Some{Entry{key, v}})
345    case _ _:
346      (TM{n, root, lo, hi, free, nodes, payloads}, None{})