ModuleDiff-1.0.2Haskell2010

Data.Algorithm.DiffContext

Generates a grouped diff with merged runs, and outputs them in the manner of diff -u

3 types
8 values

PackageDiff-1.0.2
Exports11
LanguageHaskell2010
LicenceBSD-3-Clause
SourceDiffContext.hs

typetype ContextDiff c = [Hunk c]

typetype Hunk c = [Diff [c]]

valuegetContextDiff

:: Eq a
=> Maybe Int
Number of context elements, Nothing means infinite
-> [a]
-> [a]
-> ContextDiff (Numbered a)

> let textA = ["a","b","c","d","e","f","g","h","i","j","k"]
> let textB = ["a","b","d","e","f","g","h","i","j"]
> let diff = getContextDiff (Just 2) textA textB
> prettyContextDiff (text "file1") (text "file2") (text . unnumber) diff
--- file1
+++ file2
@@ -1,5 +1,4 @@
 a
 b
-c
 d
 e
@@ -9,3 +8,2 @@
 i
 j
-k

valueprettyContextDiff

:: Doc
Document 1 name
-> Doc
Document 2 name
-> (Numbered c -> Doc)
Element pretty printer
-> ContextDiff (Numbered c)
-> Doc

Pretty print a ContextDiff in the manner of diff -u.

valueprettyContextDiffOld

:: Doc
Document 1 name
-> Doc
Document 2 name
-> (c -> Doc)
Element pretty printer
-> ContextDiff c
-> Doc

Pretty print without line numbers.

valuegetContextDiffNumbered

:: Eq a
=> Maybe Int
Number of context elements, Nothing means infinite
-> [Numbered a]
-> [Numbered a]
-> ContextDiff (Numbered a)

datadata Numbered a

Constructors

Numbered Int a

Instances3Eq, Ord, Show

Eq a => Eq (Numbered a)Defined in Diff-1.0.2 · Data.Algorithm.DiffContext
Ord a => Ord (Numbered a)Defined in Diff-1.0.2 · Data.Algorithm.DiffContext
Show a => Show (Numbered a)Defined in Diff-1.0.2 · Data.Algorithm.DiffContext

valuenumbered :: [a] -> [Numbered a]

valueunnumber :: Numbered a -> a

valueunNumberContextDiff :: ContextDiff (Numbered a) -> ContextDiff a

If for some reason you need the line numbers stripped from the result of getContextDiff for backwards compatibility.

valuegroupBy' :: (a -> a -> Bool) -> [a] -> [[a]]

A version of groupBy that does not assume the argument function is transitive. This is used to partition the Diff list into segments that begin and end with matching (Both) text, with and have non-matching (First and Second) text in the middle.

let notBoth1 a b = not (a == 1 || b == 1) in

groupBy' notBoth1 [1,1,2,3,1,1,4,5,6,1]
[[1],[1,2,3,1],[1,4,5,6,1]]

groupBy notBoth1 [1,1,2,3,1,1,4,5,6,1]
[[1],[1,2,3],[1],[1,4,5,6],[1]]

In the first result the list is split anywhere there are two adjacent ones, as desired.