Struct LshExternal

pub struct LshExternal<'a, const N: usize> { /* private fields */ }

A simple LSH-based ANNIndex implementation.

Implementations

impl<const N: usize> LshExternal<'_, N>

pub fn inner_node_count(&self) -> usize

Count the number of inner nodes in the index.

Trait Implementations

impl<'a, const N: usize> ANNIndexExternal<'a, N> for LshExternal<'a, N>

fn memory_usage(&self) -> usize

Get the memory usage of the index.

type Index = LshExternal<'a, N>

fn build<R: Rng>( num_trees: usize, max_leaf_size: usize, vectors: &'a [Vector<N>], rng: &mut R, ) -> Result<Self::Index, &'static str>

Build the index for the given vectors and ids.

fn search(&self, query: &Vector<N>, top_k: usize) -> Vec<(usize, f32)>

Search for the top_k nearest neighbors of the query vector.