mirror of
https://github.com/github/semantic.git
synced 2024-11-28 10:15:55 +03:00
41 lines
1.5 KiB
Haskell
41 lines
1.5 KiB
Haskell
{-# LANGUAGE DataKinds #-}
|
|
module Diff.Spec where
|
|
|
|
import Category
|
|
import Data.Bifunctor.Join
|
|
import Data.Functor.Listable
|
|
import Data.RandomWalkSimilarity
|
|
import Data.String
|
|
import Diff
|
|
import Info
|
|
import Interpreter
|
|
import Patch
|
|
import Prologue
|
|
import Term
|
|
import Test.Hspec
|
|
import Test.Hspec.LeanCheck
|
|
|
|
spec :: Spec
|
|
spec = parallel $ do
|
|
let decorate = defaultFeatureVectorDecorator (category . headF)
|
|
prop "equality is reflexive" $
|
|
\ a -> let diff = unListableDiff a :: SyntaxDiff String '[Category] in
|
|
diff `shouldBe` diff
|
|
|
|
prop "equal terms produce identity diffs" $
|
|
\ a -> let term = decorate (unListableF a :: SyntaxTerm String '[Category]) in
|
|
diffCost (diffTerms wrap (==) diffCost term term) `shouldBe` 0
|
|
|
|
describe "beforeTerm" $ do
|
|
prop "recovers the before term" $
|
|
\ a b -> let diff = stripDiff $ diffTerms wrap (==) diffCost (decorate (unListableF a)) (decorate (unListableF b :: SyntaxTerm String '[Category])) in
|
|
beforeTerm diff `shouldBe` Just (unListableF a)
|
|
|
|
describe "afterTerm" $ do
|
|
prop "recovers the after term" $
|
|
\ a b -> let diff = stripDiff $ diffTerms wrap (==) diffCost (decorate (unListableF a)) (decorate (unListableF b :: SyntaxTerm String '[Category])) in
|
|
afterTerm diff `shouldBe` Just (unListableF b)
|
|
|
|
unListableDiff :: Functor f => ListableF (Free (TermF f (ListableF (Join (,)) annotation))) (Patch (ListableF (Term f) annotation)) -> Diff f annotation
|
|
unListableDiff diff = hoistFree (first unListableF) $ fmap unListableF <$> unListableF diff
|