Sstable.bloom_union_trees: def of mylsm-lsm-store@0.6.0.1
Import: import mylsm-lsm-store@0.6.0.1/src/Sstable.bend as Sstable
Lines 251-257 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=251&end_line=257

import Base
import mylsm-lsm-store@0.6.0.1/src/BitTree.bend as BitTree

# Handle Bloom filter data for union trees for the SSTable indexes, filters, and lookup.
def bloom_union_trees(+abits: BitTree.BitTree, +bbits: BitTree.BitTree, size: Nat) -> Bloom:
  match abits:
    case BitTree.BT{aroot, awords, acap, aheight}:
      match bbits:
        case BitTree.BT{broot, bwords, bcap, bheight}:
          Blm{BitTree.BT{BitTree.union_bits(aroot, broot), awords, acap, aheight}, size}

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