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 and

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


Versions0.1, 0.1.1
Change logNone available
Dependenciesbase (>=3 && <5), containers (>=0.2) [details]
AuthorKeegan McAllister <>
MaintainerKeegan McAllister <>
CategoryAlgorithms, Text
UploadedWed Aug 17 00:18:58 UTC 2011 by KeeganMcAllister
DistributionsDebian:0.1.1, LTSHaskell:0.1.1, NixOS:0.1.1, Stackage:0.1.1
Downloads2127 total (62 in last 30 days)
0 []
StatusDocs uploaded by user
Build status unknown [no reports yet]




Maintainers' corner

For package maintainers and hackage trustees