def refresh_ends_1
import bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend as BalancedSearchTreeimport Base
1200def refresh_ends_1(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, pair_result: TreeMap<K, V, cmp> & Nat) -> TreeMap<K, V, cmp>:
1201 (m1, +r) = pair_result
1202 refresh_ends_2(~K, ~V, ~cmp, r, extreme(~K, ~V, ~cmp, m1, r, False{}))