levenshtein-diff 0.2.1

Generic implementation of Levenshtein's algorithm that also allows you to generate the edits required to convert a source sequence to a target, and apply them to the source sequence to regenerate the target.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15

[dev-dependencies.rand]
version = "0.8.3"

[package]
authors = ["Mohammed Ajmal Siddiqui <ajmalsiddiqui21@gmail.com>"]
categories = ["algorithms"]
description = "Generic implementation of Levenshtein's algorithm that also allows you to generate the edits required to convert a source sequence to a target, and apply them to the source sequence to regenerate the target."
edition = "2018"
homepage = "https://github.com/ajmalsiddiqui/levenshtein-diff"
keywords = ["levenshtein", "generate-differences"]
license = "MIT"
name = "levenshtein-diff"
readme = "README.md"
repository = "https://github.com/ajmalsiddiqui/levenshtein-diff"
version = "0.2.1"