Trait/Object

scalaz.effect

MonadControlIO

Related Docs: object MonadControlIO | package effect

Permalink

trait MonadControlIO[F[_]] extends LiftControlIO[F] with Monad[F]

Self Type
MonadControlIO[F]
Source
MonadControlIO.scala
Linear Supertypes
Monad[F], Bind[F], Applicative[F], Apply[F], Functor[F], InvariantFunctor[F], LiftControlIO[F], AnyRef, Any
Known Subclasses
IsomorphismMonadControlIO
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MonadControlIO
  2. Monad
  3. Bind
  4. Applicative
  5. Apply
  6. Functor
  7. InvariantFunctor
  8. LiftControlIO
  9. AnyRef
  10. 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 liftControlIO[A](f: (RunInBase[F, IO]) ⇒ IO[A]): F[A]

    Permalink
    Definition Classes
    LiftControlIO

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

    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 asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    Functor

  32. def bindLaw: BindLaw

    Permalink
    Definition Classes
    Bind

  33. val bindSyntax: BindSyntax[F]

    Permalink
    Definition Classes
    Bind

  34. def clone(): AnyRef

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

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    AnyRef

  42. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    Applicative

  44. def finalize(): Unit

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

  45. def flip: Applicative[F]

    Permalink
    Definition Classes
    Applicative → Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    Functor

  49. def functorLaw: FunctorLaw

    Permalink
    Definition Classes
    Functor

  50. val functorSyntax: FunctorSyntax[F]

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    AnyRef → Any

  52. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    Bind

  55. def invariantFunctorLaw: InvariantFunctorLaw

    Permalink
    Definition Classes
    InvariantFunctor

  56. val invariantFunctorSyntax: InvariantFunctorSyntax[F]

    Permalink
    Definition Classes
    InvariantFunctor

  57. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    Bind

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

    Permalink
    Definition Classes
    Functor

  62. 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

  63. 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

  64. 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

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

  67. 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

  68. 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

  69. 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

  70. 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

  71. 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

  72. 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

  73. val liftControlIOSyntax: LiftControlIOSyntax[F]

    Permalink
    Definition Classes
    LiftControlIO

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

    Permalink
    Definition Classes
    Monad → Applicative → Functor

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

    Permalink
    Definition Classes
    Functor

  76. val monadControlIOSyntax: MonadControlIOSyntax[F]

    Permalink

  77. def monadLaw: MonadLaw

    Permalink
    Definition Classes
    Monad

  78. val monadSyntax: MonadSyntax[F]

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    Bind

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

    Permalink
    Definition Classes
    AnyRef

  81. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  82. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    Bind

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    Applicative

  89. def replicateM[A](n: Int, fa: F[A]): F[List[A]]

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    AnyRef

  96. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

  101. 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

  102. 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

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    Functor

  107. final def wait(): Unit

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

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

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

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

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

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    Functor → InvariantFunctor

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

    Permalink
    Definition Classes
    InvariantFunctor

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

    Permalink
    Definition Classes
    InvariantFunctor

Inherited from Monad[F]

Inherited from Bind[F]

Inherited from Applicative[F]

Inherited from Apply[F]

Inherited from Functor[F]

Inherited from InvariantFunctor[F]

Inherited from LiftControlIO[F]

Inherited from AnyRef

Inherited from Any

Ungrouped