The patience package

[Tags: bsd3, library]

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.

New in version 0.1.1: relaxed containers dependency, so it should build on GHC 6.10.


Properties

Versions0.1, 0.1.1
Dependenciesbase (>=3 && <5), containers (>=0.2)
LicenseBSD3
AuthorKeegan McAllister <mcallister.keegan@gmail.com>
MaintainerKeegan McAllister <mcallister.keegan@gmail.com>
CategoryAlgorithms, Text
Upload dateWed Aug 17 00:18:58 UTC 2011
Uploaded byKeeganMcAllister
DistributionsDebian:0.1.1, NixOS:0.1.1
Downloads209 total (44 in last 30 days)

Modules

Downloads

Maintainers' corner

For package maintainers and hackage trustees