Class

com.thoughtworks.sde.comprehensionMonad.ComprehensionMonad

AbstractMonad

Related Doc: package ComprehensionMonad

Permalink

abstract class AbstractMonad[F0[_]] extends Monad[F0]

Source
ComprehensionMonad.scala
Linear Supertypes
Monad[F0], Bind[F0], BindParent[F0], Applicative[F0], ApplicativeParent[F0], Apply[F0], ApplyParent[F0], Functor[F0], InvariantFunctor[F0], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. AbstractMonad
  2. Monad
  3. Bind
  4. BindParent
  5. Applicative
  6. ApplicativeParent
  7. Apply
  8. ApplyParent
  9. Functor
  10. InvariantFunctor
  11. AnyRef
  12. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new AbstractMonad()

    Permalink

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. type F[A] = F0[A]

    Permalink
    Attributes
    protected

  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

Abstract Value Members

  1. abstract def bind[A, B](fa: F0[A])(f: (A) ⇒ F0[B]): F0[B]

    Permalink
    Definition Classes
    Bind

  2. abstract def point[A](a: ⇒ A): F0[A]

    Permalink
    Definition Classes
    Applicative

Concrete Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. def +(other: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from AbstractMonad[F0] to any2stringadd[AbstractMonad[F0]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd

  4. def ->[B](y: B): (AbstractMonad[F0], B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from AbstractMonad[F0] to ArrowAssoc[AbstractMonad[F0]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    AnyRef → Any

  6. def ap[A, B](fa: ⇒ F0[A])(f: ⇒ F0[(A) ⇒ B]): F0[B]

    Permalink
    Definition Classes
    Bind → Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

  9. def ap4[A, B, C, D, E](fa: ⇒ F0[A], fb: ⇒ F0[B], fc: ⇒ F0[C], fd: ⇒ F0[D])(f: F0[(A, B, C, D) ⇒ E]): F0[E]

    Permalink
    Definition Classes
    Apply

  10. def ap5[A, B, C, D, E, R](fa: ⇒ F0[A], fb: ⇒ F0[B], fc: ⇒ F0[C], fd: ⇒ F0[D], fe: ⇒ F0[E])(f: F0[(A, B, C, D, E) ⇒ R]): F0[R]

    Permalink
    Definition Classes
    Apply

  11. def ap6[A, B, C, D, E, FF, R](fa: ⇒ F0[A], fb: ⇒ F0[B], fc: ⇒ F0[C], fd: ⇒ F0[D], fe: ⇒ F0[E], ff: ⇒ F0[FF])(f: F0[(A, B, C, D, E, FF) ⇒ R]): F0[R]

    Permalink
    Definition Classes
    Apply

  12. def ap7[A, B, C, D, E, FF, G, R](fa: ⇒ F0[A], fb: ⇒ F0[B], fc: ⇒ F0[C], fd: ⇒ F0[D], fe: ⇒ F0[E], ff: ⇒ F0[FF], fg: ⇒ F0[G])(f: F0[(A, B, C, D, E, FF, G) ⇒ R]): F0[R]

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

  14. def apF[A, B](f: ⇒ F0[(A) ⇒ B]): (F0[A]) ⇒ F0[B]

    Permalink
    Definition Classes
    Apply

  15. def applicativeLaw: ApplicativeLaw

    Permalink
    Definition Classes
    Applicative

  16. val applicativeSyntax: ApplicativeSyntax[F0]

    Permalink
    Definition Classes
    Applicative

  17. def apply[A, B](fa: F0[A])(f: (A) ⇒ B): F0[B]

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Applicative → Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

  29. def applyApplicative: Applicative[[α]\/[F0[α], α]]

    Permalink
    Definition Classes
    Apply

  30. def applyLaw: ApplyLaw

    Permalink
    Definition Classes
    Apply

  31. val applySyntax: ApplySyntax[F0]

    Permalink
    Definition Classes
    Apply

  32. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    Functor

  34. def bindLaw: BindLaw

    Permalink
    Definition Classes
    Bind

  35. val bindSyntax: BindSyntax[F0]

    Permalink
    Definition Classes
    Bind

  36. def clone(): AnyRef

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

  37. def compose[G[_]](implicit G0: Applicative[G]): Applicative[[α]F0[G[α]]]

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    Functor

  41. def ensuring(cond: (AbstractMonad[F0]) ⇒ Boolean, msg: ⇒ Any): AbstractMonad[F0]

    Permalink
    Implicit information
    This member is added by an implicit conversion from AbstractMonad[F0] to Ensuring[AbstractMonad[F0]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  42. def ensuring(cond: (AbstractMonad[F0]) ⇒ Boolean): AbstractMonad[F0]

    Permalink
    Implicit information
    This member is added by an implicit conversion from AbstractMonad[F0] to Ensuring[AbstractMonad[F0]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  43. def ensuring(cond: Boolean, msg: ⇒ Any): AbstractMonad[F0]

    Permalink
    Implicit information
    This member is added by an implicit conversion from AbstractMonad[F0] to Ensuring[AbstractMonad[F0]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  44. def ensuring(cond: Boolean): AbstractMonad[F0]

    Permalink
    Implicit information
    This member is added by an implicit conversion from AbstractMonad[F0] to Ensuring[AbstractMonad[F0]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

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

    Permalink
    Definition Classes
    AnyRef

  46. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  47. def filterM[A](l: List[A])(f: (A) ⇒ F0[Boolean]): F0[List[A]]

    Permalink
    Definition Classes
    Applicative

  48. def finalize(): Unit

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

  49. def flip: Applicative[F0]

    Permalink
    Definition Classes
    Applicative → ApplicativeParent

  50. def forever[A, B](fa: F0[A]): F0[B]

    Permalink
    Definition Classes
    Bind → BindParent

  51. def formatted(fmtstr: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from AbstractMonad[F0] to StringFormat[AbstractMonad[F0]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()

  52. def fpair[A](fa: F0[A]): F0[(A, A)]

    Permalink
    Definition Classes
    Functor

  53. def fproduct[A, B](fa: F0[A])(f: (A) ⇒ B): F0[(A, B)]

    Permalink
    Definition Classes
    Functor

  54. def functorLaw: FunctorLaw

    Permalink
    Definition Classes
    Functor

  55. val functorSyntax: FunctorSyntax[F0]

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    AnyRef → Any

  57. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  58. def icompose[G[_]](implicit G0: Contravariant[G]): Contravariant[[α]F0[G[α]]]

    Permalink
    Definition Classes
    Functor

  59. def ifM[B](value: F0[Boolean], ifTrue: ⇒ F0[B], ifFalse: ⇒ F0[B]): F0[B]

    Permalink
    Definition Classes
    Bind

  60. def invariantFunctorLaw: InvariantFunctorLaw

    Permalink
    Definition Classes
    InvariantFunctor

  61. val invariantFunctorSyntax: InvariantFunctorSyntax[F0]

    Permalink
    Definition Classes
    InvariantFunctor

  62. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  63. def iterateUntil[A](f: F0[A])(p: (A) ⇒ Boolean): F0[A]

    Permalink
    Definition Classes
    Monad

  64. def iterateWhile[A](f: F0[A])(p: (A) ⇒ Boolean): F0[A]

    Permalink
    Definition Classes
    Monad

  65. def join[A](ffa: F0[F0[A]]): F0[A]

    Permalink
    Definition Classes
    Bind

  66. def lift[A, B](f: (A) ⇒ B): (F0[A]) ⇒ F0[B]

    Permalink
    Definition Classes
    Functor

  67. 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): (F0[A], F0[B], F0[C], F0[D], F0[E], F0[FF], F0[G], F0[H], F0[I], F0[J]) ⇒ F0[R]

    Permalink
    Definition Classes
    Apply

  68. 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): (F0[A], F0[B], F0[C], F0[D], F0[E], F0[FF], F0[G], F0[H], F0[I], F0[J], F0[K]) ⇒ F0[R]

    Permalink
    Definition Classes
    Apply

  69. 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): (F0[A], F0[B], F0[C], F0[D], F0[E], F0[FF], F0[G], F0[H], F0[I], F0[J], F0[K], F0[L]) ⇒ F0[R]

    Permalink
    Definition Classes
    Apply

  70. def lift2[A, B, C](f: (A, B) ⇒ C): (F0[A], F0[B]) ⇒ F0[C]

    Permalink
    Definition Classes
    Apply

  71. def lift3[A, B, C, D](f: (A, B, C) ⇒ D): (F0[A], F0[B], F0[C]) ⇒ F0[D]

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

  73. def lift5[A, B, C, D, E, R](f: (A, B, C, D, E) ⇒ R): (F0[A], F0[B], F0[C], F0[D], F0[E]) ⇒ F0[R]

    Permalink
    Definition Classes
    Apply

  74. def lift6[A, B, C, D, E, FF, R](f: (A, B, C, D, E, FF) ⇒ R): (F0[A], F0[B], F0[C], F0[D], F0[E], F0[FF]) ⇒ F0[R]

    Permalink
    Definition Classes
    Apply

  75. def lift7[A, B, C, D, E, FF, G, R](f: (A, B, C, D, E, FF, G) ⇒ R): (F0[A], F0[B], F0[C], F0[D], F0[E], F0[FF], F0[G]) ⇒ F0[R]

    Permalink
    Definition Classes
    Apply

  76. def lift8[A, B, C, D, E, FF, G, H, R](f: (A, B, C, D, E, FF, G, H) ⇒ R): (F0[A], F0[B], F0[C], F0[D], F0[E], F0[FF], F0[G], F0[H]) ⇒ F0[R]

    Permalink
    Definition Classes
    Apply

  77. def lift9[A, B, C, D, E, FF, G, H, I, R](f: (A, B, C, D, E, FF, G, H, I) ⇒ R): (F0[A], F0[B], F0[C], F0[D], F0[E], F0[FF], F0[G], F0[H], F0[I]) ⇒ F0[R]

    Permalink
    Definition Classes
    Apply

  78. def map[A, B](fa: F0[A])(f: (A) ⇒ B): F0[B]

    Permalink
    Definition Classes
    Monad → Applicative → Functor

  79. def mapply[A, B](a: A)(f: F0[(A) ⇒ B]): F0[B]

    Permalink
    Definition Classes
    Functor

  80. def monadLaw: MonadLaw

    Permalink
    Definition Classes
    Monad

  81. val monadSyntax: MonadSyntax[F0]

    Permalink
    Definition Classes
    Monad

  82. def mproduct[A, B](fa: F0[A])(f: (A) ⇒ F0[B]): F0[(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 product[G[_]](implicit G0: Monad[G]): Monad[[α](F0[α], G[α])]

    Permalink
    Definition Classes
    Monad

  87. def product[G[_]](implicit G0: Bind[G]): Bind[[α](F0[α], G[α])]

    Permalink
    Definition Classes
    Bind

  88. def product[G[_]](implicit G0: Applicative[G]): Applicative[[α](F0[α], G[α])]

    Permalink
    Definition Classes
    Applicative

  89. def product[G[_]](implicit G0: Apply[G]): Apply[[α](F0[α], G[α])]

    Permalink
    Definition Classes
    Apply

  90. def product[G[_]](implicit G0: Functor[G]): Functor[[α](F0[α], G[α])]

    Permalink
    Definition Classes
    Functor

  91. final def pure[A](a: ⇒ A): F0[A]

    Permalink
    Definition Classes
    Applicative

  92. def replicateM[A](n: Int, fa: F0[A]): F0[List[A]]

    Permalink
    Definition Classes
    Applicative

  93. def replicateM_[A](n: Int, fa: F0[A]): F0[Unit]

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Apply

  96. def strengthL[A, B](a: A, f: F0[B]): F0[(A, B)]

    Permalink
    Definition Classes
    Functor

  97. def strengthR[A, B](f: F0[A], b: B): F0[(A, B)]

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    AnyRef

  99. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Apply

  102. def tuple2[A, B](fa: ⇒ F0[A], fb: ⇒ F0[B]): F0[(A, B)]

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

  105. def tuple5[A, B, C, D, E](fa: ⇒ F0[A], fb: ⇒ F0[B], fc: ⇒ F0[C], fd: ⇒ F0[D], fe: ⇒ F0[E]): F0[(A, B, C, D, E)]

    Permalink
    Definition Classes
    Apply

  106. def unlessM[A](cond: Boolean)(f: ⇒ F0[A]): F0[Unit]

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Monad

  108. def untilM_[A](f: F0[A], cond: ⇒ F0[Boolean]): F0[Unit]

    Permalink
    Definition Classes
    Monad

  109. def void[A](fa: F0[A]): F0[Unit]

    Permalink
    Definition Classes
    Functor

  110. final def wait(): Unit

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

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

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

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

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

  113. def whenM[A](cond: Boolean)(f: ⇒ F0[A]): F0[Unit]

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Monad

  115. def whileM_[A](p: F0[Boolean], body: ⇒ F0[A]): F0[Unit]

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    Functor

  117. def xmap[A, B](fa: F0[A], f: (A) ⇒ B, g: (B) ⇒ A): F0[B]

    Permalink
    Definition Classes
    Functor → InvariantFunctor

  118. def xmapb[A, B](ma: F0[A])(b: Bijection[A, B]): F0[B]

    Permalink
    Definition Classes
    InvariantFunctor

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

    Permalink
    Definition Classes
    InvariantFunctor

  120. def →[B](y: B): (AbstractMonad[F0], B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from AbstractMonad[F0] to ArrowAssoc[AbstractMonad[F0]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Inherited from Monad[F0]

Inherited from Bind[F0]

Inherited from BindParent[F0]

Inherited from Applicative[F0]

Inherited from ApplicativeParent[F0]

Inherited from Apply[F0]

Inherited from ApplyParent[F0]

Inherited from Functor[F0]

Inherited from InvariantFunctor[F0]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from AbstractMonad[F0] to any2stringadd[AbstractMonad[F0]]

Inherited by implicit conversion StringFormat from AbstractMonad[F0] to StringFormat[AbstractMonad[F0]]

Inherited by implicit conversion Ensuring from AbstractMonad[F0] to Ensuring[AbstractMonad[F0]]

Inherited by implicit conversion ArrowAssoc from AbstractMonad[F0] to ArrowAssoc[AbstractMonad[F0]]

Ungrouped