pub struct HnswIndex { /* private fields */ }Expand description
Hand-rolled HNSW index over f32 vectors.
Implementations§
Source§impl HnswIndex
impl HnswIndex
Sourcepub fn new(distance: Distance, params: HnswParams) -> Self
pub fn new(distance: Distance, params: HnswParams) -> Self
Build an empty index.
Sourcepub fn insert(&mut self, id: NodeId, vector: Vec<f32>) -> Result<(), IndexError>
pub fn insert(&mut self, id: NodeId, vector: Vec<f32>) -> Result<(), IndexError>
Insert a new vector under id.
§Errors
IndexError::Empty for a zero-dim vector,
IndexError::DimensionMismatch when the vector’s
dimension differs from the index’s frozen dimension,
and IndexError::Duplicate when id is already in
the index.
Sourcepub fn delete(&mut self, id: NodeId) -> bool
pub fn delete(&mut self, id: NodeId) -> bool
Soft-delete id. The node remains in the graph for
connectivity but is filtered out of search results.
Returns true when the id was present, false otherwise.
Sourcepub fn search(
&self,
query: &[f32],
k: usize,
ef: Option<usize>,
) -> Result<Vec<SearchResult>, IndexError>
pub fn search( &self, query: &[f32], k: usize, ef: Option<usize>, ) -> Result<Vec<SearchResult>, IndexError>
Search for the k nearest neighbours of query.
ef controls the search beam width. Pass None to use the
index’s default ef_search. A larger ef trades CPU for
recall.
§Errors
Returns IndexError::DimensionMismatch when the query
vector’s dimension does not match the index’s frozen
dimension.
Trait Implementations§
Source§impl<'de> Deserialize<'de> for HnswIndex
impl<'de> Deserialize<'de> for HnswIndex
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Auto Trait Implementations§
impl Freeze for HnswIndex
impl RefUnwindSafe for HnswIndex
impl Send for HnswIndex
impl Sync for HnswIndex
impl Unpin for HnswIndex
impl UnsafeUnpin for HnswIndex
impl UnwindSafe for HnswIndex
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
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
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
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.