#[non_exhaustive]pub enum IndexAlgorithm {
Hnsw,
Flat,
}Expand description
ANN index algorithm selector.
Hnsw builds the hierarchical navigable small world graph
(linear scan only on the bottom-most candidate set; sub-
linear elsewhere). Flat runs a brute-force scan against
every stored vector. The two are mostly interchangeable
from the caller’s perspective; the difference shows up at
large corpora where Hnsw keeps O(log N) traversal cost
and Flat is O(N). Today only the turbovec codec path
honours Flat (the brute SIMD scan in
crate::turbo_index::TurboTable); non-turbovec codecs
fall back to Hnsw regardless of the requested algorithm.
Variants (Non-exhaustive)§
This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
Hnsw
Hierarchical navigable small world graph (default).
Flat
Brute-force linear scan over every stored vector.
Trait Implementations§
Source§impl Clone for IndexAlgorithm
impl Clone for IndexAlgorithm
Source§fn clone(&self) -> IndexAlgorithm
fn clone(&self) -> IndexAlgorithm
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for IndexAlgorithm
impl Debug for IndexAlgorithm
Source§impl Default for IndexAlgorithm
impl Default for IndexAlgorithm
Source§impl<'de> Deserialize<'de> for IndexAlgorithm
impl<'de> Deserialize<'de> for IndexAlgorithm
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
Source§impl PartialEq for IndexAlgorithm
impl PartialEq for IndexAlgorithm
Source§fn eq(&self, other: &IndexAlgorithm) -> bool
fn eq(&self, other: &IndexAlgorithm) -> bool
Tests for
self and other values to be equal, and is used by ==.Source§impl Serialize for IndexAlgorithm
impl Serialize for IndexAlgorithm
impl Copy for IndexAlgorithm
impl Eq for IndexAlgorithm
impl StructuralPartialEq for IndexAlgorithm
Auto Trait Implementations§
impl Freeze for IndexAlgorithm
impl RefUnwindSafe for IndexAlgorithm
impl Send for IndexAlgorithm
impl Sync for IndexAlgorithm
impl Unpin for IndexAlgorithm
impl UnsafeUnpin for IndexAlgorithm
impl UnwindSafe for IndexAlgorithm
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.