@hackage / quickcheck-combinators

Simple type-level combinators for augmenting QuickCheck instances.

Latest0.0.6

About

Metadata

  • Last updated , by athanclark
  • License BSD-3-Clause
  • Categories Testing
  • Maintained by: athan.clark@gmail.com

  • Lottery factor: 0

Links

Installation

Readme

quickcheck-combinators

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)
    -- ...