quickcheck-combinators

Simple type-level combinators for augmenting QuickCheck instances.

Version on this page:	0.0.1
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.1@sha256:b848d578bf866e84b38a4373eaa65ff76e65818f51cde2a11662e5a3d6de49d8,1474

Module documentation for 0.0.1

Test
- Test.QuickCheck
  - Test.QuickCheck.Combinators

Depends on 3 packages(full list with versions):

base, QuickCheck, unfoldable-restricted

Used by 1 package in nightly-2016-10-06(full list with versions):

ltext

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.