quickcheck
quickcheck copied to clipboard
nick8325
Automatic testing of Haskell programs.
I was able to implement an arbitrary monotonic function like this: ```hs -- | A modifier to generate monotonic functions newtype Monotonic a b = Monotonic (a -> b) instance...
I occasionally run into cases where I want to use [`Down`](https://hackage.haskell.org/package/base-4.17.0.0/docs/Data-Ord.html#t:Down) in a data type, use some generic derivation for `Arbitrary`, and end up needing to write the orphan instances...
These warnings should be addressed at some point: ``` src/Test/QuickCheck/Property.hs:220:3: warning: [-Wnoncanonical-monad-instances] Noncanonical ‘pure = return’ definition detected in the instance declaration for ‘Applicative Rose’. Move definition from ‘return’ to...
I keep getting warnings for incomplete patterns
I need to produce a variant of generate which requires access to `Test.QuickCheck.Random` but it doesn't have any Haddocks — can we get the Haddocks for this and the other...
I have a small sum type that currently uses `genericShrink`: ``` data SmallSum = A | B | C | D deriving (Eq, Ord, Read, Show, Generic, Enum, Bounded) instance...
I'm in a situation where test data is generated with `Arbitrary` and `generate` and is very useful, but not unique enough. Part of this is due to shrinking I believe,...
I just opened a PR for this feature on hedgehog: https://github.com/hedgehogqa/haskell-hedgehog/pull/454 I don't know if it's going to be accepted. But I bring it up here because QuickCheck may also...
Contrary to expectation, lowering the `maxSuccess` parameter may cause tests to fail: ``` > let p k k' = k /= k' ==> (k :: Int) /= k' > quickCheckWithResult...
QuickCheck-2.14.1 ``` GHCi, version 8.4.3: -- also tested version 8.6.5 Loaded GHCi configuration from ... λ> import Test.QuickCheck λ> quickCheck $ True && True +++ OK, passed 1 test. λ>...
