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

Define an operation to compute the edit distance.

Browse Source
This commit is contained in:
Rob Rix 2017-03-13 18:22:14 -04:00
parent 381e271924
commit f63e810c31
1 changed files with 5 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
src/SES/Myers.hs
View File

@ -13,6 +13,7 @@ import Prologue hiding (for, State)
data MyersF element result where
SES :: EditGraph a -> MyersF a [These a a]
LCS :: EditGraph a -> MyersF a [a]
EditDistance :: EditGraph a -> MyersF a Int
MiddleSnake :: EditGraph a -> MyersF a (Snake, Distance)
SearchUpToD :: EditGraph a -> Distance -> MyersF a (Maybe (Snake, Distance))
SearchAlongK :: EditGraph a -> Distance -> Direction -> Diagonal -> MyersF a (Maybe (Snake, Distance))
@ -107,6 +108,8 @@ decompose myers = let ?callStack = popCallStack callStack in case myers of
else
return (zipWith These (toList as) (toList bs))
EditDistance graph -> unDistance . snd <$> middleSnake graph
MiddleSnake graph -> do
result <- for [0..maxD] (searchUpToD graph . Distance)
case result of
@ -256,6 +259,7 @@ editGraph :: MyersF a b -> EditGraph a
editGraph myers = case myers of
SES g -> g
LCS g -> g
EditDistance g -> g
MiddleSnake g -> g
SearchUpToD g _ -> g
SearchAlongK g _ _ _ -> g
@ -290,6 +294,7 @@ instance Show2 MyersF where
liftShowsPrec2 sp1 sl1 _ _ d m = case m of
SES graph -> showsUnaryWith (liftShowsPrec sp1 sl1) "SES" d graph
LCS graph -> showsUnaryWith (liftShowsPrec sp1 sl1) "LCS" d graph
EditDistance graph -> showsUnaryWith (liftShowsPrec sp1 sl1) "EditDistance" d graph
MiddleSnake graph -> showsUnaryWith (liftShowsPrec sp1 sl1) "MiddleSnake" d graph
SearchUpToD graph distance -> showsBinaryWith (liftShowsPrec sp1 sl1) showsPrec "SearchUpToD" d graph distance
SearchAlongK graph distance direction diagonal -> showsQuaternaryWith (liftShowsPrec sp1 sl1) showsPrec showsPrec showsPrec "SearchAlongK" d graph direction distance diagonal