def ascend_slots_loop
bend-collections@1.0.0.0 · src/containers/balanced_search_tree.bend:997
import bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend as BalancedSearchTree
import Base
997def ascend_slots_loop(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, +fuel: Nat, +forward: Bool, st: NodeStore<K> & Ascend) -> NodeStore<K> & Nat:
998 match fuel st:
999 case 0n Tuple{nodes, state}:
1000 (nodes, 0n)
1001 case 1n+f Tuple{nodes, Ascend{x, p, True{}}}:
1002 (nodes, p)
1003 case 1n+f Tuple{nodes, Ascend{+x, +p, False{}}}:
1004 ascend_slots_loop(~K, ~V, ~cmp, f, forward, ascend_at(~K, ~V, ~cmp, x, p, forward, nodes))