def delete_side
bend-collections@1.0.0.0 · src/containers/balanced_search_tree.bend:1673
import bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend as BalancedSearchTree
import Base
1673def delete_side(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, m: TreeMap<K, V, cmp>, +x: Nat, +p: Nat, +pn: Node<K>, +on_left: Bool) -> TreeMap<K, V, cmp> & DeleteFix:
1674 match on_left:
1675 case True{}:
1676 delete_side_left(~K, ~V, ~cmp, m, p, pn)
1677 case False{}:
1678 delete_side_right(~K, ~V, ~cmp, m, p, pn)