diff-gestalt: A diff algorithm based on recursive longest common substrings
This is a diff algorithm based on recursive longest common substrings. A description of the algorithm itself can be found at http://collaboration.cmc.ec.gc.ca/science/rpn/biblio/ddj/Website/articles/DDJ/1988/8807/8807c/8807c.htm
Downloads
- diff-gestalt-0.2.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.1.0.0, 0.2.0.0 |
|---|---|
| Dependencies | base (>=4 && <5), Diff, KMP, QuickCheck, string-similarity [details] |
| License | LicenseRef-OtherLicense |
| Copyright | none |
| Author | Chris Wendt |
| Maintainer | chrismwendt@gmail.com |
| Category | none |
| Home page | http://github.com/chrismwendt/diff-gestalt |
| Source repo | head: git clone https://github.com/chrismwendt/diff-gestalt |
| Uploaded | by chrismwendt at 2015-11-08T22:01:17Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 1658 total (2 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2015-11-12 [all 1 reports] |