Popularity
3.5
Growing
Activity
0.0
Stable
1
4
1
Monthly Downloads: 0
Programming language: Haskell
License: BSD 3-clause "New" or "Revised" License
Latest version: v0.0.1
quickcheck-combinators alternatives and similar packages
Based on the "quickcheck" category.
Alternatively, view quickcheck-combinators alternatives based on common mentions on social networks and blogs.
-
quickcheck-state-machine
Test monadic programs using state machine based models -
quickcheck-arbitrary-adt
Typeclass for generating a list of each instance of a sum type's constructors -
quickcheck-arbitrary-template
Arbitrary QuickCheck instance generation using template haskell -
quickcheck-instances
Instances for QuickCheck classes -
quickcheck-higherorder
QuickCheck extension for higher-order properties -
quickcheck-unicode
Unicode support for QuickCheck -
quickcheck-state-machine-distributed
Test monadic programs using state machine based models -
quickcheck-io
Use HUnit assertions as QuickCheck properties -
quickcheck-property-monad
A monad for building quickcheck properties -
quickcheck-with-counterexamples
Get counterexamples out of QuickCheck as Haskell values -
quickcheck-simple
Test properties and default-mains for QuickCheck -
quickcheck-report
Customizable reports for quickcheck properties -
tasty-quickcheck-laws
Tasty trees for your lawful class instances
Learn any GitHub repo in 59 seconds
Onboard AI learns any GitHub repo in minutes and lets you chat with it to locate functionality, understand different parts, and generate new code. Use it for free at www.getonboard.dev.
Promo
getonboard.dev
Do you think we are missing an alternative of quickcheck-combinators or a related project?
|
Collect and Analyze Billions of Data Points in Real Time
sponsored
www.influxdata.com
|
Popular Comparisons
-
quickcheck-state-machinevsspeculate
-
quickcheck-instancesvsmonad-mock
-
quickcheck-reportvsquickcheck-higherorder
-
quickcheck-arbitrary-adtvsquickcheck-instances
-
quickcheck-state-machinevsgenvalidity
|
SaaSHub - Software Alternatives and Reviews
sponsored
www.saashub.com
|
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)
-- ...