trait MonadCatchIO[M[_]] extends MonadIO[M]
Ordering
- Alphabetic
- By Inheritance
Inherited
- MonadCatchIO
- MonadIO
- Monad
- Bind
- BindParent
- Applicative
- ApplicativeParent
- Apply
- ApplyParent
- Functor
- InvariantFunctor
- LiftIO
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Type Members
- trait ApplicativeLaw extends Applicative.ApplyLaw
- Definition Classes
- Applicative
- trait ApplyLaw extends Apply.FunctorLaw
- Definition Classes
- Apply
- trait BindLaw extends Bind.ApplyLaw
- Definition Classes
- Bind
- trait FunctorLaw extends Functor.InvariantFunctorLaw
- Definition Classes
- Functor
- trait InvariantFunctorLaw extends AnyRef
- Definition Classes
- InvariantFunctor
- trait MonadLaw extends Monad.ApplicativeLaw with Monad.BindLaw
- Definition Classes
- Monad
Abstract Value Members
- abstract def bind[A, B](fa: M[A])(f: (A) ⇒ M[B]): M[B]
- Definition Classes
- Bind
- abstract def except[A](ma: M[A])(handler: (Throwable) ⇒ M[A]): M[A]
Executes the handler if an exception is raised.
- abstract def liftIO[A](ioa: IO[A]): M[A]
- Definition Classes
- LiftIO
- abstract def point[A](a: ⇒ A): M[A]
- Definition Classes
- Applicative
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##(): Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def ap[A, B](fa: ⇒ M[A])(f: ⇒ M[(A) ⇒ B]): M[B]
- Definition Classes
- Bind → Apply
- def ap2[A, B, C](fa: ⇒ M[A], fb: ⇒ M[B])(f: M[(A, B) ⇒ C]): M[C]
- Definition Classes
- Apply
- 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
- 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
- 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
- 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
- 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
- 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
- def apF[A, B](f: ⇒ M[(A) ⇒ B]): (M[A]) ⇒ M[B]
- Definition Classes
- Apply
- def applicativeLaw: ApplicativeLaw
- Definition Classes
- Applicative
- val applicativeSyntax: ApplicativeSyntax[M]
- Definition Classes
- Applicative
- def apply[A, B](fa: M[A])(f: (A) ⇒ B): M[B]
- Definition Classes
- Functor
- 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
- 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
- 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
- def apply2[A, B, C](fa: ⇒ M[A], fb: ⇒ M[B])(f: (A, B) ⇒ C): M[C]
- Definition Classes
- Applicative → Apply
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- def applyApplicative: Applicative[[α]\/[M[α], α]]
- Definition Classes
- Apply
- def applyLaw: ApplyLaw
- Definition Classes
- Apply
- val applySyntax: ApplySyntax[M]
- Definition Classes
- Apply
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def bicompose[G[_, _]](implicit arg0: Bifunctor[G]): Bifunctor[[α, β]M[G[α, β]]]
- Definition Classes
- Functor
- def bindLaw: BindLaw
- Definition Classes
- Bind
- val bindSyntax: BindSyntax[M]
- Definition Classes
- Bind
- def clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws(classOf[java.lang.CloneNotSupportedException])
- def compose[G[_]](implicit G0: Applicative[G]): Applicative[[α]M[G[α]]]
- Definition Classes
- Applicative
- def compose[G[_]](implicit G0: Apply[G]): Apply[[α]M[G[α]]]
- Definition Classes
- Apply
- def compose[G[_]](implicit G0: Functor[G]): Functor[[α]M[G[α]]]
- Definition Classes
- Functor
- def counzip[A, B](a: \/[M[A], M[B]]): M[\/[A, B]]
- Definition Classes
- Functor
- def discardLeft[A, B](fa: ⇒ M[A], fb: ⇒ M[B]): M[B]
- Definition Classes
- ApplyParent
- def discardRight[A, B](fa: ⇒ M[A], fb: ⇒ M[B]): M[A]
- Definition Classes
- ApplyParent
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def filterM[A](l: List[A])(f: (A) ⇒ M[Boolean]): M[List[A]]
- Definition Classes
- Applicative
- def finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def flip: Applicative[M]
- Definition Classes
- Applicative → ApplyParent
- def forever[A, B](fa: M[A]): M[B]
- Definition Classes
- Bind → ApplyParent
- def fpair[A](fa: M[A]): M[(A, A)]
- Definition Classes
- Functor
- def fproduct[A, B](fa: M[A])(f: (A) ⇒ B): M[(A, B)]
- Definition Classes
- Functor
- def functorLaw: FunctorLaw
- Definition Classes
- Functor
- val functorSyntax: FunctorSyntax[M]
- Definition Classes
- Functor
- final def getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def icompose[G[_]](implicit G0: Contravariant[G]): Contravariant[[α]M[G[α]]]
- Definition Classes
- Functor
- def ifM[B](value: M[Boolean], ifTrue: ⇒ M[B], ifFalse: ⇒ M[B]): M[B]
- Definition Classes
- Bind
- def invariantFunctorLaw: InvariantFunctorLaw
- Definition Classes
- InvariantFunctor
- val invariantFunctorSyntax: InvariantFunctorSyntax[M]
- Definition Classes
- InvariantFunctor
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def iterateUntil[A](f: M[A])(p: (A) ⇒ Boolean): M[A]
- Definition Classes
- Monad
- def iterateWhile[A](f: M[A])(p: (A) ⇒ Boolean): M[A]
- Definition Classes
- Monad
- def join[A](ffa: M[M[A]]): M[A]
- Definition Classes
- Bind
- def lift[A, B](f: (A) ⇒ B): (M[A]) ⇒ M[B]
- Definition Classes
- Functor
- 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
- 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
- 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
- def lift2[A, B, C](f: (A, B) ⇒ C): (M[A], M[B]) ⇒ M[C]
- Definition Classes
- Apply
- def lift3[A, B, C, D](f: (A, B, C) ⇒ D): (M[A], M[B], M[C]) ⇒ M[D]
- Definition Classes
- Apply
- 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
- 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
- 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
- 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
- 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
- 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
- val liftIOSyntax: LiftIOSyntax[M]
- Definition Classes
- LiftIO
- def map[A, B](fa: M[A])(f: (A) ⇒ B): M[B]
- Definition Classes
- Monad → Applicative → Functor
- def mapply[A, B](a: A)(f: M[(A) ⇒ B]): M[B]
- Definition Classes
- Functor
- val monadIOSyntax: MonadIOSyntax[M]
- Definition Classes
- MonadIO
- def monadLaw: MonadLaw
- Definition Classes
- Monad
- val monadSyntax: MonadSyntax[M]
- Definition Classes
- Monad
- def mproduct[A, B](fa: M[A])(f: (A) ⇒ M[B]): M[(A, B)]
- Definition Classes
- Bind
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def par: Par[M]
- Definition Classes
- ApplicativeParent
- def product[G[_]](implicit G0: Monad[G]): Monad[[α](M[α], G[α])]
- Definition Classes
- Monad
- def product[G[_]](implicit G0: Bind[G]): Bind[[α](M[α], G[α])]
- Definition Classes
- Bind
- def product[G[_]](implicit G0: Applicative[G]): Applicative[[α](M[α], G[α])]
- Definition Classes
- Applicative
- def product[G[_]](implicit G0: Apply[G]): Apply[[α](M[α], G[α])]
- Definition Classes
- Apply
- def product[G[_]](implicit G0: Functor[G]): Functor[[α](M[α], G[α])]
- Definition Classes
- Functor
- final def pure[A](a: ⇒ A): M[A]
- Definition Classes
- Applicative
- def replicateM[A](n: Int, fa: M[A]): M[List[A]]
- Definition Classes
- Applicative
- def replicateM_[A](n: Int, fa: M[A]): M[Unit]
- Definition Classes
- Applicative
- def sequence[A, G[_]](as: G[M[A]])(implicit arg0: Traverse[G]): M[G[A]]
- Definition Classes
- Applicative
- def sequence1[A, G[_]](as: G[M[A]])(implicit arg0: Traverse1[G]): M[G[A]]
- Definition Classes
- Apply
- def strengthL[A, B](a: A, f: M[B]): M[(A, B)]
- Definition Classes
- Functor
- def strengthR[A, B](f: M[A], b: B): M[(A, B)]
- Definition Classes
- Functor
- final def synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- def traverse[A, G[_], B](value: G[A])(f: (A) ⇒ M[B])(implicit G: Traverse[G]): M[G[B]]
- Definition Classes
- Applicative
- def traverse1[A, G[_], B](value: G[A])(f: (A) ⇒ M[B])(implicit G: Traverse1[G]): M[G[B]]
- Definition Classes
- Apply
- def tuple2[A, B](fa: ⇒ M[A], fb: ⇒ M[B]): M[(A, B)]
- Definition Classes
- Apply
- def tuple3[A, B, C](fa: ⇒ M[A], fb: ⇒ M[B], fc: ⇒ M[C]): M[(A, B, C)]
- Definition Classes
- Apply
- 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
- 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
- def unlessM[A](cond: Boolean)(f: ⇒ M[A]): M[Unit]
- Definition Classes
- Applicative
- def untilM[G[_], A](f: M[A], cond: ⇒ M[Boolean])(implicit G: MonadPlus[G]): M[G[A]]
- Definition Classes
- Monad
- def untilM_[A](f: M[A], cond: ⇒ M[Boolean]): M[Unit]
- Definition Classes
- Monad
- def void[A](fa: M[A]): M[Unit]
- Definition Classes
- Functor
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws(classOf[java.lang.InterruptedException])
- def whenM[A](cond: Boolean)(f: ⇒ M[A]): M[Unit]
- Definition Classes
- Applicative
- def whileM[G[_], A](p: M[Boolean], body: ⇒ M[A])(implicit G: MonadPlus[G]): M[G[A]]
- Definition Classes
- Monad
- def whileM_[A](p: M[Boolean], body: ⇒ M[A]): M[Unit]
- Definition Classes
- Monad
- def widen[A, B](fa: M[A])(implicit ev: <~<[A, B]): M[B]
- Definition Classes
- Functor
- def xmap[A, B](fa: M[A], f: (A) ⇒ B, g: (B) ⇒ A): M[B]
- Definition Classes
- Functor → InvariantFunctor
- def xmapb[A, B](ma: M[A])(b: Bijection[A, B]): M[B]
- Definition Classes
- InvariantFunctor
- def xmapi[A, B](ma: M[A])(iso: Isomorphism.<=>[A, B]): M[B]
- Definition Classes
- InvariantFunctor