git.iko.soy/typeable/generic-arbitrary
on master help sign in
24 files changed+573−74
since splitsnapshots
unifiedsplit
.github/workflows/haskell-ci.yml+29 .gitignore+1 CHANGELOG.md+16 README.md+114−12 generic-arbitrary.cabal+26−19 ghc-8.10.7.yaml+1 ghc-8.10.7.yaml.lock+12 ghc-8.6.5.yaml+1 ghc-8.6.5.yaml.lock+12 ghc-9.0.2.yaml+1 ghc-9.0.2.yaml.lock+12 ghc-9.2.4.yaml+1 ghc-9.2.4.yaml.lock+12 ghc-9.4.3.yaml+1 ghc-9.4.3.yaml.lock+12 ghc-9.8.1.yaml+1 ghc-9.8.1.yaml.lock+12 src/Test/QuickCheck/Arbitrary/Generic.hs+156−11 test/Auxiliary.hs+10 test/EnumTest.hs+24 test/LimitationDemo.hs+37 test/NoTypecheckTest.hs+5−7 test/ParametersTest.hs+34 test/RecursiveTest.hs+43−25
.github/workflows/haskell-ci.ymlnew file+29
@@ -0,0 +1,29 @@
1+name: Haskell-CI
2+on: [push, pull_request]
3+jobs:
4+ linux:
5+ name: GHC-${{ matrix.ghc-version }}
6+ runs-on: ubuntu-latest
7+ strategy:
8+ matrix:
9+ ghc-version:
10+ - 8.6.5
11+ - 8.10.7
12+ - 9.0.2
13+ - 9.2.4
14+ - 9.4.3
15+ - 9.8.1
16+ steps:
17+ - uses: actions/checkout@v3
18+ - uses: haskell/actions/setup@v2
19+ with:
20+ enable-stack: true
21+ ghc-version: ${{ matrix.ghc-version }}
22+ stack-version: 'latest'
23+ - uses: actions/cache@v3
24+ with:
25+ path: |
26+ ~/.stack
27+ ./.stack-work
28+ key: ${{ matrix.ghc-version }}
29+ - run: stack --stack-yaml ghc-${{ matrix.ghc-version }}.yaml --install-ghc test --fast --haddock
.gitignore+1
@@ -4,3 +4,4 @@ dist
44.cabal-sandbox/
55cabal.sandbox.config
66dist-newstyle
7+TAGS
CHANGELOG.md+16
@@ -1,3 +1,19 @@
1+1.0.1.2
2+-------
3+
4+* Fix dependency bounds (including retroactively), and compilation with warnings.
5+
6+1.0.1.1
7+-------
8+
9+* Fix compilation with GHC 9.8.3
10+
11+1.0.1
12+-----
13+
14+* Compillability by GHC-9.2.4
15+* Fix cabal `tested-with` field
16+
1171.0.0
218-----
319
README.md+114−12
@@ -1,14 +1,31 @@
11# generic-arbitrary
22
3−[![Build Status](https://travis-ci.org/typeable/generic-arbitrary.svg?branch=master)](https://travis-ci.org/typeable/generic-arbitrary)
3+[![Haskell-CI](https://github.com/typeable/generic-arbitrary/actions/workflows/haskell-ci.yml/badge.svg)](https://github.com/typeable/generic-arbitrary/actions/workflows/haskell-ci.yml)
44
5−Deriving `Arbitrary` via `Generic`.
5+# What?
6+
7+Package for deriving `Arbitrary` via `Generic`.
68
79``` haskell
810import GHC.Generics (Generic)
911import Test.QuickCheck
1012import Test.QuickCheck.Arbitrary.Generic
1113
14+data Expr
15+ = Lit Int
16+ | Add Expr Expr
17+ | Mul Expr Expr
18+ deriving (Eq, Show, Generic)
19+ deriving Arbitrary via (GenericArbitrary Expr)
20+```
21+
22+Older versions of this package had a problem with hanging `arbitrary`
23+method. Since `1.0.0` this problem almost solved.
24+
25+For `QuickCheck` older than `2.14.0` the `GenericArbitrary` is not available, so
26+you will need to write instances more verbosely
27+
28+``` haskell
1229data Expr
1330 = Lit Int
1431 | Add Expr Expr
@@ -20,19 +37,104 @@ instance Arbitrary Expr where
2037 shrink = genericShrink
2138```
2239
23−if type has an argument then `Arg` is required
40+Which is generally the same.
41+
42+# Infinite terms problem
43+
44+The `generic-arbitrary` can partially handle the problem with recursive
45+types. Assume the type `R`
46+
47+``` haskell
48+data R = R R
49+ deriving Generic
50+```
51+
52+there is no instance
2453
2554``` haskell
26−data Expr lit
27− = Lit lit
28− | Add Expr Expr
29− | Mul Expr Expr
30− deriving (Eq, Show, Generic)
55+instance Arbitrary R where
56+ arbitrary = genericArbitrary
57+ shrink = genericShrink
58+```
59+
60+If you try to compile this you will get a type level error
61+
62+> • R refers to itself in all constructors
63+
64+Which means that there is no finite term for `R` because it is recursive in all
65+it's constructors. But, if you correct the definition of `R` like this.
3166
32−instance
33− ( Arbitrary lit
34− , Arg (Expr lit) lit
35− ) => Arbitrary (Expr lit) where
67+``` haskell
68+data R = R R | F
69+ deriving Generic
70+```
71+
72+Then it will compile. And the `arbitrary` generated will not hang forever,
73+because it respects the `size` parameter.
74+
75+## Limitation
76+
77+There is a limitation of recursion detection:
78+
79+``` haskell
80+data R1 = R1 R2
81+ deriving (Eq, Ord, Show, Generic)
82+ deriving anyclass NFData
83+ deriving Arbitrary via (GenericArbitrary R1)
84+
85+data R2 = R2 R1
86+ deriving (Eq, Ord, Show, Generic)
87+ deriving anyclass NFData
88+ deriving Arbitrary via (GenericArbitrary R2)
89+```
90+
91+This code will compile and the `arbitrary` generated will always hang. Yes,
92+there is a problem with mutually recursive types.
93+
94+# Type parameters
95+
96+Now let's see an example of datatype with parameters
97+
98+``` haskell
99+data A a = A a
100+ deriving (Eq, Ord, Show)
101+ deriving anyclass NFData
102+ deriving (Generic)
103+
104+instance (Arbitrary a) => Arbitrary (A a) where
36105 arbitrary = genericArbitrary
37106 shrink = genericShrink
38107```
108+
109+It should work from first glance, but when compile it will throw an error:
110+
111+```
112+• Could not deduce (Test.QuickCheck.Arbitrary.Generic.GArbitrary
113+ (A a)
114+ (GHC.Generics.D1
115+ ('GHC.Generics.MetaData "A" "ParametersTest" "main" 'False)
116+ (GHC.Generics.C1
117+ ('GHC.Generics.MetaCons "A" 'GHC.Generics.PrefixI 'False)
118+ (GHC.Generics.S1
119+ ('GHC.Generics.MetaSel
120+ 'Nothing
121+ 'GHC.Generics.NoSourceUnpackedness
122+ 'GHC.Generics.NoSourceStrictness
123+ 'GHC.Generics.DecidedLazy)
124+ (GHC.Generics.Rec0 a))))
125+ (TypesDiffer (A a) a))
126+ arising from a use of ‘genericArbitrary’
127+```
128+
129+Here the `TypesDiffer` is a type familty dealing with recursive types and
130+helping us to eliminate inproper instances. To convince the compiller, that the
131+`a` parameter is not an `A a` we must fix the instance with additional
132+constraint `Arg (A a) a`
133+
134+``` haskell
135+instance (Arg (A a) a, Arbitrary a) => Arbitrary (A a) where
136+ arbitrary = genericArbitrary
137+ shrink = genericShrink
138+```
139+
140+Now everything compiles and works as expected.
generic-arbitrary.cabal+26−19
@@ -1,10 +1,10 @@
11name: generic-arbitrary
2−version: 1.0.0
2+version: 1.0.1.2
33synopsis: Generic implementation for QuickCheck's Arbitrary
44description:
55 Generic implementations of methods of the 'Arbitrary' class from the
66 QuickCheck library. The approach taken here can lead to diverging instances
7− for recursive types but is safe for non-recursive ones and guarantees
7+ for mutually recursive types but is safe for simply recursive ones and guarantees
88 flat distribution for constructors of sum-types.
99
1010license: MIT
@@ -15,14 +15,14 @@ homepage: http://github.com/typeable/generic-arbitrary#readme
1515category: Generic
1616build-type: Simple
1717extra-source-files: CHANGELOG.md
18−cabal-version: 1.22
19−tested-with: GHC == 7.10.3
20− , GHC == 8.0.2
21− , GHC == 8.2.2
22− , GHC == 8.4.1
23− , GHC == 8.6.5
24− , GHC == 8.10.1
25− , GHC == 9.0.2
18+ , README.md
19+cabal-version: 2.0
20+tested-with: GHC == 8.6.5
21+ , GHC == 8.10.7
22+ , GHC == 9.0.2
23+ , GHC == 9.2.4
24+ , GHC == 9.4.3
25+ , GHC == 9.8.1
2626
2727source-repository head
2828 type: git
@@ -31,7 +31,7 @@ source-repository head
3131library
3232 exposed-modules: Test.QuickCheck.Arbitrary.Generic
3333 build-depends: base >=4.8 && <5
34− , QuickCheck >= 2.14
34+ , QuickCheck >=2.8
3535 hs-source-dirs: src
3636 default-language: Haskell2010
3737 default-extensions: AllowAmbiguousTypes
@@ -59,20 +59,27 @@ test-suite test
5959 hs-source-dirs: test
6060 main-is: Test.hs
6161 default-language: Haskell2010
62− build-depends: base >= 4.8 && <5
63− , QuickCheck
62+ build-depends: base >=4.12 && <5
63+ , QuickCheck >=2.10
6464 , deepseq
6565 , generic-arbitrary
66− , tasty
67− , tasty-discover
68− , tasty-hunit
66+ , tasty >=1.4.2 || <1.4.0.1
67+ , tasty-discover >= 2.0.0
68+ , tasty-hunit >= 0.9.2
6969 , tasty-quickcheck
70− other-modules: NoTypecheckTest
70+ other-modules: Auxiliary
71+ , EnumTest
72+ , LimitationDemo
73+ , NoTypecheckTest
74+ , ParametersTest
7175 , RecursiveTest
7276 default-extensions: AllowAmbiguousTypes
7377 , CPP
7478 , DataKinds
79+ , DeriveAnyClass
7580 , DeriveGeneric
81+ , DerivingStrategies
82+ , DerivingVia
7683 , FlexibleContexts
7784 , FlexibleInstances
7885 , GeneralizedNewtypeDeriving
@@ -81,14 +88,14 @@ test-suite test
8188 , PolyKinds
8289 , RankNTypes
8390 , ScopedTypeVariables
91+ , TypeApplications
8492 , TypeFamilies
8593 , TypeOperators
8694 , TypeSynonymInstances
8795 , UndecidableInstances
8896 , ViewPatterns
89− build-tools: tasty-discover
97+ build-tool-depends: tasty-discover:tasty-discover
9098 ghc-options: -Wall
9199 -threaded
92100 -rtsopts
93101 "-with-rtsopts=-N -A64m -qb0 -n4m -T -I1"
94− default-extensions: DeriveGeneric
ghc-8.10.7.yamlnew file+1
@@ -0,0 +1 @@
1+resolver: lts-18.18
ghc-8.10.7.yaml.locknew file+12
@@ -0,0 +1,12 @@
1+# This file was autogenerated by Stack.
2+# You should not edit this file by hand.
3+# For more information, please see the documentation at:
4+# https://docs.haskellstack.org/en/stable/lock_files
5+
6+packages: []
7+snapshots:
8+- completed:
9+ sha256: 63539429076b7ebbab6daa7656cfb079393bf644971156dc349d7c0453694ac2
10+ size: 586296
11+ url: https://raw.githubusercontent.com/commercialhaskell/stackage-snapshots/master/lts/18/18.yaml
12+ original: lts-18.18
ghc-8.6.5.yamlnew file+1
@@ -0,0 +1 @@
1+resolver: lts-13.21
ghc-8.6.5.yaml.locknew file+12
@@ -0,0 +1,12 @@
1+# This file was autogenerated by Stack.
2+# You should not edit this file by hand.
3+# For more information, please see the documentation at:
4+# https://docs.haskellstack.org/en/stable/lock_files
5+
6+packages: []
7+snapshots:
8+- completed:
9+ sha256: eff2de19a6d4691ccbf6edc1fba858f1918683047dce0f09adede874bbd2a8f3
10+ size: 498180
11+ url: https://raw.githubusercontent.com/commercialhaskell/stackage-snapshots/master/lts/13/21.yaml
12+ original: lts-13.21
ghc-9.0.2.yamlnew file+1
@@ -0,0 +1 @@
1+resolver: lts-19.20
ghc-9.0.2.yaml.locknew file+12
@@ -0,0 +1,12 @@
1+# This file was autogenerated by Stack.
2+# You should not edit this file by hand.
3+# For more information, please see the documentation at:
4+# https://docs.haskellstack.org/en/stable/lock_files
5+
6+packages: []
7+snapshots:
8+- completed:
9+ sha256: be747117bed6d462806c883352c3206325b23480825103f5c87884e97e52819a
10+ size: 619173
11+ url: https://raw.githubusercontent.com/commercialhaskell/stackage-snapshots/master/lts/19/20.yaml
12+ original: lts-19.20
ghc-9.2.4.yamlnew file+1
@@ -0,0 +1 @@
1+resolver: nightly-2022-08-24
ghc-9.2.4.yaml.locknew file+12
@@ -0,0 +1,12 @@
1+# This file was autogenerated by Stack.
2+# You should not edit this file by hand.
3+# For more information, please see the documentation at:
4+# https://docs.haskellstack.org/en/stable/lock_files
5+
6+packages: []
7+snapshots:
8+- completed:
9+ sha256: ff431937a638ebfaa5e6fec13c7ae575f01e02744d6ca5e5b1554f78cb5f88ad
10+ size: 631953
11+ url: https://raw.githubusercontent.com/commercialhaskell/stackage-snapshots/master/nightly/2022/8/24.yaml
12+ original: nightly-2022-08-24
ghc-9.4.3.yamlnew file+1
@@ -0,0 +1 @@
1+resolver: nightly-2022-12-26
ghc-9.4.3.yaml.locknew file+12
@@ -0,0 +1,12 @@
1+# This file was autogenerated by Stack.
2+# You should not edit this file by hand.
3+# For more information, please see the documentation at:
4+# https://docs.haskellstack.org/en/stable/lock_files
5+
6+packages: []
7+snapshots:
8+- completed:
9+ sha256: bbe432b2abd6d866aa37f65a8129a5f858b7c6eaae9464f8bc2814ce92ac2d15
10+ size: 573163
11+ url: https://raw.githubusercontent.com/commercialhaskell/stackage-snapshots/master/nightly/2022/12/26.yaml
12+ original: nightly-2022-12-26
ghc-9.8.1.yamlnew file+1
@@ -0,0 +1 @@
1+resolver: nightly-2024-01-12
ghc-9.8.1.yaml.locknew file+12
@@ -0,0 +1,12 @@
1+# This file was autogenerated by Stack.
2+# You should not edit this file by hand.
3+# For more information, please see the documentation at:
4+# https://docs.haskellstack.org/en/stable/lock_files
5+
6+packages: []
7+snapshots:
8+- completed:
9+ sha256: 8f06e87750f95bc8620644ea22344ad023c3c5aa6efa854747aa70093898fd79
10+ size: 556465
11+ url: https://raw.githubusercontent.com/commercialhaskell/stackage-snapshots/master/nightly/2024/1/12.yaml
12+ original: nightly-2024-01-12
src/Test/QuickCheck/Arbitrary/Generic.hs+156−11
@@ -1,8 +1,14 @@
1−{-# LANGUAGE FlexibleContexts, UndecidableInstances, TypeOperators, DataKinds, TypeFamilies, ScopedTypeVariables#-}
1+#if __GLASGOW_HASKELL__ >= 806
2+{-# OPTIONS_GHC -Wno-star-is-type #-}
3+#endif
4+#if __GLASGOW_HASKELL__ >= 800
5+{-# OPTIONS_GHC -Wno-unticked-promoted-constructors #-}
6+#endif
27
3−{- |
8+{-|
49
5−Generic implementation of the 'arbitrary' method. Example usage:
10+This module is a generic implementation of the 'arbitrary' method. Example
11+usage:
612
713@
814data Foo = Foo
@@ -27,45 +33,184 @@ data Foo = Foo
2733
2834The generated 'arbitrary' method is equivalent to
2935
30−@Foo <$> arbitrary <*> arbitrary@.
36+@
37+Foo '<$>' arbitrary '<*>' arbitrary
38+@.
39+
40+It can also handle a recursive types problem. Assuming a type
41+
42+@
43+data R = R R
44+ deriving Generic
45+@
46+
47+there is no instance
48+
49+@
50+instance Arbitrary R where
51+ arbitrary = genericArbitrary
52+ shrink = genericShrink
53+@
54+
55+If you try to compile this you will get a type level error
56+
57+> • R refers to itself in all constructors
58+
59+Which means that there is no finite term for @R@ because it is recursive. But,
60+if you correct the definition of @R@ like this.
61+
62+@
63+data R = R R | F
64+ deriving Generic
65+@
66+
67+Then it will compile. And the @arbitrary@ generated will not hang forever, because
68+it respects the @size@ parameter.
69+
70+There is a limitation of recursion detection:
71+
72+@
73+data R1 = R1 R2
74+ deriving (Eq, Ord, Show, Generic)
75+ deriving anyclass NFData
76+ deriving Arbitrary via (GenericArbitrary R1)
77+
78+data R2 = R2 R1
79+ deriving (Eq, Ord, Show, Generic)
80+ deriving anyclass NFData
81+ deriving Arbitrary via (GenericArbitrary R2)
82+@
83+
84+This code will compile and the @arbitrary@ generated will always hang. Yes,
85+there is a problem with mutually recursive types.
86+
87+Now lets see an example of datatype with parameters
88+
89+@
90+data A a = A a
91+ deriving (Eq, Ord, Show)
92+ deriving anyclass NFData
93+ deriving (Generic)
94+
95+instance (Arbitrary a) => Arbitrary (A a) where
96+ arbitrary = genericArbitrary
97+ shrink = genericShrink
98+@
99+
100+It should work from first glance, but when compile it will throw an error:
101+
102+@
103+ • Could not deduce (Test.QuickCheck.Arbitrary.Generic.GArbitrary
104+ (A a)
105+ (GHC.Generics.D1
106+ ('GHC.Generics.MetaData "A" "ParametersTest" "main" 'False)
107+ (GHC.Generics.C1
108+ ('GHC.Generics.MetaCons "A" 'GHC.Generics.PrefixI 'False)
109+ (GHC.Generics.S1
110+ ('GHC.Generics.MetaSel
111+ 'Nothing
112+ 'GHC.Generics.NoSourceUnpackedness
113+ 'GHC.Generics.NoSourceStrictness
114+ 'GHC.Generics.DecidedLazy)
115+ (GHC.Generics.Rec0 a))))
116+ (TypesDiffer (A a) a))
117+ arising from a use of ‘genericArbitrary’
118+@
119+
120+Here the @TypesDiffer@ is a type familty dealing with recursive types and
121+helping us to eliminate inproper instances. To convince the compiller, that the
122+@a@ parameter is not an @A a@ we must fix the instance with additional constraint
123+
124+@
125+instance (Arg (A a) a, Arbitrary a) => Arbitrary (A a) where
126+ arbitrary = genericArbitrary
127+ shrink = genericShrink
128+@
129+
130+Now everything compiles and works as expected.
31131
32132-}
33133
34134module Test.QuickCheck.Arbitrary.Generic
35− ( GenericArbitrary(..)
36− , Arbitrary(..)
135+ ( -- * Main
136+ genericArbitrary
137+#if MIN_VERSION_QuickCheck(2, 14, 0)
138+ , GenericArbitrary(..)
139+#endif
37140 , Arg
38− , genericArbitrary
141+ -- * Internal
142+ , GArbitrary
143+ , FiniteSum
144+ , FiniteSumElem
145+ , Finite
146+ , AllFieldsFinal
147+ , TypesDiffer
148+ , ArgumentsCount
149+ , SumLen
150+ -- * Reexports
151+ , Arbitrary(..)
39152 , genericShrink
40153 ) where
41154
42155import Control.Applicative
43−import Data.Coerce (coerce)
44156import Data.Proxy
45157import Data.Type.Bool
46158import GHC.Generics as G
47159import GHC.TypeLits
160+import Prelude
48161import Test.QuickCheck as QC
162+#if MIN_VERSION_QuickCheck(2, 14, 0)
163+import Data.Coerce (coerce)
49164import Test.QuickCheck.Arbitrary (GSubterms, RecursivelyShrink)
50165
166+
167+
168+-- | Newtype for @DerivingVia@
169+--
170+-- Usage:
171+--
172+-- @
173+-- data Foo = Foo
174+-- { _fooX :: X
175+-- , _fooY :: Y
176+-- } deriving (Generic)
177+-- deriving (Arbitrary) via GenericArbitrary Foo
178+-- @
179+--
180+-- @since 1.0.0
51181newtype GenericArbitrary a = GenericArbitrary { unGenericArbitrary :: a }
52182 deriving (Show, Eq)
53183
54184instance
55185 ( Generic a,
56− GArbitrary a (Rep a) 'True,
186+ GArbitrary a (Rep a) some,
57187 RecursivelyShrink (Rep a),
58188 GSubterms (Rep a) a
59189 ) => Arbitrary (GenericArbitrary a) where
60190 arbitrary = coerce (genericArbitrary :: Gen a)
61191 shrink = coerce (genericShrink :: a -> [a])
192+#endif
193+
194+-- | Constraint helper for types with parameters
195+--
196+-- Usage:
197+--
198+-- @
199+-- data A a = A a
200+-- deriving (Generic)
201+-- instance (Arg (A a) a, Arbitrary a) => Arbitrary (A a) where
202+-- arbitrary = genericArbitrary
203+-- shrink = genericShrink
204+-- @
205+--
206+-- @since 1.0.0
207+
208+type Arg self field = (TypesDiffer self field ~ 'True)
62209
63210type family TypesDiffer a b where
64211 TypesDiffer a a = 'False
65212 TypesDiffer a b = 'True
66213
67−type Arg self field = (TypesDiffer self field ~ 'True)
68−
69214type family AllFieldsFinal self (a :: * -> *) :: Bool where
70215 AllFieldsFinal self U1 = 'True
71216 AllFieldsFinal self (a :*: b) = AllFieldsFinal self a && AllFieldsFinal self b
test/Auxiliary.hsnew file+10
@@ -0,0 +1,10 @@
1+module Auxiliary where
2+
3+import Control.Exception
4+import Test.QuickCheck
5+
6+failGeneration :: forall a. (Arbitrary a, Show a) => IO ()
7+failGeneration = do
8+ try (generate (arbitrary :: Gen a) >>= print) >>= \case
9+ Left (_ :: SomeException) -> pure ()
10+ Right _ -> error "Error expected"
test/EnumTest.hsnew file+24
@@ -0,0 +1,24 @@
1+#if __GLASGOW_HASKELL__ >= 806 && __GLASGOW_HASKELL__ <= 900
2+{-# OPTIONS_GHC -fconstraint-solver-iterations=5 #-}
3+#elif __GLASGOW_HASKELL__ >= 902
4+{-# OPTIONS_GHC -fconstraint-solver-iterations=6 #-}
5+#endif
6+
7+
8+
9+module EnumTest where
10+
11+import Control.DeepSeq
12+import GHC.Generics
13+import Test.QuickCheck
14+import Test.QuickCheck.Arbitrary.Generic
15+
16+data Country = PL | GB | RU | RO | CZ | HR | SK | DE | NL | ES | BR
17+ deriving (Generic, NFData, Show)
18+
19+instance Arbitrary Country where
20+ arbitrary = genericArbitrary
21+ shrink = genericShrink
22+
23+prop_CountryTest :: Country -> Property
24+prop_CountryTest = total
test/LimitationDemo.hsnew file+37
@@ -0,0 +1,37 @@
1+module LimitationDemo where
2+
3+import Control.DeepSeq
4+import GHC.Generics (Generic)
5+import Test.QuickCheck
6+import Test.QuickCheck.Arbitrary.Generic
7+
8+-- As you can see, we have this instance generated, but it will definitely lead
9+-- to generating an infinite term (and the only term). The recursion detection
10+-- doesn't work here
11+data R1 = R1 R2
12+ deriving (Eq, Ord, Show, Generic)
13+ deriving anyclass NFData
14+#if MIN_VERSION_QuickCheck(2, 14, 0)
15+ deriving Arbitrary via (GenericArbitrary R1)
16+#else
17+instance Arbitrary R1 where
18+ arbitrary = genericArbitrary
19+ shrink = genericShrink
20+#endif
21+
22+data R2 = R2 R1
23+ deriving (Eq, Ord, Show, Generic)
24+ deriving anyclass NFData
25+#if MIN_VERSION_QuickCheck(2, 14, 0)
26+ deriving Arbitrary via (GenericArbitrary R2)
27+#else
28+instance Arbitrary R2 where
29+ arbitrary = genericArbitrary
30+ shrink = genericShrink
31+#endif
32+
33+-- To force the instance realy be generated
34+usage :: IO ()
35+usage = do
36+ r1 :: R1 <- generate arbitrary
37+ print r1 -- haha
test/NoTypecheckTest.hs+5−7
@@ -1,25 +1,23 @@
11{-# OPTIONS_GHC -fdefer-type-errors #-}
2+{-# OPTIONS_GHC -Wno-deferred-type-errors #-}
23
34-- | Test that infinite types has no Arbitrary instance
45
56module NoTypecheckTest where
67
7−import Control.Exception
8+import Auxiliary
89import GHC.Generics (Generic)
910import Test.QuickCheck
1011import Test.QuickCheck.Arbitrary.Generic
1112
12−
13+-- | Recursive infinite type which can not have valid Arbitrary instance
1314data R = R R
1415 deriving (Eq, Show, Generic)
1516
16−-- | Instance which must not be valid
17+-- | Instance which must not compile, but we are using deferred type errors
1718instance Arbitrary R where
1819 arbitrary = genericArbitrary
1920 shrink = genericShrink
2021
2122unit_mustFail :: IO ()
22−unit_mustFail = do
23− try (generate (arbitrary :: Gen R) >>= print) >>= \case
24− Left (_ :: SomeException) -> pure ()
25− Right _ -> error "Error expected"
23+unit_mustFail = failGeneration @R
test/ParametersTest.hsnew file+34
@@ -0,0 +1,34 @@
1+{-# OPTIONS_GHC -fdefer-type-errors #-}
2+{-# OPTIONS_GHC -Wno-deferred-type-errors #-}
3+
4+module ParametersTest where
5+
6+import Auxiliary
7+import Control.DeepSeq
8+import GHC.Generics (Generic)
9+import Test.QuickCheck
10+import Test.QuickCheck.Arbitrary.Generic
11+
12+data A a = A a
13+ deriving (Eq, Ord, Show)
14+ deriving anyclass NFData
15+ deriving (Generic)
16+
17+instance (Arbitrary a) => Arbitrary (A a) where
18+ arbitrary = genericArbitrary
19+ shrink = genericShrink
20+
21+data B a = B a
22+ deriving (Eq, Ord, Show)
23+ deriving anyclass NFData
24+ deriving (Generic)
25+
26+instance (Arg (B a) a, Arbitrary a) => Arbitrary (B a) where
27+ arbitrary = genericArbitrary
28+ shrink = genericShrink
29+
30+unit_argumentConstraintFail :: IO ()
31+unit_argumentConstraintFail = failGeneration @(A Int)
32+
33+prop_properArgumentConstraint :: B Int -> Property
34+prop_properArgumentConstraint = total
test/RecursiveTest.hs+43−25
@@ -1,45 +1,56 @@
1+{-# LANGUAGE DerivingStrategies #-}
2+{-# LANGUAGE DerivingVia #-}
3+{-# LANGUAGE DeriveAnyClass #-}
4+{-# OPTIONS_GHC -fconstraint-solver-iterations=5 #-} -- GHC-9.2.4
5+
16-- | Testing that our Arbitrary instances do not get stuck and respect the
27-- `size` parameter while generating.
38
49module RecursiveTest where
510
6−import Control.DeepSeq
11+import Control.DeepSeq (NFData)
712import GHC.Generics (Generic)
813import Test.QuickCheck
914import Test.QuickCheck.Arbitrary.Generic
1015
1116data Unit = Unit
1217 deriving (Eq, Show, Generic)
13−
14−instance NFData Unit
15−
18+ deriving anyclass NFData
19+#if MIN_VERSION_QuickCheck(2, 14, 0)
20+ deriving Arbitrary via (GenericArbitrary Unit)
21+#else
1622instance Arbitrary Unit where
1723 arbitrary = genericArbitrary
1824 shrink = genericShrink
25+#endif
1926
2027prop_unitTotal :: Unit -> Property
2128prop_unitTotal = total
2229
2330data Single = Single Int
2431 deriving (Eq, Show, Generic)
25−
26−instance NFData Single
27−
32+ deriving anyclass NFData
33+#if MIN_VERSION_QuickCheck(2, 14, 0)
34+ deriving Arbitrary via (GenericArbitrary Single)
35+#else
2836instance Arbitrary Single where
2937 arbitrary = genericArbitrary
3038 shrink = genericShrink
39+#endif
3140
3241prop_singleTotal :: Single -> Property
3342prop_singleTotal = total
3443
3544data Multiple = M1 | M2 | M3 Int
3645 deriving (Eq, Show, Generic)
37−
38−instance NFData Multiple
39−
46+ deriving anyclass NFData
47+#if MIN_VERSION_QuickCheck(2, 14, 0)
48+ deriving Arbitrary via (GenericArbitrary Multiple)
49+#else
4050instance Arbitrary Multiple where
4151 arbitrary = genericArbitrary
4252 shrink = genericShrink
53+#endif
4354
4455prop_multipleTotal :: Multiple -> Property
4556prop_multipleTotal = total
@@ -49,12 +60,14 @@ data Rec = Rec
4960 , single :: Single
5061 , multiple :: Multiple
5162 } deriving (Eq, Show, Generic)
52−
53−instance NFData Rec
54−
63+ deriving anyclass NFData
64+#if MIN_VERSION_QuickCheck(2, 14, 0)
65+ deriving Arbitrary via (GenericArbitrary Rec)
66+#else
5567instance Arbitrary Rec where
5668 arbitrary = genericArbitrary
5769 shrink = genericShrink
70+#endif
5871
5972prop_recTotal :: Rec -> Property
6073prop_recTotal = total
@@ -64,13 +77,14 @@ data Expr
6477 | Add Expr Expr
6578 | Mul Expr Expr
6679 deriving (Eq, Show, Generic)
67−
68−-- | Instance with may fall into infinite loop
80+ deriving anyclass NFData
81+#if MIN_VERSION_QuickCheck(2, 14, 0)
82+ deriving Arbitrary via (GenericArbitrary Expr)
83+#else
6984instance Arbitrary Expr where
7085 arbitrary = genericArbitrary
7186 shrink = genericShrink
72−
73−instance NFData Expr
87+#endif
7488
7589prop_exprTotal :: Expr -> Property
7690prop_exprTotal = total
@@ -83,12 +97,14 @@ data Recursive
8397 | R4 Recursive
8498 | R5 Recursive String
8599 deriving (Eq, Show, Generic)
86−
87−instance NFData Recursive
88−
100+ deriving anyclass NFData
101+#if MIN_VERSION_QuickCheck(2, 14, 0)
102+ deriving Arbitrary via (GenericArbitrary Recursive)
103+#else
89104instance Arbitrary Recursive where
90105 arbitrary = genericArbitrary
91106 shrink = genericShrink
107+#endif
92108
93109prop_recursiveTotal :: Recursive -> Property
94110prop_recursiveTotal = total
@@ -97,21 +113,23 @@ data DeepRecursive
97113 = Deep DeepRecursive DeepRecursive DeepRecursive DeepRecursive DeepRecursive
98114 | Short
99115 deriving (Eq, Show, Generic)
100−
101−instance NFData DeepRecursive
102−
116+ deriving anyclass NFData
117+#if MIN_VERSION_QuickCheck(2, 14, 0)
118+ deriving Arbitrary via (GenericArbitrary DeepRecursive)
119+#else
103120instance Arbitrary DeepRecursive where
104121 arbitrary = genericArbitrary
105122 shrink = genericShrink
123+#endif
106124
107125prop_deepRecursiveTotal :: DeepRecursive -> Property
108126prop_deepRecursiveTotal = total
109127
110128data P p = NoP | P p
111129 deriving (Eq, Show, Generic)
130+ deriving anyclass NFData
112131
113−instance (NFData p) => NFData (P p)
114−
132+-- Note that deriving via doesn't work for case with arguments
115133instance (Arg (P p) p, Arbitrary p) => Arbitrary (P p) where
116134 arbitrary = genericArbitrary
117135 shrink = genericShrink