1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
|
import Test.Tasty (defaultMain, testGroup)
import Test.Tasty.HUnit (testCase, (@?=))
import qualified Spec.Bare as Bare
import qualified Spec.Constraints as Constraints
import qualified Spec.Functor as Functor
import qualified Spec.Applicative as Applicative
import qualified Spec.Traversable as Traversable
import qualified Spec.Distributive as Distributive
import qualified Spec.Wrapper as Wrapper
import TestBarbies
import TestBarbiesW
import qualified TestBiBarbies as Bi
import Barbies(Flip)
import Barbies.Bare(Covered)
import Control.Applicative ( liftA2 )
import Data.Functor.Barbie(bfoldMap, bmapC, btraverseC, bpureC, bfoldMapC, bzipWithC, bzipWith3C, bzipWith4C)
import Data.Functor.Const (Const (..))
import Data.Functor.Identity (Identity (..))
import Data.Monoid (Sum (..))
import Data.Typeable ( Typeable, typeOf )
main :: IO ()
main
= defaultMain $
testGroup "Tests"
[ testGroup "Functor Laws"
[ Functor.laws @Record0
, Functor.laws @Record1
, Functor.laws @Record3
, Functor.laws @Record1S
, Functor.laws @Record3S
, Functor.laws @(Record1W Covered)
, Functor.laws @(Record3W Covered)
, Functor.laws @(Record1WS Covered)
, Functor.laws @(Record3WS Covered)
, Functor.laws @Ignore1
, Functor.laws @Sum3
, Functor.laws @SumRec
, Functor.laws @(Sum3W Covered)
, Functor.laws @(SumRecW Covered)
, Functor.laws @CompositeRecord
, Functor.laws @NestedF
, Functor.laws @Nested2F
, Functor.laws @(CompositeRecordW Covered)
, Functor.laws @(NestedFW Covered)
, Functor.laws @(Nested2FW Covered)
, Functor.laws @(ParF Maybe)
, Functor.laws @(Flip Bi.Record0 ())
, Functor.laws @(Flip Bi.Record1 ())
, Functor.laws @(Flip Bi.Record3 ())
, Functor.laws @(Flip Bi.Record1S ())
, Functor.laws @(Flip Bi.Record3S ())
, Functor.laws @(Flip Bi.Ignore1 ())
, Functor.laws @(Flip Bi.Sum3 ())
, Functor.laws @(Flip Bi.CompositeRecord ())
, Functor.laws @(Flip Bi.SumRec ())
, Functor.laws @(Flip Bi.NestedF ())
, Functor.laws @(Flip Bi.Nested2F ())
, Functor.laws @(Flip Bi.NestedB Maybe)
, Functor.laws @(Bi.MixedBT Maybe)
, Functor.laws @(Flip Bi.MixedBT Maybe)
]
, testGroup "Distributive Laws"
[ Distributive.laws @Record0
, Distributive.laws @Record1
, Distributive.laws @Record1S
, Distributive.laws @Record3S
, Distributive.laws @(Record1W Covered)
, Distributive.laws @(Record3W Covered)
, Distributive.laws @CompositeRecord
, Distributive.laws @(Record1WS Covered)
, Distributive.laws @(Record3WS Covered)
, Distributive.laws @(CompositeRecordW Covered)
, Distributive.laws @(Flip Bi.Record0 ())
, Distributive.laws @(Flip Bi.Record1 ())
, Distributive.laws @(Flip Bi.Record1S ())
, Distributive.laws @(Flip Bi.Record3S ())
]
, testGroup "Traversable Laws"
[ Traversable.laws @Record0
, Traversable.laws @Record1
, Traversable.laws @Record3
, Traversable.laws @Record1S
, Traversable.laws @Record3S
, Traversable.laws @(Record1W Covered)
, Traversable.laws @(Record3W Covered)
, Traversable.laws @(Record1WS Covered)
, Traversable.laws @(Record3WS Covered)
, Traversable.laws @Ignore1
, Traversable.laws @Sum3
, Traversable.laws @SumRec
, Traversable.laws @(Sum3W Covered)
, Traversable.laws @(SumRecW Covered)
, Traversable.laws @CompositeRecord
, Traversable.laws @NestedF
, Traversable.laws @Nested2F
, Traversable.laws @(CompositeRecordW Covered)
, Traversable.laws @(NestedFW Covered)
, Traversable.laws @(Nested2FW Covered)
, Traversable.laws @(ParF Maybe)
, Traversable.laws @(Flip Bi.Record0 ())
, Traversable.laws @(Flip Bi.Record1 ())
, Traversable.laws @(Flip Bi.Record3 ())
, Traversable.laws @(Flip Bi.Record1S ())
, Traversable.laws @(Flip Bi.Record3S ())
, Traversable.laws @(Flip Bi.Ignore1 ())
, Traversable.laws @(Flip Bi.Sum3 ())
, Traversable.laws @(Flip Bi.CompositeRecord ())
, Traversable.laws @(Flip Bi.SumRec ())
, Traversable.laws @(Flip Bi.NestedF ())
, Traversable.laws @(Flip Bi.Nested2F ())
, Traversable.laws @(Flip Bi.NestedB Maybe)
, Traversable.laws @(Bi.MixedBT Maybe)
, Traversable.laws @(Flip Bi.MixedBT Maybe)
]
, testGroup "Applicative laws"
[ Applicative.laws @Record0
, Applicative.laws @Record1
, Applicative.laws @Record3
, Applicative.laws @CompositeRecord
, Applicative.laws @NestedF
, Applicative.laws @Nested2F
, Applicative.laws @Record1S
, Applicative.laws @Record3S
, Applicative.laws @(Record1W Covered)
, Applicative.laws @(Record3W Covered)
, Applicative.laws @(CompositeRecordW Covered)
, Applicative.laws @(NestedFW Covered)
, Applicative.laws @(Nested2FW Covered)
, Applicative.laws @(Record1WS Covered)
, Applicative.laws @(Record3WS Covered)
, Applicative.laws @(ParX (Maybe ()))
, Applicative.laws @(ParF Sum)
, Applicative.laws @(Flip Bi.Record0 ())
, Applicative.laws @(Flip Bi.Record1 ())
, Applicative.laws @(Flip Bi.Record3 ())
, Applicative.laws @(Flip Bi.Record1S ())
, Applicative.laws @(Flip Bi.Record3S ())
, Applicative.laws @(Flip Bi.CompositeRecord ())
, Applicative.laws @(Flip Bi.NestedF ())
, Applicative.laws @(Flip Bi.Nested2F ())
, Applicative.laws @(Flip (Bi.ParX (Maybe ())) ())
, Applicative.laws @(Bi.MixedBT [])
]
, testGroup "addDict projection"
[ Constraints.lawAddDictPrj @Record0
, Constraints.lawAddDictPrj @Record1
, Constraints.lawAddDictPrj @Record3
, Constraints.lawAddDictPrj @Record1S
, Constraints.lawAddDictPrj @Record3S
, Constraints.lawAddDictPrj @(Record1W Covered)
, Constraints.lawAddDictPrj @(Record3W Covered)
, Constraints.lawAddDictPrj @(Record1WS Covered)
, Constraints.lawAddDictPrj @(Record3WS Covered)
, Constraints.lawAddDictPrj @Ignore1
, Constraints.lawAddDictPrj @Sum3
, Constraints.lawAddDictPrj @SumRec
, Constraints.lawAddDictPrj @(Sum3W Covered)
, Constraints.lawAddDictPrj @(SumRecW Covered)
, Constraints.lawAddDictPrj @CompositeRecord
, Constraints.lawAddDictPrj @(CompositeRecordW Covered)
, Constraints.lawAddDictPrj @(Bi.MixedBT Maybe)
]
, testGroup "Bare laws"
[ Bare.laws @Record1W
, Bare.laws @Record3W
, Bare.laws @Record1WS
, Bare.laws @Record3WS
, Bare.laws @Sum3W
, Bare.laws @SumRecW
, Bare.laws @NestedFW
]
, testGroup "Generic wrapper"
[ Wrapper.lawsMonoid @Record1
, Wrapper.lawsMonoid @(Record1W Covered)
, Wrapper.lawsMonoid @Record1S
, Wrapper.lawsMonoid @(Record1WS Covered)
, Wrapper.lawsMonoid @Record3
, Wrapper.lawsMonoid @(Record3W Covered)
, Wrapper.lawsMonoid @Record3S
, Wrapper.lawsMonoid @(Record3WS Covered)
]
, testGroup "bfoldMap"
[ testCase "Record3" $ do
let b = Record3 (Const "tic") (Const "tac") (Const "toe") Nothing
bfoldMap getConst b @?= "tictactoe"
]
, testGroup
"bmapC"
[ testCase "Record1" $
bmapC @Num (fmap (+1)) (Record1 (Identity 0))
@?= Record1 (Identity 1)
]
, testGroup
"btraverseC"
[ testCase "Record1" $
btraverseC @Num (\inner -> (Sum @Int 1, fmap (+ 1) inner)) (Record1 (Identity 0))
@?= (Sum 1, Record1 (Identity 1))
]
, testGroup
"bpureC"
[ testCase "Record1" $
bpureC @Num (Identity (fromIntegral (42 :: Int)))
@?= Record1 (Identity 42)
]
, testGroup "bfoldMapC"
[ testCase "Record3S" $ do
let
b = Record3S (Just 22) Nothing (Just 'x')
go :: forall a. Typeable a => Maybe a -> Maybe String
go = fmap (show . typeOf)
bfoldMapC @Typeable go b @?= Just "IntChar"
]
, testGroup "bzipWithC"
[ testCase "Record1S" $ do
let
a = Record1S (Just 44)
b = Record1S (Just 22)
bzipWithC @Num (liftA2 (+)) a b @?= Record1S (Just 66)
]
, testGroup "bzipWith3C"
[ testCase "Record1S" $ do
let
a = Record1S (Just 44)
b = Record1S (Just 22)
c = Record1S (Just 88)
go :: forall a. Num a => Maybe a -> Maybe a -> Maybe a -> Maybe a
go x y z = liftA2 (+) x $ liftA2 (+) y z
bzipWith3C @Num go a b c @?= Record1S (Just 154)
]
, testGroup "bzipWith4C"
[ testCase "Record1S" $ do
let
a = Record1S (Just 44)
b = Record1S (Just 22)
c = Record1S (Just 88)
d = Record1S (Just 11)
go :: forall a. Num a => Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a
go w x y z = liftA2 (+) (liftA2 (+) w x) (liftA2 (+) y z)
bzipWith4C @Num go a b c d @?= Record1S (Just 165)
]
]
|
