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
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
|
{-# LANGUAGE TemplateHaskell #-}
module Tests.Set (setTests) where
import Data.Foldable
import Data.Functor.Identity
import Data.Semigroup.Foldable
import qualified Data.Set as S
import qualified Data.Set.NonEmpty as NES
import qualified Data.Set.NonEmpty.Internal as NES
import Hedgehog
import qualified Hedgehog.Gen as Gen
import qualified Hedgehog.Range as Range
import Test.Tasty
import Tests.Util
setTests :: TestTree
setTests = groupTree $$discover
prop_valid :: Property
prop_valid =
property $
assert . NES.valid =<< forAll neSetGen
prop_valid_toSet :: Property
prop_valid_toSet = property $ do
assert . S.valid . NES.toSet =<< forAll neSetGen
prop_valid_insertMinSet :: Property
prop_valid_insertMinSet = property $ do
n <- forAll $ do
m <- setGen
let k = maybe dummyKey (subtract 1) $ S.lookupMin m
pure $ NES.insertMinSet k m
assert $ S.valid n
prop_valid_insertMaxSet :: Property
prop_valid_insertMaxSet = property $ do
n <- forAll $ do
m <- setGen
let k = maybe dummyKey (+ 1) $ S.lookupMax m
pure $ NES.insertMaxSet k m
assert $ S.valid n
prop_valid_insertSetMin :: Property
prop_valid_insertSetMin = property $ do
n <- forAll $ do
m <- setGen
let k = maybe dummyKey (subtract 1) $ S.lookupMin m
pure $ NES.insertSetMin k m
assert $ NES.valid n
prop_valid_insertSetMax :: Property
prop_valid_insertSetMax = property $ do
n <- forAll $ do
m <- setGen
let k = maybe dummyKey (+ 1) $ S.lookupMax m
pure $ NES.insertSetMax k m
assert $ NES.valid n
prop_toSetIso1 :: Property
prop_toSetIso1 = property $ do
m0 <- forAll setGen
tripping
m0
NES.nonEmptySet
(Identity . maybe S.empty NES.toSet)
prop_toSetIso2 :: Property
prop_toSetIso2 = property $ do
m0 <- forAll $ Gen.maybe neSetGen
tripping
m0
(maybe S.empty NES.toSet)
(Identity . NES.nonEmptySet)
prop_read_show :: Property
prop_read_show = readShow neSetGen
prop_show_show1 :: Property
prop_show_show1 = showShow1 neSetGen
prop_splitRoot :: Property
prop_splitRoot = property $ do
n <- forAll neSetGen
let rs = NES.splitRoot n
n' = foldl1 NES.merge rs
assert $ NES.valid n'
mapM_ (assert . (`NES.isSubsetOf` n)) rs
n === n'
prop_insertSet :: Property
prop_insertSet =
ttProp
(GTKey :-> GTSet :-> TTNESet)
S.insert
NES.insertSet
prop_singleton :: Property
prop_singleton =
ttProp
(GTKey :-> TTNESet)
S.singleton
NES.singleton
prop_fromAscList :: Property
prop_fromAscList =
ttProp
(GTSorted STAsc (GTNEList Nothing (GTKey :&: GTVal)) :-> TTNESet)
(S.fromAscList . fmap fst)
(NES.fromAscList . fmap fst)
prop_fromDescList :: Property
prop_fromDescList =
ttProp
(GTSorted STDesc (GTNEList Nothing (GTKey :&: GTVal)) :-> TTNESet)
(S.fromDescList . fmap fst)
(NES.fromDescList . fmap fst)
prop_fromDistinctAscList :: Property
prop_fromDistinctAscList =
ttProp
(GTSorted STAsc (GTNEList Nothing GTKey) :-> TTNESet)
S.fromDistinctAscList
NES.fromDistinctAscList
prop_fromDistinctDescList :: Property
prop_fromDistinctDescList =
ttProp
(GTSorted STDesc (GTNEList Nothing GTKey) :-> TTNESet)
S.fromDistinctDescList
NES.fromDistinctDescList
prop_fromList :: Property
prop_fromList =
ttProp
(GTNEList Nothing GTKey :-> TTNESet)
S.fromList
NES.fromList
prop_powerSet :: Property
prop_powerSet =
ttProp
(GTNESet :-> TTNEList TTNESet)
(S.toList . S.drop 1 . S.powerSet)
(NES.toList . NES.powerSet)
prop_insert :: Property
prop_insert =
ttProp
(GTKey :-> GTNESet :-> TTNESet)
S.insert
NES.insert
prop_delete :: Property
prop_delete =
ttProp
(GTKey :-> GTNESet :-> TTSet)
S.delete
NES.delete
prop_member :: Property
prop_member =
ttProp
(GTKey :-> GTNESet :-> TTOther)
S.member
NES.member
prop_notMember :: Property
prop_notMember =
ttProp
(GTKey :-> GTNESet :-> TTOther)
S.notMember
NES.notMember
prop_lookupLT :: Property
prop_lookupLT =
ttProp
(GTKey :-> GTNESet :-> TTMaybe TTKey)
S.lookupLT
NES.lookupLT
prop_lookupGT :: Property
prop_lookupGT =
ttProp
(GTKey :-> GTNESet :-> TTMaybe TTKey)
S.lookupGT
NES.lookupGT
prop_lookupLE :: Property
prop_lookupLE =
ttProp
(GTKey :-> GTNESet :-> TTMaybe TTKey)
S.lookupLE
NES.lookupLE
prop_lookupGE :: Property
prop_lookupGE =
ttProp
(GTKey :-> GTNESet :-> TTMaybe TTKey)
S.lookupGE
NES.lookupGE
prop_size :: Property
prop_size =
ttProp
(GTNESet :-> TTOther)
S.size
NES.size
prop_isSubsetOf :: Property
prop_isSubsetOf =
ttProp
(GTNESet :-> GTNESet :-> TTOther)
S.isSubsetOf
NES.isSubsetOf
prop_isProperSubsetOf :: Property
prop_isProperSubsetOf =
ttProp
(GTNESet :-> GTNESet :-> TTOther)
S.isProperSubsetOf
NES.isProperSubsetOf
prop_disjoint :: Property
prop_disjoint =
ttProp
(GTNESet :-> GTNESet :-> TTOther)
S.disjoint
NES.disjoint
prop_union :: Property
prop_union =
ttProp
(GTNESet :-> GTNESet :-> TTNESet)
S.union
NES.union
prop_unions :: Property
prop_unions =
ttProp
(GTNEList (Just (Range.linear 2 5)) GTNESet :-> TTNESet)
S.unions
NES.unions
prop_difference :: Property
prop_difference =
ttProp
(GTNESet :-> GTNESet :-> TTSet)
S.difference
NES.difference
prop_intersection :: Property
prop_intersection =
ttProp
(GTNESet :-> GTNESet :-> TTSet)
S.intersection
NES.intersection
prop_cartesianProduct :: Property
prop_cartesianProduct =
ttProp
(GTNESet :-> GTNESet :-> TTNEList (TTKey :*: TTKey))
(\xs -> S.toList . S.cartesianProduct xs)
(\xs -> NES.toList . NES.cartesianProduct xs)
prop_disjointUnion :: Property
prop_disjointUnion =
ttProp
(GTNESet :-> GTNESet :-> TTNEList (TTEither TTKey TTKey))
(\xs -> S.toList . S.disjointUnion xs)
(\xs -> NES.toList . NES.disjointUnion xs)
prop_filter :: Property
prop_filter =
ttProp
(gf1 Gen.bool :?> GTNESet :-> TTSet)
S.filter
NES.filter
prop_takeWhileAntitone :: Property
prop_takeWhileAntitone =
ttProp
(GTNESet :-> TTSet)
(S.takeWhileAntitone ((< 0) . getKX))
(NES.takeWhileAntitone ((< 0) . getKX))
prop_dropWhileAntitone :: Property
prop_dropWhileAntitone =
ttProp
(GTNESet :-> TTSet)
(S.dropWhileAntitone ((< 0) . getKX))
(NES.dropWhileAntitone ((< 0) . getKX))
prop_spanAntitone :: Property
prop_spanAntitone =
ttProp
(GTNESet :-> TTThese TTNESet TTNESet)
(S.spanAntitone ((< 0) . getKX))
(NES.spanAntitone ((< 0) . getKX))
prop_partition :: Property
prop_partition =
ttProp
(gf1 Gen.bool :?> GTNESet :-> TTThese TTNESet TTNESet)
S.partition
NES.partition
prop_split :: Property
prop_split =
ttProp
(GTKey :-> GTNESet :-> TTMThese TTNESet TTNESet)
S.split
NES.split
prop_splitMember :: Property
prop_splitMember =
ttProp
(GTKey :-> GTNESet :-> TTOther :*: TTMThese TTNESet TTNESet)
(\k -> (\(x, y, z) -> (y, (x, z))) . S.splitMember k)
NES.splitMember
prop_lookupIndex :: Property
prop_lookupIndex =
ttProp
(GTKey :-> GTNESet :-> TTMaybe TTOther)
S.lookupIndex
NES.lookupIndex
prop_elemAt :: Property
prop_elemAt =
ttProp
(GTSize :-> GTNESet :-> TTKey)
(\i m -> S.elemAt (i `mod` S.size m) m)
(\i m -> NES.elemAt (i `mod` NES.size m) m)
prop_deleteAt :: Property
prop_deleteAt =
ttProp
(GTSize :-> GTNESet :-> TTSet)
(\i m -> S.deleteAt (i `mod` S.size m) m)
(\i m -> NES.deleteAt (i `mod` NES.size m) m)
prop_take :: Property
prop_take =
ttProp
(GTSize :-> GTNESet :-> TTSet)
S.take
NES.take
prop_drop :: Property
prop_drop =
ttProp
(GTSize :-> GTNESet :-> TTSet)
S.drop
NES.drop
prop_splitAt :: Property
prop_splitAt =
ttProp
(GTSize :-> GTNESet :-> TTThese TTNESet TTNESet)
S.splitAt
NES.splitAt
prop_map :: Property
prop_map =
ttProp
(gf1 keyGen :?> GTNESet :-> TTNESet)
S.map
NES.map
prop_mapMonotonic :: Property
prop_mapMonotonic =
ttProp
(GF valGen go :?> GTNESet :-> TTNESet)
S.mapMonotonic
NES.mapMonotonic
where
go f (K i t) = K (i * 2) (f t)
prop_foldr :: Property
prop_foldr =
ttProp
( gf2 valGen
:?> GTOther valGen
:-> GTNESet
:-> TTOther
)
S.foldr
NES.foldr
prop_foldl :: Property
prop_foldl =
ttProp
( gf2 valGen
:?> GTOther valGen
:-> GTNESet
:-> TTOther
)
S.foldl
NES.foldl
prop_foldr1 :: Property
prop_foldr1 =
ttProp
( gf2 keyGen
:?> GTNESet
:-> TTOther
)
foldr1
NES.foldr1
prop_foldl1 :: Property
prop_foldl1 =
ttProp
( gf2 keyGen
:?> GTNESet
:-> TTOther
)
foldl1
NES.foldl1
prop_foldr' :: Property
prop_foldr' =
ttProp
( gf2 keyGen
:?> GTOther keyGen
:-> GTNESet
:-> TTOther
)
S.foldr'
NES.foldr'
prop_foldl' :: Property
prop_foldl' =
ttProp
( gf2 keyGen
:?> GTOther keyGen
:-> GTNESet
:-> TTOther
)
S.foldl'
NES.foldl'
prop_foldr1' :: Property
prop_foldr1' =
ttProp
( gf2 keyGen
:?> GTNESet
:-> TTOther
)
foldr1
NES.foldr1'
prop_foldl1' :: Property
prop_foldl1' =
ttProp
( gf2 keyGen
:?> GTNESet
:-> TTOther
)
foldl1
NES.foldl1'
prop_findMin :: Property
prop_findMin =
ttProp
(GTNESet :-> TTKey)
S.findMin
NES.findMin
prop_findMax :: Property
prop_findMax =
ttProp
(GTNESet :-> TTKey)
S.findMax
NES.findMax
prop_deleteMin :: Property
prop_deleteMin =
ttProp
(GTNESet :-> TTSet)
S.deleteMin
NES.deleteMin
prop_deleteMax :: Property
prop_deleteMax =
ttProp
(GTNESet :-> TTSet)
S.deleteMax
NES.deleteMax
prop_deleteFindMin :: Property
prop_deleteFindMin =
ttProp
(GTNESet :-> TTKey :*: TTSet)
S.deleteFindMin
NES.deleteFindMin
prop_deleteFindMax :: Property
prop_deleteFindMax =
ttProp
(GTNESet :-> TTKey :*: TTSet)
S.deleteFindMax
NES.deleteFindMax
prop_toList :: Property
prop_toList =
ttProp
(GTNESet :-> TTNEList TTKey)
S.toList
NES.toList
prop_toDescList :: Property
prop_toDescList =
ttProp
(GTNESet :-> TTNEList TTKey)
S.toDescList
NES.toDescList
prop_elem :: Property
prop_elem =
ttProp
(GTKey :-> GTNESet :-> TTOther)
elem
elem
prop_fold1 :: Property
prop_fold1 =
ttProp
(GTNESet :-> TTKey)
fold
fold1
prop_fold :: Property
prop_fold =
ttProp
(GTNESet :-> TTKey)
fold
fold
prop_foldMap1 :: Property
prop_foldMap1 =
ttProp
(gf1 keyGen :?> GTNESet :-> TTOther)
(\f -> foldMap ((: []) . f))
(\f -> foldMap1 ((: []) . f))
prop_foldMap :: Property
prop_foldMap =
ttProp
(gf1 keyGen :?> GTNESet :-> TTOther)
(\f -> foldMap ((: []) . f))
(\f -> foldMap ((: []) . f))
|
