t

scalaz.effect

IsomorphismMonadCatchIO

trait IsomorphismMonadCatchIO[F[_], G[_]] extends MonadCatchIO[F] with IsomorphismMonadIO[F, G]

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. IsomorphismMonadCatchIO
  2. IsomorphismMonadIO
  3. IsomorphismMonad
  4. IsomorphismBind
  5. IsomorphismApplicative
  6. IsomorphismInvariantApplicative
  7. IsomorphismApply
  8. IsomorphismFunctor
  9. IsomorphismInvariantFunctor
  10. IsomorphismLiftIO
  11. MonadCatchIO
  12. MonadIO
  13. Monad
  14. Bind
  15. Applicative
  16. InvariantApplicative
  17. Apply
  18. Functor
  19. InvariantFunctor
  20. LiftIO
  21. AnyRef
  22. Any
  1. Hide All
  2. Show All
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. implicit abstract def G: MonadCatchIO[G]
    Definition Classes
    IsomorphismMonadCatchIO → IsomorphismMonadIO → IsomorphismMonad → IsomorphismBind → IsomorphismApplicative → IsomorphismInvariantApplicative → IsomorphismApply → IsomorphismFunctor → IsomorphismInvariantFunctor → IsomorphismLiftIO
  2. abstract def iso: Isomorphism.<~>[F, G]
    Definition Classes
    IsomorphismFunctor → IsomorphismInvariantFunctor

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def ap[A, B](fa: ⇒ F[A])(f: ⇒ F[(A) ⇒ B]): F[B]
    Definition Classes
    IsomorphismApplicative → IsomorphismApply → Apply
  5. def ap2[A, B, C](fa: ⇒ F[A], fb: ⇒ F[B])(f: F[(A, B) ⇒ C]): F[C]
    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]
    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]
    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]
    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]
    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]
    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]
    Definition Classes
    Apply
  12. def apF[A, B](f: ⇒ F[(A) ⇒ B]): (F[A]) ⇒ F[B]
    Definition Classes
    Apply
  13. def applicativeLaw: ApplicativeLaw
    Definition Classes
    Applicative
  14. val applicativeSyntax: ApplicativeSyntax[F]
    Definition Classes
    Applicative
  15. def apply[A, B](fa: F[A])(f: (A) ⇒ B): F[B]
    Definition Classes
    Functor
  16. 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]
    Definition Classes
    Apply
  17. 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]
    Definition Classes
    Apply
  18. 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]
    Definition Classes
    Apply
  19. def apply2[A, B, C](fa: ⇒ F[A], fb: ⇒ F[B])(f: (A, B) ⇒ C): F[C]
    Definition Classes
    IsomorphismApplicative → IsomorphismApply → Applicative → Apply
  20. def apply3[A, B, C, D](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C])(f: (A, B, C) ⇒ D): F[D]
    Definition Classes
    Apply
  21. 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]
    Definition Classes
    Apply
  22. 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]
    Definition Classes
    Apply
  23. 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]
    Definition Classes
    Apply
  24. 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]
    Definition Classes
    Apply
  25. 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]
    Definition Classes
    Apply
  26. 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]
    Definition Classes
    Apply
  27. def applyApplicative: Applicative[[α]\/[F[α], α]]
    Definition Classes
    Apply
  28. def applyLaw: ApplyLaw
    Definition Classes
    Apply
  29. val applySyntax: ApplySyntax[F]
    Definition Classes
    Apply
  30. final def applying1[Z, A1](f: (A1) ⇒ Z)(implicit a1: F[A1]): F[Z]
    Definition Classes
    Apply
  31. final def applying2[Z, A1, A2](f: (A1, A2) ⇒ Z)(implicit a1: F[A1], a2: F[A2]): F[Z]
    Definition Classes
    Apply
  32. final def applying3[Z, A1, A2, A3](f: (A1, A2, A3) ⇒ Z)(implicit a1: F[A1], a2: F[A2], a3: F[A3]): F[Z]
    Definition Classes
    Apply
  33. final def applying4[Z, A1, A2, A3, A4](f: (A1, A2, A3, A4) ⇒ Z)(implicit a1: F[A1], a2: F[A2], a3: F[A3], a4: F[A4]): F[Z]
    Definition Classes
    Apply
  34. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  35. def bicompose[G[_, _]](implicit arg0: Bifunctor[G]): Bifunctor[[α, β]F[G[α, β]]]
    Definition Classes
    Functor
  36. def bind[A, B](fa: F[A])(f: (A) ⇒ F[B]): F[B]
    Definition Classes
    IsomorphismBind → Bind
  37. def bindLaw: BindLaw
    Definition Classes
    Bind
  38. val bindSyntax: BindSyntax[F]
    Definition Classes
    Bind
  39. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws(classOf[java.lang.CloneNotSupportedException])
  40. def compose[G[_]](implicit G0: Applicative[G]): Applicative[[α]F[G[α]]]
    Definition Classes
    Applicative
  41. def compose[G[_]](implicit G0: Apply[G]): Apply[[α]F[G[α]]]
    Definition Classes
    Apply
  42. def compose[G[_]](implicit G0: Functor[G]): Functor[[α]F[G[α]]]
    Definition Classes
    Functor
  43. def counzip[A, B](a: \/[F[A], F[B]]): F[\/[A, B]]
    Definition Classes
    Functor
  44. def discardLeft[A, B](fa: ⇒ F[A], fb: ⇒ F[B]): F[B]
    Definition Classes
    Apply
  45. def discardRight[A, B](fa: ⇒ F[A], fb: ⇒ F[B]): F[A]
    Definition Classes
    Apply
  46. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  47. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  48. def except[A](ma: F[A])(handler: (Throwable) ⇒ F[A]): F[A]

    Executes the handler if an exception is raised.

    Executes the handler if an exception is raised.

    Definition Classes
    IsomorphismMonadCatchIO → MonadCatchIO
  49. def filterM[A](l: IList[A])(f: (A) ⇒ F[Boolean]): F[IList[A]]
    Definition Classes
    Applicative
  50. def filterM[A](l: List[A])(f: (A) ⇒ F[Boolean]): F[List[A]]
    Definition Classes
    Applicative
  51. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  52. def flip: Applicative[F]
    Definition Classes
    Applicative → Apply
  53. def forever[A, B](fa: F[A]): F[B]
    Definition Classes
    Apply
  54. def fpair[A](fa: F[A]): F[(A, A)]
    Definition Classes
    Functor
  55. def fproduct[A, B](fa: F[A])(f: (A) ⇒ B): F[(A, B)]
    Definition Classes
    Functor
  56. def functorLaw: FunctorLaw
    Definition Classes
    Functor
  57. val functorSyntax: FunctorSyntax[F]
    Definition Classes
    Functor
  58. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  59. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  60. def icompose[G[_]](implicit G0: Contravariant[G]): Contravariant[[α]F[G[α]]]
    Definition Classes
    Functor
  61. def ifM[B](value: F[Boolean], ifTrue: ⇒ F[B], ifFalse: ⇒ F[B]): F[B]
    Definition Classes
    Bind
  62. val invariantApplicativeSyntax: InvariantApplicativeSyntax[F]
    Definition Classes
    InvariantApplicative
  63. def invariantFunctorLaw: InvariantFunctorLaw
    Definition Classes
    InvariantFunctor
  64. val invariantFunctorSyntax: InvariantFunctorSyntax[F]
    Definition Classes
    InvariantFunctor
  65. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  66. def iterateUntil[A](f: F[A])(p: (A) ⇒ Boolean): F[A]
    Definition Classes
    Monad
  67. def iterateWhile[A](f: F[A])(p: (A) ⇒ Boolean): F[A]
    Definition Classes
    Monad
  68. def join[A](ffa: F[F[A]]): F[A]
    Definition Classes
    Bind
  69. def lift[A, B](f: (A) ⇒ B): (F[A]) ⇒ F[B]
    Definition Classes
    Functor
  70. 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]
    Definition Classes
    Apply
  71. 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]
    Definition Classes
    Apply
  72. 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]
    Definition Classes
    Apply
  73. def lift2[A, B, C](f: (A, B) ⇒ C): (F[A], F[B]) ⇒ F[C]
    Definition Classes
    Apply
  74. def lift3[A, B, C, D](f: (A, B, C) ⇒ D): (F[A], F[B], F[C]) ⇒ F[D]
    Definition Classes
    Apply
  75. def lift4[A, B, C, D, E](f: (A, B, C, D) ⇒ E): (F[A], F[B], F[C], F[D]) ⇒ F[E]
    Definition Classes
    Apply
  76. 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]
    Definition Classes
    Apply
  77. 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]
    Definition Classes
    Apply
  78. 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]
    Definition Classes
    Apply
  79. 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]
    Definition Classes
    Apply
  80. 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]
    Definition Classes
    Apply
  81. def liftIO[A](ioa: IO[A]): F[A]
    Definition Classes
    IsomorphismLiftIO → LiftIO
  82. val liftIOSyntax: LiftIOSyntax[F]
    Definition Classes
    LiftIO
  83. def liftReducer[A, B](implicit r: Reducer[A, B]): Reducer[F[A], F[B]]
    Definition Classes
    Apply
  84. def map[A, B](fa: F[A])(f: (A) ⇒ B): F[B]
    Definition Classes
    IsomorphismFunctor → Functor
  85. def mapply[A, B](a: A)(f: F[(A) ⇒ B]): F[B]
    Definition Classes
    Functor
  86. val monadIOSyntax: MonadIOSyntax[F]
    Definition Classes
    MonadIO
  87. def monadLaw: MonadLaw
    Definition Classes
    Monad
  88. val monadSyntax: MonadSyntax[F]
    Definition Classes
    Monad
  89. def mproduct[A, B](fa: F[A])(f: (A) ⇒ F[B]): F[(A, B)]
    Definition Classes
    Bind
  90. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  91. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  92. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  93. def par: Par[F]
    Definition Classes
    Applicative
  94. def plusA[A](x: ⇒ F[A], y: ⇒ F[A])(implicit sa: Semigroup[A]): F[A]
    Definition Classes
    Applicative
  95. def point[A](a: ⇒ A): F[A]
    Definition Classes
    IsomorphismApplicative → Applicative
  96. def product[G[_]](implicit G0: Monad[G]): Monad[[α](F[α], G[α])]
    Definition Classes
    Monad
  97. def product[G[_]](implicit G0: Bind[G]): Bind[[α](F[α], G[α])]
    Definition Classes
    Bind
  98. def product[G[_]](implicit G0: Applicative[G]): Applicative[[α](F[α], G[α])]
    Definition Classes
    Applicative
  99. def product[G[_]](implicit G0: Apply[G]): Apply[[α](F[α], G[α])]
    Definition Classes
    Apply
  100. def product[G[_]](implicit G0: Functor[G]): Functor[[α](F[α], G[α])]
    Definition Classes
    Functor
  101. final def pure[A](a: ⇒ A): F[A]
    Definition Classes
    Applicative
  102. def replicateM[A](n: Int, fa: F[A]): F[IList[A]]
    Definition Classes
    Applicative
  103. def replicateM_[A](n: Int, fa: F[A]): F[Unit]
    Definition Classes
    Applicative
  104. def sequence[A, G[_]](as: G[F[A]])(implicit arg0: Traverse[G]): F[G[A]]
    Definition Classes
    Applicative
  105. def sequence1[A, G[_]](as: G[F[A]])(implicit arg0: Traverse1[G]): F[G[A]]
    Definition Classes
    Apply
  106. def strengthL[A, B](a: A, f: F[B]): F[(A, B)]
    Definition Classes
    Functor
  107. def strengthR[A, B](f: F[A], b: B): F[(A, B)]
    Definition Classes
    Functor
  108. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  109. def toString(): String
    Definition Classes
    AnyRef → Any
  110. def traverse[A, G[_], B](value: G[A])(f: (A) ⇒ F[B])(implicit G: Traverse[G]): F[G[B]]
    Definition Classes
    Applicative
  111. def traverse1[A, G[_], B](value: G[A])(f: (A) ⇒ F[B])(implicit G: Traverse1[G]): F[G[B]]
    Definition Classes
    Apply
  112. def tuple2[A, B](fa: ⇒ F[A], fb: ⇒ F[B]): F[(A, B)]
    Definition Classes
    Apply
  113. def tuple3[A, B, C](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C]): F[(A, B, C)]
    Definition Classes
    Apply
  114. def tuple4[A, B, C, D](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D]): F[(A, B, C, D)]
    Definition Classes
    Apply
  115. 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)]
    Definition Classes
    Apply
  116. def unfoldrOpt[S, A, B](seed: S)(f: (S) ⇒ Maybe[(F[A], S)])(implicit R: Reducer[A, B]): Maybe[F[B]]
    Definition Classes
    Apply
  117. def unlessM[A](cond: Boolean)(f: ⇒ F[A]): F[Unit]
    Definition Classes
    Applicative
  118. def untilM[G[_], A](f: F[A], cond: ⇒ F[Boolean])(implicit G: MonadPlus[G]): F[G[A]]
    Definition Classes
    Monad
  119. def untilM_[A](f: F[A], cond: ⇒ F[Boolean]): F[Unit]
    Definition Classes
    Monad
  120. def void[A](fa: F[A]): F[Unit]
    Definition Classes
    Functor
  121. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  122. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  123. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws(classOf[java.lang.InterruptedException])
  124. def whenM[A](cond: Boolean)(f: ⇒ F[A]): F[Unit]
    Definition Classes
    Applicative
  125. def whileM[G[_], A](p: F[Boolean], body: ⇒ F[A])(implicit G: MonadPlus[G]): F[G[A]]
    Definition Classes
    Monad
  126. def whileM_[A](p: F[Boolean], body: ⇒ F[A]): F[Unit]
    Definition Classes
    Monad
  127. def widen[A, B](fa: F[A])(implicit ev: <~<[A, B]): F[B]
    Definition Classes
    Functor
  128. final def xderiving0[Z](z: ⇒ Z): F[Z]
    Definition Classes
    InvariantApplicative
  129. final def xderiving1[Z, A1](f: (A1) ⇒ Z, g: (Z) ⇒ A1)(implicit a1: F[A1]): F[Z]
    Definition Classes
    InvariantApplicative
  130. final def xderiving2[Z, A1, A2](f: (A1, A2) ⇒ Z, g: (Z) ⇒ (A1, A2))(implicit a1: F[A1], a2: F[A2]): F[Z]
    Definition Classes
    InvariantApplicative
  131. final def xderiving3[Z, A1, A2, A3](f: (A1, A2, A3) ⇒ Z, g: (Z) ⇒ (A1, A2, A3))(implicit a1: F[A1], a2: F[A2], a3: F[A3]): F[Z]
    Definition Classes
    InvariantApplicative
  132. final def xderiving4[Z, A1, A2, A3, A4](f: (A1, A2, A3, A4) ⇒ Z, g: (Z) ⇒ (A1, A2, A3, A4))(implicit a1: F[A1], a2: F[A2], a3: F[A3], a4: F[A4]): F[Z]
    Definition Classes
    InvariantApplicative
  133. def xmap[A, B](ma: F[A], f: (A) ⇒ B, g: (B) ⇒ A): F[B]
    Definition Classes
    IsomorphismInvariantFunctor → InvariantFunctor
  134. def xmapb[A, B](ma: F[A])(b: Bijection[A, B]): F[B]
    Definition Classes
    InvariantFunctor
  135. def xmapi[A, B](ma: F[A])(iso: Isomorphism.<=>[A, B]): F[B]
    Definition Classes
    InvariantFunctor
  136. def xproduct0[Z](z: ⇒ Z): F[Z]
    Definition Classes
    IsomorphismApplicative → IsomorphismInvariantApplicative → Applicative → InvariantApplicative
  137. def xproduct1[Z, A1](a1: ⇒ F[A1])(f: (A1) ⇒ Z, g: (Z) ⇒ A1): F[Z]
    Definition Classes
    IsomorphismApplicative → Applicative → InvariantApplicative
  138. def xproduct2[Z, A1, A2](a1: ⇒ F[A1], a2: ⇒ F[A2])(f: (A1, A2) ⇒ Z, g: (Z) ⇒ (A1, A2)): F[Z]
    Definition Classes
    IsomorphismApplicative → IsomorphismInvariantApplicative → Applicative → InvariantApplicative
  139. def xproduct3[Z, A1, A2, A3](a1: ⇒ F[A1], a2: ⇒ F[A2], a3: ⇒ F[A3])(f: (A1, A2, A3) ⇒ Z, g: (Z) ⇒ (A1, A2, A3)): F[Z]
    Definition Classes
    IsomorphismApplicative → Applicative → InvariantApplicative
  140. def xproduct4[Z, A1, A2, A3, A4](a1: ⇒ F[A1], a2: ⇒ F[A2], a3: ⇒ F[A3], a4: ⇒ F[A4])(f: (A1, A2, A3, A4) ⇒ Z, g: (Z) ⇒ (A1, A2, A3, A4)): F[Z]
    Definition Classes
    IsomorphismApplicative → Applicative → InvariantApplicative

Inherited from IsomorphismMonadIO[F, G]

Inherited from IsomorphismMonad[F, G]

Inherited from IsomorphismBind[F, G]

Inherited from IsomorphismApplicative[F, G]

Inherited from IsomorphismInvariantApplicative[F, G]

Inherited from IsomorphismApply[F, G]

Inherited from IsomorphismFunctor[F, G]

Inherited from IsomorphismInvariantFunctor[F, G]

Inherited from IsomorphismLiftIO[F, G]

Inherited from MonadCatchIO[F]

Inherited from MonadIO[F]

Inherited from Monad[F]

Inherited from Bind[F]

Inherited from Applicative[F]

Inherited from InvariantApplicative[F]

Inherited from Apply[F]

Inherited from Functor[F]

Inherited from InvariantFunctor[F]

Inherited from LiftIO[F]

Inherited from AnyRef

Inherited from Any

Ungrouped