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
|
{-# LANGUAGE CPP #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE GADTs #-}
{-# LANGUAGE KindSignatures #-}
{-# LANGUAGE MagicHash #-}
{-# LANGUAGE TemplateHaskell #-}
{-# LANGUAGE TypeFamilies #-}
{-|
Module: Types.EqOrd
Copyright: (C) 2015-2017 Ryan Scott
License: BSD-style (see the file LICENSE)
Maintainer: Ryan Scott
Portability: Template Haskell
Shared datatypes between "EqSpec" and "OrdSpec".
-}
module Types.EqOrd where
#if !defined(NEW_FUNCTOR_CLASSES)
import Data.Functor.Classes (Eq1(..), Ord1(..))
#endif
import Data.Deriving
import GHC.Exts (Addr#, Char#, Double#, Float#, Int#, Word#)
-- Plain data types
data TyCon1 a m =
TyCon1A a
| TyCon1B
| TyCon1C
| TyCon1D
| TyCon1E
| TyCon1F
| TyCon1G
| TyCon1H
| TyCon1I
| TyCon1J
| TyCon1K
| TyCon1L
| TyCon1M m
data TyCon# a b = TyCon# {
tcA :: a
, tcB :: b
, tcAddr# :: Addr#
, tcInt# :: Int#
, tcFloat# :: Float#
, tcDouble# :: Double#
, tcChar# :: Char#
, tcWord# :: Word#
}
data TyCon2 a b c d where
TyConClassConstraints :: (Show m, Show n, Show o, Show p)
=> m -> n -> o -> p
-> TyCon2 m n o p
TyConEqualityConstraints :: (e ~ g, f ~ h, e ~ f)
=> e -> f -> g -> h
-> TyCon2 e f g h
TyConTypeRefinement1,
TyConTypeRefinement2 :: Int -> z
-> TyCon2 Int Int z z
data TyConWrap f g h a = TyConWrap1 (f a)
| TyConWrap2 (f (g a))
| TyConWrap3 (f (g (h a)))
data Empty a b
-- Data families
data family TyFamily1 y z :: *
data instance TyFamily1 a m =
TyFamily1A a
| TyFamily1B
| TyFamily1C
| TyFamily1D
| TyFamily1E
| TyFamily1F
| TyFamily1G
| TyFamily1H
| TyFamily1I
| TyFamily1J
| TyFamily1K
| TyFamily1L
| TyFamily1M m
data family TyFamily# y z :: *
data instance TyFamily# a b = TyFamily# {
tfA :: a
, tfB :: b
, tfInt# :: Int#
, tfFloat# :: Float#
, tfDouble# :: Double#
, tfChar# :: Char#
, tfWord# :: Word#
}
data family TyFamily2 w x y z :: *
data instance TyFamily2 a b c d where
TyFamilyClassConstraints :: (Show m, Show n, Show o, Show p)
=> m -> n -> o -> p
-> TyFamily2 m n o p
TyFamilyEqualityConstraints :: (e ~ g, f ~ h, e ~ f)
=> e -> f -> g -> h
-> TyFamily2 e f g h
TyFamilyTypeRefinement1,
TyFamilyTypeRefinement2 :: Int -> z
-> TyFamily2 Int Int z z
data family TyFamilyWrap (w :: * -> *) (x :: * -> *) (y :: * -> *) z :: *
data instance TyFamilyWrap f g h a = TyFamilyWrap1 (f a)
| TyFamilyWrap2 (f (g a))
| TyFamilyWrap3 (f (g (h a)))
-------------------------------------------------------------------------------
-- Plain data types
$(deriveEq ''TyCon1)
$(deriveEq ''TyCon#)
$(deriveEq ''TyCon2)
instance (Eq (f a), Eq (f (g a)), Eq (f (g (h a))))
=> Eq (TyConWrap f g h a) where
(==) = $(makeEq ''TyConWrap)
(/=) = $(makeNotEq ''TyConWrap)
$(deriveEq ''Empty)
$(deriveEq1 ''TyCon1)
$(deriveEq1 ''TyCon#)
$(deriveEq1 ''TyCon2)
$(deriveEq1 ''Empty)
$(deriveOrd ''TyCon1)
$(deriveOrd ''TyCon#)
$(deriveOrd ''TyCon2)
instance (Ord (f a), Ord (f (g a)), Ord (f (g (h a))))
=> Ord (TyConWrap f g h a) where
compare = $(makeCompare ''TyConWrap)
(>) = $(makeLT ''TyConWrap)
(>=) = $(makeLE ''TyConWrap)
(<) = $(makeGT ''TyConWrap)
(<=) = $(makeGE ''TyConWrap)
max = $(makeMax ''TyConWrap)
min = $(makeMin ''TyConWrap)
$(deriveOrd ''Empty)
$(deriveOrd1 ''TyCon1)
$(deriveOrd1 ''TyCon#)
$(deriveOrd1 ''TyCon2)
$(deriveOrd1 ''Empty)
#if defined(NEW_FUNCTOR_CLASSES)
$(deriveEq1 ''TyConWrap)
$(deriveOrd1 ''TyConWrap)
#else
instance (Eq1 f, Functor f, Eq1 g, Functor g, Eq1 h)
=> Eq1 (TyConWrap f g h) where
eq1 = $(makeEq1 ''TyConWrap)
instance (Ord1 f, Functor f, Ord1 g, Functor g, Ord1 h)
=> Ord1 (TyConWrap f g h) where
compare1 = $(makeCompare1 ''TyConWrap)
#endif
#if defined(NEW_FUNCTOR_CLASSES)
$(deriveEq2 ''TyCon1)
$(deriveEq2 ''TyCon#)
$(deriveEq2 ''TyCon2)
$(deriveEq2 ''Empty)
$(deriveOrd2 ''TyCon1)
$(deriveOrd2 ''TyCon#)
$(deriveOrd2 ''TyCon2)
$(deriveOrd2 ''Empty)
#endif
#if MIN_VERSION_template_haskell(2,7,0)
-- Data families
$(deriveEq 'TyFamily1A)
$(deriveEq 'TyFamily#)
$(deriveEq 'TyFamilyClassConstraints)
instance (Eq (f a), Eq (f (g a)), Eq (f (g (h a))))
=> Eq (TyFamilyWrap f g h a) where
(==) = $(makeEq 'TyFamilyWrap1)
(/=) = $(makeNotEq 'TyFamilyWrap1)
$(deriveEq1 'TyFamily1B)
$(deriveEq1 'TyFamily#)
$(deriveEq1 'TyFamilyEqualityConstraints)
$(deriveOrd 'TyFamily1A)
$(deriveOrd 'TyFamily#)
$(deriveOrd 'TyFamilyClassConstraints)
instance (Ord (f a), Ord (f (g a)), Ord (f (g (h a))))
=> Ord (TyFamilyWrap f g h a) where
compare = $(makeCompare 'TyFamilyWrap1)
(>) = $(makeLT 'TyFamilyWrap1)
(>=) = $(makeLE 'TyFamilyWrap1)
(<) = $(makeGT 'TyFamilyWrap1)
(<=) = $(makeGE 'TyFamilyWrap1)
max = $(makeMax 'TyFamilyWrap1)
min = $(makeMin 'TyFamilyWrap1)
$(deriveOrd1 'TyFamily1B)
$(deriveOrd1 'TyFamily#)
$(deriveOrd1 'TyFamilyEqualityConstraints)
#if defined(NEW_FUNCTOR_CLASSES)
$(deriveEq1 'TyFamilyWrap2)
$(deriveOrd1 'TyFamilyWrap2)
#else
instance (Eq1 f, Functor f, Eq1 g, Functor g, Eq1 h)
=> Eq1 (TyFamilyWrap f g h) where
eq1 = $(makeEq1 'TyFamilyWrap3)
instance (Ord1 f, Functor f, Ord1 g, Functor g, Ord1 h)
=> Ord1 (TyFamilyWrap f g h) where
compare1 = $(makeCompare1 'TyFamilyWrap3)
#endif
# if defined(NEW_FUNCTOR_CLASSES)
$(deriveEq2 'TyFamily1C)
$(deriveEq2 'TyFamily#)
$(deriveEq2 'TyFamilyTypeRefinement1)
$(deriveOrd2 'TyFamily1C)
$(deriveOrd2 'TyFamily#)
$(deriveOrd2 'TyFamilyTypeRefinement1)
# endif
#endif
|
