Struct prettydiff::lcs::Table

pub struct Table<'a, T: 'a> { /* fields omitted */ }

Methods

impl<'a, T> Table<'a, T> where
    T: PartialEq, 

Implements Longest Common Subsequences Table Memory requirement: O(N^2)

Based on Wikipedia article

pub fn new(x: &'a [T], y: &'a [T]) -> Table<'a, T>

Creates new table for search common subsequences in x and y

pub fn matches(&self) -> Vec<Match<T>>

Returns matches between X and Y

pub fn matches_zero(&self) -> Vec<Match<T>>

Returns matches between X and Y with zero-len match at the end

pub fn longest_seq(&self) -> Vec<&T>

Find longest sequence

Trait Implementations

impl<'a, T: Debug + 'a> Debug for Table<'a, T>

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

Formats the value using the given formatter.

impl<'a, T> Display for Table<'a, T> where
    T: Display, 

Prints pretty-table for LCS

fn fmt(&self, formatter: &mut Formatter) -> Result

Formats the value using the given formatter.