def view_entry_result

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

import Base

840def view_entry_result(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, +lower: Bound<K>, +upper: Bound<K>, +descending: Bool, r: TreeMap<K, V, cmp> & Maybe<&2, Entry<K, V>>) -> View<K, V, cmp> & Maybe<&2, Entry<K, V>>:
841  match r:
842    case Tuple{m, None{}}:
843      (View{m, lower, upper, descending}, None{})
844    case Tuple{m, Some{Entry{+k, v}}}:
845      view_entry_checked(~K, ~V, ~cmp, m, lower, upper, descending, Entry{k, v}, in_range(~K, ~V, ~cmp, k, lower, upper))