Struct CacheFriendlyVectorIndex 

pub struct CacheFriendlyVectorIndex { /* private fields */ }

Cache-friendly vector index with optimized memory layout

Implementations

impl CacheFriendlyVectorIndex

pub fn new(config: IndexConfig) -> Self

Trait Implementations

impl VectorIndex for CacheFriendlyVectorIndex

fn insert(&mut self, uri: String, vector: Vector) -> Result<()>

Insert a vector with associated URI

fn search_knn(&self, query: &Vector, k: usize) -> Result<Vec<(String, f32)>>

Find k nearest neighbors

fn search_threshold( &self, query: &Vector, threshold: f32, ) -> Result<Vec<(String, f32)>>

Find all vectors within threshold similarity

fn get_vector(&self, _uri: &str) -> Option<&Vector>

Get a vector by its URI

fn add_vector( &mut self, id: VectorId, vector: Vector, _metadata: Option<HashMap<String, String>>, ) -> Result<()>

Add a vector with associated ID and metadata

fn update_vector(&mut self, id: VectorId, vector: Vector) -> Result<()>

Update an existing vector

fn update_metadata( &mut self, _id: VectorId, _metadata: HashMap<String, String>, ) -> Result<()>

Update metadata for a vector

fn remove_vector(&mut self, _id: VectorId) -> Result<()>

Remove a vector by its ID

fn iter_vectors(&self) -> Vec<(String, Vector)>

Iterate all stored (id, vector) pairs.

fn supports_enumeration(&self) -> bool

Whether VectorIndex::iter_vectors returns a real, complete enumeration of the vectors held by this index.