-
Notifications
You must be signed in to change notification settings - Fork 61
/
CensorTests.scala
56 lines (50 loc) · 1.78 KB
/
CensorTests.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
/*
* Copyright 2021 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
package mtl
package laws
package discipline
import org.scalacheck.Prop.{forAll => ∀}
import org.scalacheck.{Arbitrary, Cogen}
import cats.kernel.laws.discipline.catsLawsIsEqToProp
trait CensorTests[F[_], L] extends ListenTests[F, L] {
def laws: CensorLaws[F, L]
def censor[A: Arbitrary, B: Arbitrary](
implicit ArbFA: Arbitrary[F[A]],
ArbL: Arbitrary[L],
CogenL: Cogen[L],
EqFU: Eq[F[Unit]],
EqFA: Eq[F[A]],
EqFAB: Eq[F[(A, B)]],
EqFUL: Eq[F[(Unit, L)]]): RuleSet = {
new DefaultRuleSet(
name = "censor",
parent = Some(listen[A, B]),
"tell leftProduct is tell combined" -> ∀(laws.tellLeftProductHomomorphism _),
"tell rightProduct is tell combined" -> ∀(laws.tellRightProductHomomorphism _),
"censor with pure is tell with empty" -> ∀(laws.censorWithPurIsTellEmpty[A] _),
"tell and clear is pure unit" -> ∀(laws.tellAndClearIsPureUnit _),
"clear is idempotent" -> ∀(laws.clearIsIdempotent[A] _)
)
}
}
object CensorTests {
def apply[F[_], L](implicit instance0: Censor[F, L]): CensorTests[F, L] = {
new CensorTests[F, L] {
override def laws: CensorLaws[F, L] = CensorLaws[F, L]
}
}
}