@hackage patience0.1

Patience diff and longest increasing subsequence

Categories
- Algorithms
- Text
License
BSD-3-Clause
Maintainer
Keegan McAllister <mcallister.keegan@gmail.com>
Links
- Homepage
- Documentation
- No source repository
Versions
- 0.3 Mon, 29 Jul 2019
- 0.2.1.1 Fri, 22 Feb 2019
- 0.2.1.0 Thu, 3 Jan 2019
- 0.2.0.0 Mon, 26 Nov 2018
- 0.1.1 Tue, 25 Sep 2018
- 0.1 Tue, 25 Sep 2018

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.

Installation
In your cabal file:
Dependencies (2)
- base >=3 && <5
- containers >=0.3 && <0.6
Dependents (5)
@hackage/nix-diff, @hackage/git, @hackage/options, @hackage/hit, @hackage/chell