-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | A diff algorithm based on recursive longest common substrings
--   
--   This is a diff algorithm based on recursive longest common substrings.
--   A description of the algorithm itself can be found at
--   <a>http://collaboration.cmc.ec.gc.ca/science/rpn/biblio/ddj/Website/articles/DDJ/1988/8807/8807c/8807c.htm</a>
@package diff-gestalt
@version 0.2.0.0

module Data.Algorithm.Diff.Gestalt

-- | Takes two lists and returns a list of differences between them,
--   grouped into chunks.
--   
--   <pre>
--   &gt;&gt;&gt; diff "tree" "there"
--   [Both "t" "t",Second "he",Both "re" "re",First "e"]
--   </pre>
diff :: Ord a => [a] -> [a] -> [Diff [a]]