Trait

optparse_applicative.internal

MonadP

Related Doc: package internal

Permalink

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

Source
MonadP.scala
Linear Supertypes
MonadPlus[F], MonadPlusParent[F], ApplicativePlus[F], PlusEmpty[F], Plus[F], Monad[F], Bind[F], BindParent[F], Applicative[F], ApplicativeParent[F], Apply[F], ApplyParent[F], Functor[F], InvariantFunctor[F], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MonadP
  2. MonadPlus
  3. MonadPlusParent
  4. ApplicativePlus
  5. PlusEmpty
  6. Plus
  7. Monad
  8. Bind
  9. BindParent
  10. Applicative
  11. ApplicativeParent
  12. Apply
  13. ApplyParent
  14. Functor
  15. InvariantFunctor
  16. AnyRef
  17. 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 FunctorLaw extends scalaz.Functor.InvariantFunctorLaw

    Permalink
    Definition Classes
    Functor

  6. trait InvariantFunctorLaw extends AnyRef

    Permalink
    Definition Classes
    InvariantFunctor

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

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    MonadPlus

  9. trait PlusLaw extends AnyRef

    Permalink
    Definition Classes
    Plus

  10. 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
    Applicative → 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 asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    Functor

  33. def bindLaw: BindLaw

    Permalink
    Definition Classes
    Bind

  34. val bindSyntax: BindSyntax[F]

    Permalink
    Definition Classes
    Bind

  35. def clone(): AnyRef

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

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

    Permalink
    Definition Classes
    ApplicativePlus → Applicative

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

    Permalink
    Definition Classes
    PlusEmpty → Plus

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    AnyRef

  42. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    MonadPlus

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

    Permalink
    Definition Classes
    Applicative

  45. def finalize(): Unit

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

  46. def flip: Applicative[F]

    Permalink
    Definition Classes
    Applicative → ApplicativeParent

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

    Permalink
    Definition Classes
    Bind → BindParent

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

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    Functor

  50. def functorLaw: FunctorLaw

    Permalink
    Definition Classes
    Functor

  51. val functorSyntax: FunctorSyntax[F]

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    AnyRef → Any

  53. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    Bind

  56. def invariantFunctorLaw: InvariantFunctorLaw

    Permalink
    Definition Classes
    InvariantFunctor

  57. val invariantFunctorSyntax: InvariantFunctorSyntax[F]

    Permalink
    Definition Classes
    InvariantFunctor

  58. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    Bind

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

    Permalink
    Definition Classes
    Functor

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

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

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

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

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

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

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

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

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

  74. def many[A](a: F[A]): F[List[A]]

    Permalink
    Definition Classes
    ApplicativePlus

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

    Permalink
    Definition Classes
    Monad → Applicative → Functor

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

    Permalink
    Definition Classes
    Functor

  77. def monadLaw: MonadLaw

    Permalink
    Definition Classes
    Monad

  78. def monadPlusLaw: MonadPlusLaw

    Permalink
    Definition Classes
    MonadPlus

  79. val monadPlusSyntax: MonadPlusSyntax[F]

    Permalink
    Definition Classes
    MonadPlus

  80. val monadSyntax: MonadSyntax[F]

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    PlusEmpty

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

    Permalink
    Definition Classes
    Bind

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

    Permalink
    Definition Classes
    AnyRef

  84. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  85. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  86. def plusEmptyLaw: EmptyLaw

    Permalink
    Definition Classes
    PlusEmpty

  87. val plusEmptySyntax: PlusEmptySyntax[F]

    Permalink
    Definition Classes
    PlusEmpty

  88. def plusLaw: PlusLaw

    Permalink
    Definition Classes
    Plus

  89. val plusSyntax: PlusSyntax[F]

    Permalink
    Definition Classes
    Plus

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

    Permalink
    Definition Classes
    MonadPlus

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

    Permalink
    Definition Classes
    ApplicativePlus

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

    Permalink
    Definition Classes
    PlusEmpty

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

    Permalink
    Definition Classes
    Plus

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

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    Bind

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    Applicative

  100. def replicateM[A](n: Int, fa: F[A]): F[List[A]]

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Plus

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

    Permalink
    Definition Classes
    MonadPlus

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Apply

  106. def some[A](a: F[A]): F[List[A]]

    Permalink
    Definition Classes
    ApplicativePlus

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

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    Functor

  109. def strongMonadPlusLaw: StrongMonadPlusLaw

    Permalink
    Definition Classes
    MonadPlus

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

    Permalink
    Definition Classes
    AnyRef

  111. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

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

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

    Permalink
    Definition Classes
    MonadPlus

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

    Permalink
    Definition Classes
    MonadPlus

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    Functor

  124. final def wait(): Unit

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

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

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

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

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

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    Functor → InvariantFunctor

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

    Permalink
    Definition Classes
    InvariantFunctor

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

    Permalink
    Definition Classes
    InvariantFunctor

Inherited from MonadPlus[F]

Inherited from MonadPlusParent[F]

Inherited from ApplicativePlus[F]

Inherited from PlusEmpty[F]

Inherited from Plus[F]

Inherited from Monad[F]

Inherited from Bind[F]

Inherited from BindParent[F]

Inherited from Applicative[F]

Inherited from ApplicativeParent[F]

Inherited from Apply[F]

Inherited from ApplyParent[F]

Inherited from Functor[F]

Inherited from InvariantFunctor[F]

Inherited from AnyRef

Inherited from Any

Ungrouped