def ascend_tag

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

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

883def ascend_tag(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, +x: Nat, +p: Nat, +i: Nat, +forward: Bool, r: NodeStore<K> & Nat) -> NodeStore<K> & Ascend:
884  match r:
885    case Tuple{nodes, 0n}:
886      (nodes, Ascend{0n, 0n, True{}})
887    case Tuple{nodes, 1n+c}:
888      ascend_side(~K, ~V, ~cmp, x, p, i, side_at(~K, ~V, ~cmp, nodes, forward, i))

Uses (9)

Used by (1)