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

Versions 0.1, 0.1.1
Dependencies base (>=3 && <5), containers (>=0.2) [details]
License BSD3
Author Keegan McAllister <mcallister.keegan@gmail.com>
Maintainer Keegan McAllister <mcallister.keegan@gmail.com>
Stability Unknown
Category Algorithms, Text
Uploaded Wed Aug 17 00:18:58 UTC 2011 by KeeganMcAllister
Distributions Arch:0.1.1, Debian:0.1.1, LTSHaskell:0.1.1, NixOS:0.1.1, Stackage:0.1.1
Downloads 2260 total (2 in the last 30 days)
Votes
0 []
Status Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees