/
SyncTests.scala
89 lines (80 loc) · 3.76 KB
/
SyncTests.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
/*
* Copyright (c) 2017-2019 The Typelevel Cats-effect Project Developers
*
* 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
package effect
package laws
package discipline
import cats.data._
import cats.laws.discipline._
import cats.laws.discipline.SemigroupalTests.Isomorphisms
import org.scalacheck._, Prop.forAll
trait SyncTests[F[_]] extends BracketTests[F, Throwable] {
def laws: SyncLaws[F]
def sync[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]],
ArbT: Arbitrary[Throwable],
CogenA: Cogen[A],
CogenB: Cogen[B],
CogenC: Cogen[C],
CogenT: Cogen[Throwable],
EqFA: Eq[F[A]],
EqFB: Eq[F[B]],
EqFC: Eq[F[C]],
EqFU: Eq[F[Unit]],
EqT: Eq[Throwable],
EqFEitherTU: Eq[F[Either[Throwable, Unit]]],
EqFEitherTA: Eq[F[Either[Throwable, A]]],
EqEitherTFTA: Eq[EitherT[F, Throwable, A]],
EqFABC: Eq[F[(A, B, C)]],
EqFInt: Eq[F[Int]],
iso: Isomorphisms[F],
params: Parameters): RuleSet = {
new RuleSet {
val name = "sync"
val bases = Nil
val parents = Seq(bracket[A, B, C])
val props = Seq(
"delay constant is pure" -> forAll(laws.delayConstantIsPure[A] _),
"suspend constant is pure join" -> forAll(laws.suspendConstantIsPureJoin[A] _),
"throw in delay is raiseError" -> forAll(laws.delayThrowIsRaiseError[A] _),
"throw in suspend is raiseError" -> forAll(laws.suspendThrowIsRaiseError[A] _),
"unsequenced delay is no-op" -> forAll(laws.unsequencedDelayIsNoop[A] _),
"repeated sync evaluation not memoized" -> forAll(laws.repeatedSyncEvaluationNotMemoized[A] _),
"propagate errors through bind (suspend)" -> forAll(laws.propagateErrorsThroughBindSuspend[A] _),
"bind suspends evaluation" -> forAll(laws.bindSuspendsEvaluation[A] _),
"map suspends evaluation" -> forAll(laws.mapSuspendsEvaluation[A] _),
"stack-safe on left-associated binds" -> Prop.lzy(laws.stackSafetyOnRepeatedLeftBinds(params.stackSafeIterationsCount)),
"stack-safe on right-associated binds" -> Prop.lzy(laws.stackSafetyOnRepeatedRightBinds(params.stackSafeIterationsCount)),
"stack-safe on repeated attempts" -> Prop.lzy(laws.stackSafetyOnRepeatedAttempts(params.stackSafeIterationsCount)),
"stack-safe on repeated maps" -> Prop.lzy(laws.stackSafetyOnRepeatedMaps(params.stackSafeIterationsCount)),
"stack-safe on bracket with left-associated binds" -> Prop.lzy(laws.stackSafetyOfBracketOnRepeatedLeftBinds(params.stackSafeIterationsCount)),
"stack-safe on bracket with right-associated binds" -> Prop.lzy(laws.stackSafetyOfBracketOnRepeatedRightBinds(params.stackSafeIterationsCount)),
"stack-safe on guarantee with left-associated binds" -> Prop.lzy(laws.stackSafetyOfGuaranteeOnRepeatedLeftBinds(params.stackSafeIterationsCount)),
"stack-safe on guarantee with right-associated binds" -> Prop.lzy(laws.stackSafetyOfGuaranteeOnRepeatedRightBinds(params.stackSafeIterationsCount)))
}
}
}
object SyncTests {
def apply[F[_]: Sync]: SyncTests[F] = new SyncTests[F] {
def laws = SyncLaws[F]
}
}