patience

Patience diff and longest increasing subsequence

Version on this page:0.1.1
LTS Haskell 9.9:0.1.1
Stackage Nightly 2017-10-21:0.1.1
Latest on Hackage:0.1.1
BSD3 licensed and maintained by Keegan McAllister

Module documentation for 0.1.1

There are no documented modules for this package.

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.

Depends on:
Used by 4 packages:
comments powered byDisqus