Struct BpsScanner 

pub struct BpsScanner<'a> { /* private fields */ }

BPS scanner for streaming candidate generation

Implementations

impl<'a> BpsScanner<'a>

pub fn new( bps_data: &'a [u8], n_vec: usize, num_blocks: usize, num_proj: usize, ) -> Self

Create a new BPS scanner

pub fn scan(&self, query_sketch: &[u8]) -> Vec<u16>

Scan and compute L1 distances to query sketch Returns distances for all vectors (lower = more similar)

Uses SIMD-accelerated C++ kernels via FFI when available:

• AVX2: 32 vectors per cycle (~32x speedup)
• AVX512: 64 vectors per cycle (~64x speedup)
• NEON: 16 vectors per cycle (~16x speedup)

pub fn top_k(&self, query_sketch: &[u8], k: usize) -> Vec<(u32, u16)>

Get top-k candidates by distance (lower is better)