KleisliCatchIO

implicit abstract def F: MonadCatchIO[M]

implicit abstract def L: LiftIO[M]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def ap[A, B](fa: ⇒ Kleisli[M, R, A])(f: ⇒ Kleisli[M, R, (A) ⇒ B]): Kleisli[M, R, B]

def ap2[A, B, C](fa: ⇒ Kleisli[M, R, A], fb: ⇒ Kleisli[M, R, B])(f: Kleisli[M, R, (A, B) ⇒ C]): Kleisli[M, R, C]

def ap3[A, B, C, D](fa: ⇒ Kleisli[M, R, A], fb: ⇒ Kleisli[M, R, B], fc: ⇒ Kleisli[M, R, C])(f: Kleisli[M, R, (A, B, C) ⇒ D]): Kleisli[M, R, D]

def ap4[A, B, C, D, E](fa: ⇒ Kleisli[M, R, A], fb: ⇒ Kleisli[M, R, B], fc: ⇒ Kleisli[M, R, C], fd: ⇒ Kleisli[M, R, D])(f: Kleisli[M, R, (A, B, C, D) ⇒ E]): Kleisli[M, R, E]

def ap5[A, B, C, D, E, R](fa: ⇒ Kleisli[M, R, A], fb: ⇒ Kleisli[M, R, B], fc: ⇒ Kleisli[M, R, C], fd: ⇒ Kleisli[M, R, D], fe: ⇒ Kleisli[M, R, E])(f: Kleisli[M, R, (A, B, C, D, E) ⇒ R]): Kleisli[M, R, R]

def ap6[A, B, C, D, E, FF, R](fa: ⇒ Kleisli[M, R, A], fb: ⇒ Kleisli[M, R, B], fc: ⇒ Kleisli[M, R, C], fd: ⇒ Kleisli[M, R, D], fe: ⇒ Kleisli[M, R, E], ff: ⇒ Kleisli[M, R, FF])(f: Kleisli[M, R, (A, B, C, D, E, FF) ⇒ R]): Kleisli[M, R, R]

def ap7[A, B, C, D, E, FF, G, R](fa: ⇒ Kleisli[M, R, A], fb: ⇒ Kleisli[M, R, B], fc: ⇒ Kleisli[M, R, C], fd: ⇒ Kleisli[M, R, D], fe: ⇒ Kleisli[M, R, E], ff: ⇒ Kleisli[M, R, FF], fg: ⇒ Kleisli[M, R, G])(f: Kleisli[M, R, (A, B, C, D, E, FF, G) ⇒ R]): Kleisli[M, R, R]

def ap8[A, B, C, D, E, FF, G, H, R](fa: ⇒ Kleisli[M, R, A], fb: ⇒ Kleisli[M, R, B], fc: ⇒ Kleisli[M, R, C], fd: ⇒ Kleisli[M, R, D], fe: ⇒ Kleisli[M, R, E], ff: ⇒ Kleisli[M, R, FF], fg: ⇒ Kleisli[M, R, G], fh: ⇒ Kleisli[M, R, H])(f: Kleisli[M, R, (A, B, C, D, E, FF, G, H) ⇒ R]): Kleisli[M, R, R]

def apF[A, B](f: ⇒ Kleisli[M, R, (A) ⇒ B]): (Kleisli[M, R, A]) ⇒ Kleisli[M, R, B]

Flipped variant of ap.

def applicativeLaw: ApplicativeLaw

val applicativeSyntax: ApplicativeSyntax[[α]Kleisli[M, R, α]]

def apply[A, B](fa: Kleisli[M, R, A])(f: (A) ⇒ B): Kleisli[M, R, B]

Alias for map.

def apply10[A, B, C, D, E, FF, G, H, I, J, R](fa: ⇒ Kleisli[M, R, A], fb: ⇒ Kleisli[M, R, B], fc: ⇒ Kleisli[M, R, C], fd: ⇒ Kleisli[M, R, D], fe: ⇒ Kleisli[M, R, E], ff: ⇒ Kleisli[M, R, FF], fg: ⇒ Kleisli[M, R, G], fh: ⇒ Kleisli[M, R, H], fi: ⇒ Kleisli[M, R, I], fj: ⇒ Kleisli[M, R, J])(f: (A, B, C, D, E, FF, G, H, I, J) ⇒ R): Kleisli[M, R, R]

def apply11[A, B, C, D, E, FF, G, H, I, J, K, R](fa: ⇒ Kleisli[M, R, A], fb: ⇒ Kleisli[M, R, B], fc: ⇒ Kleisli[M, R, C], fd: ⇒ Kleisli[M, R, D], fe: ⇒ Kleisli[M, R, E], ff: ⇒ Kleisli[M, R, FF], fg: ⇒ Kleisli[M, R, G], fh: ⇒ Kleisli[M, R, H], fi: ⇒ Kleisli[M, R, I], fj: ⇒ Kleisli[M, R, J], fk: ⇒ Kleisli[M, R, K])(f: (A, B, C, D, E, FF, G, H, I, J, K) ⇒ R): Kleisli[M, R, R]

def apply12[A, B, C, D, E, FF, G, H, I, J, K, L, R](fa: ⇒ Kleisli[M, R, A], fb: ⇒ Kleisli[M, R, B], fc: ⇒ Kleisli[M, R, C], fd: ⇒ Kleisli[M, R, D], fe: ⇒ Kleisli[M, R, E], ff: ⇒ Kleisli[M, R, FF], fg: ⇒ Kleisli[M, R, G], fh: ⇒ Kleisli[M, R, H], fi: ⇒ Kleisli[M, R, I], fj: ⇒ Kleisli[M, R, J], fk: ⇒ Kleisli[M, R, K], fl: ⇒ Kleisli[M, R, L])(f: (A, B, C, D, E, FF, G, H, I, J, K, L) ⇒ R): Kleisli[M, R, R]

def apply2[A, B, C](fa: ⇒ Kleisli[M, R, A], fb: ⇒ Kleisli[M, R, B])(f: (A, B) ⇒ C): Kleisli[M, R, C]

def apply3[A, B, C, D](fa: ⇒ Kleisli[M, R, A], fb: ⇒ Kleisli[M, R, B], fc: ⇒ Kleisli[M, R, C])(f: (A, B, C) ⇒ D): Kleisli[M, R, D]

def apply4[A, B, C, D, E](fa: ⇒ Kleisli[M, R, A], fb: ⇒ Kleisli[M, R, B], fc: ⇒ Kleisli[M, R, C], fd: ⇒ Kleisli[M, R, D])(f: (A, B, C, D) ⇒ E): Kleisli[M, R, E]

def apply5[A, B, C, D, E, R](fa: ⇒ Kleisli[M, R, A], fb: ⇒ Kleisli[M, R, B], fc: ⇒ Kleisli[M, R, C], fd: ⇒ Kleisli[M, R, D], fe: ⇒ Kleisli[M, R, E])(f: (A, B, C, D, E) ⇒ R): Kleisli[M, R, R]

def apply6[A, B, C, D, E, FF, R](fa: ⇒ Kleisli[M, R, A], fb: ⇒ Kleisli[M, R, B], fc: ⇒ Kleisli[M, R, C], fd: ⇒ Kleisli[M, R, D], fe: ⇒ Kleisli[M, R, E], ff: ⇒ Kleisli[M, R, FF])(f: (A, B, C, D, E, FF) ⇒ R): Kleisli[M, R, R]

def apply7[A, B, C, D, E, FF, G, R](fa: ⇒ Kleisli[M, R, A], fb: ⇒ Kleisli[M, R, B], fc: ⇒ Kleisli[M, R, C], fd: ⇒ Kleisli[M, R, D], fe: ⇒ Kleisli[M, R, E], ff: ⇒ Kleisli[M, R, FF], fg: ⇒ Kleisli[M, R, G])(f: (A, B, C, D, E, FF, G) ⇒ R): Kleisli[M, R, R]

def apply8[A, B, C, D, E, FF, G, H, R](fa: ⇒ Kleisli[M, R, A], fb: ⇒ Kleisli[M, R, B], fc: ⇒ Kleisli[M, R, C], fd: ⇒ Kleisli[M, R, D], fe: ⇒ Kleisli[M, R, E], ff: ⇒ Kleisli[M, R, FF], fg: ⇒ Kleisli[M, R, G], fh: ⇒ Kleisli[M, R, H])(f: (A, B, C, D, E, FF, G, H) ⇒ R): Kleisli[M, R, R]

def apply9[A, B, C, D, E, FF, G, H, I, R](fa: ⇒ Kleisli[M, R, A], fb: ⇒ Kleisli[M, R, B], fc: ⇒ Kleisli[M, R, C], fd: ⇒ Kleisli[M, R, D], fe: ⇒ Kleisli[M, R, E], ff: ⇒ Kleisli[M, R, FF], fg: ⇒ Kleisli[M, R, G], fh: ⇒ Kleisli[M, R, H], fi: ⇒ Kleisli[M, R, I])(f: (A, B, C, D, E, FF, G, H, I) ⇒ R): Kleisli[M, R, R]

val applySyntax: ApplySyntax[[α]Kleisli[M, R, α]]

final def asInstanceOf[T0]: T0

def ask: Kleisli[M, R, R]

def asks[A](f: (R) ⇒ A): Kleisli[M, R, A]

def bind[A, B](fa: Kleisli[M, R, A])(f: (A) ⇒ Kleisli[M, R, B]): Kleisli[M, R, B]

Equivalent to join(map(fa)(f)).

val bindSyntax: BindSyntax[[α]Kleisli[M, R, α]]

def clone(): AnyRef

def compose[G[_]](implicit G0: Applicative[G]): Applicative[[α]Kleisli[M, R, G[α]]]

The composition of Applicatives F and G, [x]F[G[x]], is an Applicative

def compose[G[_]](implicit G0: Apply[G]): Apply[[α]Kleisli[M, R, G[α]]]

The composition of Applys F and G, [x]F[G[x]], is a Apply

def compose[G[_]](implicit G0: Functor[G]): Functor[[α]Kleisli[M, R, G[α]]]

The composition of Functors F and G, [x]F[G[x]], is a Functor

def counzip[A, B](a: \/[Kleisli[M, R, A], Kleisli[M, R, B]]): Kleisli[M, R, \/[A, B]]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def except[A](k: Kleisli[M, R, A])(h: (Throwable) ⇒ Kleisli[M, R, A]): Kleisli[M, R, A]

Executes the handler if an exception is raised.

def filterM[A](l: List[A])(f: (A) ⇒ Kleisli[M, R, Boolean]): Kleisli[M, R, List[A]]

Filter l according to an applicative predicate.

def finalize(): Unit

def flip: Applicative[[α]Kleisli[M, R, α]]

An Applicative for F in which effects happen in the opposite order.

def fpair[A](fa: Kleisli[M, R, A]): Kleisli[M, R, (A, A)]

Twin all As in fa.

def fproduct[A, B](fa: Kleisli[M, R, A])(f: (A) ⇒ B): Kleisli[M, R, (A, B)]

Pair all As in fa with the result of function application.

def functorLaw: FunctorLaw

val functorSyntax: FunctorSyntax[[α]Kleisli[M, R, α]]

final def getClass(): Class[_]

def hashCode(): Int

def ifM[B](value: Kleisli[M, R, Boolean], ifTrue: ⇒ Kleisli[M, R, B], ifFalse: ⇒ Kleisli[M, R, B]): Kleisli[M, R, B]

if lifted into a binding.

final def isInstanceOf[T0]: Boolean

def join[A](ffa: Kleisli[M, R, Kleisli[M, R, A]]): Kleisli[M, R, A]

Sequence the inner F of FFA after the outer F, forming a single F[A].

def lift[A, B](f: (A) ⇒ B): (Kleisli[M, R, A]) ⇒ Kleisli[M, R, B]

Lift f into F.

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

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

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

def lift2[A, B, C](f: (A, B) ⇒ C): (Kleisli[M, R, A], Kleisli[M, R, B]) ⇒ Kleisli[M, R, C]

def lift3[A, B, C, D](f: (A, B, C) ⇒ D): (Kleisli[M, R, A], Kleisli[M, R, B], Kleisli[M, R, C]) ⇒ Kleisli[M, R, D]

def lift4[A, B, C, D, E](f: (A, B, C, D) ⇒ E): (Kleisli[M, R, A], Kleisli[M, R, B], Kleisli[M, R, C], Kleisli[M, R, D]) ⇒ Kleisli[M, R, E]

def lift5[A, B, C, D, E, R](f: (A, B, C, D, E) ⇒ R): (Kleisli[M, R, A], Kleisli[M, R, B], Kleisli[M, R, C], Kleisli[M, R, D], Kleisli[M, R, E]) ⇒ Kleisli[M, R, R]

def lift6[A, B, C, D, E, FF, R](f: (A, B, C, D, E, FF) ⇒ R): (Kleisli[M, R, A], Kleisli[M, R, B], Kleisli[M, R, C], Kleisli[M, R, D], Kleisli[M, R, E], Kleisli[M, R, FF]) ⇒ Kleisli[M, R, R]

def lift7[A, B, C, D, E, FF, G, R](f: (A, B, C, D, E, FF, G) ⇒ R): (Kleisli[M, R, A], Kleisli[M, R, B], Kleisli[M, R, C], Kleisli[M, R, D], Kleisli[M, R, E], Kleisli[M, R, FF], Kleisli[M, R, G]) ⇒ Kleisli[M, R, R]

def lift8[A, B, C, D, E, FF, G, H, R](f: (A, B, C, D, E, FF, G, H) ⇒ R): (Kleisli[M, R, A], Kleisli[M, R, B], Kleisli[M, R, C], Kleisli[M, R, D], Kleisli[M, R, E], Kleisli[M, R, FF], Kleisli[M, R, G], Kleisli[M, R, H]) ⇒ Kleisli[M, R, R]

def lift9[A, B, C, D, E, FF, G, H, I, R](f: (A, B, C, D, E, FF, G, H, I) ⇒ R): (Kleisli[M, R, A], Kleisli[M, R, B], Kleisli[M, R, C], Kleisli[M, R, D], Kleisli[M, R, E], Kleisli[M, R, FF], Kleisli[M, R, G], Kleisli[M, R, H], Kleisli[M, R, I]) ⇒ Kleisli[M, R, R]

def liftIO[A](ioa: IO[A]): Kleisli[M, R, A]

val liftIOSyntax: LiftIOSyntax[[α]Kleisli[M, R, α]]

def local[A](f: (R) ⇒ R)(fa: Kleisli[M, R, A]): Kleisli[M, R, A]

def map[A, B](fa: Kleisli[M, R, A])(f: (A) ⇒ B): Kleisli[M, R, B]

Lift f into F and apply to F[A].

def mapply[A, B](a: A)(f: Kleisli[M, R, (A) ⇒ B]): Kleisli[M, R, B]

Lift apply(a), and apply the result to f.

val monadIOSyntax: MonadIOSyntax[[α]Kleisli[M, R, α]]

def monadLaw: MonadLaw

val monadSyntax: MonadSyntax[[α]Kleisli[M, R, α]]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def point[A](a: ⇒ A): Kleisli[M, R, A]

def product[G[_]](implicit G0: Applicative[G]): Applicative[[α](Kleisli[M, R, α], G[α])]

The product of Applicatives F and G, [x](F[x], G[x]]), is an Applicative

def product[G[_]](implicit G0: Apply[G]): Apply[[α](Kleisli[M, R, α], G[α])]

The product of Applys F and G, [x](F[x], G[x]]), is a Apply

def product[G[_]](implicit G0: Functor[G]): Functor[[α](Kleisli[M, R, α], G[α])]

The product of Functors F and G, [x](F[x], G[x]]), is a Functor

def pure[A](a: ⇒ A): Kleisli[M, R, A]

def replicateM[A](n: Int, fa: Kleisli[M, R, A]): Kleisli[M, R, List[A]]

Performs the action n times, returning the list of results.

def replicateM_[A](n: Int, fa: Kleisli[M, R, A]): Kleisli[M, R, Unit]

Performs the action n times, returning nothing.

def scope[A](k: R)(fa: Kleisli[M, R, A]): Kleisli[M, R, A]

def sequence[A, G[_]](as: G[Kleisli[M, R, A]])(implicit arg0: Traverse[G]): Kleisli[M, R, G[A]]

def sequence1[A, G[_]](as: G[Kleisli[M, R, A]])(implicit arg0: Traverse1[G]): Kleisli[M, R, G[A]]

def strengthL[A, B](a: A, f: Kleisli[M, R, B]): Kleisli[M, R, (A, B)]

Inject a to the left of Bs in f.

def strengthR[A, B](f: Kleisli[M, R, A], b: B): Kleisli[M, R, (A, B)]

Inject b to the right of As in f.

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

def toString(): String

def traverse[A, G[_], B](value: G[A])(f: (A) ⇒ Kleisli[M, R, B])(implicit G: Traverse[G]): Kleisli[M, R, G[B]]

def traverse1[A, G[_], B](value: G[A])(f: (A) ⇒ Kleisli[M, R, B])(implicit G: Traverse1[G]): Kleisli[M, R, G[B]]

def tuple2[A, B](fa: ⇒ Kleisli[M, R, A], fb: ⇒ Kleisli[M, R, B]): Kleisli[M, R, (A, B)]

def tuple3[A, B, C](fa: ⇒ Kleisli[M, R, A], fb: ⇒ Kleisli[M, R, B], fc: Kleisli[M, R, C]): Kleisli[M, R, (A, B, C)]

def tuple4[A, B, C, D](fa: ⇒ Kleisli[M, R, A], fb: ⇒ Kleisli[M, R, B], fc: ⇒ Kleisli[M, R, C], fd: ⇒ Kleisli[M, R, D]): Kleisli[M, R, (A, B, C, D)]

def tuple5[A, B, C, D, E](fa: ⇒ Kleisli[M, R, A], fb: ⇒ Kleisli[M, R, B], fc: ⇒ Kleisli[M, R, C], fd: ⇒ Kleisli[M, R, D], fe: ⇒ Kleisli[M, R, E]): Kleisli[M, R, (A, B, C, D, E)]

def void[A](fa: Kleisli[M, R, A]): Kleisli[M, R, Unit]

Empty fa of meaningful pure values, preserving its structure.

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def map2[A, B, C](fa: ⇒ Kleisli[M, R, A], fb: ⇒ Kleisli[M, R, B])(f: (A, B) ⇒ C): Kleisli[M, R, C]

def map3[A, B, C, D](fa: ⇒ Kleisli[M, R, A], fb: ⇒ Kleisli[M, R, B], fc: ⇒ Kleisli[M, R, C])(f: (A, B, C) ⇒ D): Kleisli[M, R, D]

def map4[A, B, C, D, E](fa: ⇒ Kleisli[M, R, A], fb: ⇒ Kleisli[M, R, B], fc: ⇒ Kleisli[M, R, C], fd: ⇒ Kleisli[M, R, D])(f: (A, B, C, D) ⇒ E): Kleisli[M, R, E]

def zip: Zip[[α]Kleisli[M, R, α]]

scalaz.Zip derived from tuple2.