-
Notifications
You must be signed in to change notification settings - Fork 509
/
GenSpawnTests.scala
230 lines (218 loc) · 8.07 KB
/
GenSpawnTests.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
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
/*
* Copyright 2020-2022 Typelevel
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package cats.effect
package laws
import cats.Eq
import cats.effect.kernel.{GenSpawn, Outcome}
import cats.laws.discipline.SemigroupalTests.Isomorphisms
import org.scalacheck._
import org.scalacheck.Prop.forAll
import org.scalacheck.util.Pretty
trait GenSpawnTests[F[_], E] extends MonadCancelTests[F, E] with UniqueTests[F] {
val laws: GenSpawnLaws[F, E]
@deprecated("revised several constraints", since = "3.2.0")
protected def spawn[A: Arbitrary: Eq, B: Arbitrary: Eq, C: Arbitrary: Eq](
implicit ArbFA: Arbitrary[F[A]],
ArbFB: Arbitrary[F[B]],
ArbFC: Arbitrary[F[C]],
ArbFU: Arbitrary[F[Unit]],
ArbFAtoB: Arbitrary[F[A => B]],
ArbFBtoC: Arbitrary[F[B => C]],
ArbE: Arbitrary[E],
CogenA: Cogen[A],
CogenB: Cogen[B],
CogenC: Cogen[C],
CogenE: Cogen[E],
EqFA: Eq[F[A]],
EqFB: Eq[F[B]],
EqFC: Eq[F[C]],
EqFU: Eq[F[Unit]],
EqE: Eq[E],
EqFAB: Eq[F[Either[A, B]]],
EqFEitherEU: Eq[F[Either[E, Unit]]],
EqFEitherEA: Eq[F[Either[E, A]]],
EqFEitherUA: Eq[F[Either[Unit, A]]],
EqFEitherAU: Eq[F[Either[A, Unit]]],
EqFOutcomeEA: Eq[F[Outcome[F, E, A]]],
EqFOutcomeEU: Eq[F[Outcome[F, E, Unit]]],
EqFABC: Eq[F[(A, B, C)]],
EqFInt: Eq[F[Int]],
iso: Isomorphisms[F],
faPP: F[A] => Pretty,
fuPP: F[Unit] => Pretty,
ePP: E => Pretty,
foaPP: F[Outcome[F, E, A]] => Pretty,
feauPP: F[Either[A, Unit]] => Pretty,
feuaPP: F[Either[Unit, A]] => Pretty,
fouPP: F[Outcome[F, E, Unit]] => Pretty): RuleSet = {
// these are the OLD LAWS retained only for bincompat
new RuleSet {
val name = "concurrent"
val bases = Nil
val parents = Seq(
monadCancel[A, B, C](
implicitly[Arbitrary[A]],
implicitly[Eq[A]],
implicitly[Arbitrary[B]],
implicitly[Eq[B]],
implicitly[Arbitrary[C]],
implicitly[Eq[C]],
ArbFA,
ArbFB,
ArbFC,
ArbFU,
ArbFAtoB,
ArbFBtoC,
ArbE,
CogenA,
CogenB,
CogenC,
CogenE,
EqFA,
EqFB,
EqFC,
EqFU,
EqE,
EqFEitherEU,
EqFEitherEA,
EqFABC,
EqFInt,
iso,
faPP,
fuPP,
ePP
))
val props = Seq(
"race derives from racePair (left)" -> forAll(laws.raceDerivesFromRacePairLeft[A, B] _),
"race derives from racePair (right)" -> forAll(
laws.raceDerivesFromRacePairRight[A, B] _),
"race canceled identity (left)" -> forAll(laws.raceCanceledIdentityLeft[A] _),
"race canceled identity (right)" -> forAll(laws.raceCanceledIdentityRight[A] _),
"race never non-canceled identity (left)" -> forAll(
laws.raceNeverNoncanceledIdentityLeft[A] _),
"race never non-canceled identity (right)" -> forAll(
laws.raceNeverNoncanceledIdentityRight[A] _),
// "race left cede yields" -> forAll(laws.raceLeftCedeYields[A] _),
// "race right cede yields" -> forAll(laws.raceRightCedeYields[A] _),
"fiber pure is completed pure" -> forAll(laws.fiberPureIsOutcomeCompletedPure[A] _),
"fiber error is errored" -> forAll(laws.fiberErrorIsOutcomeErrored _),
"fiber cancelation is canceled" -> laws.fiberCancelationIsOutcomeCanceled,
"fiber canceled is canceled" -> laws.fiberCanceledIsOutcomeCanceled,
"fiber never is never" -> laws.fiberNeverIsNever,
"fiber start of never is unit" -> laws.fiberStartOfNeverIsUnit,
"never dominates over flatMap" -> forAll(laws.neverDominatesOverFlatMap[A] _),
"uncancelable race not inherited" -> laws.uncancelableRaceNotInherited,
"uncancelable canceled is canceled" -> laws.uncancelableCancelCancels,
"uncancelable start is cancelable" -> laws.uncancelableStartIsCancelable,
"forceR never is never" -> forAll(laws.forceRNeverIsNever[A] _)
)
}
}
def spawn[A: Arbitrary: Eq, B: Arbitrary: Eq, C: Arbitrary: Eq](
implicit ArbFA: Arbitrary[F[A]],
ArbFB: Arbitrary[F[B]],
ArbFC: Arbitrary[F[C]],
ArbFU: Arbitrary[F[Unit]],
ArbFAtoB: Arbitrary[F[A => B]],
ArbFBtoC: Arbitrary[F[B => C]],
ArbE: Arbitrary[E],
CogenA: Cogen[A],
CogenB: Cogen[B],
CogenC: Cogen[C],
CogenE: Cogen[E],
CogenOutcomeFEA: Cogen[Outcome[F, E, A]],
EqFA: Eq[F[A]],
EqFB: Eq[F[B]],
EqFC: Eq[F[C]],
EqFU: Eq[F[Unit]],
EqE: Eq[E],
EqFAB: Eq[F[Either[A, B]]],
EqFEitherEU: Eq[F[Either[E, Unit]]],
EqFEitherEA: Eq[F[Either[E, A]]],
EqFEitherUA: Eq[F[Either[Unit, A]]],
EqFEitherAU: Eq[F[Either[A, Unit]]],
EqFOutcomeEA: Eq[F[Outcome[F, E, A]]],
EqFOutcomeEU: Eq[F[Outcome[F, E, Unit]]],
EqFABC: Eq[F[(A, B, C)]],
EqFInt: Eq[F[Int]],
iso: Isomorphisms[F]): RuleSet = {
new RuleSet {
val name = "concurrent"
val bases = Nil
val parents = Seq(
monadCancel[A, B, C](
implicitly[Arbitrary[A]],
implicitly[Eq[A]],
implicitly[Arbitrary[B]],
implicitly[Eq[B]],
implicitly[Arbitrary[C]],
implicitly[Eq[C]],
ArbFA,
ArbFB,
ArbFC,
ArbFU,
ArbFAtoB,
ArbFBtoC,
ArbE,
CogenA,
CogenB,
CogenC,
CogenE,
EqFA,
EqFB,
EqFC,
EqFU,
EqE,
EqFEitherEU,
EqFEitherEA,
EqFABC,
EqFInt,
iso
))
val props = Seq(
"race derives from racePair (left)" -> forAll(laws.raceDerivesFromRacePairLeft[A, B] _),
"race derives from racePair (right)" -> forAll(
laws.raceDerivesFromRacePairRight[A, B] _),
"race canceled identity (left)" -> forAll(laws.raceCanceledIdentityLeft[A] _),
"race canceled identity (right)" -> forAll(laws.raceCanceledIdentityRight[A] _),
"race never non-canceled identity (left)" -> forAll(
laws.raceNeverNoncanceledIdentityLeft[A] _),
"race never non-canceled identity (right)" -> forAll(
laws.raceNeverNoncanceledIdentityRight[A] _),
// "race left cede yields" -> forAll(laws.raceLeftCedeYields[A] _),
// "race right cede yields" -> forAll(laws.raceRightCedeYields[A] _),
"fiber pure is completed pure" -> forAll(laws.fiberPureIsOutcomeCompletedPure[A] _),
"fiber error is errored" -> forAll(laws.fiberErrorIsOutcomeErrored _),
"fiber cancelation is canceled" -> laws.fiberCancelationIsOutcomeCanceled,
"fiber canceled is canceled" -> laws.fiberCanceledIsOutcomeCanceled,
"fiber never is never" -> laws.fiberNeverIsNever,
"fiber start of never is unit" -> laws.fiberStartOfNeverIsUnit,
"fiber join is guaranteeCase" -> forAll(laws.fiberJoinIsGuaranteeCase[A] _),
"never dominates over flatMap" -> forAll(laws.neverDominatesOverFlatMap[A] _),
"uncancelable race not inherited" -> laws.uncancelableRaceNotInherited,
"uncancelable canceled is canceled" -> laws.uncancelableCancelCancels,
"uncancelable start is cancelable" -> laws.uncancelableStartIsCancelable,
"forceR never is never" -> forAll(laws.forceRNeverIsNever[A] _)
)
}
}
}
object GenSpawnTests {
def apply[F[_], E](implicit F0: GenSpawn[F, E]): GenSpawnTests[F, E] =
new GenSpawnTests[F, E] {
val laws = GenSpawnLaws[F, E]
}
}