QuickCheck-2.1.0.2: Automatic testing of Haskell programsSource codeContentsIndex
Test.QuickCheck.Arbitrary
Contents
Arbitrary and CoArbitrary classes.
Helper functions for implementing arbitrary
Helper functions for implementing shrink
Helper functions for implementing coarbitrary
Generators which use arbitrary
Synopsis
class Arbitrary a where
arbitrary :: Gen a
shrink :: a -> [a]
class CoArbitrary a where
coarbitrary :: a -> Gen c -> Gen c
arbitrarySizedIntegral :: Num a => Gen a
arbitrarySizedFractional :: Fractional a => Gen a
arbitraryBoundedIntegral :: (Bounded a, Integral a) => Gen a
arbitraryBoundedRandom :: (Bounded a, Random a) => Gen a
shrinkNothing :: a -> [a]
shrinkList :: (a -> [a]) -> [a] -> [[a]]
shrinkIntegral :: Integral a => a -> [a]
shrinkRealFrac :: RealFrac a => a -> [a]
(><) :: (Gen a -> Gen a) -> (Gen a -> Gen a) -> Gen a -> Gen a
coarbitraryIntegral :: Integral a => a -> Gen b -> Gen b
coarbitraryReal :: Real a => a -> Gen b -> Gen b
coarbitraryShow :: Show a => a -> Gen b -> Gen b
vector :: Arbitrary a => Int -> Gen [a]
orderedList :: (Ord a, Arbitrary a) => Gen [a]
Arbitrary and CoArbitrary classes.
class Arbitrary a whereSource
Random generation and shrinking of values.
Methods
arbitrary :: Gen aSource
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.
show/hide Instances
class CoArbitrary a whereSource
Used for random generation of functions.
Methods
coarbitrary :: a -> Gen c -> Gen cSource
Used to generate a function of type a -> c. The implementation should use the first argument to perturb the random generator given as the second argument. the returned generator is then used to generate the function result. You can often use variant and >< to implement coarbitrary.
show/hide Instances
Helper functions for implementing arbitrary
arbitrarySizedIntegral :: Num a => Gen aSource
Generates an integral number. The number can be positive or negative and its maximum absolute value depends on the size parameter.
arbitrarySizedFractional :: Fractional a => Gen aSource
Generates a fractional number. The number can be positive or negative and its maximum absolute value depends on the size parameter.
arbitraryBoundedIntegral :: (Bounded a, Integral a) => Gen aSource
Generates an integral number. The number is chosen from the entire range of the type.
arbitraryBoundedRandom :: (Bounded a, Random a) => Gen aSource
Generates an element of a bounded type. The element is chosen from the entire range of the type.
Helper functions for implementing shrink
shrinkNothing :: a -> [a]Source
Returns no shrinking alternatives.
shrinkList :: (a -> [a]) -> [a] -> [[a]]Source
shrinkIntegral :: Integral a => a -> [a]Source
Shrink an integral number.
shrinkRealFrac :: RealFrac a => a -> [a]Source
Shrink a fraction.
Helper functions for implementing coarbitrary
(><) :: (Gen a -> Gen a) -> (Gen a -> Gen a) -> Gen a -> Gen aSource
Combine two generator perturbing functions, for example the results of calls to variant or coarbitrary.
coarbitraryIntegral :: Integral a => a -> Gen b -> Gen bSource
A coarbitrary implementation for integral numbers.
coarbitraryReal :: Real a => a -> Gen b -> Gen bSource
A coarbitrary implementation for real numbers.
coarbitraryShow :: Show a => a -> Gen b -> Gen bSource
coarbitrary helper for lazy people :-).
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 of a given length.
Produced by Haddock version 2.4.2