lcs 0.2.0

A library for computing longest common subsequences and diffs
Documentation
  • Coverage
  • 50%
    5 out of 10 items documented3 out of 7 items with examples
  • Size
  • Source code size: 9.34 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 564.86 kB This is the summed size of all files generated by rustdoc for all configured targets
  • Links
  • Homepage
  • crates.io
  • Dependencies
  • Versions
  • Owners
  • ucarion

lcs

A library for finding longest common substrings. You can also use this library to calculate a diff between two sequences.

Example

extern crate lcs;

let a: Vec<_> = "a--b---c".chars().collect();
let b: Vec<_> = "abc".chars().collect();

let table = lcs::LcsTable::new(&a, &b);
let lcs = table.longest_common_subsequence();

assert_eq!(vec![&'a', &'b', &'c'], lcs);

Documentation

crates.io