IncrementalDiskANN

Struct IncrementalDiskANN 

Source
pub struct IncrementalDiskANN<D>
where D: Distance<f32> + Send + Sync + Copy + Clone + 'static,
{ /* private fields */ }
Expand description

An incremental DiskANN index supporting add/delete without full rebuild

Implementations§

Source§

impl<D> IncrementalDiskANN<D>
where D: Distance<f32> + Send + Sync + Copy + Clone + Default + 'static,

Source

pub fn build_default( vectors: &[Vec<f32>], file_path: &str, ) -> Result<Self, DiskAnnError>

Build a new incremental index with default parameters

Source

pub fn open(path: &str) -> Result<Self, DiskAnnError>

Open an existing index for incremental updates

Source§

impl<D> IncrementalDiskANN<D>
where D: Distance<f32> + Send + Sync + Copy + Clone + 'static,

Source

pub fn build_with_config( vectors: &[Vec<f32>], file_path: &str, config: IncrementalConfig, ) -> Result<Self, DiskAnnError>
where D: Default,

Build a new incremental index with custom configuration

Source

pub fn open_with_config( path: &str, config: IncrementalConfig, ) -> Result<Self, DiskAnnError>
where D: Default,

Open an existing index with custom configuration

Source

pub fn new_empty(dim: usize, dist: D, config: IncrementalConfig) -> Self

Create an empty incremental index (no base, delta-only)

Source

pub fn add_vectors( &self, vectors: &[Vec<f32>], ) -> Result<Vec<u64>, DiskAnnError>

Add new vectors to the index. Returns their assigned IDs.

Source

pub fn delete_vectors(&self, ids: &[u64]) -> Result<(), DiskAnnError>

Delete vectors by their IDs (lazy deletion via tombstones)

Source

pub fn is_deleted(&self, id: u64) -> bool

Check if a vector ID has been deleted

Source

pub fn search(&self, query: &[f32], k: usize, beam_width: usize) -> Vec<u64>

Search the index, merging results from base and delta, excluding tombstones

Source

pub fn search_with_dists( &self, query: &[f32], k: usize, beam_width: usize, ) -> Vec<(u64, f32)>

Search returning (id, distance) pairs

Source

pub fn search_batch( &self, queries: &[Vec<f32>], k: usize, beam_width: usize, ) -> Vec<Vec<u64>>

Parallel batch search

Source

pub fn get_vector(&self, id: u64) -> Option<Vec<f32>>

Get a vector by its ID (works for both base and delta)

Source

pub fn should_compact(&self) -> bool

Check if compaction is recommended

Source

pub fn compact(&mut self, new_path: &str) -> Result<(), DiskAnnError>
where D: Default,

Compact the index: merge base + delta, remove tombstones, write new file

Source

pub fn stats(&self) -> IncrementalStats

Get statistics about the index

Source

pub fn dim(&self) -> usize

Get the dimensionality of vectors in this index

Auto Trait Implementations§

§

impl<D> !Freeze for IncrementalDiskANN<D>

§

impl<D> RefUnwindSafe for IncrementalDiskANN<D>
where D: RefUnwindSafe,

§

impl<D> Send for IncrementalDiskANN<D>

§

impl<D> Sync for IncrementalDiskANN<D>

§

impl<D> Unpin for IncrementalDiskANN<D>
where D: Unpin,

§

impl<D> UnwindSafe for IncrementalDiskANN<D>
where D: UnwindSafe,

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V