Skip to main content

LirePatcher

Struct LirePatcher 

Source
pub struct LirePatcher<'a> {
    pub main: &'a mut HnswIndex,
    pub delta: &'a mut DeltaIndex,
    pub drift_threshold: f32,
}
Expand description

SPFresh LIRE-style topology-aware local patcher.

Holds mutable references to both the main HNSW and the delta buffer so both can be updated atomically within a single flush.

Fields§

§main: &'a mut HnswIndex

Main HNSW graph that fresh vectors will be patched into.

§delta: &'a mut DeltaIndex

Delta buffer whose fresh vectors (and tombstones) will be drained.

§drift_threshold: f32

Drift threshold in [0.0, 1.0]. When the average neighbor-overlap fraction for a batch falls below this value the subgraph is flagged for deeper re-pruning. Default: 0.3.

Implementations§

Source§

impl<'a> LirePatcher<'a>

Source

pub fn new(main: &'a mut HnswIndex, delta: &'a mut DeltaIndex) -> Self

Create a patcher with the default drift threshold (0.3).

Source

pub fn patch( &mut self, _k_neighbors: usize, _ef_construction: usize, ) -> Result<PatchStats, VectorError>

Flush the delta buffer into the main HNSW.

§Steps
  1. Drain tombstones → call HnswIndex::delete on each.
  2. Drain fresh vectors → call HnswIndex::insert on each.
  3. After each insert, estimate local topology drift for the newly assigned node and accumulate the overlap fraction.
  4. If average overlap fraction < drift_threshold, increment drift_subgraphs.

k_neighbors and ef_construction are accepted for API completeness and forward-compatibility with future Vamana-style patchers; the current HNSW implementation derives its own neighbor count from HnswParams stored on the index, so these values are informational.

Auto Trait Implementations§

§

impl<'a> Freeze for LirePatcher<'a>

§

impl<'a> !RefUnwindSafe for LirePatcher<'a>

§

impl<'a> Send for LirePatcher<'a>

§

impl<'a> !Sync for LirePatcher<'a>

§

impl<'a> Unpin for LirePatcher<'a>

§

impl<'a> UnsafeUnpin for LirePatcher<'a>

§

impl<'a> !UnwindSafe for LirePatcher<'a>

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> ArchivePointee for T

Source§

type ArchivedMetadata = ()

The archived version of the pointer metadata for this type.
Source§

fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata

Converts some archived metadata to the pointer metadata for itself.
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> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
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> LayoutRaw for T

Source§

fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>

Returns the layout of the type.
Source§

impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
where T: SharedNiching<N1, N2>, N1: Niching<T>, N2: Niching<T>,

Source§

unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool

Returns whether the given value has been niched. Read more
Source§

fn resolve_niched(out: Place<NichedOption<T, N1>>)

Writes data to out indicating that a T is niched.
Source§

impl<T> Pointee for T

Source§

type Metadata = ()

The metadata type for pointers and references to this type.
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
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

Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more