mirror of
https://github.com/github/semantic.git
synced 2024-12-27 00:44:57 +03:00
62 lines
2.0 KiB
Haskell
62 lines
2.0 KiB
Haskell
{-# LANGUAGE DataKinds #-}
|
|
module DiffSpec where
|
|
|
|
import Category
|
|
import Data.Functor.Both
|
|
import Data.Functor.Foldable (cata)
|
|
import Data.Functor.Listable ()
|
|
import qualified Data.Syntax as Syntax
|
|
import qualified Data.Syntax.Comment as Comment
|
|
import qualified Data.Syntax.Declaration as Declaration
|
|
import qualified Data.Syntax.Statement as Statement
|
|
import Data.Record
|
|
import Data.Union
|
|
import Diff
|
|
import Interpreter
|
|
import RWS
|
|
import Term
|
|
import Test.Hspec
|
|
import Test.Hspec.LeanCheck
|
|
|
|
type Syntax = Union
|
|
'[ Comment.Comment
|
|
, Declaration.Function
|
|
, Declaration.Method
|
|
, Statement.If
|
|
, Syntax.Context
|
|
, Syntax.Empty
|
|
, Syntax.Identifier
|
|
, []
|
|
]
|
|
|
|
spec :: Spec
|
|
spec = parallel $ do
|
|
prop "equality is reflexive" $
|
|
\ diff -> diff `shouldBe` (diff :: Diff Syntax (Record '[]) (Record '[]))
|
|
|
|
prop "equal terms produce identity diffs" $
|
|
\ term -> diffCost (diffTerms term (term :: Term Syntax (Record '[]))) `shouldBe` 0
|
|
|
|
describe "beforeTerm" $ do
|
|
prop "recovers the before term" $
|
|
\ a b -> let diff = diffTerms a b :: Diff Syntax (Record '[]) (Record '[]) in
|
|
beforeTerm diff `shouldBe` Just a
|
|
|
|
describe "afterTerm" $ do
|
|
prop "recovers the after term" $
|
|
\ a b -> let diff = diffTerms a b :: Diff Syntax (Record '[]) (Record '[]) in
|
|
afterTerm diff `shouldBe` Just b
|
|
|
|
prop "forward permutations are changes" $
|
|
\ a b -> let wrap = termIn Nil . inj
|
|
c = wrap [a] in
|
|
diffTerms (wrap [a, b, c]) (wrap [c, a, b :: Term Syntax (Record '[])]) `shouldBe` merge (Nil, Nil) (inj [ inserting c, mergeTerm a, mergeTerm b, deleting c ])
|
|
|
|
prop "backward permutations are changes" $
|
|
\ a b -> let wrap = termIn Nil . inj
|
|
c = wrap [a] in
|
|
diffTerms (wrap [a, b, c]) (wrap [b, c, a :: Term Syntax (Record '[])]) `shouldBe` merge (Nil, Nil) (inj [ deleting a, mergeTerm b, mergeTerm c, inserting a ])
|
|
|
|
mergeTerm :: Functor syntax => Term syntax ann -> Diff syntax ann ann
|
|
mergeTerm = cata (\ (In ann syntax) -> merge (ann, ann) syntax)
|