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.


[Skip to Readme]
Versions 0.1, 0.1.1, 0.2.0.0
Change log CHANGELOG.md
Dependencies base (>=4.3 && <5), containers (>=0.5.9 && <0.7) [details]
License BSD-3-Clause
Author Keegan McAllister <mcallister.keegan@gmail.com>
Maintainer chessai <chessai1996@gmail.com>
Category Algorithms, Text
Uploaded by chessai at Mon Nov 26 16:45:14 UTC 2018
Distributions Arch:0.2.0.0, Debian:0.1.1, NixOS:0.2.0.0
Downloads 4209 total (79 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2018-11-26 [all 1 reports]
Hackage Matrix CI

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees


Readme for patience-0.2.0.0

[back to package description]

Hackage

patience

About

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

Install with cabal (new-)install patience.