Package2.0.1Algorithms
Diff
Diff algorithm in pure Haskell
- Version2.0.1
- CategoryAlgorithms
- LicenceBSD-3-Clause
- AuthorSterling Clover
- MaintainerDavid Fox <dsf@seereason.com>
- Homepageweb.archive.org/web/20150326181224/http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.6927
- Pinned byhackage Diff 2.0.1
- Sourcehackage.haskell.org/package/Diff-2.0.1
Modules
3 modules- Data.Algorithm.Diff6This is an implementation of the diff algorithm as described in
- Data.Algorithm.DiffContext10Generates a grouped diff with merged runs, and outputs them in the manner of diff -u.
- Data.Algorithm.DiffOutput8Generates a string output that is similar to diff normal mode.
Description
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.
Depends on
3 packages- array-0.5.8.0with GHC
- base-4.23.0.0with GHC
- pretty-1.1.3.6with GHC