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

Factor out the Diagonal construction.

Browse Source
This commit is contained in:
Rob Rix 2017-06-13 18:22:48 -04:00
parent 9b916d3619
commit 3ed7e1da53
1 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
src/SES/Myers.hs
View File

@ -84,24 +84,24 @@ runSES eq (EditGraph as bs)
-- | Move onto a given diagonal from one of its in-bounds adjacent diagonals (if any), and slide down any diagonal edges eagerly.
moveFromAdjacent (Distance d) (Diagonal k) = do
v <- get
let getK k = let (x, script) = v ! k in Endpoint x (x - unDiagonal k) script
let getK k = let (x, script) = v ! Diagonal k in Endpoint x (x - k) script
let endpoint@(Endpoint x' _ script) = slideFrom $! if d == 0 || k < negate 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
-- The lower/left extent of the search region or edit graph, whichever is smaller.
moveDownFrom (getK (Diagonal (succ k)))
moveDownFrom (getK (succ k))
else if k /= d && k /= n then do
-- Somewhere in the interior of the search region and edit graph.
let prev = getK (Diagonal (pred k))
let next = getK (Diagonal (succ k))
let prev = getK (pred k)
let next = getK (succ k)
if x prev < x next then
moveDownFrom next
else
moveRightFrom prev
else
-- The upper/right extent of the search region or edit graph, whichever is smaller.
moveRightFrom (getK (Diagonal (pred k)))
moveRightFrom (getK (pred k))
put (v Array.// [(Diagonal k, (x', script))])
return endpoint