def view_value
import bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend as BalancedSearchTreeimport Base
388def view_value(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, lower: Bound<K>, upper: Bound<K>, +descending: Bool, r: TreeMap<K, V, cmp> & Maybe<&2, V>) -> View<K, V, cmp> & Maybe<&2, V>:
389 (m, v) = r
390 (View{m, lower, upper, descending}, v)