-
Notifications
You must be signed in to change notification settings - Fork 99
/
ArbitraryHashSet.scala
98 lines (92 loc) · 3.27 KB
/
ArbitraryHashSet.scala
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
/*
* Copyright (c) 2015 Typelevel
*
* Permission is hereby granted, free of charge, to any person obtaining a copy of
* this software and associated documentation files (the "Software"), to deal in
* the Software without restriction, including without limitation the rights to
* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
* the Software, and to permit persons to whom the Software is furnished to do so,
* subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
* FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
* COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
* IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
package cats.collections.arbitrary
import cats.collections.HashSet
import cats.kernel.Hash
import org.scalacheck.Arbitrary
import org.scalacheck.Arbitrary.arbitrary
import org.scalacheck.Cogen
import org.scalacheck.Gen
import scala.collection.immutable.Seq
trait ArbitraryHashSet {
def hashSetGen[A: Hash: Arbitrary: Cogen]: Gen[HashSet[A]] =
Gen.oneOf(
// empty
Gen.const(HashSet.empty),
// fromSeq
arbitrary[Seq[A]].map(HashSet.fromSeq(_)),
// fromIterableOnce
arbitrary[Seq[A]].map(seq => HashSet.fromIterableOnce(seq.view)),
// fromFoldable
arbitrary[Seq[A]].map(HashSet.fromFoldable(_)),
// add
Gen.delay(for {
hs <- arbitrary[HashSet[A]]
a <- arbitrary[A]
} yield hs.add(a)),
// add existing
Gen.delay(for {
hs <- arbitrary[HashSet[A]]
if hs.nonEmpty
a <- Gen.oneOf(hs.iterator.toList)
} yield hs.add(a)),
// remove
Gen.delay(for {
hs <- arbitrary[HashSet[A]]
a <- arbitrary[A]
} yield hs.remove(a)),
// remove existing
Gen.delay(for {
hs <- arbitrary[HashSet[A]]
if hs.nonEmpty
a <- Gen.oneOf(hs.iterator.toList)
} yield hs.remove(a)),
// union
Gen.delay(for {
left <- arbitrary[HashSet[A]]
right <- arbitrary[HashSet[A]]
} yield left.union(right)),
// diff
Gen.delay(for {
left <- arbitrary[HashSet[A]]
right <- arbitrary[HashSet[A]]
} yield left.diff(right)),
// intersect
Gen.delay(for {
left <- arbitrary[HashSet[A]]
right <- arbitrary[HashSet[A]]
} yield left.intersect(right)),
// filter
Gen.delay(for {
set <- arbitrary[HashSet[A]]
pred <- arbitrary[A => Boolean]
} yield set.filter(pred)),
// filterNot
Gen.delay(for {
set <- arbitrary[HashSet[A]]
pred <- arbitrary[A => Boolean]
} yield set.filterNot(pred))
)
implicit def hashSetCogen[A](implicit A: Cogen[A]): Cogen[HashSet[A]] =
Cogen.it[HashSet[A], A](_.iterator)
implicit def hashSetArbitrary[A: Hash: Arbitrary: Cogen]: Arbitrary[HashSet[A]] =
Arbitrary(hashSetGen)
}