scalaz.effect

MonadCatchIO

trait MonadCatchIO[M[_]] extends MonadIO[M]

Source
MonadCatchIO.scala
Linear Supertypes
MonadIO[M], Monad[M], Bind[M], Applicative[M], Apply[M], Functor[M], InvariantFunctor[M], LiftIO[M], AnyRef, Any
Known Subclasses
IsomorphismMonadCatchIO
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. MonadCatchIO
  2. MonadIO
  3. Monad
  4. Bind
  5. Applicative
  6. Apply
  7. Functor
  8. InvariantFunctor
  9. LiftIO
  10. AnyRef
  11. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. trait ApplicativeLaw extends Applicative.ApplyLaw

    Definition Classes
    Applicative

  2. trait ApplyLaw extends Apply.FunctorLaw

    Definition Classes
    Apply

  3. trait BindLaw extends Bind.ApplyLaw

    Definition Classes
    Bind

  4. trait FlippedApply extends Apply[F]

    Attributes
    protected[this]
    Definition Classes
    Apply

  5. trait FunctorLaw extends Functor.InvariantFunctorLaw

    Definition Classes
    Functor

  6. trait InvariantFunctorLaw extends AnyRef

    Definition Classes
    InvariantFunctor

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

    Definition Classes
    Monad

Abstract Value Members

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

    Definition Classes
    Bind

  2. abstract def except[A](ma: M[A])(handler: (Throwable) ⇒ M[A]): M[A]

    Executes the handler if an exception is raised.

  3. abstract def liftIO[A](ioa: IO[A]): M[A]

    Definition Classes
    LiftIO

  4. abstract def point[A](a: ⇒ A): M[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 ap[A, B](fa: ⇒ M[A])(f: ⇒ M[(A) ⇒ B]): M[B]

    Definition Classes
    Bind → Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

  15. def applicativeLaw: ApplicativeLaw

    Definition Classes
    Applicative

  16. val applicativeSyntax: ApplicativeSyntax[M]

    Definition Classes
    Applicative

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

    Definition Classes
    Functor

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Applicative → Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

  30. def applyLaw: ApplyLaw

    Definition Classes
    Apply

  31. val applySyntax: ApplySyntax[M]

    Definition Classes
    Apply

  32. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

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

    Definition Classes
    Functor

  34. def bindLaw: BindLaw

    Definition Classes
    Bind

  35. val bindSyntax: BindSyntax[M]

    Definition Classes
    Bind

  36. def clone(): AnyRef

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

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

    Definition Classes
    Applicative

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

    Definition Classes
    Apply

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

    Definition Classes
    Functor

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

    Definition Classes
    Functor

  41. def discardLeft[A, B](fa: ⇒ M[A], fb: ⇒ M[B]): M[B]

    Definition Classes
    Apply

  42. def discardRight[A, B](fa: ⇒ M[A], fb: ⇒ M[B]): M[A]

    Definition Classes
    Apply

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

    Definition Classes
    AnyRef

  44. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  45. def filterM[A](l: List[A])(f: (A) ⇒ M[Boolean]): M[List[A]]

    Definition Classes
    Applicative

  46. def finalize(): Unit

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

  47. def flip: Applicative[M]

    Definition Classes
    Applicative → Apply

  48. def forever[A, B](fa: M[A]): M[B]

    Definition Classes
    Apply

  49. def fpair[A](fa: M[A]): M[(A, A)]

    Definition Classes
    Functor

  50. def fproduct[A, B](fa: M[A])(f: (A) ⇒ B): M[(A, B)]

    Definition Classes
    Functor

  51. def functorLaw: FunctorLaw

    Definition Classes
    Functor

  52. val functorSyntax: FunctorSyntax[M]

    Definition Classes
    Functor

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

    Definition Classes
    AnyRef → Any

  54. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  55. def icompose[G[_]](implicit G0: Contravariant[G]): Contravariant[[α]M[G[α]]]

    Definition Classes
    Functor

  56. def ifM[B](value: M[Boolean], ifTrue: ⇒ M[B], ifFalse: ⇒ M[B]): M[B]

    Definition Classes
    Bind

  57. def invariantFunctorLaw: InvariantFunctorLaw

    Definition Classes
    InvariantFunctor

  58. val invariantFunctorSyntax: InvariantFunctorSyntax[M]

    Definition Classes
    InvariantFunctor

  59. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  60. def iterateUntil[A](f: M[A])(p: (A) ⇒ Boolean): M[A]

    Definition Classes
    Monad

  61. def iterateWhile[A](f: M[A])(p: (A) ⇒ Boolean): M[A]

    Definition Classes
    Monad

  62. def join[A](ffa: M[M[A]]): M[A]

    Definition Classes
    Bind

  63. def lift[A, B](f: (A) ⇒ B): (M[A]) ⇒ M[B]

    Definition Classes
    Functor

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

  67. def lift2[A, B, C](f: (A, B) ⇒ C): (M[A], M[B]) ⇒ M[C]

    Definition Classes
    Apply

  68. def lift3[A, B, C, D](f: (A, B, C) ⇒ D): (M[A], M[B], M[C]) ⇒ M[D]

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

  75. val liftIOSyntax: LiftIOSyntax[M]

    Definition Classes
    LiftIO

  76. def map[A, B](fa: M[A])(f: (A) ⇒ B): M[B]

    Definition Classes
    Monad → Applicative → Functor

  77. def mapply[A, B](a: A)(f: M[(A) ⇒ B]): M[B]

    Definition Classes
    Functor

  78. val monadIOSyntax: MonadIOSyntax[M]

    Definition Classes
    MonadIO

  79. def monadLaw: MonadLaw

    Definition Classes
    Monad

  80. val monadSyntax: MonadSyntax[M]

    Definition Classes
    Monad

  81. def mproduct[A, B](fa: M[A])(f: (A) ⇒ M[B]): M[(A, B)]

    Definition Classes
    Bind

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

    Definition Classes
    AnyRef

  83. final def notify(): Unit

    Definition Classes
    AnyRef

  84. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  85. def product[G[_]](implicit G0: Monad[G]): Monad[[α](M[α], G[α])]

    Definition Classes
    Monad

  86. def product[G[_]](implicit G0: Bind[G]): Bind[[α](M[α], G[α])]

    Definition Classes
    Bind

  87. def product[G[_]](implicit G0: Applicative[G]): Applicative[[α](M[α], G[α])]

    Definition Classes
    Applicative

  88. def product[G[_]](implicit G0: Apply[G]): Apply[[α](M[α], G[α])]

    Definition Classes
    Apply

  89. def product[G[_]](implicit G0: Functor[G]): Functor[[α](M[α], G[α])]

    Definition Classes
    Functor

  90. final def pure[A](a: ⇒ A): M[A]

    Definition Classes
    Applicative

  91. def replicateM[A](n: Int, fa: M[A]): M[List[A]]

    Definition Classes
    Applicative

  92. def replicateM_[A](n: Int, fa: M[A]): M[Unit]

    Definition Classes
    Applicative

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

    Definition Classes
    Applicative

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

    Definition Classes
    Apply

  95. def strengthL[A, B](a: A, f: M[B]): M[(A, B)]

    Definition Classes
    Functor

  96. def strengthR[A, B](f: M[A], b: B): M[(A, B)]

    Definition Classes
    Functor

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

    Definition Classes
    AnyRef

  98. def toString(): String

    Definition Classes
    AnyRef → Any

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

    Definition Classes
    Applicative

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

    Definition Classes
    Apply

  101. def tuple2[A, B](fa: ⇒ M[A], fb: ⇒ M[B]): M[(A, B)]

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

  105. def unlessM[A](cond: Boolean)(f: ⇒ M[A]): M[Unit]

    Definition Classes
    Applicative

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

    Definition Classes
    Monad

  107. def untilM_[A](f: M[A], cond: ⇒ M[Boolean]): M[Unit]

    Definition Classes
    Monad

  108. def void[A](fa: M[A]): M[Unit]

    Definition Classes
    Functor

  109. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  112. def whenM[A](cond: Boolean)(f: ⇒ M[A]): M[Unit]

    Definition Classes
    Applicative

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

    Definition Classes
    Monad

  114. def whileM_[A](p: M[Boolean], body: ⇒ M[A]): M[Unit]

    Definition Classes
    Monad

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

    Definition Classes
    Functor

  116. def xmap[A, B](fa: M[A], f: (A) ⇒ B, g: (B) ⇒ A): M[B]

    Definition Classes
    Functor → InvariantFunctor

  117. def xmapb[A, B](ma: M[A])(b: Bijection[A, B]): M[B]

    Definition Classes
    InvariantFunctor

  118. def xmapi[A, B](ma: M[A])(iso: Isomorphism.<=>[A, B]): M[B]

    Definition Classes
    InvariantFunctor

Inherited from MonadIO[M]

Inherited from Monad[M]

Inherited from Bind[M]

Inherited from Applicative[M]

Inherited from Apply[M]

Inherited from Functor[M]

Inherited from InvariantFunctor[M]

Inherited from LiftIO[M]

Inherited from AnyRef

Inherited from Any

Ungrouped