Diff: Diff algorithm in pure Haskell

[ algorithms, bsd3, library ] [ Propose Tags ]

Implementation of the standard diff algorithm, and utilities for pretty printing. Time complexity is proportional to N (input length) & D (number of differences). Space complexity is D^2. Includes utilities for pretty printing.


Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS] 0.1, 0.1.1, 0.1.2, 0.1.3, 0.2.0, 0.3.0, 0.3.1, 0.3.2, 0.3.3, 0.3.4, 0.4.0, 0.4.1, 0.5
Dependencies array, base (>=4.8 && <=6), pretty (>=1.1) [details]
License BSD-3-Clause
Author Sterling Clover
Maintainer David Fox <dsf@seereason.com>
Revised Revision 1 made by DavidFox at 2023-10-22T21:44:20Z
Category Algorithms
Home page https://citeseerx.ist.psu.edu/viewdoc/summary?doi=
Source repo head: git clone http://github.com/seereason/Diff
Uploaded by DavidFox at 2023-10-22T21:32:05Z
Distributions Arch:0.4.1, Fedora:0.4.1, FreeBSD:0.3.2, LTSHaskell:0.4.1, NixOS:0.4.1, Stackage:0.5, openSUSE:0.4.1
Reverse Dependencies 58 direct, 281 indirect [details]
Downloads 82060 total (298 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2023-10-22 [all 1 reports]