Enum IndexStrategy 

pub enum IndexStrategy {
    BruteForce,
    LSH {
        num_tables: usize,
        num_hyperplanes: usize,
    },
}

How the in-memory vector store picks the documents a search scores.

Variants

BruteForce

Scores every document: exact results.

LSH

Scores only the documents sharing an lsh::LSHIndex bucket with the query, exactly. Faster on large stores, but a true neighbor in no shared bucket is missed, so a search can return fewer or other results than Self::BruteForce.

Fields

num_tables: usize

Hash tables; more find more true neighbors. 0 scores every document, like Self::BruteForce.

num_hyperplanes: usize

Hyperplanes per table (at most 64); more make smaller buckets.

Trait Implementations

impl Clone for IndexStrategy

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 IndexStrategy

impl Debug for IndexStrategy

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

Formats the value using the given formatter.

impl Default for IndexStrategy

fn default() -> Self

Returns the “default value” for a type.

impl Eq for IndexStrategy

impl PartialEq for IndexStrategy

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for IndexStrategy