def ascend_par

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

import bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend as BalancedSearchTree
import Base

567def ascend_par(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, +x: Nat, +p: Nat, +s: Nat, r: NodeStore<K> & Nat) -> NodeStore<K> & Ascend:
568  (nodes, +q) = r
569  (nodes, ascend_choice(p, p, q, Nat.is_eq(x, s)))

Uses (8)

Used by (1)