mirror of
https://github.com/github/semantic.git
synced 2024-12-22 22:31:36 +03:00
43 lines
1.6 KiB
Haskell
43 lines
1.6 KiB
Haskell
module Algorithm where
|
||
|
||
import Control.Applicative.Free
|
||
import Prologue hiding (Pure)
|
||
|
||
-- | A single step in a diffing algorithm.
|
||
--
|
||
-- 'term' is the type of terms.
|
||
-- 'diff' is the type of diffs.
|
||
-- 'f' represents the continuation after diffing. Often 'Algorithm'.
|
||
data AlgorithmF term diff f
|
||
-- | Recursively diff two terms and pass the result to the continuation.
|
||
= Recursive term term (diff -> f)
|
||
-- | Diff two lists by each element’s position, and pass the resulting list of diffs to the continuation.
|
||
| ByIndex [term] [term] ([diff] -> f)
|
||
-- | Diff two lists by each element’s similarity and pass the resulting list of diffs to the continuation.
|
||
| BySimilarity [term] [term] ([diff] -> f)
|
||
deriving Functor
|
||
|
||
-- | The free applicative for 'AlgorithmF'. This enables us to construct diff values using <$> and <*> notation.
|
||
type Algorithm term diff = Ap (AlgorithmF term diff)
|
||
|
||
-- | Tear down an Ap by iteration.
|
||
iterAp :: Functor g => (g a -> a) -> Ap g a -> a
|
||
iterAp algebra = go
|
||
where go (Pure a) = a
|
||
go (Ap underlying apply) = algebra (go . (apply <*>) . pure <$> underlying)
|
||
|
||
|
||
-- DSL
|
||
|
||
-- | Constructs a 'Recursive' diff of two terms.
|
||
recursively :: term -> term -> Algorithm term diff diff
|
||
recursively a b = liftAp (Recursive a b identity)
|
||
|
||
-- | Constructs a 'ByIndex' diff of two lists of terms.
|
||
byIndex :: [term] -> [term] -> Algorithm term diff [diff]
|
||
byIndex a b = liftAp (ByIndex a b identity)
|
||
|
||
-- | Constructs a 'BySimilarity' diff of two lists of terms.
|
||
bySimilarity :: [term] -> [term] -> Algorithm term diff [diff]
|
||
bySimilarity a b = liftAp (BySimilarity a b identity)
|