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

🔥 the bounds check in runSearchAlongK.

Browse Source
This commit is contained in:
Rob Rix 2017-03-23 13:24:38 -04:00
parent 3130ae48e9
commit 7a0efc3391
1 changed files with 6 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
src/SES/Myers.hs
View File

@ -128,16 +128,13 @@ runSearchUpToD (EditGraph as bs) (Distance d) = let ?callStack = popCallStack ca
where (n, m) = (length as, length bs)
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
runSearchAlongK (EditGraph as bs) d k = let ?callStack = popCallStack callStack in do
Endpoint x y <- moveFromAdjacent d k
if x >= length as && y >= length bs then do
(_, script) <- getK k
return (Just (script, d))
else
continue
else do
Endpoint x y <- moveFromAdjacent d k
if x >= length as && y >= length bs then do
(_, script) <- getK k
return (Just (script, d))
else
continue
runMoveFromAdjacent :: HasCallStack => EditGraph a b -> Distance -> Diagonal -> Myers a b Endpoint
runMoveFromAdjacent (EditGraph as bs) (Distance d) (Diagonal k) = let ?callStack = popCallStack callStack in do