def nav_equal
import bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend as BalancedSearchTreeimport Base
1204def nav_equal(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, m: TreeMap<K, V, cmp>, +id: Nat, +higher: Bool, +inclusive: Bool) -> TreeMap<K, V, cmp> & Nat:
1205 match inclusive:
1206 case True{}:
1207 (m, id)
1208 case False{}:
1209 neighbor(~K, ~V, ~cmp, m, id, higher)