-
Notifications
You must be signed in to change notification settings - Fork 519
/
PureConcGenerators.scala
53 lines (41 loc) · 1.71 KB
/
PureConcGenerators.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
/*
* Copyright 2020-2023 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.kernel
package testkit
import cats.effect.kernel.testkit.pure._
import org.scalacheck.{Arbitrary, Cogen}
object PureConcGenerators {
import OutcomeGenerators._
implicit def cogenPureConc[E: Cogen, A: Cogen]: Cogen[PureConc[E, A]] =
Cogen[Outcome[Option, E, A]].contramap(run(_))
def generators[E: Arbitrary: Cogen] =
new GenSpawnGenerators[PureConc[E, *], E] {
val arbitraryE: Arbitrary[E] = implicitly[Arbitrary[E]]
val cogenE: Cogen[E] = Cogen[E]
val F: GenSpawn[PureConc[E, *], E] = allocateForPureConc[E]
def cogenCase[A: Cogen]: Cogen[Outcome[PureConc[E, *], E, A]] =
OutcomeGenerators.cogenOutcome[PureConc[E, *], E, A]
override def recursiveGen[B: Arbitrary: Cogen](deeper: GenK[PureConc[E, *]]) =
super
.recursiveGen[B](deeper)
.filterNot(
_._1 == "racePair"
) // remove the racePair generator since it reifies nondeterminism, which cannot be law-tested
}
implicit def arbitraryPureConc[E: Arbitrary: Cogen, A: Arbitrary: Cogen]
: Arbitrary[PureConc[E, A]] =
Arbitrary(generators[E].generators[A])
}