QuickCheck-2.8.2: Automatic testing of Haskell programs

Safe HaskellSafe
LanguageHaskell98

Test.QuickCheck.Arbitrary

Contents

Description

Type classes for random generation of values.

Synopsis

Arbitrary and CoArbitrary classes

class Arbitrary a where Source

Random generation and shrinking of values.

Minimal complete definition

arbitrary

Methods

arbitrary :: Gen a Source

A generator for values of the given type.

shrink :: a -> [a] Source

Produces a (possibly) empty list of all the possible immediate shrinks of the given value. The default implementation returns the empty list, so will not try to shrink the value.

Most implementations of shrink should try at least three things:

  1. Shrink a term to any of its immediate subterms.
  2. Recursively apply shrink to all immediate subterms.
  3. Type-specific shrinkings such as replacing a constructor by a simpler constructor.

For example, suppose we have the following implementation of binary trees:

data Tree a = Nil | Branch a (Tree a) (Tree a)

We can then define shrink as follows:

shrink Nil = []
shrink (Branch x l r) =
  -- shrink Branch to Nil
  [Nil] ++
  -- shrink to subterms
  [l, r] ++
  -- recursively shrink subterms
  [Branch x' l' r' | (x', l', r') <- shrink (x, l, r)]

There are a couple of subtleties here:

  • QuickCheck tries the shrinking candidates in the order they appear in the list, so we put more aggressive shrinking steps (such as replacing the whole tree by Nil) before smaller ones (such as recursively shrinking the subtrees).
  • It is tempting to write the last line as [Branch x' l' r' | x' <- shrink x, l' <- shrink l, r' <- shrink r] but this is the wrong thing! It will force QuickCheck to shrink x, l and r in tandem, and shrinking will stop once one of the three is fully shrunk.

There is a fair bit of boilerplate in the code above. We can avoid it with the help of some generic functions; note that these only work on GHC 7.2 and above. The function genericShrink tries shrinking a term to all of its subterms and, failing that, recursively shrinks the subterms. Using it, we can define shrink as:

shrink x = shrinkToNil x ++ genericShrink x
  where
    shrinkToNil Nil = []
    shrinkToNil (Branch _ l r) = [Nil]

genericShrink is a combination of subterms, which shrinks a term to any of its subterms, and recursivelyShrink, which shrinks all subterms of a term. These may be useful if you need a bit more control over shrinking than genericShrink gives you.

A final gotcha: we cannot define shrink as simply shrink x = Nil:genericShrink x as this shrinks Nil to Nil, and shrinking will go into an infinite loop.

If all this leaves you bewildered, you might try shrink = genericShrink to begin with, after deriving Generic for your type. However, if your data type has any special invariants, you will need to check that genericShrink can't break those invariants.

Instances

Arbitrary Bool Source 
Arbitrary Char Source 
Arbitrary Double Source 
Arbitrary Float Source 
Arbitrary Int Source 
Arbitrary Int8 Source 
Arbitrary Int16 Source 
Arbitrary Int32 Source 
Arbitrary Int64 Source 
Arbitrary Integer Source 
Arbitrary Ordering Source 
Arbitrary Word Source 
Arbitrary Word8 Source 
Arbitrary Word16 Source 
Arbitrary Word32 Source 
Arbitrary Word64 Source 
Arbitrary () Source 
Arbitrary Natural Source 
Arbitrary IntSet Source 
Arbitrary OrdC Source 
Arbitrary OrdB Source 
Arbitrary OrdA Source 
Arbitrary C Source 
Arbitrary B Source 
Arbitrary A Source 
Arbitrary a => Arbitrary [a] Source 
Integral a => Arbitrary (Ratio a) Source 
HasResolution a => Arbitrary (Fixed a) Source 
(RealFloat a, Arbitrary a) => Arbitrary (Complex a) Source 
Arbitrary a => Arbitrary (Maybe a) Source 
Arbitrary a => Arbitrary (IntMap a) Source 
(Ord a, Arbitrary a) => Arbitrary (Set a) Source 
Arbitrary a => Arbitrary (Seq a) Source 
Arbitrary a => Arbitrary (Smart a) Source 
Arbitrary a => Arbitrary (Shrink2 a) Source 
Integral a => Arbitrary (Small a) Source 
(Integral a, Bounded a) => Arbitrary (Large a) Source 
(Num a, Ord a, Arbitrary a) => Arbitrary (NonNegative a) Source 
(Num a, Eq a, Arbitrary a) => Arbitrary (NonZero a) Source 
(Num a, Ord a, Arbitrary a) => Arbitrary (Positive a) Source 
Arbitrary a => Arbitrary (NonEmptyList a) Source 
(Ord a, Arbitrary a) => Arbitrary (OrderedList a) Source 
Arbitrary a => Arbitrary (Fixed a) Source 
Arbitrary a => Arbitrary (Blind a) Source 
(CoArbitrary a, Arbitrary b) => Arbitrary (a -> b) Source 
(Arbitrary a, Arbitrary b) => Arbitrary (Either a b) Source 
(Arbitrary a, Arbitrary b) => Arbitrary (a, b) Source 
(Ord k, Arbitrary k, Arbitrary v) => Arbitrary (Map k v) Source 
(Arbitrary a, ShrinkState s a) => Arbitrary (Shrinking s a) Source 
(Function a, CoArbitrary a, Arbitrary b) => Arbitrary (Fun a b) Source 
(Function a, CoArbitrary a, Arbitrary b) => Arbitrary ((:->) a b) Source 
(Arbitrary a, Arbitrary b, Arbitrary c) => Arbitrary (a, b, c) Source 
(Arbitrary a, Arbitrary b, Arbitrary c, Arbitrary d) => Arbitrary (a, b, c, d) Source 
(Arbitrary a, Arbitrary b, Arbitrary c, Arbitrary d, Arbitrary e) => Arbitrary (a, b, c, d, e) Source 

class CoArbitrary a where Source

Used for random generation of functions.

If you are using a recent GHC, there is a default definition of coarbitrary using genericCoarbitrary, so if your type has a Generic instance it's enough to say

instance CoArbitrary MyType

You should only use genericCoarbitrary for data types where equality is structural, i.e. if you can't have two different representations of the same value. An example where it's not safe is sets implemented using binary search trees: the same set can be represented as several different trees. Here you would have to explicitly define coarbitrary s = coarbitrary (toList s).

Minimal complete definition

Nothing

Methods

coarbitrary :: a -> Gen b -> Gen b Source

Used to generate a function of type a -> b. The first argument is a value, the second a generator. You should use variant to perturb the random generator; the goal is that different values for the first argument will lead to different calls to variant. An example will help:

instance CoArbitrary a => CoArbitrary [a] where
  coarbitrary []     = variant 0
  coarbitrary (x:xs) = variant 1 . coarbitrary (x,xs)

Instances

CoArbitrary Bool Source 
CoArbitrary Char Source 
CoArbitrary Double Source 
CoArbitrary Float Source 
CoArbitrary Int Source 
CoArbitrary Int8 Source 
CoArbitrary Int16 Source 
CoArbitrary Int32 Source 
CoArbitrary Int64 Source 
CoArbitrary Integer Source 
CoArbitrary Ordering Source 
CoArbitrary Word Source 
CoArbitrary Word8 Source 
CoArbitrary Word16 Source 
CoArbitrary Word32 Source 
CoArbitrary Word64 Source 
CoArbitrary () Source 
CoArbitrary Natural Source 
CoArbitrary IntSet Source 
CoArbitrary OrdC Source 
CoArbitrary OrdB Source 
CoArbitrary OrdA Source 
CoArbitrary C Source 
CoArbitrary B Source 
CoArbitrary A Source 
CoArbitrary a => CoArbitrary [a] Source 
(Integral a, CoArbitrary a) => CoArbitrary (Ratio a) Source 
HasResolution a => CoArbitrary (Fixed a) Source 
(RealFloat a, CoArbitrary a) => CoArbitrary (Complex a) Source 
CoArbitrary a => CoArbitrary (Maybe a) Source 
CoArbitrary a => CoArbitrary (IntMap a) Source 
CoArbitrary a => CoArbitrary (Set a) Source 
CoArbitrary a => CoArbitrary (Seq a) Source 
(Arbitrary a, CoArbitrary b) => CoArbitrary (a -> b) Source 
(CoArbitrary a, CoArbitrary b) => CoArbitrary (Either a b) Source 
(CoArbitrary a, CoArbitrary b) => CoArbitrary (a, b) Source 
(CoArbitrary k, CoArbitrary v) => CoArbitrary (Map k v) Source 
(CoArbitrary a, CoArbitrary b, CoArbitrary c) => CoArbitrary (a, b, c) Source 
(CoArbitrary a, CoArbitrary b, CoArbitrary c, CoArbitrary d) => CoArbitrary (a, b, c, d) Source 
(CoArbitrary a, CoArbitrary b, CoArbitrary c, CoArbitrary d, CoArbitrary e) => CoArbitrary (a, b, c, d, e) Source 

Helper functions for implementing arbitrary

arbitrarySizedIntegral :: Integral a => Gen a Source

Generates an integral number. The number can be positive or negative and its maximum absolute value depends on the size parameter.

arbitrarySizedNatural :: Integral a => Gen a Source

Generates a natural number. The number's maximum value depends on the size parameter.

arbitraryBoundedIntegral :: (Bounded a, Integral a) => Gen a Source

Generates an integral number. The number is chosen uniformly from the entire range of the type. You may want to use arbitrarySizedBoundedIntegral instead.

arbitrarySizedBoundedIntegral :: (Bounded a, Integral a) => Gen a Source

Generates an integral number from a bounded domain. The number is chosen from the entire range of the type, but small numbers are generated more often than big numbers. Inspired by demands from Phil Wadler.

arbitrarySizedFractional :: Fractional a => Gen a Source

Generates a fractional number. The number can be positive or negative and its maximum absolute value depends on the size parameter.

arbitraryBoundedRandom :: (Bounded a, Random a) => Gen a Source

Generates an element of a bounded type. The element is chosen from the entire range of the type.

arbitraryBoundedEnum :: (Bounded a, Enum a) => Gen a Source

Generates an element of a bounded enumeration.

Helper functions for implementing shrink

genericShrink :: (Generic a, RecursivelyShrink (Rep a), GSubterms (Rep a) a) => a -> [a] Source

Shrink a term to any of its immediate subterms, and also recursively shrink all subterms.

subterms :: (Generic a, GSubterms (Rep a) a) => a -> [a] Source

All immediate subterms of a term.

recursivelyShrink :: (Generic a, RecursivelyShrink (Rep a)) => a -> [a] Source

Recursively shrink all immediate subterms.

genericCoarbitrary :: (Generic a, GCoArbitrary (Rep a)) => a -> Gen b -> Gen b Source

Generic CoArbitrary implementation.

shrinkNothing :: a -> [a] Source

Returns no shrinking alternatives.

shrinkList :: (a -> [a]) -> [a] -> [[a]] Source

Shrink a list of values given a shrinking function for individual values.

shrinkIntegral :: Integral a => a -> [a] Source

Shrink an integral number.

shrinkRealFrac :: RealFrac a => a -> [a] Source

Shrink a fraction.

shrinkRealFracToInteger :: RealFrac a => a -> [a] Source

Shrink a fraction, but only shrink to integral values.

Helper functions for implementing coarbitrary

coarbitraryIntegral :: Integral a => a -> Gen b -> Gen b Source

A coarbitrary implementation for integral numbers.

coarbitraryReal :: Real a => a -> Gen b -> Gen b Source

A coarbitrary implementation for real numbers.

coarbitraryShow :: Show a => a -> Gen b -> Gen b Source

coarbitrary helper for lazy people :-).

coarbitraryEnum :: Enum a => a -> Gen b -> Gen b Source

A coarbitrary implementation for enums.

(><) :: (Gen a -> Gen a) -> (Gen a -> Gen a) -> Gen a -> Gen a Source

Deprecated: Use ordinary function composition instead

Combine two generator perturbing functions, for example the results of calls to variant or coarbitrary.

Generators which use arbitrary

vector :: Arbitrary a => Int -> Gen [a] Source

Generates a list of a given length.

orderedList :: (Ord a, Arbitrary a) => Gen [a] Source

Generates an ordered list.

infiniteList :: Arbitrary a => Gen [a] Source

Generate an infinite list.