def iterator_reseek

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

import Base

1098def iterator_reseek(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, k: Maybe<&2, K>, lower: Bound<K>, upper: Bound<K>, +forward: Bool, r: TreeMap<K, V, cmp> & Maybe<&2, V>) -> Cursor<K, V, cmp> & Maybe<&2, V>:
1099  match k r:
1100    case None{} Tuple{m, removed}:
1101      (Cursor{m, 0n, 0n, lower, upper, forward}, removed)
1102    case Some{key} Tuple{m, removed}:
1103      iterator_relocated(~K, ~V, ~cmp, lower, upper, forward, removed, search(~K, ~V, ~cmp, m, key))