Enum DistanceKind

#[non_exhaustive]
pub enum DistanceKind {
    Chebyshev,
    Cosine,
    Euclidean,
    Hamming,
    Jaccard,
    Manhattan,
    Minkowski,
    Pearson,
}

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.

Chebyshev

Cosine

Euclidean

Hamming

Jaccard

Manhattan

Minkowski

Pearson

Implementations

impl DistanceKind

pub fn as_str(&self) -> &'static str

Trait Implementations

impl Clone for DistanceKind

fn clone(&self) -> DistanceKind

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for DistanceKind

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

Formats the value using the given formatter.

impl Hash for DistanceKind

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 DistanceKind

fn eq(&self, other: &DistanceKind) -> 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 Copy for DistanceKind

impl Eq for DistanceKind

impl StructuralPartialEq for DistanceKind