quickcheck-combinators: Simple type-level combinators for augmenting QuickCheck instances.
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)
-- ...
Downloads
- quickcheck-combinators-0.0.4.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.0.0, 0.0.1, 0.0.2, 0.0.3, 0.0.4, 0.0.5, 0.0.6 |
|---|---|
| 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> |
| Uploaded | by athanclark at 2018-06-09T04:40:40Z |
| Category | Testing |
| Source repo | head: git clone git@github.com:athanclark/quickcheck-combinators.git |
| Distributions | Stackage:0.0.6 |
| Reverse Dependencies | 1 direct, 1 indirect [details] |
| Downloads | 3748 total (21 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2018-06-09 [all 1 reports] |