QuickCheck-2.1.0.3: Automatic testing of Haskell programsSource codeContentsIndex
Test.QuickCheck
Contents
Running tests
Random generation
Generator combinators
Generators which use Arbitrary
Generator debugging
Arbitrary and CoArbitrary classes.
Helper functions for implementing arbitrary
Helper functions for implementing shrink
Helper functions for implementing coarbitrary
Type-level modifiers for changing generator behavior
Properties
Property combinators
Handling failure
Test distribution
Text formatting
Synopsis
quickCheck :: Testable prop => prop -> IO ()
data Args = Args {
replay :: Maybe (StdGen, Int)
maxSuccess :: Int
maxDiscard :: Int
maxSize :: Int
}
data Result
= Success {
labels :: [(String, Int)]
}
| GaveUp {
numTests :: Int
labels :: [(String, Int)]
}
| Failure {
usedSeed :: StdGen
usedSize :: Int
reason :: String
labels :: [(String, Int)]
}
| NoExpectedFailure {
labels :: [(String, Int)]
}
stdArgs :: Args
quickCheckWith :: Testable prop => Args -> prop -> IO ()
quickCheckWithResult :: Testable prop => Args -> prop -> IO Result
quickCheckResult :: Testable prop => prop -> IO Result
data Gen a
sized :: (Int -> Gen a) -> Gen a
resize :: Int -> Gen a -> Gen a
choose :: Random a => (a, a) -> Gen a
promote :: Monad m => m (Gen a) -> Gen (m a)
suchThat :: Gen a -> (a -> Bool) -> Gen a
suchThatMaybe :: Gen a -> (a -> Bool) -> Gen (Maybe a)
oneof :: [Gen a] -> Gen a
frequency :: [(Int, Gen a)] -> Gen a
elements :: [a] -> Gen a
growingElements :: [a] -> Gen a
listOf :: Gen a -> Gen [a]
listOf1 :: Gen a -> Gen [a]
vectorOf :: Int -> Gen a -> Gen [a]
vector :: Arbitrary a => Int -> Gen [a]
orderedList :: (Ord a, Arbitrary a) => Gen [a]
sample :: Show a => Gen a -> IO ()
sample' :: Gen a -> IO [a]
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]
shrinkIntegral :: Integral a => a -> [a]
shrinkRealFrac :: RealFrac a => a -> [a]
variant :: Integral n => n -> Gen a -> Gen 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
newtype Blind a = Blind a
newtype Fixed a = Fixed a
newtype OrderedList a = Ordered [a]
newtype NonEmptyList a = NonEmpty [a]
newtype Positive a = Positive a
newtype NonZero a = NonZero a
newtype NonNegative a = NonNegative a
data Smart a = Smart Int a
newtype Shrink2 a = Shrink2 a
data Shrinking s a = Shrinking s a
class ShrinkState s a where
shrinkInit :: a -> s
shrinkState :: a -> s -> [(a, s)]
type Property = Gen Prop
data Prop
class Testable prop where
property :: prop -> Property
mapSize :: Testable prop => (Int -> Int) -> prop -> Property
shrinking :: Testable prop => (a -> [a]) -> a -> (a -> prop) -> Property
(==>) :: Testable prop => Bool -> prop -> Property
forAll :: (Show a, Testable prop) => Gen a -> (a -> prop) -> Property
forAllShrink :: (Show a, Testable prop) => Gen a -> (a -> [a]) -> (a -> prop) -> Property
(.&.) :: (Testable prop1, Testable prop2) => prop1 -> prop2 -> Property
whenFail :: Testable prop => IO () -> prop -> Property
whenFail' :: Testable prop => IO () -> prop -> Property
expectFailure :: Testable prop => prop -> Property
within :: Testable prop => Int -> prop -> Property
label :: Testable prop => String -> prop -> Property
collect :: (Show a, Testable prop) => a -> prop -> Property
classify :: Testable prop => Bool -> String -> prop -> Property
cover :: Testable prop => Bool -> Int -> String -> prop -> Property
newtype Str = MkStr String
ranges :: Integral a => a -> a -> Str
Running tests
quickCheck :: Testable prop => prop -> IO ()Source
Tests a property and prints the results to stdout.
data Args Source
Args specifies arguments to the QuickCheck driver
Constructors
Args
replay :: Maybe (StdGen, Int)should we replay a previous test?
maxSuccess :: Intmaximum number of successful tests before succeeding
maxDiscard :: Intmaximum number of discarded tests before giving up
maxSize :: Intsize to use for the biggest test cases
show/hide Instances
data Result Source
Result represents the test result
Constructors
Success
labels :: [(String, Int)]labels and frequencies found during all tests
GaveUp
numTests :: Intnumber of successful tests performed
labels :: [(String, Int)]labels and frequencies found during all tests
Failure
usedSeed :: StdGenwhat seed was used
usedSize :: Intwhat was the test size
reason :: Stringwhat was the reason
labels :: [(String, Int)]labels and frequencies found during all successful tests
NoExpectedFailure
labels :: [(String, Int)]labels and frequencies found during all successful tests
show/hide Instances
stdArgs :: ArgsSource
stdArgs are the default test arguments used
quickCheckWith :: Testable prop => Args -> prop -> IO ()Source
Tests a property, using test arguments, and prints the results to stdout.
quickCheckWithResult :: Testable prop => Args -> prop -> IO ResultSource
Tests a property, using test arguments, produces a test result, and prints the results to stdout.
quickCheckResult :: Testable prop => prop -> IO ResultSource
Tests a property, produces a test result, and prints the results to stdout.
Random generation
data Gen a Source
show/hide Instances
Generator combinators
sized :: (Int -> Gen a) -> Gen aSource
Used to construct generators that depend on the size parameter.
resize :: Int -> Gen a -> Gen aSource
Overrides the size parameter. Returns a generator which uses the given size instead of the runtime-size parameter.
choose :: Random a => (a, a) -> Gen aSource
Generates a random element in the given inclusive range.
promote :: Monad m => m (Gen a) -> Gen (m a)Source
Promotes a generator to a generator of monadic values.
suchThat :: Gen a -> (a -> Bool) -> Gen aSource
Generates a value that satisfies a predicate.
suchThatMaybe :: Gen a -> (a -> Bool) -> Gen (Maybe a)Source
Tries to generate a value that satisfies a predicate.
oneof :: [Gen a] -> Gen aSource
Randomly uses one of the given generators. The input list must be non-empty.
frequency :: [(Int, Gen a)] -> Gen aSource
Chooses one of the given generators, with a weighted random distribution. The input list must be non-empty.
elements :: [a] -> Gen aSource
Generates one of the given values. The input list must be non-empty.
growingElements :: [a] -> Gen aSource
Takes a list of elements of increasing size, and chooses among an initial segment of the list. The size of this initial segment increases with the size parameter. The input list must be non-empty.
listOf :: Gen a -> Gen [a]Source
Generates a list of random length. The maximum length depends on the size parameter.
listOf1 :: Gen a -> Gen [a]Source
Generates a non-empty list of random length. The maximum length depends on the size parameter.
vectorOf :: Int -> Gen a -> Gen [a]Source
Generates a list of the given length.
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.
Generator debugging
sample :: Show a => Gen a -> IO ()Source
Generates some example values and prints them to stdout.
sample' :: Gen a -> IO [a]Source
Generates some example values.
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.
shrinkIntegral :: Integral a => a -> [a]Source
Shrink an integral number.
shrinkRealFrac :: RealFrac a => a -> [a]Source
Shrink a fraction.
Helper functions for implementing coarbitrary
variant :: Integral n => n -> Gen a -> Gen aSource
Modifies a generator using an integer seed.
(><) :: (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 :-).
Type-level modifiers for changing generator behavior
newtype Blind a Source
Blind x: as x, but x does not have to be in the Show class.
Constructors
Blind a
show/hide Instances
Enum a => Enum (Blind a)
Eq a => Eq (Blind a)
Integral a => Integral (Blind a)
Num a => Num (Blind a)
Ord a => Ord (Blind a)
Real a => Real (Blind a)
Show (Blind a)
Arbitrary a => Arbitrary (Blind a)
newtype Fixed a Source
Fixed x: as x, but will not be shrunk.
Constructors
Fixed a
show/hide Instances
Enum a => Enum (Fixed a)
Eq a => Eq (Fixed a)
Integral a => Integral (Fixed a)
Num a => Num (Fixed a)
Ord a => Ord (Fixed a)
Read a => Read (Fixed a)
Real a => Real (Fixed a)
Show a => Show (Fixed a)
Arbitrary a => Arbitrary (Fixed a)
newtype OrderedList a Source
Ordered xs: guarantees that xs is ordered.
Constructors
Ordered [a]
show/hide Instances
newtype NonEmptyList a Source
NonEmpty xs: guarantees that xs is non-empty.
Constructors
NonEmpty [a]
show/hide Instances
newtype Positive a Source
Positive x: guarantees that x > 0.
Constructors
Positive a
show/hide Instances
Enum a => Enum (Positive a)
Eq a => Eq (Positive a)
Integral a => Integral (Positive a)
Num a => Num (Positive a)
Ord a => Ord (Positive a)
Read a => Read (Positive a)
Real a => Real (Positive a)
Show a => Show (Positive a)
(Num a, Ord a, Arbitrary a) => Arbitrary (Positive a)
newtype NonZero a Source
NonZero x: guarantees that x /= 0.
Constructors
NonZero a
show/hide Instances
Enum a => Enum (NonZero a)
Eq a => Eq (NonZero a)
Integral a => Integral (NonZero a)
Num a => Num (NonZero a)
Ord a => Ord (NonZero a)
Read a => Read (NonZero a)
Real a => Real (NonZero a)
Show a => Show (NonZero a)
(Num a, Ord a, Arbitrary a) => Arbitrary (NonZero a)
newtype NonNegative a Source
NonNegative x: guarantees that x >= 0.
Constructors
NonNegative a
show/hide Instances
data Smart a Source
Smart _ x: tries a different order when shrinking.
Constructors
Smart Int a
show/hide Instances
newtype Shrink2 a Source
Shrink2 x: allows 2 shrinking steps at the same time when shrinking x
Constructors
Shrink2 a
show/hide Instances
Enum a => Enum (Shrink2 a)
Eq a => Eq (Shrink2 a)
Integral a => Integral (Shrink2 a)
Num a => Num (Shrink2 a)
Ord a => Ord (Shrink2 a)
Read a => Read (Shrink2 a)
Real a => Real (Shrink2 a)
Show a => Show (Shrink2 a)
Arbitrary a => Arbitrary (Shrink2 a)
data Shrinking s a Source
Shrinking _ x: allows for maintaining a state during shrinking.
Constructors
Shrinking s a
show/hide Instances
class ShrinkState s a whereSource
Methods
shrinkInit :: a -> sSource
shrinkState :: a -> s -> [(a, s)]Source
Properties
type Property = Gen PropSource
data Prop Source
show/hide Instances
class Testable prop whereSource
The class of things which can be tested, i.e. turned into a property.
Methods
property :: prop -> PropertySource
show/hide Instances
Property combinators
mapSize :: Testable prop => (Int -> Int) -> prop -> PropertySource
Changes the maximum test case size for a property.
shrinkingSource
:: Testable prop
=> a -> [a]shrink-like function.
-> aThe original argument
-> a -> prop
-> Property
Shrinks the argument to property if it fails. Shrinking is done automatically for most types. This is only needed weh you want to override the default behavior.
(==>) :: Testable prop => Bool -> prop -> PropertySource
Implication for properties: The resulting property holds if the first argument is False, or if the given property holds.
forAll :: (Show a, Testable prop) => Gen a -> (a -> prop) -> PropertySource
Explicit universal quantification: uses an explicitly given test case generator.
forAllShrink :: (Show a, Testable prop) => Gen a -> (a -> [a]) -> (a -> prop) -> PropertySource
Like forAll, but tries to shrink the argument for failing test cases.
(.&.) :: (Testable prop1, Testable prop2) => prop1 -> prop2 -> PropertySource
Handling failure
whenFail :: Testable prop => IO () -> prop -> PropertySource
Performs an IO action after the last failure of a property.
whenFail' :: Testable prop => IO () -> prop -> PropertySource
Performs an IO action every time a property fails. Thus, if shrinking is done, this can be used to keep track of the failures along the way.
expectFailure :: Testable prop => prop -> PropertySource
Modifies a property so that it is expected to fail for some test cases.
within :: Testable prop => Int -> prop -> PropertySource
Considers a property failed if it does not complete within the given number of microseconds.
Test distribution
label :: Testable prop => String -> prop -> PropertySource
Attaches a label to a property. This is used for reporting test case distribution.
collect :: (Show a, Testable prop) => a -> prop -> PropertySource

Labels a property with a value:

 collect x = label (show x)
classifySource
:: Testable prop
=> BoolTrue if the test case should be labelled.
-> StringLabel.
-> prop
-> Property
Conditionally labels test case.
coverSource
:: Testable prop
=> BoolTrue if the test case belongs to the class.
-> IntThe required percentage (0-100) of test cases.
-> StringLabel for the test case class.
-> prop
-> Property
Checks that at least the given proportion of the test cases belong to the given class.
Text formatting
newtype Str Source
Constructors
MkStr String
show/hide Instances
ranges :: Integral a => a -> a -> StrSource
Produced by Haddock version 2.4.2