Simple type-level combinators for augmenting QuickCheck instances.

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

See all snapshots quickcheck-combinators appears in

BSD-3-Clause licensed and maintained by Athan Clark
This version can be pinned in stack with:quickcheck-combinators-0.0.4@sha256:234d8136a4461d8098ecaf9dbbe8a41b0280f8d831f65f3df41e82f856b19fb8,1474

Module documentation for 0.0.4

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.