scalaz

ApplicativePlus

trait ApplicativePlus[F[_]] extends Applicative[F] with PlusEmpty[F]

scalaz.Applicative combined with scalaz.PlusEmpty.

Self Type
ApplicativePlus[F]
Source
ApplicativePlus.scala
Linear Supertypes
PlusEmpty[F], Plus[F], Applicative[F], Apply[F], Functor[F], AnyRef, Any
Known Subclasses
Ordering
1. Alphabetic
2. By inheritance
Inherited
1. ApplicativePlus
2. PlusEmpty
3. Plus
4. Applicative
5. Apply
6. Functor
7. AnyRef
8. Any
1. Hide All
2. Show all
Visibility
1. Public
2. All

Type Members

1. trait ApplicativeLaw extends FunctorLaw

Definition Classes
Applicative
2. trait EmptyLaw extends PlusLaw

Definition Classes
PlusEmpty
3. trait FunctorLaw extends AnyRef

Definition Classes
Functor
4. trait PlusLaw extends AnyRef

Definition Classes
Plus

Abstract Value Members

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

Definition Classes
Apply
2. abstract def empty[A]: F[A]

Definition Classes
PlusEmpty
3. abstract def plus[A](a: F[A], b: ⇒ F[A]): F[A]

Definition Classes
Plus
4. abstract def point[A](a: ⇒ A): F[A]

Definition Classes
Applicative

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 ap2[A, B, C](fa: ⇒ F[A], fb: ⇒ F[B])(f: F[(A, B) ⇒ C]): F[C]

Definition Classes
Apply
7. def ap3[A, B, C, D](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C])(f: F[(A, B, C) ⇒ D]): F[D]

Definition Classes
Apply
8. def ap4[A, B, C, D, E](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D])(f: F[(A, B, C, D) ⇒ E]): F[E]

Definition Classes
Apply
9. def ap5[A, B, C, D, E, R](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E])(f: F[(A, B, C, D, E) ⇒ R]): F[R]

Definition Classes
Apply
10. def ap6[A, B, C, D, E, FF, R](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E], ff: ⇒ F[FF])(f: F[(A, B, C, D, E, FF) ⇒ R]): F[R]

Definition Classes
Apply
11. def ap7[A, B, C, D, E, FF, G, R](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E], ff: ⇒ F[FF], fg: ⇒ F[G])(f: F[(A, B, C, D, E, FF, G) ⇒ R]): F[R]

Definition Classes
Apply
12. def ap8[A, B, C, D, E, FF, G, H, R](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E], ff: ⇒ F[FF], fg: ⇒ F[G], fh: ⇒ F[H])(f: F[(A, B, C, D, E, FF, G, H) ⇒ R]): F[R]

Definition Classes
Apply
13. def apF[A, B](f: ⇒ F[(A) ⇒ B]): (F[A]) ⇒ F[B]

Flipped variant of `ap`.

Flipped variant of `ap`.

Definition Classes
Apply
14. def applicativeLaw: ApplicativeLaw

Definition Classes
Applicative

16. val applicativeSyntax: ApplicativeSyntax[F]

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

Alias for `map`.

Alias for `map`.

Definition Classes
Functor
18. def apply10[A, B, C, D, E, FF, G, H, I, J, R](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E], ff: ⇒ F[FF], fg: ⇒ F[G], fh: ⇒ F[H], fi: ⇒ F[I], fj: ⇒ F[J])(f: (A, B, C, D, E, FF, G, H, I, J) ⇒ R): F[R]

Definition Classes
Apply
19. def apply11[A, B, C, D, E, FF, G, H, I, J, K, R](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E], ff: ⇒ F[FF], fg: ⇒ F[G], fh: ⇒ F[H], fi: ⇒ F[I], fj: ⇒ F[J], fk: ⇒ F[K])(f: (A, B, C, D, E, FF, G, H, I, J, K) ⇒ R): F[R]

Definition Classes
Apply
20. def apply12[A, B, C, D, E, FF, G, H, I, J, K, L, R](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E], ff: ⇒ F[FF], fg: ⇒ F[G], fh: ⇒ F[H], fi: ⇒ F[I], fj: ⇒ F[J], fk: ⇒ F[K], fl: ⇒ F[L])(f: (A, B, C, D, E, FF, G, H, I, J, K, L) ⇒ R): F[R]

Definition Classes
Apply
21. def apply2[A, B, C](fa: ⇒ F[A], fb: ⇒ F[B])(f: (A, B) ⇒ C): F[C]

Definition Classes
ApplicativeApply
22. def apply3[A, B, C, D](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C])(f: (A, B, C) ⇒ D): F[D]

Definition Classes
Apply
23. def apply4[A, B, C, D, E](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D])(f: (A, B, C, D) ⇒ E): F[E]

Definition Classes
Apply
24. def apply5[A, B, C, D, E, R](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E])(f: (A, B, C, D, E) ⇒ R): F[R]

Definition Classes
Apply
25. def apply6[A, B, C, D, E, FF, R](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E], ff: ⇒ F[FF])(f: (A, B, C, D, E, FF) ⇒ R): F[R]

Definition Classes
Apply
26. def apply7[A, B, C, D, E, FF, G, R](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E], ff: ⇒ F[FF], fg: ⇒ F[G])(f: (A, B, C, D, E, FF, G) ⇒ R): F[R]

Definition Classes
Apply
27. def apply8[A, B, C, D, E, FF, G, H, R](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E], ff: ⇒ F[FF], fg: ⇒ F[G], fh: ⇒ F[H])(f: (A, B, C, D, E, FF, G, H) ⇒ R): F[R]

Definition Classes
Apply
28. def apply9[A, B, C, D, E, FF, G, H, I, R](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E], ff: ⇒ F[FF], fg: ⇒ F[G], fh: ⇒ F[H], fi: ⇒ F[I])(f: (A, B, C, D, E, FF, G, H, I) ⇒ R): F[R]

Definition Classes
Apply
29. val applySyntax: ApplySyntax[F]

Definition Classes
Apply
30. final def asInstanceOf[T0]: T0

Definition Classes
Any
31. def clone(): AnyRef

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

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

33. def compose[G[_]](implicit G0: Applicative[G]): Applicative[[α]F[G[α]]]

The composition of Applicatives `F` and `G`, `[x]F[G[x]]`, is an Applicative

The composition of Applicatives `F` and `G`, `[x]F[G[x]]`, is an Applicative

Definition Classes
Applicative
34. def compose[G[_]](implicit G0: Apply[G]): Apply[[α]F[G[α]]]

The composition of Applys `F` and `G`, `[x]F[G[x]]`, is a Apply

The composition of Applys `F` and `G`, `[x]F[G[x]]`, is a Apply

Definition Classes
Apply
35. def compose[G[_]](implicit G0: Functor[G]): Functor[[α]F[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
36. def counzip[A, B](a: \/[F[A], F[B]]): F[\/[A, B]]

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

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

Definition Classes
AnyRef → Any
39. def filterM[A](l: List[A])(f: (A) ⇒ F[Boolean]): F[List[A]]

Filter `l` according to an applicative predicate.

Filter `l` according to an applicative predicate.

Definition Classes
Applicative
40. def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
41. def flip: Applicative[F]

An `Applicative` for `F` in which effects happen in the opposite order.

An `Applicative` for `F` in which effects happen in the opposite order.

Definition Classes
Applicative
42. def fpair[A](fa: F[A]): F[(A, A)]

Twin all `A`s in `fa`.

Twin all `A`s in `fa`.

Definition Classes
Functor
43. 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.

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

Definition Classes
Functor
44. def functorLaw: FunctorLaw

Definition Classes
Functor
45. val functorSyntax: FunctorSyntax[F]

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

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

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

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

Lift `f` into `F`.

Lift `f` into `F`.

Definition Classes
Functor
50. def lift10[A, B, C, D, E, FF, G, H, I, J, R](f: (A, B, C, D, E, FF, G, H, I, J) ⇒ R): (F[A], F[B], F[C], F[D], F[E], F[FF], F[G], F[H], F[I], F[J]) ⇒ F[R]

Definition Classes
Apply
51. def lift11[A, B, C, D, E, FF, G, H, I, J, K, R](f: (A, B, C, D, E, FF, G, H, I, J, K) ⇒ R): (F[A], F[B], F[C], F[D], F[E], F[FF], F[G], F[H], F[I], F[J], F[K]) ⇒ F[R]

Definition Classes
Apply
52. def lift12[A, B, C, D, E, FF, G, H, I, J, K, L, R](f: (A, B, C, D, E, FF, G, H, I, J, K, L) ⇒ R): (F[A], F[B], F[C], F[D], F[E], F[FF], F[G], F[H], F[I], F[J], F[K], F[L]) ⇒ F[R]

Definition Classes
Apply
53. def lift2[A, B, C](f: (A, B) ⇒ C): (F[A], F[B]) ⇒ F[C]

Definition Classes
Apply
54. def lift3[A, B, C, D](f: (A, B, C) ⇒ D): (F[A], F[B], F[C]) ⇒ F[D]

Definition Classes
Apply
55. def lift4[A, B, C, D, E](f: (A, B, C, D) ⇒ E): (F[A], F[B], F[C], F[D]) ⇒ F[E]

Definition Classes
Apply
56. def lift5[A, B, C, D, E, R](f: (A, B, C, D, E) ⇒ R): (F[A], F[B], F[C], F[D], F[E]) ⇒ F[R]

Definition Classes
Apply
57. def lift6[A, B, C, D, E, FF, R](f: (A, B, C, D, E, FF) ⇒ R): (F[A], F[B], F[C], F[D], F[E], F[FF]) ⇒ F[R]

Definition Classes
Apply
58. def lift7[A, B, C, D, E, FF, G, R](f: (A, B, C, D, E, FF, G) ⇒ R): (F[A], F[B], F[C], F[D], F[E], F[FF], F[G]) ⇒ F[R]

Definition Classes
Apply
59. def lift8[A, B, C, D, E, FF, G, H, R](f: (A, B, C, D, E, FF, G, H) ⇒ R): (F[A], F[B], F[C], F[D], F[E], F[FF], F[G], F[H]) ⇒ F[R]

Definition Classes
Apply
60. def lift9[A, B, C, D, E, FF, G, H, I, R](f: (A, B, C, D, E, FF, G, H, I) ⇒ R): (F[A], F[B], F[C], F[D], F[E], F[FF], F[G], F[H], F[I]) ⇒ F[R]

Definition Classes
Apply
61. def many[A](a: F[A]): F[List[A]]

A list of results acquired by repeating `a`.

A list of results acquired by repeating `a`. Never `empty`; initial failure is an empty list instead.

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

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

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

Definition Classes
ApplicativeFunctor
63. def mapply[A, B](a: A)(f: F[(A) ⇒ B]): F[B]

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

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

Definition Classes
Functor
64. def monoid[A]: Monoid[F[A]]

Definition Classes
PlusEmpty
65. final def ne(arg0: AnyRef): Boolean

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

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

Definition Classes
AnyRef
68. def plusEmptyLaw: EmptyLaw

Definition Classes
PlusEmpty
69. val plusEmptySyntax: PlusEmptySyntax[F]

Definition Classes
PlusEmpty
70. def plusLaw: PlusLaw

Definition Classes
Plus
71. val plusSyntax: PlusSyntax[F]

Definition Classes
Plus
72. def product[G[_]](implicit G0: ApplicativePlus[G]): ApplicativePlus[[α](F[α], G[α])]

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

73. def product[G[_]](implicit G0: Applicative[G]): Applicative[[α](F[α], G[α])]

The product of Applicatives `F` and `G`, `[x](F[x], G[x]])`, is an Applicative

The product of Applicatives `F` and `G`, `[x](F[x], G[x]])`, is an Applicative

Definition Classes
Applicative
74. def product[G[_]](implicit G0: Apply[G]): Apply[[α](F[α], G[α])]

The product of Applys `F` and `G`, `[x](F[x], G[x]])`, is a Apply

The product of Applys `F` and `G`, `[x](F[x], G[x]])`, is a Apply

Definition Classes
Apply
75. 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

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

Definition Classes
Functor
76. def pure[A](a: ⇒ A): F[A]

Definition Classes
Applicative
77. def replicateM[A](n: Int, fa: F[A]): F[List[A]]

Performs the action `n` times, returning the list of results.

Performs the action `n` times, returning the list of results.

Definition Classes
Applicative
78. def replicateM_[A](n: Int, fa: F[A]): F[Unit]

Performs the action `n` times, returning nothing.

Performs the action `n` times, returning nothing.

Definition Classes
Applicative
79. def semigroup[A]: Semigroup[F[A]]

Definition Classes
Plus
80. def sequence[A, G[_]](as: G[F[A]])(implicit arg0: Traverse[G]): F[G[A]]

Definition Classes
Applicative
81. def sequence1[A, G[_]](as: G[F[A]])(implicit arg0: Traverse1[G]): F[G[A]]

Definition Classes
Apply
82. def some[A](a: F[A]): F[List[A]]

`empty` or a non-empty list of results acquired by repeating `a`.

83. def strengthL[A, B](a: A, f: F[B]): F[(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
84. def strengthR[A, B](f: F[A], b: B): F[(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
85. final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
86. def toString(): String

Definition Classes
AnyRef → Any
87. def traverse[A, G[_], B](value: G[A])(f: (A) ⇒ F[B])(implicit G: Traverse[G]): F[G[B]]

Definition Classes
Applicative
88. def traverse1[A, G[_], B](value: G[A])(f: (A) ⇒ F[B])(implicit G: Traverse1[G]): F[G[B]]

Definition Classes
Apply
89. def tuple2[A, B](fa: ⇒ F[A], fb: ⇒ F[B]): F[(A, B)]

Definition Classes
Apply
90. def tuple3[A, B, C](fa: ⇒ F[A], fb: ⇒ F[B], fc: F[C]): F[(A, B, C)]

Definition Classes
Apply
91. def tuple4[A, B, C, D](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D]): F[(A, B, C, D)]

Definition Classes
Apply
92. def tuple5[A, B, C, D, E](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E]): F[(A, B, C, D, E)]

Definition Classes
Apply
93. def void[A](fa: F[A]): F[Unit]

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

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

Definition Classes
Functor
94. final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )
97. def zip: Zip[F]

scalaz.Zip derived from `tuple2`.

scalaz.Zip derived from `tuple2`.

Definition Classes
Apply

Deprecated Value Members

1. def map2[A, B, C](fa: ⇒ F[A], fb: ⇒ F[B])(f: (A, B) ⇒ C): F[C]

Definition Classes
Apply
Annotations
@deprecated
Deprecated

(Since version 7) given `F: Apply[F]` use `F(a,b)(f)` instead, or given `implicitly[Apply[F]]`, use `^(a,b)(f)`

2. def map3[A, B, C, D](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C])(f: (A, B, C) ⇒ D): F[D]

Definition Classes
Apply
Annotations
@deprecated
Deprecated

(Since version 7) given `F: Apply[F]` use `F(a,b,c)(f)` instead, or given `implicitly[Apply[F]]`, use `^(a,b,c)(f)`

3. def map4[A, B, C, D, E](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D])(f: (A, B, C, D) ⇒ E): F[E]

Definition Classes
Apply
Annotations
@deprecated
Deprecated

(Since version 7) given `F: Apply[F]` use `F(a,b,c,d)(f)` instead, or given `implicitly[Apply[F]]`, use `^(a,b,c,d)(f)`