Hackage :: [Package]

patience: Patience diff and longest increasing subsequence

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain] [Publish]

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]

Properties

Versions 0.1, 0.1.1, 0.2.0.0, 0.2.0.0, 0.2.1.0, 0.2.1.1, 0.3
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 2018-11-26T16:41:56Z

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

Package maintainers

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.