def cursor_started

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

import Base

396def cursor_started(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, lower: Bound<K>, upper: Bound<K>, +forward: Bool, r: TreeMap<K, V, cmp> & Nat) -> Cursor<K, V, cmp>:
397  (m, id) = r
398  Cursor{m, id, 0n, lower, upper, forward}