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
|
import Test.Tasty (defaultMain, testGroup)
import Test.Tasty.HUnit (testCase, (@?=))
import qualified Legacy.Spec.Bare as Bare
import qualified Legacy.Spec.Constraints as Constraints
import qualified Legacy.Spec.Functor as Functor
import qualified Legacy.Spec.Product as Product
import qualified Legacy.Spec.Traversable as Traversable
import qualified Legacy.Spec.Wrapper as Wrapper
import Legacy.TestBarbies
import Legacy.TestBarbiesW
import Data.Barbie (bfoldMap, bmapC, btraverseC, buniqC)
import Data.Barbie.Bare (Covered)
import Data.Functor.Const (Const (..))
import Data.Functor.Identity (Identity (..))
import Data.Monoid (Sum (..))
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 @(CompositeRecordW Covered)
]
, 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 @(CompositeRecordW Covered)
]
, testGroup "Product Laws"
[ Product.laws @Record0
, Product.laws @Record1
, Product.laws @Record3
, Product.laws @CompositeRecord
, Product.laws @Record1S
, Product.laws @Record3S
, Product.laws @(Record1W Covered)
, Product.laws @(Record3W Covered)
, Product.laws @(CompositeRecordW Covered)
, Product.laws @(Record1WS Covered)
, Product.laws @(Record3WS Covered)
]
, testGroup "Uniq Laws"
[ Product.uniqLaws @Record0
, Product.uniqLaws @Record1
, Product.uniqLaws @Record3
, Product.uniqLaws @CompositeRecord
, Product.uniqLaws @Record1S
, Product.uniqLaws @Record3S
, Product.uniqLaws @(Record1W Covered)
, Product.uniqLaws @(Record3W Covered)
, Product.uniqLaws @(CompositeRecordW Covered)
, Product.uniqLaws @(Record1WS Covered)
, Product.uniqLaws @(Record3WS Covered)
]
, testGroup "adDict 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)
]
, testGroup "bdicts projection"
[ Constraints.lawDictsEquivPrj @Record0
, Constraints.lawDictsEquivPrj @Record1
, Constraints.lawDictsEquivPrj @Record3
, Constraints.lawDictsEquivPrj @CompositeRecord
, Constraints.lawDictsEquivPrj @Record1S
, Constraints.lawDictsEquivPrj @Record3S
, Constraints.lawDictsEquivPrj @(Record1W Covered)
, Constraints.lawDictsEquivPrj @(Record3W Covered)
, Constraints.lawDictsEquivPrj @(CompositeRecordW Covered)
, Constraints.lawDictsEquivPrj @(Record1WS Covered)
, Constraints.lawDictsEquivPrj @(Record3WS Covered)
]
, 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")
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
"buniqC"
[ testCase "Record1" $
buniqC @Num (Identity (fromIntegral (42 :: Int)))
@?= Record1 (Identity 42)
]
]
|
