def delete_stop
bend-collections@1.0.0.0 · src/containers/balanced_search_tree.bend:1690
import bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend as BalancedSearchTree
import Base
1690def delete_stop(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, m: TreeMap<K, V, cmp>, +x: Nat, +p: Nat, +pn: Node<K>, +stop: Bool) -> TreeMap<K, V, cmp> & DeleteFix:
1691 match stop:
1692 case True{}:
1693 (set_red(~K, ~V, ~cmp, m, x, False{}), DF{0n, 0n, False{}})
1694 case False{}:
1695 delete_side(~K, ~V, ~cmp, m, x, p, pn, Nat.is_eq(x, node_left(~K, pn)))