lcs 0.2.0

A library for computing longest common subsequences and diffs
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

# lcs

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

## Example

```rust
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](http://ulysse.io/rust-lcs/lcs/)

[crates.io](https://crates.io/crates/lcs)