def iterator_set_done

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

import Base

412def iterator_set_done(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, +next: Nat, +current: Nat, lower: Bound<K>, upper: Bound<K>, +forward: Bool, r: TreeMap<K, V, cmp> & Maybe<&2, V>) -> Cursor<K, V, cmp> & Result<&2, &2, Error, V>:
413  match r:
414    case Tuple{m, Some{old}}:
415      (Cursor{m, next, current, lower, upper, forward}, Done{old})
416    case Tuple{m, None{}}:
417      (Cursor{m, next, current, lower, upper, forward}, Fail{NoCurrent{}})