MonadIOSyntax

abstract def F: MonadIO[F]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

implicit def ApplicativeIdV[A](v: ⇒ A): ApplicativeIdV[A]

implicit def ToApplicativeOps[A](v: F[A]): ApplicativeOps[F, A]

implicit def ToApplyOps[A](v: F[A]): ApplyOps[F, A]

implicit def ToBindOps[A](v: F[A]): BindOps[F, A]

implicit def ToFunctorOps[A](v: F[A]): FunctorOps[F, A]

implicit def ToInvariantFunctorOps[A](v: F[A]): InvariantFunctorOps[F, A]

implicit def ToLiftIOOps[A](v: F[A]): LiftIOOps[F, A]

implicit def ToLiftV[A, B](v: (A) ⇒ B): LiftV[A, B]

implicit def ToMonadIOOps[A](v: F[A]): MonadIOOps[F, A]

implicit def ToMonadOps[A](v: F[A]): MonadOps[F, A]

def ^[A, B, C](fa: ⇒ F[A], fb: ⇒ F[B])(f: (A, B) ⇒ C): F[C]

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

def ^^^[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]

def ^^^^[A, B, C, D, E, I](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E])(f: (A, B, C, D, E) ⇒ I): F[I]

def ^^^^^[A, B, C, D, E, I, J](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E], fi: ⇒ F[I])(f: (A, B, C, D, E, I) ⇒ J): F[J]

def ^^^^^^[A, B, C, D, E, I, J, K](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E], fi: ⇒ F[I], fj: ⇒ F[J])(f: (A, B, C, D, E, I, J) ⇒ K): F[K]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def point[A](a: ⇒ A)(implicit F: Applicative[F]): F[A]

def pure[A](a: ⇒ A)(implicit F: Applicative[F]): F[A]

Alias for point

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def η[A](a: ⇒ A)(implicit F: Applicative[F]): F[A]