def insert_uncle_left
bend-collections@1.0.0.0 · src/containers/balanced_search_tree.bend:1315
import bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend as BalancedSearchTree
import Base
1315def insert_uncle_left(~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:
1316 match uncle:
1317 case N{True{}, l, r, gp, k}:
1318 (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{}})
1319 case _:
1320 insert_black_left(~K, ~V, ~cmp, m, z, p, g, triangle)