/
ApplicativeErrorTests.scala
103 lines (98 loc) · 4.74 KB
/
ApplicativeErrorTests.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
/*
* 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
package laws
package discipline
import cats.data.EitherT
import cats.laws.discipline.SemigroupalTests.Isomorphisms
import cats.laws.discipline.arbitrary._
import org.scalacheck.{Arbitrary, Cogen, Prop}
import org.scalacheck.Prop.forAll
trait ApplicativeErrorTests[F[_], E] extends ApplicativeTests[F] {
def laws: ApplicativeErrorLaws[F, E]
def applicativeError[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]],
EqE: Eq[E],
EqFEitherEU: Eq[F[Either[E, Unit]]],
EqFEitherEA: Eq[F[Either[E, A]]],
EqEitherTFEA: Eq[EitherT[F, E, A]],
EqFABC: Eq[F[(A, B, C)]],
iso: Isomorphisms[F]
): RuleSet =
new RuleSet {
def name: String = "applicativeError"
def bases: Seq[(String, RuleSet)] = Nil
def parents: Seq[RuleSet] = Seq(applicative[A, B, C])
def props: Seq[(String, Prop)] =
Seq(
"applicativeError handleWith" -> forAll(laws.applicativeErrorHandleWith[A] _),
"applicativeError handle" -> forAll(laws.applicativeErrorHandle[A] _),
"applicativeError handleErrorWith pure" -> forAll(laws.handleErrorWithPure[A] _),
"applicativeError handleError pure" -> forAll(laws.handleErrorPure[A] _),
"applicativeError raiseError attempt" -> forAll(laws.raiseErrorAttempt _),
"applicativeError pure attempt" -> forAll(laws.pureAttempt[A] _),
"applicativeError handleErrorWith consistent with recoverWith" -> forAll(
laws.handleErrorWithConsistentWithRecoverWith[A] _
),
"applicativeError handleError consistent with recover" -> forAll(laws.handleErrorConsistentWithRecover[A] _),
"applicativeError recover consistent with recoverWith" -> forAll(laws.recoverConsistentWithRecoverWith[A] _),
"applicativeError attempt consistent with attemptT" -> forAll(laws.attemptConsistentWithAttemptT[A] _),
"applicativeError attempt fromEither consistent with pure" -> forAll(
laws.attemptFromEitherConsistentWithPure[A] _
),
"applicativeError voidError consistent with void+handleError" -> forAll { (a: A) =>
// Should be an implicit parameter but that is not a binary-compatible change
implicit val eqFUnit: Eq[F[Unit]] = makeEqFUnit[A](a)
forAll(laws.voidErrorConsistentWithHandleError _)
},
"applicativeError onError pure" -> forAll(laws.onErrorPure[A] _),
"applicativeError onError raise" -> forAll(laws.onErrorRaise[A] _),
"applicativeError adaptError pure" -> forAll(laws.adaptErrorPure[A] _),
"applicativeError adaptError raise" -> forAll(laws.adaptErrorRaise[A] _),
"applicativeError redeem is derived from attempt and map" -> forAll(laws.redeemDerivedFromAttemptMap[A, B] _),
"applicativeError handleError . raiseError left-distributes over ap" -> forAll(
laws.raiseErrorDistributesOverApLeft[A] _
),
"applicativeError handleError . raiseError right-distributes over ap" -> forAll(
laws.raiseErrorDistributesOverApRight[A] _
)
)
}
}
object ApplicativeErrorTests {
def apply[F[_], E](implicit FE: ApplicativeError[F, E]): ApplicativeErrorTests[F, E] =
new ApplicativeErrorTests[F, E] {
def laws: ApplicativeErrorLaws[F, E] = ApplicativeErrorLaws[F, E]
}
}