Trait

optparse_applicative.internal

MonadP

Related Doc: package internal

Permalink

trait MonadP[F[_]] extends MonadPlus[F]

Source
MonadP.scala
Linear Supertypes
MonadPlus[F], ApplicativePlus[F], PlusEmpty[F], Plus[F], Monad[F], Bind[F], Applicative[F], InvariantApplicative[F], Apply[F], Functor[F], InvariantFunctor[F], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MonadP
  2. MonadPlus
  3. ApplicativePlus
  4. PlusEmpty
  5. Plus
  6. Monad
  7. Bind
  8. Applicative
  9. InvariantApplicative
  10. Apply
  11. Functor
  12. InvariantFunctor
  13. AnyRef
  14. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. trait ApplicativeLaw extends scalaz.Applicative.ApplyLaw

    Permalink
    Definition Classes
    Applicative

  2. trait ApplyLaw extends scalaz.Apply.FunctorLaw

    Permalink
    Definition Classes
    Apply

  3. trait BindLaw extends scalaz.Bind.ApplyLaw

    Permalink
    Definition Classes
    Bind

  4. trait EmptyLaw extends scalaz.PlusEmpty.PlusLaw

    Permalink
    Definition Classes
    PlusEmpty

  5. trait FlippedApply extends Apply[F]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    Apply

  6. trait FunctorLaw extends scalaz.Functor.InvariantFunctorLaw

    Permalink
    Definition Classes
    Functor

  7. trait InvariantFunctorLaw extends AnyRef

    Permalink
    Definition Classes
    InvariantFunctor

  8. trait MonadLaw extends scalaz.Monad.ApplicativeLaw with scalaz.Monad.BindLaw

    Permalink
    Definition Classes
    Monad

  9. trait MonadPlusLaw extends scalaz.MonadPlus.EmptyLaw with scalaz.MonadPlus.MonadLaw

    Permalink
    Definition Classes
    MonadPlus

  10. trait PlusLaw extends AnyRef

    Permalink
    Definition Classes
    Plus

  11. trait StrongMonadPlusLaw extends MonadPlusLaw

    Permalink
    Definition Classes
    MonadPlus

Abstract Value Members

  1. abstract def attempt[A](fa: F[A]): F[\/[ParseError, A]]

    Permalink

  2. abstract def bind[A, B](fa: F[A])(f: (A) ⇒ F[B]): F[B]

    Permalink
    Definition Classes
    Bind

  3. abstract def empty[A]: F[A]

    Permalink
    Definition Classes
    PlusEmpty

  4. abstract def error[A](e: ParseError): F[A]

    Permalink

  5. abstract def exit[A, B](p: types.Parser[B], a: Option[A]): F[A]

    Permalink

  6. abstract def getPrefs: F[ParserPrefs]

    Permalink

  7. abstract def missingArg[A](e: ParseError): F[A]

    Permalink

  8. abstract def plus[A](a: F[A], b: ⇒ F[A]): F[A]

    Permalink
    Definition Classes
    Plus

  9. abstract def point[A](a: ⇒ A): F[A]

    Permalink
    Definition Classes
    Applicative

  10. abstract def setContext[A](s: Option[String], p: types.ParserInfo[A]): F[Unit]

    Permalink

  11. abstract def setParser[A](s: Option[String], p: types.Parser[A]): F[Unit]

    Permalink

Concrete Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    Bind → Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

  7. 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]

    Permalink
    Definition Classes
    Apply

  8. 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]

    Permalink
    Definition Classes
    Apply

  9. 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]

    Permalink
    Definition Classes
    Apply

  10. 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]

    Permalink
    Definition Classes
    Apply

  11. 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]

    Permalink
    Definition Classes
    Apply

  12. def apF[A, B](f: ⇒ F[(A) ⇒ B]): (F[A]) ⇒ F[B]

    Permalink
    Definition Classes
    Apply

  13. def applicativeLaw: ApplicativeLaw

    Permalink
    Definition Classes
    Applicative

  14. val applicativePlusSyntax: ApplicativePlusSyntax[F]

    Permalink
    Definition Classes
    ApplicativePlus

  15. val applicativeSyntax: ApplicativeSyntax[F]

    Permalink
    Definition Classes
    Applicative

  16. def apply[A, B](fa: F[A])(f: (A) ⇒ B): F[B]

    Permalink
    Definition Classes
    Functor

  17. 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]

    Permalink
    Definition Classes
    Apply

  18. 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]

    Permalink
    Definition Classes
    Apply

  19. 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]

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Bind → Apply

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

    Permalink
    Definition Classes
    Apply

  22. 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]

    Permalink
    Definition Classes
    Apply

  23. 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]

    Permalink
    Definition Classes
    Apply

  24. 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]

    Permalink
    Definition Classes
    Apply

  25. 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]

    Permalink
    Definition Classes
    Apply

  26. 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]

    Permalink
    Definition Classes
    Apply

  27. 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]

    Permalink
    Definition Classes
    Apply

  28. def applyApplicative: Applicative[[α]\/[F[α], α]]

    Permalink
    Definition Classes
    Apply

  29. def applyLaw: ApplyLaw

    Permalink
    Definition Classes
    Apply

  30. val applySyntax: ApplySyntax[F]

    Permalink
    Definition Classes
    Apply

  31. final def applying1[Z, A1](f: (A1) ⇒ Z)(implicit a1: F[A1]): F[Z]

    Permalink
    Definition Classes
    Apply

  32. final def applying2[Z, A1, A2](f: (A1, A2) ⇒ Z)(implicit a1: F[A1], a2: F[A2]): F[Z]

    Permalink
    Definition Classes
    Apply

  33. final def applying3[Z, A1, A2, A3](f: (A1, A2, A3) ⇒ Z)(implicit a1: F[A1], a2: F[A2], a3: F[A3]): F[Z]

    Permalink
    Definition Classes
    Apply

  34. final def applying4[Z, A1, A2, A3, A4](f: (A1, A2, A3, A4) ⇒ Z)(implicit a1: F[A1], a2: F[A2], a3: F[A3], a4: F[A4]): F[Z]

    Permalink
    Definition Classes
    Apply

  35. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  36. def bicompose[G[_, _]](implicit arg0: Bifunctor[G]): Bifunctor[[α, β]F[G[α, β]]]

    Permalink
    Definition Classes
    Functor

  37. def bindLaw: BindLaw

    Permalink
    Definition Classes
    Bind

  38. val bindSyntax: BindSyntax[F]

    Permalink
    Definition Classes
    Bind

  39. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    ApplicativePlus → Applicative

  41. def compose[G[_]]: PlusEmpty[[α]F[G[α]]]

    Permalink
    Definition Classes
    PlusEmpty → Plus

  42. def compose[G[_]](implicit G0: Apply[G]): Apply[[α]F[G[α]]]

    Permalink
    Definition Classes
    Apply

  43. def compose[G[_]](implicit G0: Functor[G]): Functor[[α]F[G[α]]]

    Permalink
    Definition Classes
    Functor

  44. def counzip[A, B](a: \/[F[A], F[B]]): F[\/[A, B]]

    Permalink
    Definition Classes
    Functor

  45. def discardLeft[A, B](fa: ⇒ F[A], fb: ⇒ F[B]): F[B]

    Permalink
    Definition Classes
    Apply

  46. def discardRight[A, B](fa: ⇒ F[A], fb: ⇒ F[B]): F[A]

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    AnyRef

  48. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  49. def filter[A](fa: F[A])(f: (A) ⇒ Boolean): F[A]

    Permalink
    Definition Classes
    MonadPlus

  50. def filterM[A](l: IList[A])(f: (A) ⇒ F[Boolean]): F[IList[A]]

    Permalink
    Definition Classes
    Applicative

  51. def filterM[A](l: List[A])(f: (A) ⇒ F[Boolean]): F[List[A]]

    Permalink
    Definition Classes
    Applicative

  52. def filterM[A, B](map: ==>>[A, B])(f: (B) ⇒ F[Boolean])(implicit O: Order[A]): F[==>>[A, B]]

    Permalink
    Definition Classes
    Applicative

  53. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  54. def flip: Applicative[F]

    Permalink
    Definition Classes
    Applicative → Apply

  55. def forever[A, B](fa: F[A]): F[B]

    Permalink
    Definition Classes
    Apply

  56. def fpair[A](fa: F[A]): F[(A, A)]

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    Functor

  58. def functorLaw: FunctorLaw

    Permalink
    Definition Classes
    Functor

  59. val functorSyntax: FunctorSyntax[F]

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    AnyRef → Any

  61. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  62. def icompose[G[_]](implicit G0: Contravariant[G]): Contravariant[[α]F[G[α]]]

    Permalink
    Definition Classes
    Functor

  63. def ifM[B](value: F[Boolean], ifTrue: ⇒ F[B], ifFalse: ⇒ F[B]): F[B]

    Permalink
    Definition Classes
    Bind

  64. val invariantApplicativeSyntax: InvariantApplicativeSyntax[F]

    Permalink
    Definition Classes
    InvariantApplicative

  65. def invariantFunctorLaw: InvariantFunctorLaw

    Permalink
    Definition Classes
    InvariantFunctor

  66. val invariantFunctorSyntax: InvariantFunctorSyntax[F]

    Permalink
    Definition Classes
    InvariantFunctor

  67. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  68. def iterateUntil[A](f: F[A])(p: (A) ⇒ Boolean): F[A]

    Permalink
    Definition Classes
    Monad

  69. def iterateWhile[A](f: F[A])(p: (A) ⇒ Boolean): F[A]

    Permalink
    Definition Classes
    Monad

  70. def join[A](ffa: F[F[A]]): F[A]

    Permalink
    Definition Classes
    Bind

  71. def lefts[G[_, _], A, B](value: F[G[A, B]])(implicit G: Bifoldable[G]): F[A]

    Permalink
    Definition Classes
    MonadPlus

  72. def lift[A, B](f: (A) ⇒ B): (F[A]) ⇒ F[B]

    Permalink
    Definition Classes
    Functor

  73. 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]

    Permalink
    Definition Classes
    Apply

  74. 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]

    Permalink
    Definition Classes
    Apply

  75. 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]

    Permalink
    Definition Classes
    Apply

  76. def lift2[A, B, C](f: (A, B) ⇒ C): (F[A], F[B]) ⇒ F[C]

    Permalink
    Definition Classes
    Apply

  77. def lift3[A, B, C, D](f: (A, B, C) ⇒ D): (F[A], F[B], F[C]) ⇒ F[D]

    Permalink
    Definition Classes
    Apply

  78. def lift4[A, B, C, D, E](f: (A, B, C, D) ⇒ E): (F[A], F[B], F[C], F[D]) ⇒ F[E]

    Permalink
    Definition Classes
    Apply

  79. 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]

    Permalink
    Definition Classes
    Apply

  80. 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]

    Permalink
    Definition Classes
    Apply

  81. 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]

    Permalink
    Definition Classes
    Apply

  82. 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]

    Permalink
    Definition Classes
    Apply

  83. 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]

    Permalink
    Definition Classes
    Apply

  84. def liftReducer[A, B](implicit r: Reducer[A, B]): Reducer[F[A], F[B]]

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Monad → Applicative → Functor

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

    Permalink
    Definition Classes
    Functor

  87. def monadLaw: MonadLaw

    Permalink
    Definition Classes
    Monad

  88. def monadPlusLaw: MonadPlusLaw

    Permalink
    Definition Classes
    MonadPlus

  89. val monadPlusSyntax: MonadPlusSyntax[F]

    Permalink
    Definition Classes
    MonadPlus

  90. val monadSyntax: MonadSyntax[F]

    Permalink
    Definition Classes
    Monad

  91. def monoid[A]: Monoid[F[A]]

    Permalink
    Definition Classes
    PlusEmpty

  92. def mproduct[A, B](fa: F[A])(f: (A) ⇒ F[B]): F[(A, B)]

    Permalink
    Definition Classes
    Bind

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

    Permalink
    Definition Classes
    AnyRef

  94. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  95. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  96. def par: Par[F]

    Permalink
    Definition Classes
    Applicative

  97. def plusA[A](x: ⇒ F[A], y: ⇒ F[A])(implicit sa: Semigroup[A]): F[A]

    Permalink
    Definition Classes
    Applicative

  98. def plusEmptyLaw: EmptyLaw

    Permalink
    Definition Classes
    PlusEmpty

  99. val plusEmptySyntax: PlusEmptySyntax[F]

    Permalink
    Definition Classes
    PlusEmpty

  100. def plusLaw: PlusLaw

    Permalink
    Definition Classes
    Plus

  101. val plusSyntax: PlusSyntax[F]

    Permalink
    Definition Classes
    Plus

  102. def product[G[_]](implicit G0: MonadPlus[G]): MonadPlus[[α](F[α], G[α])]

    Permalink
    Definition Classes
    MonadPlus

  103. def product[G[_]](implicit G0: ApplicativePlus[G]): ApplicativePlus[[α](F[α], G[α])]

    Permalink
    Definition Classes
    ApplicativePlus

  104. def product[G[_]](implicit G0: PlusEmpty[G]): PlusEmpty[[α](F[α], G[α])]

    Permalink
    Definition Classes
    PlusEmpty

  105. def product[G[_]](implicit G0: Plus[G]): Plus[[α](F[α], G[α])]

    Permalink
    Definition Classes
    Plus

  106. def product[G[_]](implicit G0: Monad[G]): Monad[[α](F[α], G[α])]

    Permalink
    Definition Classes
    Monad

  107. def product[G[_]](implicit G0: Bind[G]): Bind[[α](F[α], G[α])]

    Permalink
    Definition Classes
    Bind

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

    Permalink
    Definition Classes
    Applicative

  109. def product[G[_]](implicit G0: Apply[G]): Apply[[α](F[α], G[α])]

    Permalink
    Definition Classes
    Apply

  110. def product[G[_]](implicit G0: Functor[G]): Functor[[α](F[α], G[α])]

    Permalink
    Definition Classes
    Functor

  111. final def pure[A](a: ⇒ A): F[A]

    Permalink
    Definition Classes
    Applicative

  112. def replicateM[A](n: Int, fa: F[A]): F[IList[A]]

    Permalink
    Definition Classes
    Applicative

  113. def replicateM_[A](n: Int, fa: F[A]): F[Unit]

    Permalink
    Definition Classes
    Applicative

  114. def rights[G[_, _], A, B](value: F[G[A, B]])(implicit G: Bifoldable[G]): F[B]

    Permalink
    Definition Classes
    MonadPlus

  115. def semigroup[A]: Semigroup[F[A]]

    Permalink
    Definition Classes
    Plus

  116. def separate[G[_, _], A, B](value: F[G[A, B]])(implicit G: Bifoldable[G]): (F[A], F[B])

    Permalink
    Definition Classes
    MonadPlus

  117. def sequence[A, G[_]](as: G[F[A]])(implicit arg0: Traverse[G]): F[G[A]]

    Permalink
    Definition Classes
    Applicative

  118. def sequence1[A, G[_]](as: G[F[A]])(implicit arg0: Traverse1[G]): F[G[A]]

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    Functor

  121. def strongMonadPlusLaw: StrongMonadPlusLaw

    Permalink
    Definition Classes
    MonadPlus

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

    Permalink
    Definition Classes
    AnyRef

  123. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  124. def traverse[A, G[_], B](value: G[A])(f: (A) ⇒ F[B])(implicit G: Traverse[G]): F[G[B]]

    Permalink
    Definition Classes
    Applicative

  125. def traverse1[A, G[_], B](value: G[A])(f: (A) ⇒ F[B])(implicit G: Traverse1[G]): F[G[B]]

    Permalink
    Definition Classes
    Apply

  126. def tuple2[A, B](fa: ⇒ F[A], fb: ⇒ F[B]): F[(A, B)]

    Permalink
    Definition Classes
    Apply

  127. def tuple3[A, B, C](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C]): F[(A, B, C)]

    Permalink
    Definition Classes
    Apply

  128. def tuple4[A, B, C, D](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D]): F[(A, B, C, D)]

    Permalink
    Definition Classes
    Apply

  129. 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)]

    Permalink
    Definition Classes
    Apply

  130. def unfoldlPsum[S, A](seed: S)(f: (S) ⇒ Maybe[(S, F[A])]): F[A]

    Permalink
    Definition Classes
    PlusEmpty

  131. def unfoldlPsumOpt[S, A](seed: S)(f: (S) ⇒ Maybe[(S, F[A])]): Maybe[F[A]]

    Permalink
    Definition Classes
    Plus

  132. def unfoldrOpt[S, A, B](seed: S)(f: (S) ⇒ Maybe[(F[A], S)])(implicit R: Reducer[A, B]): Maybe[F[B]]

    Permalink
    Definition Classes
    Apply

  133. def unfoldrPsum[S, A](seed: S)(f: (S) ⇒ Maybe[(F[A], S)]): F[A]

    Permalink
    Definition Classes
    PlusEmpty

  134. def unfoldrPsumOpt[S, A](seed: S)(f: (S) ⇒ Maybe[(F[A], S)]): Maybe[F[A]]

    Permalink
    Definition Classes
    Plus

  135. def unite[T[_], A](value: F[T[A]])(implicit T: Foldable[T]): F[A]

    Permalink
    Definition Classes
    MonadPlus

  136. final def uniteU[T](value: F[T])(implicit T: Unapply[Foldable, T]): F[A]

    Permalink
    Definition Classes
    MonadPlus

  137. def unlessM[A](cond: Boolean)(f: ⇒ F[A]): F[Unit]

    Permalink
    Definition Classes
    Applicative

  138. def untilM[G[_], A](f: F[A], cond: ⇒ F[Boolean])(implicit G: MonadPlus[G]): F[G[A]]

    Permalink
    Definition Classes
    Monad

  139. def untilM_[A](f: F[A], cond: ⇒ F[Boolean]): F[Unit]

    Permalink
    Definition Classes
    Monad

  140. def void[A](fa: F[A]): F[Unit]

    Permalink
    Definition Classes
    Functor

  141. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  142. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  143. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  144. def whenM[A](cond: Boolean)(f: ⇒ F[A]): F[Unit]

    Permalink
    Definition Classes
    Applicative

  145. def whileM[G[_], A](p: F[Boolean], body: ⇒ F[A])(implicit G: MonadPlus[G]): F[G[A]]

    Permalink
    Definition Classes
    Monad

  146. def whileM_[A](p: F[Boolean], body: ⇒ F[A]): F[Unit]

    Permalink
    Definition Classes
    Monad

  147. def widen[A, B](fa: F[A])(implicit ev: <~<[A, B]): F[B]

    Permalink
    Definition Classes
    Functor

  148. final def xderiving0[Z](z: ⇒ Z): F[Z]

    Permalink
    Definition Classes
    InvariantApplicative

  149. final def xderiving1[Z, A1](f: (A1) ⇒ Z, g: (Z) ⇒ A1)(implicit a1: F[A1]): F[Z]

    Permalink
    Definition Classes
    InvariantApplicative

  150. final def xderiving2[Z, A1, A2](f: (A1, A2) ⇒ Z, g: (Z) ⇒ (A1, A2))(implicit a1: F[A1], a2: F[A2]): F[Z]

    Permalink
    Definition Classes
    InvariantApplicative

  151. final def xderiving3[Z, A1, A2, A3](f: (A1, A2, A3) ⇒ Z, g: (Z) ⇒ (A1, A2, A3))(implicit a1: F[A1], a2: F[A2], a3: F[A3]): F[Z]

    Permalink
    Definition Classes
    InvariantApplicative

  152. final def xderiving4[Z, A1, A2, A3, A4](f: (A1, A2, A3, A4) ⇒ Z, g: (Z) ⇒ (A1, A2, A3, A4))(implicit a1: F[A1], a2: F[A2], a3: F[A3], a4: F[A4]): F[Z]

    Permalink
    Definition Classes
    InvariantApplicative

  153. def xmap[A, B](fa: F[A], f: (A) ⇒ B, g: (B) ⇒ A): F[B]

    Permalink
    Definition Classes
    Functor → InvariantFunctor

  154. def xmapb[A, B](ma: F[A])(b: Bijection[A, B]): F[B]

    Permalink
    Definition Classes
    InvariantFunctor

  155. def xmapi[A, B](ma: F[A])(iso: scalaz.Isomorphism.<=>[A, B]): F[B]

    Permalink
    Definition Classes
    InvariantFunctor

  156. def xproduct0[Z](z: ⇒ Z): F[Z]

    Permalink
    Definition Classes
    Applicative → InvariantApplicative

  157. def xproduct1[Z, A1](a1: ⇒ F[A1])(f: (A1) ⇒ Z, g: (Z) ⇒ A1): F[Z]

    Permalink
    Definition Classes
    Applicative → InvariantApplicative

  158. def xproduct2[Z, A1, A2](a1: ⇒ F[A1], a2: ⇒ F[A2])(f: (A1, A2) ⇒ Z, g: (Z) ⇒ (A1, A2)): F[Z]

    Permalink
    Definition Classes
    Applicative → InvariantApplicative

  159. def xproduct3[Z, A1, A2, A3](a1: ⇒ F[A1], a2: ⇒ F[A2], a3: ⇒ F[A3])(f: (A1, A2, A3) ⇒ Z, g: (Z) ⇒ (A1, A2, A3)): F[Z]

    Permalink
    Definition Classes
    Applicative → InvariantApplicative

  160. def xproduct4[Z, A1, A2, A3, A4](a1: ⇒ F[A1], a2: ⇒ F[A2], a3: ⇒ F[A3], a4: ⇒ F[A4])(f: (A1, A2, A3, A4) ⇒ Z, g: (Z) ⇒ (A1, A2, A3, A4)): F[Z]

    Permalink
    Definition Classes
    Applicative → InvariantApplicative

Inherited from MonadPlus[F]

Inherited from ApplicativePlus[F]

Inherited from PlusEmpty[F]

Inherited from Plus[F]

Inherited from Monad[F]

Inherited from Bind[F]

Inherited from Applicative[F]

Inherited from InvariantApplicative[F]

Inherited from Apply[F]

Inherited from Functor[F]

Inherited from InvariantFunctor[F]

Inherited from AnyRef

Inherited from Any

Ungrouped