github/semantic
1
1
Fork 0
mirror of https://github.com/github/semantic.git synced 2025-01-03 04:51:57 +03:00
Code Issues Projects Releases Wiki Activity

runMyersSteps constructs the initial state itself.

Browse Source
This commit is contained in:
Rob Rix 2017-03-13 11:35:11 -04:00
parent 8998884e51
commit 95a800660e
1 changed files with 5 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
src/SES/Myers.hs
View File

@ -48,10 +48,11 @@ runMyers eq step = runAll (emptyStateForStep step) step
Left a -> a
Right next -> uncurry runAll next
runMyersSteps :: HasCallStack => (a -> a -> Bool) -> MyersState -> Myers a b -> [(MyersState, Myers a b)]
runMyersSteps eq state step = let ?callStack = popCallStack callStack in (state, step) : case runMyersStep eq state step of
Left result -> [ (state, return result) ]
Right next -> uncurry (runMyersSteps eq) next
runMyersSteps :: HasCallStack => (a -> a -> Bool) -> Myers a b -> [(MyersState, Myers a b)]
runMyersSteps eq step = go (emptyStateForStep step) step
where go state step = let ?callStack = popCallStack callStack in (state, step) : case runMyersStep eq state step of
Left result -> [ (state, return result) ]
Right next -> uncurry go next
runMyersStep :: HasCallStack => (a -> a -> Bool) -> MyersState -> Myers a b -> Either b (MyersState, Myers a b)
runMyersStep eq state step = let ?callStack = popCallStack callStack in case step of