generic-random
Generic random generators http://github.com/lysxia/generic-random
| Version on this page: | 1.2.0.0@rev:1 |
| LTS Haskell 14.16: | 1.2.0.0@rev:1 |
| Stackage Nightly 2019-12-08: | 1.3.0.0 |
| Latest on Hackage: | 1.3.0.0 |
Maintained by lysxia@gmail.com
Module documentation for 1.2.0.0
This version can be pinned in stack with:
generic-random-1.2.0.0@sha256:c4faea0197ac73f2850e07d0023e43500152b613d0d9e60d5202fb9303e910b4,1521- Generic
- Generic.Random
- Generic.Random.Internal
- Generic.Random.Tutorial
- Generic.Random
Generic random generators 
Derive simple random generators for QuickCheck using generics.
Automating the Arbitrary boilerplate also ensures that if a type changes to
have more constructors, then the generator fixes itself to generate that new
case (with uniform distribution) or causes a compilation error (with an
explicit distribution).
A simple (optional) strategy to ensure termination for recursive types:
make Test.QuickCheck.Gen’s size parameter decrease at every recursive call;
when it reaches zero, sample directly from a trivially terminating generator
given explicitly (genericArbitraryRec and withBaseCase) or implicitly
(genericArbitrary').
Example
{-# LANGUAGE DeriveGeneric #-}
import GHC.Generics (Generic)
import Test.QuickCheck
import Generic.Random
data Tree a = Leaf | Node (Tree a) a (Tree a)
deriving (Show, Generic)
instance Arbitrary a => Arbitrary (Tree a) where
arbitrary = genericArbitraryRec uniform `withBaseCase` return Leaf
-- Equivalent to
-- > arbitrary =
-- > sized $ \n ->
-- > if n == 0 then
-- > return Leaf
-- > else
-- > oneof
-- > [ return Leaf
-- > , resize (n `div` 3) $
-- > Node <$> arbitrary <*> arbitrary <*> arbitrary
-- > ]
main = sample (arbitrary :: Gen (Tree ()))
Changes
Depends on 2 packages(full list with versions):
comments powered byDisqus