def iter_at

bend-collections@1.0.0.0 · src/containers/balanced_search_tree.bend:1413

import Base

1413def iter_at(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, +next: Nat, +current: Nat, lower: Bound<K>, upper: Bound<K>, +forward: Bool, m: TreeMap<K, V, cmp>) -> Cursor<K, V, cmp> & Maybe<&2, Entry<K, V>>:
1414  match next:
1415    case 0n:
1416      (Cursor{m, 0n, current, lower, upper, forward}, None{})
1417    case 1n+ +i:
1418      iter_value(~K, ~V, ~cmp, i, current, lower, upper, forward, get_id(~K, ~V, ~cmp, m, 1n+i))