def read_finish
bend-collections@1.0.0.0 · src/containers/balanced_search_tree.bend:240
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
240def read_finish(~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>>, r: NodeStore<K> & Result<&2, &2, DE.Error, Node<K>>) -> TreeMap<K, V, cmp> & Node<K>:
241 match r:
242 case Tuple{nodes, Done{x}}:
243 (TM{n, root, lo, hi, free, nodes, payloads}, x)
244 case Tuple{nodes, Fail{e}}:
245 (TM{n, root, lo, hi, free, nodes, payloads}, Free{0n})