Data.Algorithm.Diff.Context

Documentation

contextDiff :: Eq a => Int -> [a] -> [a] -> [[Diff [a]]]

Do a grouped diff and then turn it into a list of hunks, where each hunk is a grouped diff with at most N elements of common context around each one.

groups :: Eq a => (a -> a -> Bool) -> [a] -> [[a]]

Group the elements whose adjacent pairs satisfy the predicate. Differs from groupBy because the predicate does not have to define a total ordering.