def get_id_finish
bend-collections@1.0.0.0 · src/containers/balanced_search_tree.bend:296
import bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend as BalancedSearchTree
import Base
import bend-collections@1.0.0.0/src/containers/dynamic_array.bend as D
import bend-collections@1.0.0.0/src/containers/types/dynamic_array.bend as DE
296def get_id_finish(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, +n: Nat, +root: Nat, +lo: Nat, +hi: Nat, +free: Nat, nodes: NodeStore<K>, r: D.DynArray<&2, Maybe<&2, V>> & Result<&2, &2, DE.Error, Maybe<&2, V>>) -> TreeMap<K, V, cmp> & Maybe<&2, V>:
297 match r:
298 case Tuple{payloads, Done{x}}:
299 (TM{n, root, lo, hi, free, nodes, payloads}, x)
300 case Tuple{payloads, Fail{e}}:
301 (TM{n, root, lo, hi, free, nodes, payloads}, None{})