| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Util.Myers
Description
Implementation of the Myers algorithm, from "An O(ND) Difference Algorithm and Its Variations", by Eugene Myers page 6 (figure 2).
Specification: if
f1 (InBoth v) = Just v f1 (InFirst v) = Just v f1 (InSecond v) = Nothing
and
f2 (InBoth v) = Just v f2 (InFirst v) = Nothing f2 (InSecond v) = Just v
then
mapPartial f1 (diff l1 l2) == l1
and
mapPartial f2 (diff l1 l2) == l2
Documentation
diff :: Eq a => [a] -> [a] -> [DiffElement a] Source #
diff2 :: Eq v => [v] -> [v] -> [DiffElement v] Source #
data DiffElement v Source #
Instances
| Show v => Show (DiffElement v) Source # | |
Defined in Util.Myers Methods showsPrec :: Int -> DiffElement v -> ShowS # show :: DiffElement v -> String # showList :: [DiffElement v] -> ShowS # | |