def alloc_read
bend-collections@1.0.0.0 · src/containers/balanced_search_tree.bend:990
import bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend as BalancedSearchTree
import Base
990def alloc_read(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, +id: Nat, +p: Nat, +k: K, +v: V, r: TreeMap<K, V, cmp> & Node<K>) -> TreeMap<K, V, cmp> & Result<&2, &2, Rejected<K, V>, Nat>:
991 match r:
992 case Tuple{m, Free{next}}:
993 reuse_slot(~K, ~V, ~cmp, m, id, next, p, k, v)
994 case Tuple{m, N{c, l, r, q, oldk}}:
995 (m, Fail{Rejected{CapacityExceeded{}, k, v}})