quickcheck-combinators

Simple type-level combinators for augmenting QuickCheck instances.

LTS Haskell 9.5:0.0.2
Stackage Nightly 2017-09-20:0.0.2
Latest on Hackage:0.0.2
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)
    -- ...

Changes

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.
Used by 1 package:
comments powered byDisqus