patience

Patience diff and longest increasing subsequence

Version0.3
CategoryAlgorithms, Text
LicenceBSD-3-Clause
AuthorKeegan McAllister <mcallister.keegan@gmail.com> chessai <chessai1996@gmail.com>
Maintainerchessai <chessai1996@gmail.com>
Homepagegithub.com/chessai/patience
Pinned byhackage patience 0.3
Sourcehackage.haskell.org/package/patience-0.3

Modules

2 modules

Patience3Implements "patience diff" and the patience algorithm for the longest
Patience.Map22This module provides a lossless way to do

Description

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.

Depends on

2 packages

base-4.20.2.0with GHC
containers-0.7with GHC

Used by in this set · 0

Nothing in this set depends on it.