generic-arbitrary-1.0.1: Generic implementation for QuickCheck's Arbitrary
Safe Haskell None
Language Haskell2010

Test.QuickCheck.Arbitrary.Generic

Description

This module is a generic implementation of the arbitrary method. Example usage:

data Foo = Foo
  { _fooX :: X
  , _fooY :: Y
  } deriving (Generic)

instance Arbitrary Foo where
  arbitrary = genericArbitrary
  shrink = genericShrink

This instance can also be derived using DerivingVia language extension

data Foo = Foo
  { _fooX :: X
  , _fooY :: Y
  } deriving (Generic)
    deriving (Arbitrary) via GenericArbitrary Foo

The generated arbitrary method is equivalent to

Foo <$> arbitrary <*> arbitrary

.

It can also handle a recursive types problem. Assuming a type

data R = R R
  deriving Generic

there is no instance

instance Arbitrary R where
  arbitrary = genericArbitrary
  shrink = genericShrink

If you try to compile this you will get a type level error

   • R refers to itself in all constructors

Which means that there is no finite term for R because it is recursive. But, if you correct the definition of R like this.

data R = R R | F
  deriving Generic

Then it will compile. And the arbitrary generated will not hang forever, because it respects the size parameter.

There is a limitation of recursion detection:

data R1 = R1 R2
  deriving (Eq, Ord, Show, Generic)
  deriving anyclass NFData
  deriving Arbitrary via (GenericArbitrary R1)

data R2 = R2 R1
  deriving (Eq, Ord, Show, Generic)
  deriving anyclass NFData
  deriving Arbitrary via (GenericArbitrary R2)

This code will compile and the arbitrary generated will always hang. Yes, there is a problem with mutually recursive types.

Now lets see an example of datatype with parameters

data A a = A a
  deriving (Eq, Ord, Show)
  deriving anyclass NFData
  deriving (Generic)

instance (Arbitrary a) => Arbitrary (A a) where
  arbitrary = genericArbitrary
  shrink = genericShrink

It should work from first glance, but when compile it will throw an error:

    • Could not deduce (Test.QuickCheck.Arbitrary.Generic.GArbitrary
                          (A a)
                          (GHC.Generics.D1
                             ('GHC.Generics.MetaData A ParametersTest "main" 'False)
                             (GHC.Generics.C1
                                ('GHC.Generics.MetaCons A 'GHC.Generics.PrefixI 'False)
                                (GHC.Generics.S1
                                   ('GHC.Generics.MetaSel
                                      'Nothing
                                      'GHC.Generics.NoSourceUnpackedness
                                      'GHC.Generics.NoSourceStrictness
                                      'GHC.Generics.DecidedLazy)
                                   (GHC.Generics.Rec0 a))))
                          (TypesDiffer (A a) a))
        arising from a use of ‘genericArbitrary’

Here the TypesDiffer is a type familty dealing with recursive types and helping us to eliminate inproper instances. To convince the compiller, that the a parameter is not an A a we must fix the instance with additional constraint

instance (Arg (A a) a, Arbitrary a) => Arbitrary (A a) where
  arbitrary = genericArbitrary
  shrink = genericShrink

Now everything compiles and works as expected.

Synopsis

Main

genericArbitrary :: forall a ga some. ( Generic a, GArbitrary a ga some, ga ~ Rep a) => Gen a Source #

type Arg self field = TypesDiffer self field ~ ' True Source #

Constraint helper for types with parameters

Usage:

data A a = A a
  deriving (Generic)
instance (Arg (A a) a, Arbitrary a) => Arbitrary (A a) where
  arbitrary = genericArbitrary
  shrink = genericShrink

Since: 1.0.0

Internal

class Finite self a ~ finite => GArbitrary self a (finite :: Bool ) Source #

Generic arbitrary.

Parameters are: * self: the ADT we generating instance for * a: some part of the `Rep self` * finite: Is a finite? Infinite type has no finite values (like Stream)

Minimal complete definition

gArbitrary

Instances

Instances details
GArbitrary self ( U1 :: Type -> Type ) ' True Source #

Unit type instance

Instance details

Defined in Test.QuickCheck.Arbitrary.Generic

Methods

gArbitrary :: Proxy self -> Gen ( U1 x)

( GArbitrary self a af, GArbitrary self b bf, KnownNat ( SumLen a), KnownNat ( SumLen b), (af || bf) ~ some) => GArbitrary self (a :+: b) some Source #

Any sum inside of declaration

Instance details

Defined in Test.QuickCheck.Arbitrary.Generic

Methods

gArbitrary :: Proxy self -> Gen ((a :+: b) x)

( GArbitrary self a af, GArbitrary self b bf, (af && bf) ~ some) => GArbitrary self (a :*: b) some Source #

Product

Instance details

Defined in Test.QuickCheck.Arbitrary.Generic

Methods

gArbitrary :: Proxy self -> Gen ((a :*: b) x)

( Arbitrary t, Finite self ( K1 R t :: Type -> Type ) ~ some) => GArbitrary self ( K1 R t :: Type -> Type ) some Source #

Data of the constructor field

Instance details

Defined in Test.QuickCheck.Arbitrary.Generic

Methods

gArbitrary :: Proxy self -> Gen ( K1 R t x)

( TypeError (' ShowType self :<>: ' Text " refers to itself in all constructors") :: Constraint , ( Finite self a || Finite self b) ~ ' False ) => GArbitrary self ( M1 D t (a :+: b)) ' False Source #
Instance details

Defined in Test.QuickCheck.Arbitrary.Generic

Methods

gArbitrary :: Proxy self -> Gen ( M1 D t (a :+: b) x)

( FiniteSum self a b af bf, GArbitrary self (a :+: b) ' True ) => GArbitrary self ( M1 D t (a :+: b)) ' True Source #

ADT declaration with multiple constructors

Instance details

Defined in Test.QuickCheck.Arbitrary.Generic

Methods

gArbitrary :: Proxy self -> Gen ( M1 D t (a :+: b) x)

( TypeError (' ShowType self :<>: ' Text " refers to itself in all constructors") :: Constraint , AllFieldsFinal self f ~ ' False ) => GArbitrary self ( M1 D t ( M1 C c f)) ' False Source #
Instance details

Defined in Test.QuickCheck.Arbitrary.Generic

Methods

gArbitrary :: Proxy self -> Gen ( M1 D t ( M1 C c f) x)

GArbitrary self f some => GArbitrary self ( M1 S t f) some Source #

Constructor field meta information

Instance details

Defined in Test.QuickCheck.Arbitrary.Generic

Methods

gArbitrary :: Proxy self -> Gen ( M1 S t f x)

( GArbitrary self f some, KnownNat ( ArgumentsCount f), AllFieldsFinal self f ~ some) => GArbitrary self ( M1 C c f) some Source #

The constructor meta information

Instance details

Defined in Test.QuickCheck.Arbitrary.Generic

Methods

gArbitrary :: Proxy self -> Gen ( M1 C c f x)

GArbitrary self ( M1 C c f) ' True => GArbitrary self ( M1 D t ( M1 C c f)) ' True Source #
Instance details

Defined in Test.QuickCheck.Arbitrary.Generic

Methods

gArbitrary :: Proxy self -> Gen ( M1 D t ( M1 C c f) x)

class ( Finite self a ~ af, Finite self b ~ bf) => FiniteSum self (a :: * -> *) (b :: * -> *) af bf Source #

Minimal complete definition

finiteSum

Instances

Instances details
( FiniteSumElem self b, Finite self a ~ ' False , Finite self b ~ ' True ) => FiniteSum self a b ' False ' True Source #
Instance details

Defined in Test.QuickCheck.Arbitrary.Generic

Methods

finiteSum :: Proxy self -> [ Gen ((a :+: b) p)]

( FiniteSumElem self a, Finite self a ~ ' True , Finite self b ~ ' False ) => FiniteSum self a b ' True ' False Source #
Instance details

Defined in Test.QuickCheck.Arbitrary.Generic

Methods

finiteSum :: Proxy self -> [ Gen ((a :+: b) p)]

( FiniteSumElem self a, FiniteSumElem self b, Finite self a ~ ' True , Finite self b ~ ' True ) => FiniteSum self a b ' True ' True Source #
Instance details

Defined in Test.QuickCheck.Arbitrary.Generic

Methods

finiteSum :: Proxy self -> [ Gen ((a :+: b) p)]

class FiniteSumElem self a Source #

Minimal complete definition

finiteElem

Instances

Instances details
FiniteSum self a b af bf => FiniteSumElem (self :: Type ) (a :+: b :: Type -> Type ) Source #
Instance details

Defined in Test.QuickCheck.Arbitrary.Generic

Methods

finiteElem :: forall (p :: k). Proxy self -> [ Gen ((a :+: b) p)]

GArbitrary self ( M1 C c f) ' True => FiniteSumElem (self :: Type ) ( M1 C c f :: Type -> Type ) Source #
Instance details

Defined in Test.QuickCheck.Arbitrary.Generic

Methods

finiteElem :: forall (p :: k). Proxy self -> [ Gen ( M1 C c f p)]

type family Finite self (a :: * -> *) :: Bool where ... Source #

Equations

Finite self U1 = ' True
Finite self ( K1 R field) = TypesDiffer self field
Finite self (a :*: b) = Finite self a && Finite self b
Finite self ( M1 D t f) = Finite self f
Finite self (a :+: b) = Finite self a || Finite self b
Finite self ( M1 C c f) = AllFieldsFinal self f
Finite self ( M1 S s f) = Finite self f

type family TypesDiffer a b where ... Source #

type family SumLen a :: Nat where ... Source #

Calculates count of constructors encoded by particular :+: . Internal use only.

Reexports

class Arbitrary a where Source #

Random generation and shrinking of values.

QuickCheck provides Arbitrary instances for most types in base , except those which incur extra dependencies. For a wider range of Arbitrary instances see the quickcheck-instances package.

Minimal complete definition

arbitrary

Methods

arbitrary :: Gen a Source #

A generator for values of the given type.

It is worth spending time thinking about what sort of test data you want - good generators are often the difference between finding bugs and not finding them. You can use sample , label and classify to check the quality of your test data.

There is no generic arbitrary implementation included because we don't know how to make a high-quality one. If you want one, consider using the testing-feat or generic-random packages.

The QuickCheck manual goes into detail on how to write good generators. Make sure to look at it, especially if your type is recursive!

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. If your data type has no special invariants, you can enable shrinking by defining shrink = genericShrink , but by customising the behaviour of shrink you can often get simpler counterexamples.

Most implementations of shrink should try at least three things:

  1. Shrink a term to any of its immediate subterms. You can use subterms to do this.
  2. Recursively apply shrink to all immediate subterms. You can use recursivelyShrink to do this.
  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. 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

Instances details
Arbitrary Bool
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary Char
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary Double
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary Float
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary Int
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary Int8
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary Int16
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary Int32
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary Int64
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary Integer
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary Ordering
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary Word
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary Word8
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary Word16
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary Word32
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary Word64
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary ()
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary Version

Generates Version with non-empty non-negative versionBranch , and empty versionTags

Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary QCGen
Instance details

Defined in Test.QuickCheck.Arbitrary

Methods

arbitrary :: Gen QCGen Source #

shrink :: QCGen -> [QCGen] Source #

Arbitrary ASCIIString
Instance details

Defined in Test.QuickCheck.Modifiers

Arbitrary UnicodeString
Instance details

Defined in Test.QuickCheck.Modifiers

Arbitrary PrintableString
Instance details

Defined in Test.QuickCheck.Modifiers

Arbitrary ExitCode
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary All
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary Any
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary CChar
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary CSChar
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary CUChar
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary CShort
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary CUShort
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary CInt
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary CUInt
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary CLong
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary CULong
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary CLLong
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary CULLong
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary CFloat
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary CDouble
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary CPtrdiff
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary CSize
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary CWchar
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary CSigAtomic
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary CClock
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary CTime
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary CUSeconds
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary CSUSeconds
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary CIntPtr
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary CUIntPtr
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary CIntMax
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary CUIntMax
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary IntSet
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary a => Arbitrary [a]
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary a => Arbitrary ( Maybe a)
Instance details

Defined in Test.QuickCheck.Arbitrary

Integral a => Arbitrary ( Ratio a)
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary a => Arbitrary ( Blind a)
Instance details

Defined in Test.QuickCheck.Modifiers

Arbitrary a => Arbitrary ( Fixed a)
Instance details

Defined in Test.QuickCheck.Modifiers

( Ord a, Arbitrary a) => Arbitrary ( OrderedList a)
Instance details

Defined in Test.QuickCheck.Modifiers

Arbitrary a => Arbitrary ( NonEmptyList a)
Instance details

Defined in Test.QuickCheck.Modifiers

Arbitrary a => Arbitrary ( InfiniteList a)
Instance details

Defined in Test.QuickCheck.Modifiers

( Arbitrary a, Ord a) => Arbitrary ( SortedList a)
Instance details

Defined in Test.QuickCheck.Modifiers

( Num a, Ord a, Arbitrary a) => Arbitrary ( Positive a)
Instance details

Defined in Test.QuickCheck.Modifiers

( Num a, Ord a, Arbitrary a) => Arbitrary ( Negative a)
Instance details

Defined in Test.QuickCheck.Modifiers

( Num a, Eq a, Arbitrary a) => Arbitrary ( NonZero a)
Instance details

Defined in Test.QuickCheck.Modifiers

( Num a, Ord a, Arbitrary a) => Arbitrary ( NonNegative a)
Instance details

Defined in Test.QuickCheck.Modifiers

( Num a, Ord a, Arbitrary a) => Arbitrary ( NonPositive a)
Instance details

Defined in Test.QuickCheck.Modifiers

( Integral a, Bounded a) => Arbitrary ( Large a)
Instance details

Defined in Test.QuickCheck.Modifiers

Integral a => Arbitrary ( Small a)
Instance details

Defined in Test.QuickCheck.Modifiers

Arbitrary a => Arbitrary ( Shrink2 a)
Instance details

Defined in Test.QuickCheck.Modifiers

Arbitrary a => Arbitrary ( Smart a)
Instance details

Defined in Test.QuickCheck.Modifiers

Arbitrary a => Arbitrary ( Complex a)
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary a => Arbitrary ( ZipList a)
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary a => Arbitrary ( Identity a)
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary a => Arbitrary ( First a)
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary a => Arbitrary ( Last a)
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary a => Arbitrary ( Dual a)
Instance details

Defined in Test.QuickCheck.Arbitrary

( Arbitrary a, CoArbitrary a) => Arbitrary ( Endo a)
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary a => Arbitrary ( Sum a)
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary a => Arbitrary ( Product a)
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary a => Arbitrary ( IntMap a)
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary a => Arbitrary ( Tree a)
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary a => Arbitrary ( Seq a)
Instance details

Defined in Test.QuickCheck.Arbitrary

( Ord a, Arbitrary a) => Arbitrary ( Set a)
Instance details

Defined in Test.QuickCheck.Arbitrary

( Generic a, GArbitrary a ( Rep a) some, RecursivelyShrink ( Rep a), GSubterms ( Rep a) a) => Arbitrary ( GenericArbitrary a) Source #
Instance details

Defined in Test.QuickCheck.Arbitrary.Generic

Arbitrary a => Arbitrary (InfiniteListInternalData a)
Instance details

Defined in Test.QuickCheck.Modifiers

Methods

arbitrary :: Gen (InfiniteListInternalData a) Source #

shrink :: InfiniteListInternalData a -> [InfiniteListInternalData a] Source #

( CoArbitrary a, Arbitrary b) => Arbitrary (a -> b)
Instance details

Defined in Test.QuickCheck.Arbitrary

Methods

arbitrary :: Gen (a -> b) Source #

shrink :: (a -> b) -> [a -> b] Source #

( Arbitrary a, Arbitrary b) => Arbitrary ( Either a b)
Instance details

Defined in Test.QuickCheck.Arbitrary

( Arbitrary a, Arbitrary b) => Arbitrary (a, b)
Instance details

Defined in Test.QuickCheck.Arbitrary

Methods

arbitrary :: Gen (a, b) Source #

shrink :: (a, b) -> [(a, b)] Source #

( Function a, CoArbitrary a, Arbitrary b) => Arbitrary (a :-> b)
Instance details

Defined in Test.QuickCheck.Function

( Function a, CoArbitrary a, Arbitrary b) => Arbitrary ( Fun a b)
Instance details

Defined in Test.QuickCheck.Function

( Arbitrary a, ShrinkState s a) => Arbitrary ( Shrinking s a)
Instance details

Defined in Test.QuickCheck.Modifiers

HasResolution a => Arbitrary ( Fixed a)
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary (m a) => Arbitrary ( WrappedMonad m a)
Instance details

Defined in Test.QuickCheck.Arbitrary

( Ord k, Arbitrary k, Arbitrary v) => Arbitrary ( Map k v)
Instance details

Defined in Test.QuickCheck.Arbitrary

( Arbitrary a, Arbitrary b, Arbitrary c) => Arbitrary (a, b, c)
Instance details

Defined in Test.QuickCheck.Arbitrary

Methods

arbitrary :: Gen (a, b, c) Source #

shrink :: (a, b, c) -> [(a, b, c)] Source #

Arbitrary (a b c) => Arbitrary ( WrappedArrow a b c)
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary a => Arbitrary ( Const a b)
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary (f a) => Arbitrary ( Alt f a)
Instance details

Defined in Test.QuickCheck.Arbitrary

Arbitrary a => Arbitrary ( Constant a b)
Instance details

Defined in Test.QuickCheck.Arbitrary

( Arbitrary a, Arbitrary b, Arbitrary c, Arbitrary d) => Arbitrary (a, b, c, d)
Instance details

Defined in Test.QuickCheck.Arbitrary

Methods

arbitrary :: Gen (a, b, c, d) Source #

shrink :: (a, b, c, d) -> [(a, b, c, d)] Source #

( Arbitrary1 f, Arbitrary1 g, Arbitrary a) => Arbitrary ( Product f g a)
Instance details

Defined in Test.QuickCheck.Arbitrary

( Arbitrary a, Arbitrary b, Arbitrary c, Arbitrary d, Arbitrary e) => Arbitrary (a, b, c, d, e)
Instance details

Defined in Test.QuickCheck.Arbitrary

Methods

arbitrary :: Gen (a, b, c, d, e) Source #

shrink :: (a, b, c, d, e) -> [(a, b, c, d, e)] Source #

( Arbitrary1 f, Arbitrary1 g, Arbitrary a) => Arbitrary ( Compose f g a)
Instance details

Defined in Test.QuickCheck.Arbitrary

( Arbitrary a, Arbitrary b, Arbitrary c, Arbitrary d, Arbitrary e, Arbitrary f) => Arbitrary (a, b, c, d, e, f)
Instance details

Defined in Test.QuickCheck.Arbitrary

Methods

arbitrary :: Gen (a, b, c, d, e, f) Source #

shrink :: (a, b, c, d, e, f) -> [(a, b, c, d, e, f)] Source #

( Arbitrary a, Arbitrary b, Arbitrary c, Arbitrary d, Arbitrary e, Arbitrary f, Arbitrary g) => Arbitrary (a, b, c, d, e, f, g)
Instance details

Defined in Test.QuickCheck.Arbitrary

Methods

arbitrary :: Gen (a, b, c, d, e, f, g) Source #

shrink :: (a, b, c, d, e, f, g) -> [(a, b, c, d, e, f, g)] Source #

( Arbitrary a, Arbitrary b, Arbitrary c, Arbitrary d, Arbitrary e, Arbitrary f, Arbitrary g, Arbitrary h) => Arbitrary (a, b, c, d, e, f, g, h)
Instance details

Defined in Test.QuickCheck.Arbitrary

Methods

arbitrary :: Gen (a, b, c, d, e, f, g, h) Source #

shrink :: (a, b, c, d, e, f, g, h) -> [(a, b, c, d, e, f, g, h)] Source #

( Arbitrary a, Arbitrary b, Arbitrary c, Arbitrary d, Arbitrary e, Arbitrary f, Arbitrary g, Arbitrary h, Arbitrary i) => Arbitrary (a, b, c, d, e, f, g, h, i)
Instance details

Defined in Test.QuickCheck.Arbitrary

Methods

arbitrary :: Gen (a, b, c, d, e, f, g, h, i) Source #

shrink :: (a, b, c, d, e, f, g, h, i) -> [(a, b, c, d, e, f, g, h, i)] Source #

( Arbitrary a, Arbitrary b, Arbitrary c, Arbitrary d, Arbitrary e, Arbitrary f, Arbitrary g, Arbitrary h, Arbitrary i, Arbitrary j) => Arbitrary (a, b, c, d, e, f, g, h, i, j)
Instance details

Defined in Test.QuickCheck.Arbitrary

Methods

arbitrary :: Gen (a, b, c, d, e, f, g, h, i, j) Source #

shrink :: (a, b, c, d, e, f, g, h, i, j) -> [(a, b, c, d, e, f, g, h, i, j)] Source #

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.