Modulequickcheck-transformer-0.3.1.3Haskell2010

Test.QuickCheck.GenT

Most of the code is borrowed from a mailing list discussion. Therefor, credits go to Paul Johnson and Felix Martini.

1 type
1 class
14 values

Packagequickcheck-transformer-0.3.1.3
Exports16
LanguageHaskell2010
LicenceMIT
SourceGenT.hs

newtypenewtype GenT (m :: Type -> Type) a

Constructors

GenT
- unGenT :: QCGen -> Int -> m a

Instances7MonadTrans, Monad, Functor, MonadFail, Applicative, MonadIO, …

MonadTrans GenTDefined in quickcheck-transformer-0.3.1.3 · Test.QuickCheck.GenT.Private
Monad m => Monad (GenT m)Defined in quickcheck-transformer-0.3.1.3 · Test.QuickCheck.GenT.Private
Functor m => Functor (GenT m)Defined in quickcheck-transformer-0.3.1.3 · Test.QuickCheck.GenT.Private
MonadFail m => MonadFail (GenT m)Defined in quickcheck-transformer-0.3.1.3 · Test.QuickCheck.GenT.Private
(Functor m, Monad m) => Applicative (GenT m)Defined in quickcheck-transformer-0.3.1.3 · Test.QuickCheck.GenT.Private
MonadIO m => MonadIO (GenT m)Defined in quickcheck-transformer-0.3.1.3 · Test.QuickCheck.GenT.Private
(Applicative m, Monad m) => MonadGen (GenT m)Defined in quickcheck-transformer-0.3.1.3 · Test.QuickCheck.GenT

valuerunGenT :: GenT m a -> Gen (m a)

classclass (Applicative g, Monad g) => MonadGen (g :: Type -> Type) where

Methods

liftGen :: Gen a -> g a
variant :: Integral n => n -> g a -> g a
sized :: (Int -> g a) -> g a
resize :: Int -> g a -> g a
choose :: Random a => (a, a) -> g a

Instances2MonadGen

MonadGen GenDefined in quickcheck-transformer-0.3.1.3 · Test.QuickCheck.GenT
(Applicative m, Monad m) => MonadGen (GenT m)Defined in quickcheck-transformer-0.3.1.3 · Test.QuickCheck.GenT

valuevar :: Integral n => n -> QCGen -> QCGen

Private variant-generating function. Converts an integer into a chain of (fst . split) and (snd . split) applications. Every integer (including negative ones) will give rise to a different random number generator in log2 n steps.

valuesuchThat :: MonadGen m => m a -> (a -> Bool) -> m a

Generates a value that satisfies a predicate.

valuesuchThatMaybe :: MonadGen m => m a -> (a -> Bool) -> m (Maybe a)

Tries to generate a value that satisfies a predicate.

valuelistOf :: MonadGen m => m a -> m [a]

Generates a list of random length. The maximum length depends on the size parameter.

valuelistOf1 :: MonadGen m => m a -> m [a]

Generates a non-empty list of random length. The maximum length depends on the size parameter.

valuevectorOf :: MonadGen m => Int -> m a -> m [a]

Generates a list of the given length.

valueoneof :: MonadGen m => [m a] -> m a

Randomly uses one of the given generators. The input list must be non-empty.

valuefrequency :: MonadGen m => [(Int, m a)] -> m a

Chooses one of the given generators, with a weighted random distribution. The input list must be non-empty.

valueelements :: MonadGen m => [a] -> m a

Generates one of the given values. The input list must be non-empty.

valuegrowingElements :: MonadGen m => [a] -> m a

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.

valueoneofMay :: MonadGen m => [m a] -> m (Maybe a)

Randomly uses one of the given generators.

valueelementsMay :: MonadGen m => [a] -> m (Maybe a)

Generates one of the given values.

valuegrowingElementsMay :: MonadGen m => [a] -> m (Maybe a)

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.