def iterator_has_next

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

import Base

1161def iterator_has_next(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, cursor: Cursor<K, V, cmp>) -> Cursor<K, V, cmp> & Bool:
1162  Cursor{m, +next, current, lower, upper, forward} = cursor
1163  iterator_has_checked(~K, ~V, ~cmp, next, current, lower, upper, forward, read(~K, ~V, ~cmp, m, next))