def put_absent_found

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

import Base

1680def put_absent_found(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, +k: K, +v: V, r: TreeMap<K, V, cmp> & Search) -> TreeMap<K, V, cmp> & Result<&2, &2, Rejected<K, V>, Maybe<&2, V>>:
1681  match r:
1682    case Tuple{m, Search{0n, +p, +on_left}}:
1683      put_allocated(~K, ~V, ~cmp, p, on_left, allocate(~K, ~V, ~cmp, m, p, k, v))
1684    case Tuple{m, Search{1n+i, p, on_left}}:
1685      put_replaced(~K, ~V, ~cmp, get_id(~K, ~V, ~cmp, m, 1n+i))