def extreme_start
bend-collections@1.0.0.0 · src/containers/balanced_search_tree.bend:1055
import bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend as BalancedSearchTree
import Base
1055def extreme_start(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, nodes: NodeStore<K>, +n: Nat, +id: Nat, +forward: Bool) -> NodeStore<K> & Nat:
1056 match id:
1057 case 0n:
1058 (nodes, 0n)
1059 case 1n+ +j:
1060 extreme_slots_loop(~K, ~V, ~cmp, 1n+n, forward, 1n+j, extreme_at(~K, ~V, ~cmp, forward, nodes, j))