def insert_fix_loop
bend-collections@1.0.0.0 · src/containers/balanced_search_tree.bend:1618
import bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend as BalancedSearchTree
import Base
1618def insert_fix_loop(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, +fuel: Nat, st: TreeMap<K, V, cmp> & Fix) -> TreeMap<K, V, cmp>:
1619 match fuel st:
1620 case 0n Tuple{m, f}:
1621 black_root(~K, ~V, ~cmp, m)
1622 case 1n+p Tuple{m, Fix{z, False{}}}:
1623 black_root(~K, ~V, ~cmp, m)
1624 case 1n+p Tuple{m, Fix{z, True{}}}:
1625 insert_fix_loop(~K, ~V, ~cmp, p, insert_fix_step(~K, ~V, ~cmp, m, z))