BalancedSearchTree.range_start: def of bend-collections@1.0.0.0
Import: import bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend as BalancedSearchTree
Lines 1368-1375 of bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend: https://jend.leeeet.dev/read.txt?path=bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend&start_line=1368&end_line=1375

import Base

def 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:
  match bound:
    case Unbounded{}:
      range_unbounded(~K, ~V, ~cmp, m, forward)
    case Inclusive{k}:
      navigate(~K, ~V, ~cmp, m, k, forward, True{})
    case Exclusive{k}:
      navigate(~K, ~V, ~cmp, m, k, forward, False{})

Uses (8):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Cmp
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Pair
  https://jend.leeeet.dev/definition.txt?path=bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend&name=Bound
  https://jend.leeeet.dev/definition.txt?path=bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend&name=TreeMap
  https://jend.leeeet.dev/definition.txt?path=bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend&name=navigate
  https://jend.leeeet.dev/definition.txt?path=bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend&name=range_unbounded