Hoogle Search
Within LTS Haskell 23.21 (ghc-9.8.4)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
quickCheck :: Testable prop => prop -> IO ()QuickCheck Test.QuickCheck Tests a property and prints the results to stdout. By default up to 100 tests are performed, which may not be enough to find all bugs. To run more tests, use withMaxSuccess. If you want to get the counterexample as a Haskell value, rather than just printing it, try the quickcheck-with-counterexamples package.
quickCheck :: NormalizationMode -> Text -> Maybe Booltext-icu Data.Text.ICU No documentation available.
quickCheck :: NormalizationMode -> Text -> Maybe Booltext-icu Data.Text.ICU.Normalize Perform an efficient check on a string, to quickly determine if the string is in a particular normalization form. A Nothing result indicates that a definite answer could not be determined quickly, and a more thorough check is required, e.g. with isNormalized. The user may have to convert the string to its normalized form and compare the results. A result of Just True or Just False indicates that the string definitely is, or is not, in the given normalization form.
quickCheck :: NormalizationMode -> Text -> Maybe Booltext-icu Data.Text.ICU.Normalize2 No documentation available.
quickCheck :: Testable prop => prop -> IO ()massiv-test Test.Massiv.Utils Tests a property and prints the results to stdout. By default up to 100 tests are performed, which may not be enough to find all bugs. To run more tests, use withMaxSuccess. If you want to get the counterexample as a Haskell value, rather than just printing it, try the quickcheck-with-counterexamples package.
quickcheck :: MonadGen m => Gen a -> m ahedgehog-quickcheck Hedgehog.Gen.QuickCheck Create a Hedgehog Gen from a QuickCheck Gen. By default the Gen created will not have any shrinking, you can use Gen.shrink if you have a shrink function which you would like to apply.
-
Automatic testing of Haskell programs QuickCheck is a library for random testing of program properties. The programmer provides a specification of the program, in the form of properties which functions should satisfy, and QuickCheck then tests that the properties hold in a large number of randomly generated cases. Specifications are expressed in Haskell, using combinators provided by QuickCheck. QuickCheck provides combinators to define properties, observe the distribution of test data, and define test data generators. Most of QuickCheck's functionality is exported by the main Test.QuickCheck module. The main exception is the monadic property testing library in Test.QuickCheck.Monadic. If you are new to QuickCheck, you can try looking at the following resources:
- The official QuickCheck manual. It's a bit out-of-date in some details and doesn't cover newer QuickCheck features, but is still full of good advice.
- https://begriffs.com/posts/2017-01-14-design-use-quickcheck.html, a detailed tutorial written by a user of QuickCheck.
-
The QuickCheck manual gives detailed information about using QuickCheck effectively. You can also try https://begriffs.com/posts/2017-01-14-design-use-quickcheck.html, a tutorial written by a user of QuickCheck. To start using QuickCheck, write down your property as a function returning Bool. For example, to check that reversing a list twice gives back the same list you can write:
import Test.QuickCheck prop_reverse :: [Int] -> Bool prop_reverse xs = reverse (reverse xs) == xs
You can then use QuickCheck to test prop_reverse on 100 random lists:>>> quickCheck prop_reverse +++ OK, passed 100 tests.
To run more tests you can use the withMaxSuccess combinator:>>> quickCheck (withMaxSuccess 10000 prop_reverse) +++ OK, passed 10000 tests.
To use QuickCheck on your own data types you will need to write Arbitrary instances for those types. See the QuickCheck manual for details about how to do that. -
No documentation available.
-
This module allows to use QuickCheck properties in tasty.
Page 1 of many | Next