def nav_end
bend-collections@1.0.0.0 · src/containers/balanced_search_tree.bend:1262
import bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend as BalancedSearchTree
import Base
import bend-collections@1.0.0.0/src/containers/dynamic_array.bend as D
1262def nav_end(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, +n: Nat, +root: Nat, +lo: Nat, +hi: Nat, +free: Nat, payloads: D.DynArray<&2, Maybe<&2, V>>, +higher: Bool, +inclusive: Bool, r: NodeStore<K> & NavEnd) -> TreeMap<K, V, cmp> & Nat:
1263 match r:
1264 case Tuple{nodes, NavBest{b}}:
1265 (TM{n, root, lo, hi, free, nodes, payloads}, b)
1266 case Tuple{nodes, NavEqual{+id}}:
1267 nav_equal(~K, ~V, ~cmp, TM{n, root, lo, hi, free, nodes, payloads}, id, higher, inclusive)