Struct Bag 

pub struct Bag {}

Bag distance is how many max items there are in one sequence that aren’t in the other.

Trait Implementations

impl Algorithm<usize> for Bag

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

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

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 Bag

fn default() -> Bag

Returns the “default value” for a type.