-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSet7Test.hs
279 lines (229 loc) · 11.8 KB
/
Set7Test.hs
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
{-# LANGUAGE TemplateHaskell, ScopedTypeVariables, StandaloneDeriving, DeriveGeneric #-}
module Set7Test where
import Data.List
import Data.List.NonEmpty (NonEmpty ((:|)))
import GHC.Generics (Generic)
import Generic.Random
import Test.QuickCheck
import Mooc.Th
import Mooc.Test
import Set7 hiding (bake)
main = score tests
tests = [(1,"travel",[ex1_travel, ex1_velocity])
,(2,"Set",[ex2_member, ex2_add, ex2_empty_add])
,(3,"bake",[ex3_ok, ex3_finished, ex3_error, ex3_type])
,(4,"average NonEmpty",[ex4])
,(5,"reverseNonEmpty",[ex5_one, ex5_many])
,(6,"Semigroup x3",[ex6_Distance, ex6_Time, ex6_Velocity])
,(7,"Monoid Set",[ex7_combine, ex7_mempty])
,(8,"Operation1&2",[ex8_multiply1, ex8_multiply2, ex8_show1, ex8_show1_multiply1, ex8_show2, ex8_show2_multiply2])
,(9,"PasswordRequirement",[ex9_basics, ex9_either_both, ex9_large])
,(10,"Arithmetic",[ex10_examples, ex10_large])
]
--
ex1_velocity = forAll_ $ \d ->
forAll_ $ \(Positive t) ->
$(testing [|velocity (Distance d) (Time t)|]) (?==Velocity (d/t))
ex1_travel = forAll_ $ \(v,t) ->
$(testing [|travel (Velocity v) (Time t)|]) (?==Distance (v*t))
instance (Ord a, Arbitrary a) => Arbitrary (Set a) where
arbitrary = fmap (Set . nub) orderedList
m2_member example = forAll_ $ \(Set xs) ->
not (null xs) ==>
forAllBlind (elements (xs`asTypeOf`example)) $ \x ->
conjoin [$(testing [|member x (Set xs)|]) (?==True)
,$(testing [|member x (Set (delete x xs))|]) (?==False)]
ex2_member = conjoin [m2_member [True,False]
,m2_member [1::Int,2,3]]
m2_add example = forAll_ $ \(Set xs) ->
not (null xs) ==>
forAllBlind (elements (xs`asTypeOf`example)) $ \x ->
conjoin [$(testing [|add x (Set xs)|]) (?==(Set xs))
,$(testing [|add x (Set (delete x xs))|]) (?==(Set xs))]
ex2_add = conjoin [m2_add ["foo","bar"]
,m2_add [1::Int,2,3]]
ex2_empty_add = conjoin
[forAll_ $ \(i::Integer) -> counterexample ("add "++show i++" emptySet") (add i emptySet ?== Set [i])
,forAll_ $ \(b::Bool) -> counterexample ("add " ++show b++"(add "++show b++" emptySet)")
(add b (add b emptySet) ?== Set [b])]
deriving instance Generic Event
instance Arbitrary Event where
arbitrary = genericArbitrary uniform
ex3_good = [[AddEggs,AddFlour,AddSugar,Mix,Bake]
,[AddEggs,AddSugar,AddFlour,Mix,Bake]]
canFinish ev = any (\g -> ev `isPrefixOf` g) ex3_good
finished ev = any (\g -> g `isPrefixOf` ev) ex3_good
bake :: [Event] -> State
bake events = go Start events
where go state [] = state
go state (e:es) = go (step state e) es
ex3_ok = forAllBlind (elements ex3_good) $ \events ->
$(testing [|bake events|]) (?==Finished)
ex3_finished = forAll_ $ \(ev::Event) ->
$(testing [|step Finished ev|]) (?==Finished)
genBad = do
g <- elements ex3_good
i <- choose (0,length g - 1)
let pre = take i g
x <- arbitrary `suchThat` (\x -> not (canFinish (pre++[x]) || finished (pre++[x])))
y <- arbitrary
elements [pre++[x], pre++[x,y]]
ex3_error = forAllBlind (genBad) $ \events ->
$(testing [|bake events|]) (?==Error)
ex3_type = $(reifyType "State") $ \(DataType vars cs) ->
conjoin [counterexample " should have no type parameters" $ vars == []
,conjoin $ map ok cs]
where ok (Constructor _ []) = property True
ok (Constructor n _) = counterexample (" constructor "++show n++" should have no fields") $ property False
ok (Weird n) = counterexample (" constructor "++show n++" is weird. Make it normal.") $ property False
ex4 = conjoin [forAll_ $ \(Small i) -> $(testing [|average ((fromIntegral i :: Float) :| [])|]) (?==fromIntegral i)
,forAllBlind (choose (1,10)) $ \n -> forAll_ $ \(i::Rational) ->
$(testing [|average (i:|(replicate n i))|]) (?==i)
,forAll_ $ \(Small i) -> let f = fromIntegral i in $(testing [|average ((f-1):|[f,f+1])|]) (?==f)
,forAll_ $ \(Small i,Small j) ->
let x = fromIntegral i :: Double
y = fromIntegral j :: Double
in $(testing [|average (x:|(replicate 9 x ++ replicate 10 y))|]) (?~=(x+y)/2)]
ex5_one = forAll_ $ \(x::Bool) -> $(testing [|reverseNonEmpty (x:|[])|]) (?==(x:|[]))
ex5_many = forAllBlind (choose (0,10)) $ \(i::Int) ->
forAllBlind (choose (2,10)) $ \(n::Int) ->
$(testing [|reverseNonEmpty (i:|[i+1..i+n])|]) (?==((i+n):|[i+n-1,i+n-2..i]))
ex6_Distance = $(withInstance "Semigroup" "Distance" [|(<>)|]) $ \(<>) ->
forAll_ $ \(x,y) ->
$(testing [|(Distance x) <> (Distance y)|]) (?==Distance (x+y))
ex6_Time = $(withInstance "Semigroup" "Time" [|(<>)|]) $ \(<>) ->
forAll_ $ \(x,y) ->
$(testing [|(Time x) <> (Time y)|]) (?==Time (x+y))
ex6_Velocity = $(withInstance "Semigroup" "Velocity" [|(<>)|]) $ \(<>) ->
forAll_ $ \(x,y) ->
$(testing [|(Velocity x) <> (Velocity y)|]) (?==Velocity (x+y))
split [] = return ([],[])
split (x:xs) = do
(as,bs) <- split xs
oneof [return (x:as,bs)
,return (as,x:bs)
,return (x:as,x:bs)]
ex7_combine = $(withInstance1 "Monoid" "Set" [|(<>)|]) $ \(<>) ->
forAll_ $ \(Set (xs :: [Integer])) ->
forAllBlind (split xs) $ \(as,bs) ->
$(testing [|(Set as) <> (Set bs)|]) (?==(Set xs))
ex7_mempty = $(withInstance1 "Monoid" "Set" [|((<>),mempty)|]) $ \((<>),mempty) ->
forAll_ $ \(Set (xs :: [Char])) ->
conjoin [counterexample (show (Set xs) ++ " <> mempty") ((Set xs <> mempty) ?== Set xs)
,counterexample ("mempty <> " ++ show (Set xs)) ((mempty <> Set xs) ?== Set xs)]
smallInt = choose (0,100::Int)
ex8_multiply1 = $(withConstructor "Operation1" "Multiply1" ["Int","Int"]) $ \mul1 ->
forAllBlind smallInt $ \i ->
forAllBlind smallInt $ \j ->
$(testing [|compute1 (mul1 i j)|]) (?==(i*j))
{-
ex8_multiply1 = $(reifyType "Operation1") $ \(DataType vars cs) ->
case filter ok cs of
[Constructor _ ts] -> counterexample " constructor Multiply1 should have type Int -> Int -> Operation1" $
property $ ts == [SimpleType "Int", SimpleType "Int"]
[_] -> counterexample (" constructor Multiply1 is weid. Make it normal.") $ property False
_ -> counterexample (" should have a constructor named Multiply1") $ property False
where ok (Constructor "Multiply1" _) = True
ok (Weird "Multiply1") = True
ok _ = False
-}
ex8_multiply2 =
$(withInstance "Operation2" "Multiply2" [|compute2|]) $ \compute2 ->
$(withDefined "Multiply2") $ \mul2 ->
forAllBlind smallInt $ \i ->
forAllBlind smallInt $ \j ->
-- no Show instance available...
counterexample ("compute2 (Multiply2 " ++ show i ++ " " ++ show j ++ ")") $
compute2 (mul2 i j) ?== (i*j)
ex8_show1 =
$(hasType "show1" [t|Operation1 -> String|]) $ \show1 ->
forAllBlind smallInt $ \i ->
forAllBlind smallInt $ \j ->
conjoin [$(testing [|show1 (Add1 i j)|]) (?==show i++"+"++show j)
,$(testing [|show1 (Subtract1 i j)|]) (?==show i++"-"++show j)]
ex8_show1_multiply1 =
$(withConstructor "Operation1" "Multiply1" ["Int","Int"]) $ \mul1 ->
$(hasType "show1" [t|Operation1 -> String|]) $ \show1 ->
forAllBlind smallInt $ \i ->
forAllBlind smallInt $ \j ->
counterexample ("show1 (Multiply1 " ++ show i ++ " " ++ show j ++ ")") $
show1 (mul1 i j) ?== show i++"*"++show j
ex8_show2 =
conjoin [$(withDefined "show2") $ \show2 ->
forAllBlind smallInt $ \i ->
forAllBlind smallInt $ \j ->
$(testing [|show2 (Add2 i j)|]) (?==show i++"+"++show j)
,$(withDefined "show2") $ \show2 ->
forAllBlind smallInt $ \i ->
forAllBlind smallInt $ \j ->
$(testing [|show2 (Subtract2 i j)|]) (?==show i++"-"++show j)]
ex8_show2_multiply2 =
$(withDefined "show2") $ \show2 ->
$(withDefined "Multiply2") $ \mul2 ->
forAllBlind (choose (0,100::Int)) $ \i ->
forAllBlind (choose (0,100::Int)) $ \j ->
$(testing [|show2 (Add2 i j)|]) (?==show i++"+"++show j)
ex9_basics =
conjoin [$(testing [|passwordAllowed "short" (MinimumLength 8)|]) (?==False)
,$(testing [|passwordAllowed "veryLongPassword" (MinimumLength 8)|]) (?==True)
,$(testing [|passwordAllowed "password" (ContainsSome "0123456789")|]) (?==False)
,$(testing [|passwordAllowed "p4ssword" (ContainsSome "0123456789")|]) (?==True)
,$(testing [|passwordAllowed "password" (DoesNotContain "0123456789")|]) (?==True)
,$(testing [|passwordAllowed "p4ssword" (DoesNotContain "0123456789")|]) (?==False)
]
ex9_either_both = property $ do
~limits@[a,b,c,d] <- vectorOf 4 (choose (3,12))
password <- vectorOf 24 (choose ('a','z'))
let or = Or (Or (MinimumLength a) (MinimumLength b)) (Or (MinimumLength c) (MinimumLength d))
and = And (And (MinimumLength a) (MinimumLength b)) (And (MinimumLength c) (MinimumLength d))
low = minimum limits
hi = maximum limits
return $
(low < hi) ==> do med <- choose (low,hi-1)
return $
conjoin [$(testing [|passwordAllowed (take (low-1) password) or|]) (?==False)
,$(testing [|passwordAllowed (take (low-1) password) and|]) (?==False)
,$(testing [|passwordAllowed (take med password) or|]) (?==True)
,$(testing [|passwordAllowed (take med password) and|]) (?==False)
,$(testing [|passwordAllowed (take hi password) or|]) (?==True)
,$(testing [|passwordAllowed (take hi password) and|]) (?==True)]
tree leaf node [] = MinimumLength 0
tree leaf node cs
| length cs <= 2 = leaf cs
tree leaf node cs = node (tree leaf node lefts) (tree leaf node rights)
where (lefts,rights) = splitAt (length cs `div` 2) cs
special = elements "0123456789!#%&/()="
ex9_large = forAllBlind (listOf special) $ \forbidden ->
forAllBlind (listOf special) $ \required' ->
forAllShrink_ (listOf (choose ('a','z'))) $ \base ->
let required = filter (not . flip elem forbidden) required'
rules = And (tree ContainsSome Or required) (tree DoesNotContain And forbidden)
in not (null required) ==>
not (null forbidden) ==>
forAllBlind (elements required) $ \req ->
forAllBlind (elements forbidden) $ \forb ->
conjoin [$(testing [|passwordAllowed base rules|]) (?==False)
,forAllBlind (shuffle (req:base)) $ \pw ->
$(testing [|passwordAllowed pw rules|]) (?==True)
,forAllBlind (shuffle (forb:req:base)) $ \pw ->
$(testing [|passwordAllowed pw rules|]) (?==False)]
ex10_examples = conjoin [$(testing [|evaluate (literal 3)|]) (?==3)
,$(testing [|render (literal 3)|]) (?=="3")
,$(testing [|evaluate (operation "+" (literal 3) (literal 4))|]) (?==7)
,$(testing [|render (operation "+" (literal 3) (literal 4))|]) (?=="(3+4)")
,$(testing [|evaluate (operation "*" (literal 3) (operation "+" (literal 1) (literal 1)))|]) (?==6)
,$(testing [|render (operation "*" (literal 3) (operation "+" (literal 1) (literal 1)))|]) (?=="(3*(1+1))")]
gen_arithmetic :: Integer -> Gen (Integer,Arithmetic,String,String)
gen_arithmetic 0 = do
i <- choose (0,10)
return (i,literal i,show i,"(literal "++show i++")")
gen_arithmetic i = do
(lval,lexp,lshow,lcode) <- gen_arithmetic (i-1)
(rval,rexp,rshow,rcode) <- gen_arithmetic (i-1)
elements [(lval+rval,operation "+" lexp rexp,"("++lshow++"+"++rshow++")","(operation \"+\" "++lcode++" "++rcode++")")
,(lval*rval,operation "*" lexp rexp,"("++lshow++"*"++rshow++")","(operation \"*\" "++lcode++" "++rcode++")")]
m_ex10 level = forAllShrink_ (choose (1,level)) $ \l ->
forAllBlind (gen_arithmetic level) $ \(val,exp,show,code) ->
conjoin [counterexample ("evaluate "++code) $ evaluate exp ?== val
,counterexample ("render "++code) $ render exp ?== show]
ex10_large = conjoin [m_ex10 level | level <- [1..5]]