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

Try to implement SES recursively.

Browse Source
This commit is contained in:
Rob Rix 2017-03-10 14:14:04 -05:00
parent e74119d3de
commit 438dc91672
1 changed files with 13 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
src/SES/Myers.hs
View File

@ -89,7 +89,16 @@ decompose myers = let ?callStack = popCallStack callStack in case myers of
| null bs -> return (This <$> toList as)
| null as -> return (That <$> toList bs)
| otherwise -> do
return []
(Snake xy uv, EditDistance d) <- middleSnake graph
if d > 1 then do
let (before, _) = divideGraph graph xy
let (start, after) = divideGraph graph uv
let (EditGraph midAs midBs, _) = divideGraph start xy
before' <- ses before
after' <- ses after
return $! before' <> zipWith These (toList midAs) (toList midBs) <> after'
else
return (zipWith These (toList as) (toList bs))
MiddleSnake graph -> fmap (fromMaybe (error "bleah")) $
for [0..maxD] $ \ d ->
@ -154,6 +163,9 @@ decompose myers = let ?callStack = popCallStack callStack in case myers of
-- Smart constructors
ses :: HasCallStack => EditGraph a -> Myers a [These a a]
ses graph = M (SES graph) `Then` return
lcs :: HasCallStack => EditGraph a -> Myers a [a]
lcs graph = M (LCS graph) `Then` return