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

Save the initial bounds computation.

Browse Source
This commit is contained in:
Rob Rix 2017-06-21 13:20:25 -04:00
parent c2daf3af07
commit d71f97d1b5
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
src/SES/Myers.hs
View File

@ -24,8 +24,8 @@ ses eq as' bs'
| null bs = This <$> toList as
| null as = That <$> toList bs
| otherwise = reverse (searchUpToD 0 (Array.array (1, 1) [(1, Endpoint 0 (-1) [])]))
where (as, bs) = (Array.listArray (0, pred n) (toList as'), Array.listArray (0, pred m) (toList bs'))
(aBounds, bBounds) = (Array.bounds as, Array.bounds bs)
where (as, bs) = (Array.listArray aBounds (toList as'), Array.listArray bBounds (toList bs'))
(aBounds, bBounds) = ((0, pred n), (0, pred m))
(n, m) = (length as', length bs')
-- Search an edit graph for the shortest edit script up to a given proposed edit distance, building on the results of previous searches.