com.thoughtworks.sde.comprehensionMonad.ComprehensionMonad

AbstractMonad

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

Source
ComprehensionMonad.scala
Linear Supertypes
Type Hierarchy Learn more about scaladoc diagrams
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 any2stringfmt
  3. by any2ArrowAssoc
  4. by any2Ensuring
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new AbstractMonad()

Type Members

  1. trait ApplicativeLaw extends scalaz.Applicative.ApplyLaw

    Definition Classes
    Applicative
  2. trait ApplyLaw extends scalaz.Apply.FunctorLaw

    Definition Classes
    Apply
  3. trait BindLaw extends scalaz.Bind.ApplyLaw

    Definition Classes
    Bind
  4. type F[A] = F0[A]

    Attributes
    protected
  5. trait FunctorLaw extends scalaz.Functor.InvariantFunctorLaw

    Definition Classes
    Functor
  6. trait InvariantFunctorLaw extends AnyRef

    Definition Classes
    InvariantFunctor
  7. trait MonadLaw extends scalaz.Monad.ApplicativeLaw with scalaz.Monad.BindLaw

    Definition Classes
    Monad

Abstract Value Members

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

    Definition Classes
    Bind
  2. abstract def point[A](a: ⇒ A): F0[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. def +(other: String): String

    Implicit information
    This member is added by an implicit conversion from AbstractMonad[F0] to StringAdd performed by method any2stringadd in scala.Predef.
    Definition Classes
    StringAdd
  5. def ->[B](y: B): (AbstractMonad[F0], B)

    Implicit information
    This member is added by an implicit conversion from AbstractMonad[F0] to ArrowAssoc[AbstractMonad[F0]] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  6. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  7. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  8. def ap[A, B](fa: ⇒ F0[A])(f: ⇒ F0[(A) ⇒ B]): F0[B]

    Definition Classes
    Bind → Apply
  9. def ap2[A, B, C](fa: ⇒ F0[A], fb: ⇒ F0[B])(f: F0[(A, B) ⇒ C]): F0[C]

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

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

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

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

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

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

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

    Definition Classes
    Apply
  17. def applicativeLaw: ApplicativeLaw

    Definition Classes
    Applicative
  18. val applicativeSyntax: ApplicativeSyntax[F0]

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

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

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

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

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

    Definition Classes
    Applicative → Apply
  24. def apply3[A, B, C, D](fa: ⇒ F0[A], fb: ⇒ F0[B], fc: ⇒ F0[C])(f: (A, B, C) ⇒ D): F0[D]

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

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

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

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

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

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

    Definition Classes
    Apply
  31. def applyApplicative: Applicative[[α]\/[F0[α], α]]

    Definition Classes
    Apply
  32. def applyLaw: ApplyLaw

    Definition Classes
    Apply
  33. val applySyntax: ApplySyntax[F0]

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

    Definition Classes
    Any
  35. def bicompose[G[_, _]](implicit arg0: Bifunctor[G]): Bifunctor[[α, β]F0[G[α, β]]]

    Definition Classes
    Functor
  36. def bindLaw: BindLaw

    Definition Classes
    Bind
  37. val bindSyntax: BindSyntax[F0]

    Definition Classes
    Bind
  38. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  39. def compose[G[_]](implicit G0: Applicative[G]): Applicative[[α]F0[G[α]]]

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

    Definition Classes
    Apply
  41. def compose[G[_]](implicit G0: Functor[G]): Functor[[α]F0[G[α]]]

    Definition Classes
    Functor
  42. def counzip[A, B](a: \/[F0[A], F0[B]]): F0[\/[A, B]]

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

    Implicit information
    This member is added by an implicit conversion from AbstractMonad[F0] to Ensuring[AbstractMonad[F0]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  44. def ensuring(cond: (AbstractMonad[F0]) ⇒ Boolean): AbstractMonad[F0]

    Implicit information
    This member is added by an implicit conversion from AbstractMonad[F0] to Ensuring[AbstractMonad[F0]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  45. def ensuring(cond: Boolean, msg: ⇒ Any): AbstractMonad[F0]

    Implicit information
    This member is added by an implicit conversion from AbstractMonad[F0] to Ensuring[AbstractMonad[F0]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  46. def ensuring(cond: Boolean): AbstractMonad[F0]

    Implicit information
    This member is added by an implicit conversion from AbstractMonad[F0] to Ensuring[AbstractMonad[F0]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  47. final def eq(arg0: AnyRef): Boolean

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

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

    Definition Classes
    Applicative
  50. def finalize(): Unit

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

    Definition Classes
    Applicative → ApplicativeParent
  52. def forever[A, B](fa: F0[A]): F0[B]

    Definition Classes
    Bind → BindParent
  53. def formatted(fmtstr: String): String

    Implicit information
    This member is added by an implicit conversion from AbstractMonad[F0] to StringFormat performed by method any2stringfmt in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  54. def fpair[A](fa: F0[A]): F0[(A, A)]

    Definition Classes
    Functor
  55. def fproduct[A, B](fa: F0[A])(f: (A) ⇒ B): F0[(A, B)]

    Definition Classes
    Functor
  56. def functorLaw: FunctorLaw

    Definition Classes
    Functor
  57. val functorSyntax: FunctorSyntax[F0]

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

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

    Definition Classes
    AnyRef → Any
  60. def icompose[G[_]](implicit G0: Contravariant[G]): Contravariant[[α]F0[G[α]]]

    Definition Classes
    Functor
  61. def ifM[B](value: F0[Boolean], ifTrue: ⇒ F0[B], ifFalse: ⇒ F0[B]): F0[B]

    Definition Classes
    Bind
  62. def invariantFunctorLaw: InvariantFunctorLaw

    Definition Classes
    InvariantFunctor
  63. val invariantFunctorSyntax: InvariantFunctorSyntax[F0]

    Definition Classes
    InvariantFunctor
  64. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  65. def iterateUntil[A](f: F0[A])(p: (A) ⇒ Boolean): F0[A]

    Definition Classes
    Monad
  66. def iterateWhile[A](f: F0[A])(p: (A) ⇒ Boolean): F0[A]

    Definition Classes
    Monad
  67. def join[A](ffa: F0[F0[A]]): F0[A]

    Definition Classes
    Bind
  68. def lift[A, B](f: (A) ⇒ B): (F0[A]) ⇒ F0[B]

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

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    Apply
  80. def map[A, B](fa: F0[A])(f: (A) ⇒ B): F0[B]

    Definition Classes
    Monad → Applicative → Functor
  81. def mapply[A, B](a: A)(f: F0[(A) ⇒ B]): F0[B]

    Definition Classes
    Functor
  82. def monadLaw: MonadLaw

    Definition Classes
    Monad
  83. val monadSyntax: MonadSyntax[F0]

    Definition Classes
    Monad
  84. def mproduct[A, B](fa: F0[A])(f: (A) ⇒ F0[B]): F0[(A, B)]

    Definition Classes
    Bind
  85. final def ne(arg0: AnyRef): Boolean

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

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

    Definition Classes
    AnyRef
  88. def product[G[_]](implicit G0: Monad[G]): Monad[[α](F0[α], G[α])]

    Definition Classes
    Monad
  89. def product[G[_]](implicit G0: Bind[G]): Bind[[α](F0[α], G[α])]

    Definition Classes
    Bind
  90. def product[G[_]](implicit G0: Applicative[G]): Applicative[[α](F0[α], G[α])]

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

    Definition Classes
    Apply
  92. def product[G[_]](implicit G0: Functor[G]): Functor[[α](F0[α], G[α])]

    Definition Classes
    Functor
  93. final def pure[A](a: ⇒ A): F0[A]

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

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

    Definition Classes
    Applicative
  96. def sequence[A, G[_]](as: G[F0[A]])(implicit arg0: Traverse[G]): F0[G[A]]

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

    Definition Classes
    Apply
  98. def strengthL[A, B](a: A, f: F0[B]): F0[(A, B)]

    Definition Classes
    Functor
  99. def strengthR[A, B](f: F0[A], b: B): F0[(A, B)]

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

    Definition Classes
    AnyRef
  101. def toString(): String

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

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

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

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

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

    Definition Classes
    Apply
  107. 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)]

    Definition Classes
    Apply
  108. def unlessM[A](cond: Boolean)(f: ⇒ F0[A]): F0[Unit]

    Definition Classes
    Applicative
  109. def untilM[G[_], A](f: F0[A], cond: ⇒ F0[Boolean])(implicit G: MonadPlus[G]): F0[G[A]]

    Definition Classes
    Monad
  110. def untilM_[A](f: F0[A], cond: ⇒ F0[Boolean]): F0[Unit]

    Definition Classes
    Monad
  111. def void[A](fa: F0[A]): F0[Unit]

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

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  115. def whenM[A](cond: Boolean)(f: ⇒ F0[A]): F0[Unit]

    Definition Classes
    Applicative
  116. def whileM[G[_], A](p: F0[Boolean], body: ⇒ F0[A])(implicit G: MonadPlus[G]): F0[G[A]]

    Definition Classes
    Monad
  117. def whileM_[A](p: F0[Boolean], body: ⇒ F0[A]): F0[Unit]

    Definition Classes
    Monad
  118. def widen[A, B](fa: F0[A])(implicit ev: <~<[A, B]): F0[B]

    Definition Classes
    Functor
  119. def xmap[A, B](fa: F0[A], f: (A) ⇒ B, g: (B) ⇒ A): F0[B]

    Definition Classes
    Functor → InvariantFunctor
  120. def xmapb[A, B](ma: F0[A])(b: Bijection[A, B]): F0[B]

    Definition Classes
    InvariantFunctor
  121. def xmapi[A, B](ma: F0[A])(iso: scalaz.Isomorphism.<=>[A, B]): F0[B]

    Definition Classes
    InvariantFunctor
  122. def [B](y: B): (AbstractMonad[F0], B)

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

Shadowed Implicit Value Members

  1. val self: Any

    Implicit information
    This member is added by an implicit conversion from AbstractMonad[F0] to StringAdd performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (abstractMonad: StringAdd).self
    Definition Classes
    StringAdd
  2. val self: Any

    Implicit information
    This member is added by an implicit conversion from AbstractMonad[F0] to StringFormat performed by method any2stringfmt in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (abstractMonad: StringFormat).self
    Definition Classes
    StringFormat

Deprecated Value Members

  1. def x: AbstractMonad[F0]

    Implicit information
    This member is added by an implicit conversion from AbstractMonad[F0] to ArrowAssoc[AbstractMonad[F0]] performed by method any2ArrowAssoc in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (abstractMonad: ArrowAssoc[AbstractMonad[F0]]).x
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use leftOfArrow instead

  2. def x: AbstractMonad[F0]

    Implicit information
    This member is added by an implicit conversion from AbstractMonad[F0] to Ensuring[AbstractMonad[F0]] performed by method any2Ensuring in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (abstractMonad: Ensuring[AbstractMonad[F0]]).x
    Definition Classes
    Ensuring
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use resultOfEnsuring instead

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 StringAdd

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

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

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

Ungrouped