trait Contravariant[F[-_]] extends ContravariantSubset[F, AnyType] with Invariant[F]
Contravariant[F]
provides implicit evidence that F[-_]
is a
contravariant endofunctor in the category of Scala objects.
Contravariant
instances of type F[A]
"consume" values of type A
in
some sense. For example, Equal[A]
takes two values of type A
as input
and returns a Boolean
indicating whether they are equal. Similarly, a
Ord[A]
takes two values of type A
as input and returns an Ordering
with the result of comparing them and Hash
takes an A
value and returns
an Int
.
Common examples of contravariant instances in ZIO include effects with regard to their environment types, sinks with regard to their input type, and polymorphic queues and references regarding their input types.
Contravariant
instances support a contramap
operation, which allows
transforming the input type given a function from the new input type to the
old input type. For example, if we have an Ord[Int]
that allows us to
compare two integers and we have a function String => Int
that returns
the length of a string, then we can construct an Ord[String]
that
compares strings by computing their lengths with the provided function and
comparing those.
- Self Type
- Contravariant[F]
- Alphabetic
- By Inheritance
- Contravariant
- Invariant
- ContravariantSubset
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Abstract Value Members
- abstract def contramap[A, B](f: (B) => A): (F[A]) => F[B]
Lift a function from
B
toA
to a function fromF[A]
toF[B]
.
Concrete Value Members
- final def compose[G[+_]](implicit g: Covariant[G]): Contravariant[[-A]F[G[A]]]
Compose contravariant and covariant functors.
- final def compose[G[-_]](implicit g: Contravariant[G]): Covariant[[+A]F[G[A]]]
Compose two contravariant functors.
- final def compose[G[_]](implicit g: Invariant[G]): Invariant[[A]F[G[A]]]
Compose two invariant functors.
Compose two invariant functors.
- Definition Classes
- Invariant
- def compositionLaw[A, B, C](fa: F[A], f: <=>[A, B], g: <=>[B, C])(implicit equal: Equal[F[C]]): Boolean
- Definition Classes
- Invariant
- final def contramapSubset[A, B](f: (B) => A)(implicit arg0: AnyType[B]): (F[A]) => F[B]
- Definition Classes
- Contravariant → ContravariantSubset
- def identityLaw1[A](fa: F[A])(implicit equal: Equal[F[A]]): Boolean
- Definition Classes
- Invariant
- final def invmap[A, B](f: <=>[A, B]): <=>[F[A], F[B]]
- Definition Classes
- Contravariant → Invariant