Enum IndexAlgorithm 

#[non_exhaustive]
pub enum IndexAlgorithm {
    Hnsw,
    Flat,
}

Index algorithm.

RediSearch ships HNSW and FLAT (brute-force). This crate only implements HNSW today; the FLAT variant exists so the FT.CREATE parser can record the operator’s request and the command handler can return a not-implemented error rather than silently downgrade.

Variants (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.

Flat

Brute-force scan (every vector compared on every query).

Trait Implementations

impl Clone for IndexAlgorithm

fn clone(&self) -> IndexAlgorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for IndexAlgorithm

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for IndexAlgorithm

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for IndexAlgorithm

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for IndexAlgorithm

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Copy for IndexAlgorithm

impl Eq for IndexAlgorithm

impl StructuralPartialEq for IndexAlgorithm