trait
Functor[F[_]] extends AnyRef
Abstract Value Members
-
abstract
def
map[A, B](fa: F[A])(f: (A) ⇒ B): F[B]
Concrete Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
def
apply[A, B](fa: F[A])(f: (A) ⇒ B): F[B]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
compose[G[_]](implicit G0: Functor[G]): Functor[[α]F[G[α]]]
-
def
counzip[A, B](a: \/[F[A], F[B]]): F[\/[A, B]]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
fpair[A](fa: F[A]): F[(A, A)]
-
def
fproduct[A, B](fa: F[A])(f: (A) ⇒ B): F[(A, B)]
-
-
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
lift[A, B](f: (A) ⇒ B): (F[A]) ⇒ F[B]
-
def
mapply[A, B](a: A)(f: F[(A) ⇒ B]): F[B]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
product[G[_]](implicit G0: Functor[G]): Functor[[α](F[α], G[α])]
-
def
strengthL[A, B](a: A, f: F[B]): F[(A, B)]
-
def
strengthR[A, B](f: F[A], b: B): F[(A, B)]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
void[A](fa: F[A]): F[Unit]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any
Functors, covariant by nature if not by Scala type. Their key operation is
map
, whose behavior is constrained only by type and the functor laws.Many useful functors also have natural scalaz.Apply or scalaz.Bind operations. Many also support scalaz.Traverse.
scalaz.Functor.FunctorLaw