github/semantic
1
1
Fork 0
mirror of https://github.com/github/semantic.git synced 2024-12-22 22:31:36 +03:00
Code Issues Projects Releases Wiki Activity

Pare algorithmWithTerms down to its essentials.

Browse Source
This commit is contained in:
Rob Rix 2016-08-04 11:09:48 -04:00
parent 401b78099c
commit 78a5e8cf32
1 changed files with 1 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
src/Interpreter.hs
View File

@ -35,12 +35,11 @@ diffComparableTerms construct comparable cost a b
| comparable a b = run construct comparable cost (algorithmWithTerms construct a b) | comparable a b = run construct comparable cost (algorithmWithTerms construct a b)
| otherwise = Nothing | otherwise = Nothing
algorithmWithTerms :: Eq leaf => (TermF leaf (Both a) diff -> diff) -> Term leaf a -> Term leaf a -> Algorithm (Term leaf a) diff diff algorithmWithTerms :: (TermF leaf (Both a) diff -> diff) -> Term leaf a -> Term leaf a -> Algorithm (Term leaf a) diff diff
algorithmWithTerms construct t1 t2 = case (unwrap t1, unwrap t2) of algorithmWithTerms construct t1 t2 = case (unwrap t1, unwrap t2) of
(Indexed a, Indexed b) -> do (Indexed a, Indexed b) -> do
diffs <- byIndex a b diffs <- byIndex a b
annotate (Indexed diffs) annotate (Indexed diffs)
(Leaf a, Leaf b) | a == b -> annotate (Leaf b)
_ -> recursively t1 t2 _ -> recursively t1 t2
where annotate = pure . construct . (both (extract t1) (extract t2) :<) where annotate = pure . construct . (both (extract t1) (extract t2) :<)