Struct LCSSeq 

pub struct LCSSeq {}

The length of the Longest common subsequence.

It differs from the LCSStr. Unlike substrings, subsequences are not required to occupy consecutive positions within the original sequences.

Trait Implementations

impl Algorithm<usize> for LCSSeq

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

Calculate distance/similarity for vectors.

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

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

Calculate distance/similarity for iterators.

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 LCSSeq

fn default() -> LCSSeq

Returns the “default value” for a type.