Struct LSH

pub struct LSH { /* private fields */ }

Locality Sensitive Hashing for approximate nearest neighbor search

Implementations

impl LSH

pub fn new(vector_dim: usize, num_tables: usize, hash_size: usize) -> Self

Create a new LSH index with dynamic sizing

pub fn with_expected_size( vector_dim: usize, num_tables: usize, hash_size: usize, expected_size: usize, ) -> Self

Create a new LSH index with expected dataset size for optimal memory allocation

pub fn add_vector(&mut self, vector: Array1<f32>, data: f32)

Add a vector to the LSH index with dynamic resizing

pub fn query( &self, query_vector: &Array1<f32>, k: usize, ) -> Vec<(Array1<f32>, f32, f32)>

Find approximate nearest neighbors

pub fn stats(&self) -> LSHStats

Get statistics about the index

pub fn save_to_database(&self, db: &Database) -> Result<(), Box<dyn Error>>

Save LSH configuration and hash functions to database

pub fn load_from_database( db: &Database, positions: &[(Array1<f32>, f32)], ) -> Result<Option<Self>, Box<dyn Error>>

Load LSH configuration from database and rebuild hash tables

pub fn from_database_or_new( db: &Database, positions: &[(Array1<f32>, f32)], vector_dim: usize, num_tables: usize, hash_size: usize, ) -> Result<Self, Box<dyn Error>>

Create LSH from database or return None if no saved configuration exists

Trait Implementations

impl Clone for LSH

fn clone(&self) -> LSH

Returns a duplicate of the value.

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

Performs copy-assignment from source.