github/semantic
1
1
Fork 0
mirror of https://github.com/github/semantic.git synced 2024-12-22 22:31:36 +03:00
Code Issues Projects Releases Wiki Activity

Define a function decomposing an algorithm into its next steps.

Browse Source
This commit is contained in:
Rob Rix 2017-02-21 13:40:59 -05:00
parent c198dac33d
commit 3b71c510e7
1 changed files with 9 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
src/Interpreter.hs
View File

@ -114,3 +114,12 @@ runAlgorithm construct recur cost = iterAp $ \ r cont -> case r of
Delete a -> cont (deleting a)
Insert b -> cont (inserting b)
Replace a b -> cont (replacing a b)
-- | Decompose a step of an algorithm into the next steps to perform.
decompose :: (GAlign f, Traversable f) => AlgorithmF (Term f ann) (Diff f ann) result -> Algorithm (Term f ann) (Diff f ann) result
decompose = \case
Linear t1 t2 -> case galignWith recur (unwrap t1) (unwrap t2) of
Just result -> annotate t1 t2 <$> sequenceA result
_ -> byReplacing t1 t2
where recur = these byDeleting byInserting byReplacing
annotate t1 t2 = wrap . (both (extract t1) (extract t2) :<)