trait
NaturalTransformation[F[_], G[_]] extends AnyRef
Abstract Value Members
-
abstract
def
apply[A](fa: F[A]): G[A]
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
andThen[H[_]](f: ~>[G, H]): ~>[F, H]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
compose[E[_]](f: ~>[E, F]): ~>[E, G]
-
-
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
narrow[FF[_]](implicit ev: <~~<[FF, F]): ~>[FF, G]
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
or[H[_]](hg: ~>[H, G]): ~>[[γ$0$]Coproduct[F, H, γ$0$], G]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
widen[GG[_]](implicit ev: >~~>[GG, G]): ~>[F, GG]
A universally quantified function, usually written as
F ~> G
, for symmetry withA => B
.Can be used to encode first-class functor transformations in the same way functions encode first-class concrete value morphisms; for example,
sequence
from scalaz.Traverse andcosequence
from scalaz.Distributive give rise to([a]T[A[a]]) ~> ([a]A[T[a]])
, for varyingA
andT
constraints.