{-# LANGUAGE CPP #-}
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE ScopedTypeVariables #-}
#if HAVE_QUANTIFIED_CONSTRAINTS
{-# LANGUAGE QuantifiedConstraints #-}
#endif
{-# OPTIONS_GHC -Wall #-}
module Test.QuickCheck.Classes.Apply
(
#if defined(HAVE_SEMIGROUPOIDS) && defined(HAVE_UNARY_LAWS)
applyLaws
#endif
) where
#if defined(HAVE_SEMIGROUPOIDS) && defined(HAVE_UNARY_LAWS)
import Data.Functor
import qualified Data.Functor.Apply as FunctorApply
import Test.QuickCheck hiding ((.&.))
import Test.QuickCheck.Arbitrary (Arbitrary1(..))
import Data.Functor.Classes (Eq1,Show1)
import Test.QuickCheck.Property (Property)
import Test.QuickCheck.Classes.Internal
type ApplyProp proxy f =
#if HAVE_QUANTIFIED_CONSTRAINTS
(FunctorApply.Apply f, forall x. Eq x => Eq (f x), forall x. Show x => Show (f x), forall x. Arbitrary x => Arbitrary (f x))
#else
(FunctorApply.Apply f, Eq1 f, Show1 f, Arbitrary1 f)
#endif
=> proxy f -> Property
applyLaws ::
#if HAVE_QUANTIFIED_CONSTRAINTS
(FunctorApply.Apply f, forall a. Eq a => Eq (f a), forall a. Show a => Show (f a), forall a. Arbitrary a => Arbitrary (f a))
#else
(FunctorApply.Apply f, Eq1 f, Show1 f, Arbitrary1 f)
#endif
=> proxy f -> Laws
applyLaws p = Laws "Apply"
[ ("LiftF2 part 1", applyLiftF2_1 p)
, ("Associativity", applyAssociativity p)
]
applyLiftF2_1 :: forall proxy f. ApplyProp proxy f
applyLiftF2_1 _ = property $ \(Apply (f' :: f QuadraticEquation)) (Apply (x :: f Integer)) ->
let f = fmap runQuadraticEquation f'
in eq1 (FunctorApply.liftF2 id f x) (f FunctorApply.<.> x)
applyAssociativity :: forall proxy f. ApplyProp proxy f
applyAssociativity _ = property $ \(Apply (u' :: f QuadraticEquation)) (Apply (v' :: f QuadraticEquation)) (Apply (w :: f Integer)) ->
let u = fmap runQuadraticEquation u'
v = fmap runQuadraticEquation v'
in eq1 (fmap (.) u FunctorApply.<.> v FunctorApply.<.> w) (u FunctorApply.<.> (v FunctorApply.<.> w))
#endif