scalaz

Functor

trait Functor[F[_]] extends AnyRef

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.

Self Type
Functor[F]
Source
Functor.scala
Linear Supertypes
AnyRef, Any
Ordering
1. Alphabetic
2. By inheritance
Inherited
1. Functor
2. AnyRef
3. Any
1. Hide All
2. Show all
Visibility
1. Public
2. All

Abstract Value Members

1. abstract def map[A, B](fa: F[A])(f: (A) ⇒ B): F[B]

Lift `f` into `F` and apply to `F[A]`.

Concrete Value Members

1. final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
2. final def !=(arg0: Any): Boolean

Definition Classes
Any
3. final def ##(): Int

Definition Classes
AnyRef → Any
4. final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
5. final def ==(arg0: Any): Boolean

Definition Classes
Any
6. def apply[A, B](fa: F[A])(f: (A) ⇒ B): F[B]

Alias for `map`.

7. final def asInstanceOf[T0]: T0

Definition Classes
Any
8. def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
9. def compose[G[_]](implicit G0: Functor[G]): Functor[[α]F[G[α]]]

The composition of Functors `F` and `G`, `[x]F[G[x]]`, is a Functor

11. final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
12. def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
13. def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
14. def fpair[A](fa: F[A]): F[(A, A)]

Twin all `A`s in `fa`.

15. def fproduct[A, B](fa: F[A])(f: (A) ⇒ B): F[(A, B)]

Pair all `A`s in `fa` with the result of function application.

18. final def getClass(): Class[_]

Definition Classes
AnyRef → Any
19. def hashCode(): Int

Definition Classes
AnyRef → Any
20. final def isInstanceOf[T0]: Boolean

Definition Classes
Any
21. def lift[A, B](f: (A) ⇒ B): (F[A]) ⇒ F[B]

Lift `f` into `F`.

22. def mapply[A, B](a: A)(f: F[(A) ⇒ B]): F[B]

Lift `apply(a)`, and apply the result to `f`.

23. final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
24. final def notify(): Unit

Definition Classes
AnyRef
25. final def notifyAll(): Unit

Definition Classes
AnyRef
26. def product[G[_]](implicit G0: Functor[G]): Functor[[α](F[α], G[α])]

The product of Functors `F` and `G`, `[x](F[x], G[x]])`, is a Functor

27. def strengthL[A, B](a: A, f: F[B]): F[(A, B)]

Inject `a` to the left of `B`s in `f`.

28. def strengthR[A, B](f: F[A], b: B): F[(A, B)]

Inject `b` to the right of `A`s in `f`.

29. final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
30. def toString(): String

Definition Classes
AnyRef → Any
31. def void[A](fa: F[A]): F[Unit]

Empty `fa` of meaningful pure values, preserving its structure.

32. final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
33. final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
34. final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )