def view_extreme

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

import Base

1427def view_extreme(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, view: View<K, V, cmp>, +first: Bool) -> View<K, V, cmp> & Maybe<&2, Entry<K, V>>:
1428  View{m, +lower, +upper, +descending} = view
1429  +up = pick(Bool, descending, Bool.not(first), first)
1430  view_entry_result(~K, ~V, ~cmp, lower, upper, descending, entry_snapshot(~K, ~V, ~cmp, range_start(~K, ~V, ~cmp, m, pick(Bound<K>, up, lower, upper), up)))