Struct Hamming 

pub struct Hamming {
    pub truncate: bool,
}

Hamming distance is the number of positions at which the corresponding symbols are different.

Fields

truncate: bool

If false (default), the longer strings is truncated to the same length as the shorter one.

Trait Implementations

impl Algorithm<usize> for Hamming

fn for_iter<C, E>(&self, s1: C, s2: C) -> Result<usize>

where C: Iterator<Item = E>, E: Eq,

Calculate distance/similarity for iterators.

fn for_vec<E>(&self, s1: &[E], s2: &[E]) -> Result<R>

where E: Eq + Hash,

Calculate distance/similarity for vectors.

fn for_str(&self, s1: &str, s2: &str) -> Result<R>

Calculate distance/similarity for strings.

fn for_words(&self, s1: &str, s2: &str) -> Result<R>

Calculate distance/similarity for words in strings.

fn for_bigrams(&self, s1: &str, s2: &str) -> Result<R>

Calculate distance/similarity for bigrams in strings.

impl Default for Hamming

fn default() -> Hamming

Returns the “default value” for a type.