Patience diff and longest increasing subsequence

Version on this page:0.1.1
LTS Haskell 11.22:0.1.1
Stackage Nightly 2018-03-12:0.1.1
Latest on Hackage:0.3

See all snapshots patience appears in

BSD-3-Clause licensed and maintained by Keegan McAllister
This version can be pinned in stack with:patience-0.1.1@sha256:7b18aef594b49332047a256b0e894f3720429a6a9bf7424335a318aa98d93352,1194

Module documentation for 0.1.1

Depends on 2 packages(full list with versions):
Used by 3 packages in lts-7.24(full list with versions):

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.