#levenshtein #diff #patch

nightly liff

Fast levenshtein diff, fastest as we can do with levenshtein

2 releases

0.1.1 Dec 19, 2021
0.1.0 Dec 19, 2021

#1800 in Algorithms

21 downloads per month

MIT/Apache

16KB
351 lines

CI

Liff 🍃

Compute the diff between two vectors with the Levenshtein algorithm.

Faster than other crate. Try cargo bench to see the difference.

Usage

Levenshtein is a O(n1n2) time complexty and in space so you don't want to use it with a big raw. But you can use it with good chunks or text content!

    let from: Vec<u8> = input_text_from.as_bytes().into();
    let to: Vec<u8> = input_text_to.as_bytes().into();
    let diff = diff::diff::<u8>(&from, &to);

Use the diff output

The diff output can be used as a patch from another part of your code.

    let res = apply::apply(from, &diff);
    // res should be equals to "to"

Write temporary a compressed patch

the diff patch is quite bigger than we can do. You can compress it and that's what we do when we dump a file. You can read and write a diff with these functions.

    diffio::write(std::path::Path::new("diff.d"), diff.clone());
    let diff = diffio::read(std::path::Path::new("diff.d"));

License

Licensed under either of Apache License, Version 2.0 or MIT license at your option.
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in this crate by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.

Dependencies

~110KB