Simple type-level combinators for augmenting QuickCheck instances.

Version on this page:0.0.2
LTS Haskell 11.22:0.0.4
Stackage Nightly 2018-03-12:0.0.2
Latest on Hackage:0.0.4

See all snapshots quickcheck-combinators appears in

BSD3 licensed and maintained by Athan Clark

Module documentation for 0.0.2

Simply wrap the type you want to generate (assuming it satisfies all the necessary constraints) to refine the terms generated:

{-# LANGUAGE DataKinds #-}

import Data.Set (Set)
import Test.QuickCheck
import Test.QuickCheck.Instances
import GHC.TypeLits

instance Arbitrary LinearEquation where
  arbitrary = do
    vars <- arbitrary :: Gen (AtLeast 3 Set String)
    -- ...


Revision history for dnf

0.0.0 – 2016-04-08

  • First version. Released on an unsuspecting world.

0.0.1 – 2016-06-18

  • Added changelog (which you are now reading).
  • Added instances of AtLeast, AtMost, and Between for OrderedList.
  • Removed some redundant constraints.
Depends on 3 packages:
Used by 1 package:
comments powered byDisqus