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
|
module Control.SearchTree.Generators
( genBool, genNat, genInt, genFloat, genChar, genList
, genMaybe, genEither, genUnit, genPair, genTriple, genTuple4, genTuple5
, genOrdering
, genCons0, genCons1, genCons2, genCons3, genCons4, genCons5
, (|||)
) where
import Float
import Control.SearchTree
import Control.SearchTree.Traversal
infixr 1 |||
valsTo :: SearchTree a -> (a -> SearchTree b) -> SearchTree b
valsTo (Value a) f = f a
valsTo (Fail i) _ = Fail i
valsTo (Or t1 t2) f = Or (valsTo t1 f) (valsTo t2 f)
(|||) :: SearchTree a -> SearchTree a -> SearchTree a
x ||| y = Or x y
genCons0 :: a -> SearchTree a
genCons0 = Value
genCons1 :: (a -> b) -> SearchTree a -> SearchTree b
genCons1 c gena = valsTo gena (Value . c)
genCons2 :: (a1 -> a2 -> b) -> SearchTree a1 -> SearchTree a2 -> SearchTree b
genCons2 c gena1 gena2 =
valsTo gena1 (\a1 ->
valsTo gena2 (\a2 -> Value (c a1 a2)))
genCons3 :: (a1 -> a2 -> a3 -> b) -> SearchTree a1 -> SearchTree a2
-> SearchTree a3 -> SearchTree b
genCons3 c gena1 gena2 gena3 =
valsTo gena1 (\a1 ->
valsTo gena2 (\a2 ->
valsTo gena3 (\a3 -> Value (c a1 a2 a3))))
genCons4 :: (a1 -> a2 -> a3 -> a4 -> b) -> SearchTree a1 -> SearchTree a2
-> SearchTree a3 -> SearchTree a4 -> SearchTree b
genCons4 c gena1 gena2 gena3 gena4 =
valsTo gena1 (\a1 ->
valsTo gena2 (\a2 ->
valsTo gena3 (\a3 ->
valsTo gena4 (\a4 -> Value (c a1 a2 a3 a4)))))
genCons5 :: (a1 -> a2 -> a3 -> a4 -> a5 -> b) -> SearchTree a1 -> SearchTree a2
-> SearchTree a3 -> SearchTree a4 -> SearchTree a5 -> SearchTree b
genCons5 c gena1 gena2 gena3 gena4 gena5 =
valsTo gena1 (\a1 ->
valsTo gena2 (\a2 ->
valsTo gena3 (\a3 ->
valsTo gena4 (\a4 ->
valsTo gena5 (\a5 -> Value (c a1 a2 a3 a4 a5))))))
genNat :: SearchTree Int
genNat = Or (Value 1)
(Or (valsTo genNat (\n -> Value (2*n)))
(valsTo genNat (\n -> Value (2*n+1))))
genInt :: SearchTree Int
genInt = Or genNat
(Or (Value 0)
(valsTo genNat (Value . (0 -))))
genFloat :: SearchTree Float
genFloat = Or genPosFloat
(Or (Value 0.0)
(valsTo genPosFloat (Value . (0.0 -.))))
genPosFloat :: SearchTree Float
genPosFloat = valsTo (genPair genNat genNat) ii2f
where
ii2f (x,y) = Value (i2f x +. nat2float 0.1 y)
nat2float m i =
if i == 0 then 0.0
else nat2float (m/.10) (i `div` 10) +. m *. i2f (i `mod` 10)
genBool :: SearchTree Bool
genBool = Or (Value False) (Value True)
genChar :: SearchTree Char
genChar = foldr1 Or (map Value chars)
where
chars = map chr ([65..90] ++ [97..122] ++ [48..57])
genList :: SearchTree a -> SearchTree [a]
genList genx =
Or (Value [])
(genCons2 (:) genx (genList genx))
genMaybe :: SearchTree a -> SearchTree (Maybe a)
genMaybe genx = Value Nothing ||| genCons1 Just genx
genEither :: SearchTree a -> SearchTree b -> SearchTree (Either a b)
genEither genx geny = genCons1 Left genx ||| genCons1 Right geny
genUnit :: SearchTree ()
genUnit = Value ()
genPair :: SearchTree a -> SearchTree b -> SearchTree (a,b)
genPair = genCons2 (\x y -> (x,y))
genTriple :: SearchTree a -> SearchTree b -> SearchTree c
-> SearchTree (a,b,c)
genTriple = genCons3 (\x y z -> (x,y,z))
genTuple4 :: SearchTree a -> SearchTree b -> SearchTree c -> SearchTree d
-> SearchTree (a,b,c,d)
genTuple4 = genCons4 (\x y z1 z2 -> (x,y,z1,z2))
genTuple5 :: SearchTree a -> SearchTree b -> SearchTree c -> SearchTree d
-> SearchTree e -> SearchTree (a,b,c,d,e)
genTuple5 = genCons5 (\x y z1 z2 z3 -> (x,y,z1,z2,z3))
genOrdering :: SearchTree Ordering
genOrdering = Or (Value LT) (Or (Value EQ) (Value GT))
|