patience: Patience diff and longest increasing subsequence
This library implements the "patience diff" algorithm, as well as the patience algorithm for the longest increasing subsequence problem.
Patience diff computes the difference between two lists, for example the lines of two versions of a source file. It provides a good balance of performance, nice output for humans, and implementation simplicity. For more information, see http://alfedenzo.livejournal.com/170301.html and http://bramcohen.livejournal.com/73318.html.
[Skip to Readme]
|Versions [faq]||0.1, 0.1.1, 0.2.0.0, 0.2.1.0, 0.2.1.1, 0.3|
|Dependencies||base (>=4.6 && <5), containers (>=0.5.9 && <0.7) [details]|
|Author||Keegan McAllister <firstname.lastname@example.org> chessai <email@example.com>|
|Revised||Revision 1 made by HerbertValerioRiedel at Thu Jan 3 19:11:41 UTC 2019|
|Source repo||head: git clone https://github.com/chessai/patience.git|
|Uploaded||by chessai at Sun Dec 30 16:19:53 UTC 2018|
|Distributions||Arch:0.3, Debian:0.1.1, NixOS:0.3|
|Downloads||6279 total (269 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs available [build log]
Last success reported on 2018-12-30 [all 1 reports]
- patience-0.2.1.0.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
For package maintainers and hackage trustees