Struct BinaryIndex 

pub struct BinaryIndex { /* private fields */ }

Index of binary vectors for fast batch search

Implementations

impl BinaryIndex

pub fn new(dim: usize) -> Self

Create a new binary index

pub fn with_capacity(dim: usize, capacity: usize) -> Self

Create with pre-allocated capacity

pub fn add(&mut self, vector: &BinaryVector)

Add a vector to the index

pub fn add_f32(&mut self, vector: &[f32])

Add a fp32 vector (will be quantized)

pub fn len(&self) -> usize

Get number of vectors in the index

pub fn is_empty(&self) -> bool

Check if index is empty

pub fn memory_bytes(&self) -> usize

Get memory usage in bytes

pub fn get(&self, idx: usize) -> Option<BinaryVector>

Get a vector by index

pub fn search(&self, query: &BinaryVector, k: usize) -> Vec<(usize, u32)>

Search for k nearest neighbors using Hamming distance

Returns (index, hamming_distance) pairs sorted by distance.

pub fn search_f32(&self, query: &[f32], k: usize) -> Vec<(usize, u32)>

Search from fp32 query (will be quantized)

pub fn batch_search( &self, queries: &[BinaryVector], k: usize, ) -> Vec<Vec<(usize, u32)>>

Batch search for multiple queries

More efficient than individual searches due to cache locality.

Trait Implementations

impl Clone for BinaryIndex

fn clone(&self) -> BinaryIndex

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.