Trait/Object

scalaz.effect

MonadIO

Related Docs: object MonadIO | package effect

Permalink

trait MonadIO[F[_]] extends LiftIO[F] with Monad[F]

Self Type
MonadIO[F]
Source
MonadIO.scala
Linear Supertypes
Monad[F], Bind[F], Applicative[F], InvariantApplicative[F], Apply[F], Functor[F], InvariantFunctor[F], LiftIO[F], AnyRef, Any
Known Subclasses
IsomorphismMonadCatchIO, IsomorphismMonadIO, MonadCatchIO
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MonadIO
  2. Monad
  3. Bind
  4. Applicative
  5. InvariantApplicative
  6. Apply
  7. Functor
  8. InvariantFunctor
  9. LiftIO
  10. AnyRef
  11. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. trait ApplicativeLaw extends Applicative.ApplyLaw

    Permalink
    Definition Classes
    Applicative

  2. trait ApplyLaw extends Apply.FunctorLaw

    Permalink
    Definition Classes
    Apply

  3. trait BindLaw extends Bind.ApplyLaw

    Permalink
    Definition Classes
    Bind

  4. trait FlippedApply extends Apply[F]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    Apply

  5. trait FunctorLaw extends Functor.InvariantFunctorLaw

    Permalink
    Definition Classes
    Functor

  6. trait InvariantFunctorLaw extends AnyRef

    Permalink
    Definition Classes
    InvariantFunctor

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

    Permalink
    Definition Classes
    Monad

Abstract Value Members

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

    Permalink
    Definition Classes
    Bind

  2. abstract def liftIO[A](ioa: IO[A]): F[A]

    Permalink
    Definition Classes
    LiftIO

  3. abstract def point[A](a: ⇒ A): F[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. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. def ap[A, B](fa: ⇒ F[A])(f: ⇒ F[(A) ⇒ B]): F[B]

    Permalink
    Definition Classes
    Bind → Apply

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

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    Definition Classes
    Apply

  12. def apF[A, B](f: ⇒ F[(A) ⇒ B]): (F[A]) ⇒ F[B]

    Permalink
    Definition Classes
    Apply

  13. def applicativeLaw: ApplicativeLaw

    Permalink
    Definition Classes
    Applicative

  14. val applicativeSyntax: ApplicativeSyntax[F]

    Permalink
    Definition Classes
    Applicative

  15. def apply[A, B](fa: F[A])(f: (A) ⇒ B): F[B]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Bind → Apply

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

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    Definition Classes
    Apply

  27. def applyApplicative: Applicative[[α]\/[F[α], α]]

    Permalink
    Definition Classes
    Apply

  28. def applyLaw: ApplyLaw

    Permalink
    Definition Classes
    Apply

  29. val applySyntax: ApplySyntax[F]

    Permalink
    Definition Classes
    Apply

  30. final def applying1[Z, A1](f: (A1) ⇒ Z)(implicit a1: F[A1]): F[Z]

    Permalink
    Definition Classes
    Apply

  31. final def applying2[Z, A1, A2](f: (A1, A2) ⇒ Z)(implicit a1: F[A1], a2: F[A2]): F[Z]

    Permalink
    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]

    Permalink
    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]

    Permalink
    Definition Classes
    Apply

  34. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    Functor

  36. def bindLaw: BindLaw

    Permalink
    Definition Classes
    Bind

  37. val bindSyntax: BindSyntax[F]

    Permalink
    Definition Classes
    Bind

  38. def clone(): AnyRef

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

  39. def compose[G[_]](implicit G0: Applicative[G]): Applicative[[α]F[G[α]]]

    Permalink
    Definition Classes
    Applicative

  40. def compose[G[_]](implicit G0: Apply[G]): Apply[[α]F[G[α]]]

    Permalink
    Definition Classes
    Apply

  41. def compose[G[_]](implicit G0: Functor[G]): Functor[[α]F[G[α]]]

    Permalink
    Definition Classes
    Functor

  42. def counzip[A, B](a: \/[F[A], F[B]]): F[\/[A, B]]

    Permalink
    Definition Classes
    Functor

  43. def discardLeft[A, B](fa: ⇒ F[A], fb: ⇒ F[B]): F[B]

    Permalink
    Definition Classes
    Apply

  44. def discardRight[A, B](fa: ⇒ F[A], fb: ⇒ F[B]): F[A]

    Permalink
    Definition Classes
    Apply

  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: IList[A])(f: (A) ⇒ F[Boolean]): F[IList[A]]

    Permalink
    Definition Classes
    Applicative

  48. def filterM[A](l: List[A])(f: (A) ⇒ F[Boolean]): F[List[A]]

    Permalink
    Definition Classes
    Applicative

  49. def filterM[A, B](map: ==>>[A, B])(f: (B) ⇒ F[Boolean])(implicit O: Order[A]): F[==>>[A, B]]

    Permalink
    Definition Classes
    Applicative

  50. def finalize(): Unit

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

  51. def flip: Applicative[F]

    Permalink
    Definition Classes
    Applicative → Apply

  52. def forever[A, B](fa: F[A]): F[B]

    Permalink
    Definition Classes
    Apply

  53. def fpair[A](fa: F[A]): F[(A, A)]

    Permalink
    Definition Classes
    Functor

  54. def fproduct[A, B](fa: F[A])(f: (A) ⇒ B): F[(A, B)]

    Permalink
    Definition Classes
    Functor

  55. def functorLaw: FunctorLaw

    Permalink
    Definition Classes
    Functor

  56. val functorSyntax: FunctorSyntax[F]

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    AnyRef → Any

  58. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  59. def icompose[G[_]](implicit G0: Contravariant[G]): Contravariant[[α]F[G[α]]]

    Permalink
    Definition Classes
    Functor

  60. def ifM[B](value: F[Boolean], ifTrue: ⇒ F[B], ifFalse: ⇒ F[B]): F[B]

    Permalink
    Definition Classes
    Bind

  61. val invariantApplicativeSyntax: InvariantApplicativeSyntax[F]

    Permalink
    Definition Classes
    InvariantApplicative

  62. def invariantFunctorLaw: InvariantFunctorLaw

    Permalink
    Definition Classes
    InvariantFunctor

  63. val invariantFunctorSyntax: InvariantFunctorSyntax[F]

    Permalink
    Definition Classes
    InvariantFunctor

  64. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  65. def iterateUntil[A](f: F[A])(p: (A) ⇒ Boolean): F[A]

    Permalink
    Definition Classes
    Monad

  66. def iterateWhile[A](f: F[A])(p: (A) ⇒ Boolean): F[A]

    Permalink
    Definition Classes
    Monad

  67. def join[A](ffa: F[F[A]]): F[A]

    Permalink
    Definition Classes
    Bind

  68. def lift[A, B](f: (A) ⇒ B): (F[A]) ⇒ F[B]

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

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

    Permalink
    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): (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]

    Permalink
    Definition Classes
    Apply

  72. def lift2[A, B, C](f: (A, B) ⇒ C): (F[A], F[B]) ⇒ F[C]

    Permalink
    Definition Classes
    Apply

  73. def lift3[A, B, C, D](f: (A, B, C) ⇒ D): (F[A], F[B], F[C]) ⇒ F[D]

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

  75. 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]

    Permalink
    Definition Classes
    Apply

  76. 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]

    Permalink
    Definition Classes
    Apply

  77. 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]

    Permalink
    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): (F[A], F[B], F[C], F[D], F[E], F[FF], F[G], F[H]) ⇒ F[R]

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

    Permalink
    Definition Classes
    Apply

  80. val liftIOSyntax: LiftIOSyntax[F]

    Permalink
    Definition Classes
    LiftIO

  81. def liftReducer[A, B](implicit r: Reducer[A, B]): Reducer[F[A], F[B]]

    Permalink
    Definition Classes
    Apply

  82. def map[A, B](fa: F[A])(f: (A) ⇒ B): F[B]

    Permalink
    Definition Classes
    Monad → Applicative → Functor

  83. def mapply[A, B](a: A)(f: F[(A) ⇒ B]): F[B]

    Permalink
    Definition Classes
    Functor

  84. val monadIOSyntax: MonadIOSyntax[F]

    Permalink

  85. def monadLaw: MonadLaw

    Permalink
    Definition Classes
    Monad

  86. val monadSyntax: MonadSyntax[F]

    Permalink
    Definition Classes
    Monad

  87. def mproduct[A, B](fa: F[A])(f: (A) ⇒ F[B]): F[(A, B)]

    Permalink
    Definition Classes
    Bind

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

    Permalink
    Definition Classes
    AnyRef

  89. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  90. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  91. def par: Par[F]

    Permalink
    Definition Classes
    Applicative

  92. def plusA[A](x: ⇒ F[A], y: ⇒ F[A])(implicit sa: Semigroup[A]): F[A]

    Permalink
    Definition Classes
    Applicative

  93. def product[G[_]](implicit G0: Monad[G]): Monad[[α](F[α], G[α])]

    Permalink
    Definition Classes
    Monad

  94. def product[G[_]](implicit G0: Bind[G]): Bind[[α](F[α], G[α])]

    Permalink
    Definition Classes
    Bind

  95. def product[G[_]](implicit G0: Applicative[G]): Applicative[[α](F[α], G[α])]

    Permalink
    Definition Classes
    Applicative

  96. def product[G[_]](implicit G0: Apply[G]): Apply[[α](F[α], G[α])]

    Permalink
    Definition Classes
    Apply

  97. def product[G[_]](implicit G0: Functor[G]): Functor[[α](F[α], G[α])]

    Permalink
    Definition Classes
    Functor

  98. final def pure[A](a: ⇒ A): F[A]

    Permalink
    Definition Classes
    Applicative

  99. def replicateM[A](n: Int, fa: F[A]): F[IList[A]]

    Permalink
    Definition Classes
    Applicative

  100. def replicateM_[A](n: Int, fa: F[A]): F[Unit]

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Apply

  103. def strengthL[A, B](a: A, f: F[B]): F[(A, B)]

    Permalink
    Definition Classes
    Functor

  104. def strengthR[A, B](f: F[A], b: B): F[(A, B)]

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    AnyRef

  106. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Apply

  109. def tuple2[A, B](fa: ⇒ F[A], fb: ⇒ F[B]): F[(A, B)]

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

  112. 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)]

    Permalink
    Definition Classes
    Apply

  113. def unfoldrOpt[S, A, B](seed: S)(f: (S) ⇒ Maybe[(F[A], S)])(implicit R: Reducer[A, B]): Maybe[F[B]]

    Permalink
    Definition Classes
    Apply

  114. def unlessM[A](cond: Boolean)(f: ⇒ F[A]): F[Unit]

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Monad

  116. def untilM_[A](f: F[A], cond: ⇒ F[Boolean]): F[Unit]

    Permalink
    Definition Classes
    Monad

  117. def void[A](fa: F[A]): F[Unit]

    Permalink
    Definition Classes
    Functor

  118. final def wait(): Unit

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

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

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

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

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

  121. def whenM[A](cond: Boolean)(f: ⇒ F[A]): F[Unit]

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Monad

  123. def whileM_[A](p: F[Boolean], body: ⇒ F[A]): F[Unit]

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    Functor

  125. final def xderiving0[Z](z: ⇒ Z): F[Z]

    Permalink
    Definition Classes
    InvariantApplicative

  126. final def xderiving1[Z, A1](f: (A1) ⇒ Z, g: (Z) ⇒ A1)(implicit a1: F[A1]): F[Z]

    Permalink
    Definition Classes
    InvariantApplicative

  127. final def xderiving2[Z, A1, A2](f: (A1, A2) ⇒ Z, g: (Z) ⇒ (A1, A2))(implicit a1: F[A1], a2: F[A2]): F[Z]

    Permalink
    Definition Classes
    InvariantApplicative

  128. 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]

    Permalink
    Definition Classes
    InvariantApplicative

  129. 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]

    Permalink
    Definition Classes
    InvariantApplicative

  130. def xmap[A, B](fa: F[A], f: (A) ⇒ B, g: (B) ⇒ A): F[B]

    Permalink
    Definition Classes
    Functor → InvariantFunctor

  131. def xmapb[A, B](ma: F[A])(b: Bijection[A, B]): F[B]

    Permalink
    Definition Classes
    InvariantFunctor

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

    Permalink
    Definition Classes
    InvariantFunctor

  133. def xproduct0[Z](z: ⇒ Z): F[Z]

    Permalink
    Definition Classes
    Applicative → InvariantApplicative

  134. def xproduct1[Z, A1](a1: ⇒ F[A1])(f: (A1) ⇒ Z, g: (Z) ⇒ A1): F[Z]

    Permalink
    Definition Classes
    Applicative → InvariantApplicative

  135. def xproduct2[Z, A1, A2](a1: ⇒ F[A1], a2: ⇒ F[A2])(f: (A1, A2) ⇒ Z, g: (Z) ⇒ (A1, A2)): F[Z]

    Permalink
    Definition Classes
    Applicative → InvariantApplicative

  136. 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]

    Permalink
    Definition Classes
    Applicative → InvariantApplicative

  137. 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]

    Permalink
    Definition Classes
    Applicative → InvariantApplicative

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