Struct LinearSearchExternal

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

A linear search implementation of the ANNIndex trait. This performs no indexing and simply scans the entire dataset for each query. It’s useful as a baseline comparison and for small datasets.

Trait Implementations

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

type Index = LinearSearchExternal<'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.

fn memory_usage(&self) -> usize

Get the memory usage of the index.