Enum IndexBackend 

pub enum IndexBackend {
    Hnsw,
    Ivf,
}

Which approximate-nearest-neighbor backend to build.

Both backends sit behind the same index trait and share the two-level hybrid search; this only selects the graph/partition structure.

Variants

Hnsw

Hierarchical Navigable Small World graph with high-degree-preserving pruning. Best recall/latency tradeoff; the default.

Ivf

Inverted file (k-means) partitioning. Naturally sequential per-list reads make it friendly to spinning disks.

Trait Implementations

impl Clone for IndexBackend

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for IndexBackend

impl Debug for IndexBackend

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for IndexBackend

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for IndexBackend

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for IndexBackend

impl Hash for IndexBackend

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for IndexBackend

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl Serialize for IndexBackend

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for IndexBackend