def iterator_next

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

import Base

1452def iterator_next(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, cursor: Cursor<K, V, cmp>) -> Cursor<K, V, cmp> & Maybe<&2, Entry<K, V>>:
1453  Cursor{m, +next, current, lower, upper, forward} = cursor
1454  iter_at(~K, ~V, ~cmp, next, current, lower, upper, forward, m)