def range_start
bend-collections@1.0.0.0 · src/containers/balanced_search_tree.bend:1368
import bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend as BalancedSearchTree
import Base
1368def range_start(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, m: TreeMap<K, V, cmp>, bound: Bound<K>, +forward: Bool) -> TreeMap<K, V, cmp> & Nat:
1369 match bound:
1370 case Unbounded{}:
1371 range_unbounded(~K, ~V, ~cmp, m, forward)
1372 case Inclusive{k}:
1373 navigate(~K, ~V, ~cmp, m, k, forward, True{})
1374 case Exclusive{k}:
1375 navigate(~K, ~V, ~cmp, m, k, forward, False{})