def iterator_yield

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

import Base

408def iterator_yield(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, +id: Nat, lower: Bound<K>, upper: Bound<K>, +forward: Bool, entry: Entry<K, V>, r: TreeMap<K, V, cmp> & Nat) -> Cursor<K, V, cmp> & Maybe<&2, Entry<K, V>>:
409  (m, next) = r
410  (Cursor{m, next, id, lower, upper, forward}, Some{entry})