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

s/negate/-/

Browse Source
This commit is contained in:
Rob Rix 2017-06-21 11:57:50 -04:00
parent f395d5c144
commit 6a4148fd6f
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
src/SES/Myers.hs
View File

@ -29,18 +29,18 @@ ses eq as' bs'
-- Search an edit graph for the shortest edit script up to a given proposed edit distance, building on the results of previous searches.
searchUpToD d v =
let endpoints = searchAlongK <$> [ k | k <- [negate d, negate d + 2 .. d], inRange (negate m, n) k ] in
let endpoints = searchAlongK <$> [ k | k <- [-d, -d + 2 .. d], inRange (negate m, n) k ] in
case find isComplete endpoints of
Just (Endpoint _ _ script) -> script
_ -> searchUpToD (succ d) (Array.array (negate d, d) ((\ e@(Endpoint x y _) -> (x - y, e)) <$> endpoints))
_ -> searchUpToD (succ d) (Array.array (-d, d) ((\ e@(Endpoint x y _) -> (x - y, e)) <$> endpoints))
where isComplete (Endpoint x y _) = x >= n && y >= m
-- Search an edit graph for the shortest edit script along a specific diagonal, moving onto a given diagonal from one of its in-bounds adjacent diagonals (if any), and sliding down any diagonal edges eagerly.
searchAlongK k = slideFrom $!
if d == 0 || k < negate m || k > n then
if d == 0 || k < -m || k > n then
-- The top-left corner, or otherwise out-of-bounds.
Endpoint 0 0 []
else if k == negate d || k == negate m then
else if k == -d || k == -m then
-- The lower/left extent of the search region or edit graph, whichever is smaller.
moveDownFrom up
else if k /= d && k /= n then