patience: Patience diff and longest increasing subsequence

[ algorithms, bsd3, library, text ] [ Propose Tags ]

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.

Versions 0.1, 0.1.1
Dependencies base (>=3 && <5), containers (>=0.2 && <0.6) [details]
License BSD-3-Clause
Author Keegan McAllister <mcallister.keegan@gmail.com>
Maintainer Keegan McAllister <mcallister.keegan@gmail.com>
Revised Revision 1 made by phadej at Tue Sep 25 06:49:12 UTC 2018
Category Algorithms, Text
Uploaded by KeeganMcAllister at Wed Aug 17 00:18:58 UTC 2011
Distributions Arch:0.1.1, Debian:0.1.1, NixOS:0.1.1
Downloads 4133 total (47 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Modules

[Index]

Downloads

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'.

Maintainer's Corner

For package maintainers and hackage trustees