def ns_right_ok
bend-collections@1.0.0.0 · src/containers/balanced_search_tree.bend:479
import bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend as BalancedSearchTree
import Base
479def ns_right_ok(~K: Data, +limit: Nat, +depth: Nat, +cap: Nat, +used: Nat, tags: Array<Nat>, lefts: Array<Nat>, rights: Array<Nat>, parents: Array<Nat>, keys: Array<Maybe<&2, K>>, +i: Nat, ok: Bool) -> NodeStore<K> & Nat:
480 match ok:
481 case True{}:
482 ns_right_fin(~K, limit, depth, cap, used, tags, lefts, parents, keys, Array.get(Nat, rights, U32.from_nat(i)))
483 case False{}:
484 (NS{limit, depth, cap, used, tags, lefts, rights, parents, keys}, 0n)