Struct UpdatableVGraph 

pub struct UpdatableVGraph { /* private fields */ }

A mapped base plus a mutable graph delta, with atomic durable batches. insert, delete, and replace publish immediately; commit makes the batch durable. Only one process may open a directory, while any number of threads may search it.

Implementations

impl UpdatableVGraph

pub fn create( path: &Path, data: &[f32], dim: usize, params: &BuildParams, ) -> Result<Self, UpdateError>

Creates a new directory from row-major vectors with ids 0..n.

pub fn create_from_graph( path: &Path, graph: &Graph, vertex: &VGraph, ) -> Result<Self, UpdateError>

Saves a graph and its matching vertex encoding without rebuilding the graph.

pub fn open(path: &Path) -> Result<Self, UpdateError>

Opens and replays committed batches; truncates only an incomplete final frame.

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn dim(&self) -> usize

pub fn insert(&self, id: u32, vector: &[f32]) -> Result<(), UpdateError>

Stages a new id in the current batch.

pub fn delete(&self, id: u32) -> Result<(), UpdateError>

Stages deletion of an existing id.

pub fn replace(&self, id: u32, vector: &[f32]) -> Result<(), UpdateError>

Atomically invalidates the previous vector and inserts the replacement.

pub fn batch_capacity(&self) -> usize

Most operations one batch can stage before commit for vectors of this dimension.

pub fn insert_batch( &self, ids: &[u32], vectors: &[f32], ) -> Result<(), UpdateError>

Stages new ids for row-major vectors, all or none, linking them into the delta in parallel. Up to batch_capacity operations fit in one batch.

pub fn commit(&self) -> Result<(), UpdateError>

Appends the whole pending batch and completes its durable sync.

pub fn search( &self, query: &[f32], k: usize, params: VSearchParams, ) -> Result<Vec<u32>, UpdateError>

Searches a consistent in-memory view. k is clamped to the live count.

pub fn search_into( &self, query: &[f32], k: usize, params: VSearchParams, out: &mut Vec<u32>, ) -> Result<(), UpdateError>

Searches with a reusable result buffer, avoiding allocation on clean-base queries.

pub fn needs_consolidation( &self, policy: ConsolidationPolicy, ) -> Result<bool, UpdateError>

pub fn consolidate(&self) -> Result<(), UpdateError>

Commits pending work and publishes a new immutable generation while readers run.