Struct VectorLite

pub struct VectorLite<const N: usize> { /* private fields */ }

A lightweight lsh-based ann index.

Implementations

impl<const N: usize> VectorLite<N>

pub fn new(num_trees: usize, max_leaf_size: usize) -> Self

Create a new VectorLite index with the given number of trees and max leaf size. More trees means more accuracy but slower search and larger memory usage. Lower max_leaf_size means higher accuracy but larger memory usage.

pub fn to_bytes(&self) -> Vec<u8>

pub fn from_bytes(bytes: &[u8]) -> Self

Trait Implementations

impl<const N: usize> ANNIndexOwned<N> for VectorLite<N>

fn insert_with_rng(&mut self, vector: Vector<N>, id: usize, rng: &mut impl Rng)

Insert a vector into the index with a custom rng.

fn delete_by_id(&mut self, id: usize)

Delete a vector from the index by id.

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

Search for the top_k nearest neighbors of the query vector.

fn insert(&mut self, vector: Vector<N>, id: usize)

Insert a vector into the index.

impl<'de, const N: usize> Deserialize<'de> for VectorLite<N>

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<const N: usize> Serialize for VectorLite<N>

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.