def ns_key_ok

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

import Base

493def ns_key_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> & Maybe<&2, K>:
494  match ok:
495    case True{}:
496      ns_key_fin(~K, limit, depth, cap, used, tags, lefts, rights, parents, Array.get(Maybe<&2, K>, keys, U32.from_nat(i)))
497    case False{}:
498      (NS{limit, depth, cap, used, tags, lefts, rights, parents, keys}, None{})