Sstable.key_idxs: def of mylsm-lsm-store@0.6.0.1
Import: import mylsm-lsm-store@0.6.0.1/src/Sstable.bend as Sstable
Lines 290-298 of mylsm-lsm-store@0.6.0.1/src/Sstable.bend: https://jend.leeeet.dev/read.txt?path=mylsm-lsm-store@0.6.0.1/src/Sstable.bend&start_line=290&end_line=298

import Base

# --- Hybrid bloom (spike): parallel index collection, sequential assembly ---
# Phase 1 emits a flat index list (two per key); joins concatenate, so no
# chunk tree or union is ever built. Phase 2 folds the indexes into ONE tree
# on the CPU. This removes the tree-allocation amplification that costs ~10%
# at 1M scale in the chunk+union design, while keeping a fork tree that a
# future `!` can ship once the GPU recovery crash is fixed upstream.
# Both bit positions of one key as a flat two-element list.
def key_idxs(+key: String, +size: Nat) -> List<&2, Nat>:
  Con{bhash_n(key, 17, size), Con{bhash_n(key, 257, size), Nil{}}}

Uses (4):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=String
  https://jend.leeeet.dev/definition.txt?path=mylsm-lsm-store@0.6.0.1/src/Sstable.bend&name=bhash_n