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:

See all snapshots patience appears in

Maintained by chessai

Module documentation for 0.1.1




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 these two blog posts: alfedenzo, bramcohen


Install with cabal (new-)install patience.


Changes in version TBA

  • Deprecate Patience.itemChar.
  • Add module Patience.Map.

Changes in version

  • Move Data.Algorithm.Patience to Patience
  • Remove use of deprecated Data.Map.insertWith'
  • Add strictness/UNPACK annotations to Int values
Depends on 2 packages:
Used by 4 packages:
comments powered byDisqus