def ns_parent_ok
bend-collections@1.0.0.0 · src/containers/balanced_search_tree.bend:486
import bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend as BalancedSearchTree
import Base
486def ns_parent_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:
487 match ok:
488 case True{}:
489 ns_parent_fin(~K, limit, depth, cap, used, tags, lefts, rights, keys, Array.get(Nat, parents, U32.from_nat(i)))
490 case False{}:
491 (NS{limit, depth, cap, used, tags, lefts, rights, parents, keys}, 0n)