Source
Function.scala
Linear Supertypes
Comonad[[α](M) ⇒ α], Cobind[[α](M) ⇒ α], Cojoin[[α](M) ⇒ α], Functor[[α](M) ⇒ α], AnyRef, Any
Ordering
1. Alphabetic
2. By inheritance
Inherited
3. Cobind
4. Cojoin
5. Functor
6. AnyRef
7. Any
1. Hide All
2. Show all
Visibility
1. Public
2. All

### Type Members

1. #### trait ComonadLaws extends AnyRef

Definition Classes
2. #### trait FunctorLaw extends AnyRef

Definition Classes
Functor

### 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: (M) ⇒ A)(f: (A) ⇒ B): (M) ⇒ B

Alias for `map`.

Alias for `map`.

Definition Classes
Functor
7. #### final def asInstanceOf[T0]: T0

Definition Classes
Any
8. #### def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
9. #### def cobind[A, B](fa: (M) ⇒ A)(f: ((M) ⇒ A) ⇒ B): (M) ⇒ B

Also know as `extend`

Also know as `extend`

Definition Classes
10. #### val cobindSyntax: CobindSyntax[[α](M) ⇒ α]

Definition Classes
Cobind
11. #### def cojoin[A](a: (M) ⇒ A): (M) ⇒ (M) ⇒ A

Also known as `duplicate`

Also known as `duplicate`

Definition Classes
12. #### val cojoinSyntax: CojoinSyntax[[α](M) ⇒ α]

Definition Classes
Cojoin

Definition Classes

Definition Classes
15. #### def compose[G[_]](implicit G0: Functor[G]): Functor[[α](M) ⇒ G[α]]

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

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

Definition Classes
Functor
16. #### def copoint[A](p: (M) ⇒ A): A

Also known as `extract` / `copure`

Also known as `extract` / `copure`

Definition Classes
17. #### def copure[A](p: (M) ⇒ A): A

alias for `copoint`

alias for `copoint`

Definition Classes
18. #### def counzip[A, B](a: \/[(M) ⇒ A, (M) ⇒ B]): (M) ⇒ \/[A, B]

Definition Classes
Functor
19. #### final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
21. #### def extend[A, B](a: (M) ⇒ A)(f: ((M) ⇒ A) ⇒ B): (M) ⇒ B

Definition Classes
Cojoin
22. #### def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
23. #### def fpair[A](fa: (M) ⇒ A): (M) ⇒ (A, A)

Twin all `A`s in `fa`.

Twin all `A`s in `fa`.

Definition Classes
Functor
24. #### def fproduct[A, B](fa: (M) ⇒ A)(f: (A) ⇒ B): (M) ⇒ (A, B)

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

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

Definition Classes
Functor
25. #### def functorLaw: FunctorLaw

Definition Classes
Functor
26. #### val functorSyntax: FunctorSyntax[[α](M) ⇒ α]

Definition Classes
Functor
27. #### final def getClass(): Class[_]

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

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

Definition Classes
Any
30. #### def lift[A, B](f: (A) ⇒ B): ((M) ⇒ A) ⇒ (M) ⇒ B

Lift `f` into `F`.

Lift `f` into `F`.

Definition Classes
Functor
31. #### def map[A, B](fa: (M) ⇒ A)(f: (A) ⇒ B): (M) ⇒ B

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

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

Definition Classes
32. #### def mapply[A, B](a: A)(f: (M) ⇒ (A) ⇒ B): (M) ⇒ B

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

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

Definition Classes
Functor
33. #### final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
34. #### final def notify(): Unit

Definition Classes
AnyRef
35. #### final def notifyAll(): Unit

Definition Classes
AnyRef
36. #### def product[G[_]](implicit G0: Functor[G]): Functor[[α]((M) ⇒ α, G[α])]

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

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

Definition Classes
Functor
37. #### def strengthL[A, B](a: A, f: (M) ⇒ B): (M) ⇒ (A, B)

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

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

Definition Classes
Functor
38. #### def strengthR[A, B](f: (M) ⇒ A, b: B): (M) ⇒ (A, B)

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

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

Definition Classes
Functor
39. #### final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
40. #### def toString(): String

Definition Classes
AnyRef → Any
41. #### def void[A](fa: (M) ⇒ A): (M) ⇒ Unit

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

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

Definition Classes
Functor
42. #### final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )