github/semantic
1
1
Fork 0
mirror of https://github.com/github/semantic.git synced 2024-12-25 16:02:43 +03:00
Code Issues Projects Releases Wiki Activity

Encapsulate throwing failures.

Browse Source
This commit is contained in:
Rob Rix 2017-03-17 09:54:49 -04:00
parent a8853d9807
commit 64d8aced70
1 changed files with 7 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
src/SES/Myers.hs
View File

@ -93,7 +93,7 @@ runMyersStep eq state step = let ?callStack = popCallStack callStack in case ste
decompose :: HasCallStack => MyersF a b c -> Myers a b c
decompose myers = let ?callStack = fromCallSiteList (filter ((/= "M") . fst) (getCallStack (popCallStack callStack))) in case myers of
decompose myers = let ?callStack = popCallStack callStack in case myers of
LCS graph
| null as || null bs -> return []
| otherwise -> do
@ -145,9 +145,9 @@ decompose myers = let ?callStack = fromCallSiteList (filter ((/= "M") . fst) (ge
v <- gets (stateFor direction)
let i = index v k
if i < 0 then
throw (MyersException ("negative index " <> Prologue.show i) callStack)
fail ("negative index " <> Prologue.show i)
else if i >= length v then
throw (MyersException ("index " <> Prologue.show i <> "past end of state vector " <> Prologue.show (length v)) callStack)
fail ("index " <> Prologue.show i <> "past end of state vector " <> Prologue.show (length v))
else
return (v Vector.! i)
@ -199,6 +199,10 @@ decompose myers = let ?callStack = fromCallSiteList (filter ((/= "M") . fst) (ge
Forward -> return (here, there)
Reverse -> return (there, here)
fail :: (HasCallStack, Monad m) => String -> m a
fail s = let ?callStack = fromCallSiteList (filter ((/= "M") . fst) (getCallStack callStack)) in
throw (MyersException s callStack)
invert Forward = Reverse
invert Reverse = Forward