Diff: Diff algorithm in pure Haskell

[ algorithms, bsd3, library ] [ Propose Tags ] [ Report a vulnerability ]

Implementation of the standard diff algorithm in Haskell.

Time complexity is O(ND) (input length * number of differences). Space complexity is O(D^2). Includes utilities for pretty printing.

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • 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, 1.0, 1.0.1, 1.0.1.1
Change log CHANGELOG.md
Dependencies array, base (>=4.11 && <=6), pretty (>=1.1) [details]
Tested with ghc ==9.12.0, ghc ==9.10.1, ghc ==9.8.2, ghc ==9.6.6, ghc ==9.4.8, ghc ==9.2.8, ghc ==9.0.2, ghc ==8.10.7, ghc ==8.8.4, ghc ==8.6.5, ghc ==8.4.4
License BSD-3-Clause
Author Sterling Clover
Maintainer David Fox <dsf@seereason.com>
Category Algorithms
Home page https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.6927
Source repo head: git clone https://github.com/seereason/Diff
Uploaded by DavidFox at 2024-11-06T19:45:08Z
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 60 direct, 283 indirect [details]
Downloads 83472 total (482 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 2024-11-06 [all 1 reports]