patience: Patience diff and longest increasing subsequence
|Dependencies||base (>=3 && <5), containers (>=0.3) [details]|
|Author||Keegan McAllister <email@example.com>|
|Maintainer||Keegan McAllister <firstname.lastname@example.org>|
|Uploaded||by KeeganMcAllister at Thu Feb 24 20:46:51 UTC 2011|
|Distributions||Arch:0.1.1, Debian:0.1.1, LTSHaskell:0.1.1, NixOS:0.1.1, openSUSE:0.1.1|
|Downloads||3794 total (22 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI
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.
For package maintainers and hackage trustees