Modulecheckers-0.6.0Haskell2010

Test.QuickCheck.Classes

Some QuickCheck properties for standard type classes

38 values

Packagecheckers-0.6.0
Exports38
LanguageHaskell2010
LicenceBSD-3-Clause
SourceClasses.hs

valueordRel

:: (Ord a, Show a, Arbitrary a)
=> BinRel a
-> a -> Gen a
-> TestBatch

Total ordering.

gen a ought to generate values b satisfying a rel b fairly often.

valueord :: (Ord a, Show a, Arbitrary a) => (a -> Gen a) -> TestBatch

Ord laws.

gen a ought to generate values b satisfying a rel b fairly often.

valueordMorphism

:: (Ord a, Ord b, EqProp b, Show a, Arbitrary a)
=> a -> b
-> TestBatch

Ord morphism properties. h is an Ord morphism iff:

   a <= b = h a <= h b

   h (a `min` b) = h a `min` h b
   h (a `max` b) = h a `max` h b

valuesemanticOrd

:: (Model a b, Ord a, Ord b, Show a, Arbitrary a, EqProp b)
=> a
-> TestBatch

The semantic function (model) for a is an ordMorphism.

valuesemigroup

:: (Semigroup a, Show a, Arbitrary a, EqProp a, Integral n, Show n, Arbitrary n)
=> (a, n)
-> TestBatch

Properties to check that the Semigroup a satisfies the semigroup properties. The argument value is ignored and is present only for its type.

valuemonoid :: (Monoid a, Show a, Arbitrary a, EqProp a) => a -> TestBatch

Properties to check that the Monoid a satisfies the monoid properties. The argument value is ignored and is present only for its type.

valuemonoidMorphism

:: (Monoid a, Monoid b, EqProp b, Show a, Arbitrary a)
=> a -> b
-> TestBatch

Monoid homomorphism properties. See also homomorphism.

valuesemanticMonoid

:: (Model a b, Monoid a, Monoid b, Show a, Arbitrary a, EqProp b)
=> a
-> TestBatch

The semantic function (model) for a is a monoidMorphism.

valuefunctor

:: (Functor m, Arbitrary b, Arbitrary c, CoArbitrary a, CoArbitrary b, Show (m a), Arbitrary (m a), EqProp (m a), EqProp (m c))
=> m (a, b, c)
-> TestBatch

Properties to check that the Functor m satisfies the functor properties.

valuefunctorMorphism

:: (Functor f, Functor g, Arbitrary (f NumT), Show (f NumT), EqProp (g T))
=> forall a. f a -> g a
-> TestBatch

Functor morphism (natural transformation) properties

valuesemanticFunctor

:: (Model1 f g, Functor f, Functor g, Arbitrary (f NumT), Show (f NumT), EqProp (g T))
=> f ()
-> TestBatch

The semantic function (model1) for f is a functorMorphism.

valuefunctorMonoid

:: (Functor m, Monoid (m a), Monoid (m b), CoArbitrary a, Arbitrary b, Arbitrary (m a), Show (m a), EqProp (m b))
=> m (a, b)
-> TestBatch

valueapply

:: (Apply m, CoArbitrary a, Arbitrary b, CoArbitrary b, Arbitrary c, Arbitrary (m a), Arbitrary (m (b -> c)), Show (m (b -> c)), Arbitrary (m (a -> b)), Show (m (a -> b)), Show (m a), EqProp (m c))
=> m (a, b, c)
-> TestBatch

Properties to check that the Apply m satisfies the apply properties

valueapplyMorphism

:: (Apply f, Apply g, Show (f NumT), Arbitrary (f NumT), EqProp (g T), Show (f (NumT -> T)), Arbitrary (f (NumT -> T)))
=> forall a. f a -> g a
-> TestBatch

Apply morphism properties

valuesemanticApply

:: (Model1 f g, Apply f, Apply g, Arbitrary (f NumT), Arbitrary (f (NumT -> T)), EqProp (g T), Show (f NumT), Show (f (NumT -> T)))
=> f ()
-> TestBatch

The semantic function (model1) for f is an applyMorphism.

valueapplicative

:: (Applicative m, Arbitrary a, CoArbitrary a, Arbitrary b, Arbitrary (m a), Arbitrary (m (b -> c)), Show (m (b -> c)), Arbitrary (m (a -> b)), Show (m (a -> b)), Show a, Show (m a), EqProp (m a), EqProp (m b), EqProp (m c))
=> m (a, b, c)
-> TestBatch

Properties to check that the Applicative m satisfies the applicative properties

valueapplicativeMorphism

:: (Applicative f, Applicative g, Show (f NumT), Arbitrary (f NumT), EqProp (g NumT), EqProp (g T), Show (f (NumT -> T)), Arbitrary (f (NumT -> T)))
=> forall a. f a -> g a
-> TestBatch

Applicative morphism properties

valuesemanticApplicative

:: (Model1 f g, Applicative f, Applicative g, Arbitrary (f NumT), Arbitrary (f (NumT -> T)), EqProp (g NumT), EqProp (g T), Show (f NumT), Show (f (NumT -> T)))
=> f ()
-> TestBatch

The semantic function (model1) for f is an applicativeMorphism.

valuebind

:: (Bind m, CoArbitrary a, CoArbitrary b, Arbitrary (m a), EqProp (m a), Show (m a), Arbitrary (m b), Arbitrary (m c), EqProp (m c), Arbitrary (m (m (m a))), Show (m (m (m a))))
=> m (a, b, c)
-> TestBatch

Properties to check that the bind m satisfies the bind properties

valuebindMorphism

:: (Bind f, Bind g, Show (f NumT), Show (f (f (NumT -> T))), Arbitrary (f NumT), Arbitrary (f T), Arbitrary (f (f (NumT -> T))), EqProp (g T), EqProp (g (NumT -> T)))
=> forall a. f a -> g a
-> TestBatch

bind morphism properties

valuesemanticBind

:: (Model1 f g, Bind f, Bind g, EqProp (g T), EqProp (g (NumT -> T)), Arbitrary (f T), Arbitrary (f NumT), Arbitrary (f (f (NumT -> T))), Show (f (f (NumT -> T))), Show (f NumT))
=> f ()
-> TestBatch

The semantic function (model1) for f is a bindMorphism.

valuebindApply

:: (Bind m, EqProp (m b), Show (m a), Arbitrary (m a), Show (m (a -> b)), Arbitrary (m (a -> b)))
=> m (a, b)
-> TestBatch

valuemonad

:: (Monad m, Show a, Arbitrary a, CoArbitrary a, CoArbitrary b, Arbitrary (m a), EqProp (m a), Show (m a), Arbitrary (m b), EqProp (m b), Arbitrary (m c), EqProp (m c), Show (m (a -> b)), Arbitrary (m (a -> b)))
=> m (a, b, c)
-> TestBatch

Properties to check that the Monad m satisfies the monad properties

valuemonadMorphism

:: (Monad f, Monad g, Show (f NumT), Show (f (f (NumT -> T))), Arbitrary (f NumT), Arbitrary (f T), Arbitrary (f (f (NumT -> T))), EqProp (g NumT), EqProp (g T), EqProp (g (NumT -> T)))
=> forall a. f a -> g a
-> TestBatch

Monad morphism properties

Applicative morphism properties

valuesemanticMonad

:: (Model1 f g, Monad f, Monad g, EqProp (g T), EqProp (g NumT), EqProp (g (NumT -> T)), Arbitrary (f T), Arbitrary (f NumT), Arbitrary (f (f (NumT -> T))), Show (f (f (NumT -> T))), Show (f NumT))
=> f ()
-> TestBatch

The semantic function (model1) for f is a monadMorphism.

valuemonadFunctor

:: (Monad m, Arbitrary b, CoArbitrary a, Arbitrary (m a), Show (m a), EqProp (m b))
=> m (a, b)
-> TestBatch

Law for monads that are also instances of Functor.

Note that instances that satisfy applicative and monad are implied to satisfy this property too.

valuemonadApplicative

:: (Monad m, EqProp (m a), EqProp (m b), Show a, Arbitrary a, Show (m a), Arbitrary (m a), Show (m (a -> b)), Arbitrary (m (a -> b)))
=> m (a, b)
-> TestBatch

Note that monad also contains these properties.

valuearrow

:: (Arrow a, Show (a d e), Show (a c d), Show (a b c), Arbitrary (a d e), Arbitrary (a c d), Arbitrary (a b c), Arbitrary c, Arbitrary d, Arbitrary e, CoArbitrary b, CoArbitrary c, CoArbitrary d, EqProp (a b e), EqProp (a b d), EqProp (a (b, d) c), EqProp (a (b, d) (c, d)), EqProp (a (b, e) (d, e)), EqProp (a (b, d) (c, e)))
=> a b (c, d, e)
-> TestBatch

valuearrowChoice

:: (ArrowChoice a, Show (a b c), Arbitrary (a b c), Arbitrary c, Arbitrary e, CoArbitrary b, CoArbitrary d, EqProp (a (Either b d) (Either c e)), EqProp (a (Either b d) (Either c d)))
=> a b (c, d, e)
-> TestBatch

valuefoldable

:: (Foldable t, CoArbitrary a, CoArbitrary b, Arbitrary a, Arbitrary b, Arbitrary m, Arbitrary o, Arbitrary (t a), Arbitrary (t m), Arbitrary (t n), Arbitrary (t o), Monoid m, Num n, Ord o, EqProp m, EqProp n, EqProp b, EqProp o, EqProp a, Show (t m), Show (t n), Show (t o), Show b, Show (t a), Show o)
=> t (a, b, m, n, o)
-> TestBatch

Note that foldable doesn't check the strictness of foldl', foldr' and foldMap'.

valuefoldableFunctor

:: (Functor t, Foldable t, CoArbitrary a, Arbitrary m, Arbitrary (t a), EqProp m, Monoid m, Show (t a))
=> t (a, m)
-> TestBatch

valuebifoldable

:: (Bifoldable p, Monoid m, Show (p a b), Show (p m m), Arbitrary (p a b), Arbitrary (p m m), Arbitrary m, CoArbitrary a, CoArbitrary b, EqProp m, EqProp c, CoArbitrary c, Arbitrary c, Show c)
=> p a (b, c, m)
-> TestBatch

valuebifoldableBifunctor

:: (Bifoldable p, Bifunctor p, Monoid m, Show (p a b), Arbitrary (p a b), Arbitrary m, CoArbitrary a, CoArbitrary b, EqProp m)
=> p a (b, m)
-> TestBatch

valuetraversable

:: (Traversable t, Applicative f, Applicative g, Monoid m, Arbitrary (t a), Arbitrary (t b), Arbitrary (f b), Arbitrary (g c), Arbitrary (t (f (g a))), Arbitrary m, Arbitrary b, CoArbitrary a, CoArbitrary b, Show (t a), Show (t b), Show (t (f (g a))), EqProp (t b), EqProp m, EqProp (f (g (t a))), EqProp (f (g (t c))))
=> t (f a, g b, c, m)
-> TestBatch

valuemonadPlus

:: (MonadPlus m, Show (m a), CoArbitrary a, Arbitrary (m a), Arbitrary (m b), EqProp (m a), EqProp (m b))
=> m (a, b)
-> TestBatch

Laws for MonadPlus instances with left distribution.

valuemonadOr

:: (MonadPlus m, Show a, Show (m a), Arbitrary a, CoArbitrary a, Arbitrary (m a), Arbitrary (m b), EqProp (m a), EqProp (m b))
=> m (a, b)
-> TestBatch

Laws for MonadPlus instances with left catch.

valuealt

:: (Alt f, Arbitrary (f a), EqProp (f a), Show (f a))
=> f a
-> TestBatch

Check Alt Semigroup law

valuealternative

:: (Alternative f, Arbitrary (f a), EqProp (f a), Show (f a))
=> f a
-> TestBatch

Check Alternative Monoid laws