quickcheck-combinators: Simple type-level combinators for augmenting QuickCheck instances.

[ bsd3, library, testing ] [ Propose Tags ]

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)
    -- ...
Versions 0.0.0, 0.0.1, 0.0.2
Change log ChangeLog.md
Dependencies base (>=4.8 && <5), QuickCheck, unfoldable-restricted (>=0.0.1) [details]
License BSD-3-Clause
Author Athan Clark <athan.clark@gmail.com>
Maintainer Athan Clark <athan.clark@gmail.com>
Category Testing
Source repo head: git clone git@github.com:athanclark/quickcheck-combinators.git
Uploaded by athanclark at Fri Apr 14 05:29:24 UTC 2017
Distributions LTSHaskell:0.0.2, NixOS:0.0.2, openSUSE:0.0.2
Downloads 625 total (13 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI




Maintainer's Corner

For package maintainers and hackage trustees