def insert_side
bend-collections@1.0.0.0 · src/containers/balanced_search_tree.bend:1467
import bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend as BalancedSearchTree
import Base
1467def insert_side(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, m: TreeMap<K, V, cmp>, +z: Nat, +p: Nat, +g: Nat, +pn: Node<K>, +gn: Node<K>, +on_left: Bool) -> TreeMap<K, V, cmp> & Fix:
1468 match on_left:
1469 case True{}:
1470 insert_side_left(~K, ~V, ~cmp, m, z, p, g, pn, gn)
1471 case False{}:
1472 insert_side_right(~K, ~V, ~cmp, m, z, p, g, pn, gn)