ce46d8432f780d499116864a7b505f80e74328d9
[darcs-mirrors/vector.git] / tests / Tests / Vector.hs
1 module Tests.Vector (tests) where
2
3 import Boilerplater
4 import Utilities
5
6 import qualified Data.Vector.Generic as V
7 import qualified Data.Vector
8 import qualified Data.Vector.Primitive
9 import qualified Data.Vector.Storable
10 import qualified Data.Vector.Unboxed
11 import qualified Data.Vector.Fusion.Stream as S
12
13 import Test.QuickCheck
14
15 import Test.Framework
16 import Test.Framework.Providers.QuickCheck2
17
18 import Text.Show.Functions ()
19 import Data.List
20 import System.Random (Random)
21
22 #define COMMON_CONTEXT(a, v) \
23 VANILLA_CONTEXT(a, v), VECTOR_CONTEXT(a, v)
24
25 #define VANILLA_CONTEXT(a, v) \
26 Eq a, Show a, Arbitrary a, CoArbitrary a, TestData a, Model a ~ a, EqTest a ~ Property
27
28 #define VECTOR_CONTEXT(a, v) \
29 Eq (v a), Show (v a), Arbitrary (v a), CoArbitrary (v a), TestData (v a), Model (v a) ~ [a], EqTest (v a) ~ Property, V.Vector v a
30
31 -- TODO: implement Vector equivalents of list functions for some of the commented out properties
32
33 -- TODO: test and implement some of these other Prelude functions:
34 -- mapM *
35 -- mapM_ *
36 -- sequence
37 -- sequence_
38 -- sum *
39 -- product *
40 -- scanl *
41 -- scanl1 *
42 -- scanr *
43 -- scanr1 *
44 -- lookup *
45 -- lines
46 -- words
47 -- unlines
48 -- unwords
49 -- NB: this is an exhaustive list of all Prelude list functions that make sense for vectors.
50 -- Ones with *s are the most plausible candidates.
51
52 -- TODO: add tests for the other extra functions
53 -- IVector exports still needing tests:
54 -- copy,
55 -- slice,
56 -- (//), update, bpermute,
57 -- prescanl, prescanl',
58 -- new,
59 -- unsafeSlice, unsafeIndex,
60 -- vlength, vnew
61
62 -- TODO: test non-IVector stuff?
63
64 testSanity :: forall a v. (COMMON_CONTEXT(a, v)) => v a -> [Test]
65 testSanity _ = [
66 testProperty "fromList.toList == id" prop_fromList_toList,
67 testProperty "toList.fromList == id" prop_toList_fromList,
68 testProperty "unstream.stream == id" prop_unstream_stream,
69 testProperty "stream.unstream == id" prop_stream_unstream
70 ]
71 where
72 prop_fromList_toList (v :: v a) = (V.fromList . V.toList) v == v
73 prop_toList_fromList (l :: [a]) = ((V.toList :: v a -> [a]) . V.fromList) l == l
74 prop_unstream_stream (v :: v a) = (V.unstream . V.stream) v == v
75 prop_stream_unstream (s :: S.Stream a) = ((V.stream :: v a -> S.Stream a) . V.unstream) s == s
76
77 testPolymorphicFunctions :: forall a v. (COMMON_CONTEXT(a, v), VECTOR_CONTEXT(Int, v)) => v a -> [Test]
78 testPolymorphicFunctions _ = $(testProperties [
79 'prop_eq,
80
81 'prop_length, 'prop_null,
82
83 'prop_empty, 'prop_singleton, 'prop_replicate,
84 'prop_cons, 'prop_snoc, 'prop_append, 'prop_copy, 'prop_generate,
85
86 'prop_head, 'prop_last, 'prop_index,
87 'prop_unsafeHead, 'prop_unsafeLast, 'prop_unsafeIndex,
88
89 'prop_slice, 'prop_init, 'prop_tail, 'prop_take, 'prop_drop,
90
91 'prop_accum, 'prop_upd, 'prop_backpermute, 'prop_reverse,
92
93 'prop_map, 'prop_zipWith, 'prop_zipWith3,
94 'prop_imap, 'prop_izipWith, 'prop_izipWith3,
95
96 'prop_filter, 'prop_ifilter, 'prop_takeWhile, 'prop_dropWhile,
97 'prop_span, 'prop_break,
98
99 'prop_elem, 'prop_notElem,
100 'prop_find, 'prop_findIndex, 'prop_findIndices,
101 'prop_elemIndex, 'prop_elemIndices,
102
103 'prop_foldl, 'prop_foldl1, 'prop_foldl', 'prop_foldl1',
104 'prop_foldr, 'prop_foldr1, 'prop_foldr', 'prop_foldr1',
105 'prop_ifoldl, 'prop_ifoldl', 'prop_ifoldr, 'prop_ifoldr',
106
107 'prop_all, 'prop_any,
108
109 'prop_prescanl, 'prop_prescanl',
110 'prop_postscanl, 'prop_postscanl',
111 'prop_scanl, 'prop_scanl', 'prop_scanl1, 'prop_scanl1',
112
113 'prop_prescanr, 'prop_prescanr',
114 'prop_postscanr, 'prop_postscanr',
115 'prop_scanr, 'prop_scanr', 'prop_scanr1, 'prop_scanr1',
116
117 'prop_concatMap {- ,
118 'prop_unfoldr -}
119 ])
120 where
121 -- Prelude
122 prop_eq :: P (v a -> v a -> Bool) = (==) `eq` (==)
123
124 prop_length :: P (v a -> Int) = V.length `eq` length
125 prop_null :: P (v a -> Bool) = V.null `eq` null
126
127 prop_empty :: P (v a) = V.empty `eq` []
128 prop_singleton :: P (a -> v a) = V.singleton `eq` singleton
129 prop_replicate :: P (Int -> a -> v a)
130 = (\n _ -> n < 1000) ===> V.replicate `eq` replicate
131 prop_cons :: P (a -> v a -> v a) = V.cons `eq` (:)
132 prop_snoc :: P (v a -> a -> v a) = V.snoc `eq` snoc
133 prop_append :: P (v a -> v a -> v a) = (V.++) `eq` (++)
134 prop_copy :: P (v a -> v a) = V.copy `eq` id
135 prop_generate :: P (Int -> (Int -> a) -> v a)
136 = (\n _ -> n < 1000) ===> V.generate `eq` generate
137
138 prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
139 prop_last :: P (v a -> a) = not . V.null ===> V.last `eq` last
140 prop_index = \xs ->
141 not (V.null xs) ==>
142 forAll (choose (0, V.length xs-1)) $ \i ->
143 unP prop xs i
144 where
145 prop :: P (v a -> Int -> a) = (V.!) `eq` (!!)
146 prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
147 prop_unsafeLast :: P (v a -> a) = not . V.null ===> V.unsafeLast `eq` last
148 prop_unsafeIndex = \xs ->
149 not (V.null xs) ==>
150 forAll (choose (0, V.length xs-1)) $ \i ->
151 unP prop xs i
152 where
153 prop :: P (v a -> Int -> a) = V.unsafeIndex `eq` (!!)
154
155 prop_slice = \xs ->
156 forAll (choose (0, V.length xs)) $ \i ->
157 forAll (choose (0, V.length xs - i)) $ \n ->
158 unP prop i n xs
159 where
160 prop :: P (Int -> Int -> v a -> v a) = V.slice `eq` slice
161
162 prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
163 prop_init :: P (v a -> v a) = not . V.null ===> V.init `eq` init
164 prop_take :: P (Int -> v a -> v a) = V.take `eq` take
165 prop_drop :: P (Int -> v a -> v a) = V.drop `eq` drop
166
167 prop_accum = \f xs ->
168 forAll (index_value_pairs (V.length xs)) $ \ps ->
169 unP prop f xs ps
170 where
171 prop :: P ((a -> a -> a) -> v a -> [(Int,a)] -> v a)
172 = V.accum `eq` accum
173
174 prop_upd = \xs ->
175 forAll (index_value_pairs (V.length xs)) $ \ps ->
176 unP prop xs ps
177 where
178 prop :: P (v a -> [(Int,a)] -> v a) = (V.//) `eq` (//)
179
180 prop_backpermute = \xs ->
181 forAll (indices (V.length xs)) $ \is ->
182 unP prop xs (V.fromList is)
183 where
184 prop :: P (v a -> v Int -> v a) = V.backpermute `eq` backpermute
185
186 prop_reverse :: P (v a -> v a) = V.reverse `eq` reverse
187
188 prop_map :: P ((a -> a) -> v a -> v a) = V.map `eq` map
189 prop_zipWith :: P ((a -> a -> a) -> v a -> v a -> v a) = V.zipWith `eq` zipWith
190 prop_zipWith3 :: P ((a -> a -> a -> a) -> v a -> v a -> v a -> v a)
191 = V.zipWith3 `eq` zipWith3
192 prop_imap :: P ((Int -> a -> a) -> v a -> v a) = V.imap `eq` imap
193 prop_izipWith :: P ((Int -> a -> a -> a) -> v a -> v a -> v a) = V.izipWith `eq` izipWith
194 prop_izipWith3 :: P ((Int -> a -> a -> a -> a) -> v a -> v a -> v a -> v a)
195 = V.izipWith3 `eq` izipWith3
196
197 prop_filter :: P ((a -> Bool) -> v a -> v a) = V.filter `eq` filter
198 prop_ifilter :: P ((Int -> a -> Bool) -> v a -> v a) = V.ifilter `eq` ifilter
199 prop_takeWhile :: P ((a -> Bool) -> v a -> v a) = V.takeWhile `eq` takeWhile
200 prop_dropWhile :: P ((a -> Bool) -> v a -> v a) = V.dropWhile `eq` dropWhile
201 prop_span :: P ((a -> Bool) -> v a -> (v a, v a)) = V.span `eq` span
202 prop_break :: P ((a -> Bool) -> v a -> (v a, v a)) = V.break `eq` break
203
204 prop_elem :: P (a -> v a -> Bool) = V.elem `eq` elem
205 prop_notElem :: P (a -> v a -> Bool) = V.notElem `eq` notElem
206 prop_find :: P ((a -> Bool) -> v a -> Maybe a) = V.find `eq` find
207 prop_findIndex :: P ((a -> Bool) -> v a -> Maybe Int)
208 = V.findIndex `eq` findIndex
209 prop_findIndices :: P ((a -> Bool) -> v a -> v Int)
210 = V.findIndices `eq` findIndices
211 prop_elemIndex :: P (a -> v a -> Maybe Int) = V.elemIndex `eq` elemIndex
212 prop_elemIndices :: P (a -> v a -> v Int) = V.elemIndices `eq` elemIndices
213
214 prop_foldl :: P ((a -> a -> a) -> a -> v a -> a) = V.foldl `eq` foldl
215 prop_foldl1 :: P ((a -> a -> a) -> v a -> a) = notNull2 ===>
216 V.foldl1 `eq` foldl1
217 prop_foldl' :: P ((a -> a -> a) -> a -> v a -> a) = V.foldl' `eq` foldl'
218 prop_foldl1' :: P ((a -> a -> a) -> v a -> a) = notNull2 ===>
219 V.foldl1' `eq` foldl1'
220 prop_foldr :: P ((a -> a -> a) -> a -> v a -> a) = V.foldr `eq` foldr
221 prop_foldr1 :: P ((a -> a -> a) -> v a -> a) = notNull2 ===>
222 V.foldr1 `eq` foldr1
223 prop_foldr' :: P ((a -> a -> a) -> a -> v a -> a) = V.foldr' `eq` foldr
224 prop_foldr1' :: P ((a -> a -> a) -> v a -> a) = notNull2 ===>
225 V.foldr1' `eq` foldr1
226 prop_ifoldl :: P ((a -> Int -> a -> a) -> a -> v a -> a)
227 = V.ifoldl `eq` ifoldl
228 prop_ifoldl' :: P ((a -> Int -> a -> a) -> a -> v a -> a)
229 = V.ifoldl' `eq` ifoldl
230 prop_ifoldr :: P ((Int -> a -> a -> a) -> a -> v a -> a)
231 = V.ifoldr `eq` ifoldr
232 prop_ifoldr' :: P ((Int -> a -> a -> a) -> a -> v a -> a)
233 = V.ifoldr' `eq` ifoldr
234
235 prop_all :: P ((a -> Bool) -> v a -> Bool) = V.all `eq` all
236 prop_any :: P ((a -> Bool) -> v a -> Bool) = V.any `eq` any
237
238 prop_prescanl :: P ((a -> a -> a) -> a -> v a -> v a)
239 = V.prescanl `eq` prescanl
240 prop_prescanl' :: P ((a -> a -> a) -> a -> v a -> v a)
241 = V.prescanl' `eq` prescanl
242 prop_postscanl :: P ((a -> a -> a) -> a -> v a -> v a)
243 = V.postscanl `eq` postscanl
244 prop_postscanl' :: P ((a -> a -> a) -> a -> v a -> v a)
245 = V.postscanl' `eq` postscanl
246 prop_scanl :: P ((a -> a -> a) -> a -> v a -> v a)
247 = V.scanl `eq` scanl
248 prop_scanl' :: P ((a -> a -> a) -> a -> v a -> v a)
249 = V.scanl' `eq` scanl
250 prop_scanl1 :: P ((a -> a -> a) -> v a -> v a) = notNull2 ===>
251 V.scanl1 `eq` scanl1
252 prop_scanl1' :: P ((a -> a -> a) -> v a -> v a) = notNull2 ===>
253 V.scanl1' `eq` scanl1
254
255 prop_prescanr :: P ((a -> a -> a) -> a -> v a -> v a)
256 = V.prescanr `eq` prescanr
257 prop_prescanr' :: P ((a -> a -> a) -> a -> v a -> v a)
258 = V.prescanr' `eq` prescanr
259 prop_postscanr :: P ((a -> a -> a) -> a -> v a -> v a)
260 = V.postscanr `eq` postscanr
261 prop_postscanr' :: P ((a -> a -> a) -> a -> v a -> v a)
262 = V.postscanr' `eq` postscanr
263 prop_scanr :: P ((a -> a -> a) -> a -> v a -> v a)
264 = V.scanr `eq` scanr
265 prop_scanr' :: P ((a -> a -> a) -> a -> v a -> v a)
266 = V.scanr' `eq` scanr
267 prop_scanr1 :: P ((a -> a -> a) -> v a -> v a) = notNull2 ===>
268 V.scanr1 `eq` scanr1
269 prop_scanr1' :: P ((a -> a -> a) -> v a -> v a) = notNull2 ===>
270 V.scanr1' `eq` scanr1
271
272 prop_concatMap = forAll arbitrary $ \xs ->
273 forAll (sized (\n -> resize (n `div` V.length xs) arbitrary)) $ \f -> unP prop f xs
274 where
275 prop :: P ((a -> v a) -> v a -> v a) = V.concatMap `eq` concatMap
276
277 --prop_span = (V.span :: (a -> Bool) -> v a -> (v a, v a)) `eq2` span
278 --prop_break = (V.break :: (a -> Bool) -> v a -> (v a, v a)) `eq2` break
279 --prop_splitAt = (V.splitAt :: Int -> v a -> (v a, v a)) `eq2` splitAt
280 --prop_all = (V.all :: (a -> Bool) -> v a -> Bool) `eq2` all
281 --prop_any = (V.any :: (a -> Bool) -> v a -> Bool) `eq2` any
282
283 -- Data.List
284 --prop_findIndices = V.findIndices `eq2` (findIndices :: (a -> Bool) -> v a -> v Int)
285 --prop_isPrefixOf = V.isPrefixOf `eq2` (isPrefixOf :: v a -> v a -> Bool)
286 --prop_elemIndex = V.elemIndex `eq2` (elemIndex :: a -> v a -> Maybe Int)
287 --prop_elemIndices = V.elemIndices `eq2` (elemIndices :: a -> v a -> v Int)
288 --
289 --prop_mapAccumL = eq3
290 -- (V.mapAccumL :: (X -> W -> (X,W)) -> X -> B -> (X, B))
291 -- ( mapAccumL :: (X -> W -> (X,W)) -> X -> [W] -> (X, [W]))
292 --
293 --prop_mapAccumR = eq3
294 -- (V.mapAccumR :: (X -> W -> (X,W)) -> X -> B -> (X, B))
295 -- ( mapAccumR :: (X -> W -> (X,W)) -> X -> [W] -> (X, [W]))
296
297 -- Because the vectors are strict, we need to be totally sure that the unfold eventually terminates. This
298 -- is achieved by injecting our own bit of state into the unfold - the maximum number of unfolds allowed.
299 limitUnfolds f (theirs, ours) | ours >= 0
300 , Just (out, theirs') <- f theirs = Just (out, (theirs', ours - 1))
301 | otherwise = Nothing
302 prop_unfoldr :: P (Int -> (Int -> Maybe (a,Int)) -> Int -> v a)
303 = (\n f a -> V.unfoldr (limitUnfolds f) (a, n))
304 `eq` (\n f a -> unfoldr (limitUnfolds f) (a, n))
305
306
307 testTuplyFunctions:: forall a v. (COMMON_CONTEXT(a, v), VECTOR_CONTEXT((a, a), v), VECTOR_CONTEXT((a, a, a), v)) => v a -> [Test]
308 testTuplyFunctions _ = $(testProperties ['prop_zip, 'prop_zip3, 'prop_unzip, 'prop_unzip3])
309 where
310 prop_zip :: P (v a -> v a -> v (a, a)) = V.zip `eq` zip
311 prop_zip3 :: P (v a -> v a -> v a -> v (a, a, a)) = V.zip3 `eq` zip3
312 prop_unzip :: P (v (a, a) -> (v a, v a)) = V.unzip `eq` unzip
313 prop_unzip3 :: P (v (a, a, a) -> (v a, v a, v a)) = V.unzip3 `eq` unzip3
314
315 testOrdFunctions :: forall a v. (COMMON_CONTEXT(a, v), Ord a, Ord (v a)) => v a -> [Test]
316 testOrdFunctions _ = $(testProperties
317 ['prop_compare,
318 'prop_maximum, 'prop_minimum,
319 'prop_minIndex, 'prop_maxIndex ])
320 where
321 prop_compare :: P (v a -> v a -> Ordering) = compare `eq` compare
322 prop_maximum :: P (v a -> a) = not . V.null ===> V.maximum `eq` maximum
323 prop_minimum :: P (v a -> a) = not . V.null ===> V.minimum `eq` minimum
324 prop_minIndex :: P (v a -> Int) = not . V.null ===> V.minIndex `eq` minIndex
325 prop_maxIndex :: P (v a -> Int) = not . V.null ===> V.maxIndex `eq` maxIndex
326
327 testEnumFunctions :: forall a v. (COMMON_CONTEXT(a, v), Enum a, Ord a, Num a, Random a) => v a -> [Test]
328 testEnumFunctions _ = $(testProperties ['prop_enumFromTo, 'prop_enumFromThenTo])
329 where
330 prop_enumFromTo = \m ->
331 forAll (choose (-2,100)) $ \n ->
332 unP prop m (m+n)
333 where
334 prop :: P (a -> a -> v a) = V.enumFromTo `eq` enumFromTo
335
336 prop_enumFromThenTo = \i j ->
337 j /= i ==>
338 forAll (choose (ks i j)) $ \k ->
339 unP prop i j k
340 where
341 prop :: P (a -> a -> a -> v a) = V.enumFromThenTo `eq` enumFromThenTo
342
343 ks i j | j < i = (i-d*100, i+d*2)
344 | otherwise = (i-d*2, i+d*100)
345 where
346 d = abs (j-i)
347
348 testBoolFunctions :: forall v. (COMMON_CONTEXT(Bool, v)) => v Bool -> [Test]
349 testBoolFunctions _ = $(testProperties ['prop_and, 'prop_or])
350 where
351 prop_and :: P (v Bool -> Bool) = V.and `eq` and
352 prop_or :: P (v Bool -> Bool) = V.or `eq` or
353
354 testNumFunctions :: forall a v. (COMMON_CONTEXT(a, v), Num a) => v a -> [Test]
355 testNumFunctions _ = $(testProperties ['prop_sum, 'prop_product])
356 where
357 prop_sum :: P (v a -> a) = V.sum `eq` sum
358 prop_product :: P (v a -> a) = V.product `eq` product
359
360 testNestedVectorFunctions :: forall a v. (COMMON_CONTEXT(a, v)) => v a -> [Test]
361 testNestedVectorFunctions _ = $(testProperties [])
362 where
363 -- Prelude
364 --prop_concat = (V.concat :: [v a] -> v a) `eq1` concat
365
366 -- Data.List
367 --prop_transpose = V.transpose `eq1` (transpose :: [v a] -> [v a])
368 --prop_group = V.group `eq1` (group :: v a -> [v a])
369 --prop_inits = V.inits `eq1` (inits :: v a -> [v a])
370 --prop_tails = V.tails `eq1` (tails :: v a -> [v a])
371
372
373 testGeneralBoxedVector dummy = concatMap ($ dummy) [
374 testSanity,
375 testPolymorphicFunctions,
376 testOrdFunctions,
377 testTuplyFunctions,
378 testNestedVectorFunctions
379 ]
380
381 testBoolBoxedVector dummy = concatMap ($ dummy)
382 [
383 testGeneralBoxedVector
384 , testBoolFunctions
385 ]
386
387 testNumericBoxedVector dummy = concatMap ($ dummy)
388 [
389 testGeneralBoxedVector
390 , testNumFunctions
391 , testEnumFunctions
392 ]
393
394
395
396 testGeneralPrimitiveVector dummy = concatMap ($ dummy) [
397 testSanity,
398 testPolymorphicFunctions,
399 testOrdFunctions
400 ]
401
402 testBoolPrimitiveVector dummy = concatMap ($ dummy)
403 [
404 testGeneralPrimitiveVector
405 , testBoolFunctions
406 ]
407
408 testNumericPrimitiveVector dummy = concatMap ($ dummy)
409 [
410 testGeneralPrimitiveVector
411 , testNumFunctions
412 , testEnumFunctions
413 ]
414
415
416
417 testGeneralStorableVector dummy = concatMap ($ dummy) [
418 testSanity,
419 testPolymorphicFunctions,
420 testOrdFunctions
421 ]
422
423 testNumericStorableVector dummy = concatMap ($ dummy)
424 [
425 testGeneralStorableVector
426 , testNumFunctions
427 , testEnumFunctions
428 ]
429
430
431
432 testGeneralUnboxedVector dummy = concatMap ($ dummy) [
433 testSanity,
434 testPolymorphicFunctions,
435 testOrdFunctions
436 ]
437
438 testUnitUnboxedVector dummy = concatMap ($ dummy)
439 [
440 testGeneralUnboxedVector
441 ]
442
443 testBoolUnboxedVector dummy = concatMap ($ dummy)
444 [
445 testGeneralUnboxedVector
446 , testBoolFunctions
447 ]
448
449 testNumericUnboxedVector dummy = concatMap ($ dummy)
450 [
451 testGeneralUnboxedVector
452 , testNumFunctions
453 , testEnumFunctions
454 ]
455
456 testTupleUnboxedVector dummy = concatMap ($ dummy)
457 [
458 testGeneralUnboxedVector
459 ]
460
461 tests = [
462 testGroup "Data.Vector.Vector (Bool)" (testBoolBoxedVector (undefined :: Data.Vector.Vector Bool)),
463 testGroup "Data.Vector.Vector (Int)" (testNumericBoxedVector (undefined :: Data.Vector.Vector Int)),
464
465 testGroup "Data.Vector.Primitive.Vector (Int)" (testNumericPrimitiveVector (undefined :: Data.Vector.Primitive.Vector Int)),
466 testGroup "Data.Vector.Primitive.Vector (Double)" (testNumericPrimitiveVector (undefined :: Data.Vector.Primitive.Vector Double)),
467
468 testGroup "Data.Vector.Storable.Vector (Int)" (testNumericStorableVector (undefined :: Data.Vector.Storable.Vector Int)),
469 testGroup "Data.Vector.Storable.Vector (Double)" (testNumericStorableVector (undefined :: Data.Vector.Storable.Vector Double)),
470
471 testGroup "Data.Vector.Unboxed.Vector ()" (testUnitUnboxedVector (undefined :: Data.Vector.Unboxed.Vector ())),
472 testGroup "Data.Vector.Unboxed.Vector (Int)" (testNumericUnboxedVector (undefined :: Data.Vector.Unboxed.Vector Int)),
473 testGroup "Data.Vector.Unboxed.Vector (Double)" (testNumericUnboxedVector (undefined :: Data.Vector.Unboxed.Vector Double)),
474 testGroup "Data.Vector.Unboxed.Vector (Int,Bool)" (testTupleUnboxedVector (undefined :: Data.Vector.Unboxed.Vector (Int,Bool))),
475 testGroup "Data.Vector.Unboxed.Vector (Int,Bool,Int)" (testTupleUnboxedVector (undefined :: Data.Vector.Unboxed.Vector (Int,Bool,Int)))
476
477 ]
478