def insert_uncle_right
bend-collections@1.0.0.0 · src/containers/balanced_search_tree.bend:1322
import bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend as BalancedSearchTree
import Base
1322def insert_uncle_right(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, m: TreeMap<K, V, cmp>, +z: Nat, +p: Nat, +g: Nat, +u: Nat, +triangle: Bool, +uncle: Node<K>) -> TreeMap<K, V, cmp> & Fix:
1323 match uncle:
1324 case N{True{}, l, r, gp, k}:
1325 (set_red(~K, ~V, ~cmp, set_red(~K, ~V, ~cmp, set_red(~K, ~V, ~cmp, m, p, False{}), u, False{}), g, True{}), Fix{g, True{}})
1326 case _:
1327 insert_black_right(~K, ~V, ~cmp, m, z, p, g, triangle)