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

Extract the searchAlongK evaluator.

Browse Source
This commit is contained in:
Rob Rix 2017-03-23 10:06:53 -04:00
parent 2b1bf43a1e
commit b477a93dba
1 changed files with 13 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
src/SES/Myers.hs
View File

@ -94,14 +94,7 @@ decompose myers = let ?callStack = popCallStack callStack in case myers of
LCS graph -> runLCS graph
EditDistance graph -> runEditDistance graph
SearchUpToD graph d -> runSearchUpToD graph d
SearchAlongK (EditGraph as bs) d k -> if negate (length bs) > unDiagonal k || unDiagonal k > length as then continue else do
Endpoint x y <- moveFromAdjacent (EditGraph as bs) d k
if x >= length as && y >= length bs then do
(_, script) <- getK (EditGraph as bs) k
return (Just (script, d))
else
continue
SearchAlongK graph d k -> runSearchAlongK graph d k
MoveFromAdjacent (EditGraph as bs) (Distance d) (Diagonal k) -> do
let (n, m) = (length as, length bs)
@ -180,6 +173,18 @@ runEditDistance graph = let ?callStack = popCallStack callStack in length . filt
runSearchUpToD :: HasCallStack => EditGraph a b -> Distance -> Myers a b (Maybe (EditScript a b, Distance))
runSearchUpToD graph (Distance d) = let ?callStack = popCallStack callStack in for [negate d, negate d + 2 .. d] (searchAlongK graph (Distance d) . Diagonal)
runSearchAlongK :: HasCallStack => EditGraph a b -> Distance -> Diagonal -> Myers a b (Maybe (EditScript a b, Distance))
runSearchAlongK (EditGraph as bs) d k = let ?callStack = popCallStack callStack in
if negate (length bs) > unDiagonal k || unDiagonal k > length as then
continue
else do
Endpoint x y <- moveFromAdjacent (EditGraph as bs) d k
if x >= length as && y >= length bs then do
(_, script) <- getK (EditGraph as bs) k
return (Just (script, d))
else
continue
-- Smart constructors