Struct BinaryStore 

pub struct BinaryStore { /* private fields */ }

Binary code store for Hamming distance pre-filtering. Encodes vectors as 1-bit-per-dimension codes via randomized Walsh-Hadamard rotation + sign extraction (SimHash).

Implementations

impl BinaryStore

pub fn from_parts( codes: Vec<u64>, code_words: usize, signs: Vec<f32>, block_size: usize, ) -> Self

Reassemble from persisted parts (the ANN segment decode path). The SIGNS are persisted rather than re-derived from the seed, so a future seed change can never silently desynchronize codes from queries.

pub fn codes(&self) -> &[u64]

pub fn signs(&self) -> &[f32]

pub fn block_size(&self) -> usize

pub fn build(store: &PointStore) -> Self

Build binary codes: random sign flips (D) + Walsh-Hadamard in blocks of largest_pow2_factor(dim). Fixed seed for build/query consistency.

pub fn empty(dim: usize) -> Self

A store with signs but no codes, for configs that never consult the binary pre-filter (binary_rerank == 0). encode_query stays valid; code() must not be reached (every caller is gated on the rerank factor), so the per-point encoding pass and its memory are skipped.

pub fn code(&self, id: u32) -> &[u64]

Get the binary code (packed u64 words) for point id.

pub fn code_words(&self) -> usize

Number of u64 words per binary code.

pub fn encode_query(&self, query: &[f32]) -> Vec<u64>

Encode a query vector to binary code using the same HD rotation.