Enum Algorithm 

pub enum Algorithm {
    JaroWinkler,
    Levenshtein,
    DamerauLevenshtein,
}

Algorithm for similarity calculation

Variants

JaroWinkler

Jaro-Winkler similarity (recommended for typos)

Good for: transpositions, prefix matching Returns: 0.0 to 1.0 (1.0 = identical)

Levenshtein

Levenshtein distance (edit distance)

Good for: insertions, deletions, substitutions Normalized to 0.0 to 1.0 (1.0 = identical)

DamerauLevenshtein

Damerau-Levenshtein distance

Like Levenshtein but also handles transpositions Normalized to 0.0 to 1.0 (1.0 = identical)

Trait Implementations

impl Clone for Algorithm

fn clone(&self) -> Algorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Algorithm

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

Formats the value using the given formatter.

impl Default for Algorithm

fn default() -> Algorithm

Returns the “default value” for a type.

impl PartialEq for Algorithm

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

impl Eq for Algorithm

impl StructuralPartialEq for Algorithm