Kleisli

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def applyK[F[_], A](a: A): ~>[[γ$0$]Kleisli[F, A, γ$0$], F]

Creates a FunctionK that transforms a Kleisli[F, A, B] into an F[B] by applying the value of type a:A.

scala> import cats.{~>}, cats.data.{Kleisli, EitherT}

scala> def f(i: Int): Option[Either[Char, Char]] = if (i > 0) Some(Right('n')) else if (i < 0) Some(Left('z')) else None

scala> type KOI[A] = Kleisli[Option, Int, A]
scala> val b: KOI[Either[Char, Char]] = Kleisli[Option, Int, Either[Char, Char]](f _)
scala> val nt: Kleisli[Option, Int, ?] ~> Option = Kleisli.applyK[Option, Int](1)
scala> nt(b)
res0: Option[Either[Char, Char]] = Some(Right(n))

scala> type EKOIC[A] = EitherT[KOI, Char, A]
scala> val c: EKOIC[Char] = EitherT[KOI, Char, Char](b)
scala> c.mapK(nt).value
res1: Option[Either[Char, Char]] = Some(Right(n))

scala> val ntz = Kleisli.applyK[Option, Int](0)
scala> c.mapK(ntz).value
res2: Option[Either[Char, Char]] = None

final def asInstanceOf[T0]: T0

def ask[F[_], A](implicit F: Applicative[F]): Kleisli[F, A, A]

Creates a Kleisli arrow which can lift an A into applicative context F.

scala> Kleisli.ask[Option, Int].run(1)
res0: Option[Int]: Some(1)

implicit def catsDataAlternativeForKleisli[F[_], A](implicit F0: Alternative[F]): Alternative[[γ$54$]Kleisli[F, A, γ$54$]]

implicit def catsDataApplicativeErrorForKleisli[F[_], E, A](implicit F0: ApplicativeError[F, E]): ApplicativeError[[γ$68$]Kleisli[F, A, γ$68$], E]

implicit def catsDataApplicativeForKleisli[F[_], A](implicit A: Applicative[F]): Applicative[[γ$69$]Kleisli[F, A, γ$69$]]

implicit def catsDataApplyForKleisli[F[_], A](implicit A: Apply[F]): Apply[[γ$70$]Kleisli[F, A, γ$70$]]

implicit def catsDataArrowChoiceForKleisli[F[_]](implicit M: Monad[F]): ArrowChoice[[β$28$, γ$29$]Kleisli[F, β$28$, γ$29$]]

implicit def catsDataChoiceForKleisli[F[_]](implicit M: Monad[F]): Choice[[β$58$, γ$59$]Kleisli[F, β$58$, γ$59$]]

implicit val catsDataChoiceForKleisliId: Choice[[β$60$, γ$61$]Kleisli[[A]A, β$60$, γ$61$]]

implicit def catsDataCommutativeArrowForKleisli[F[_]](implicit M: CommutativeMonad[F]): CommutativeArrow[[β$21$, γ$22$]Kleisli[F, β$21$, γ$22$]] with ArrowChoice[[β$23$, γ$24$]Kleisli[F, β$23$, γ$24$]]

implicit val catsDataCommutativeArrowForKleisliId: CommutativeArrow[[β$16$, γ$17$]Kleisli[[A]A, β$16$, γ$17$]]

implicit def catsDataCommutativeFlatMapForKleisli[F[_], A](implicit F0: CommutativeFlatMap[F]): CommutativeFlatMap[[γ$56$]Kleisli[F, A, γ$56$]]

implicit def catsDataCommutativeMonadForKleisli[F[_], A](implicit F0: CommutativeMonad[F]): CommutativeMonad[[γ$25$]Kleisli[F, A, γ$25$]]

implicit def catsDataComposeForKleisli[F[_]](implicit FM: FlatMap[F]): Compose[[β$62$, γ$63$]Kleisli[F, β$62$, γ$63$]]

implicit def catsDataContravariantForKleisli[F[_], C]: Contravariant[[β$52$]Kleisli[F, β$52$, C]]

implicit def catsDataContravariantMonoidalForKleisli[F[_], A](implicit F0: ContravariantMonoidal[F]): ContravariantMonoidal[[γ$30$]Kleisli[F, A, γ$30$]]

implicit def catsDataDeferForKleisli[F[_], A](implicit F: Defer[F]): Defer[[γ$18$]Kleisli[F, A, γ$18$]]

implicit def catsDataDistributiveForKleisli[F[_], R](implicit F0: Distributive[F]): Distributive[[γ$71$]Kleisli[F, R, γ$71$]]

implicit def catsDataFlatMapForKleisli[F[_], A](implicit FM: FlatMap[F]): FlatMap[[γ$67$]Kleisli[F, A, γ$67$]]

implicit def catsDataFunctorFilterForKleisli[F[_], A](implicit ev: FunctorFilter[F]): FunctorFilter[[γ$20$]Kleisli[F, A, γ$20$]]

implicit def catsDataFunctorForKleisli[F[_], A](implicit F0: Functor[F]): Functor[[γ$72$]Kleisli[F, A, γ$72$]]

implicit def catsDataMonadErrorForKleisli[F[_], A, E](implicit ME: MonadError[F, E]): MonadError[[γ$27$]Kleisli[F, A, γ$27$], E]

implicit def catsDataMonadForKleisli[F[_], A](implicit M: Monad[F]): Monad[[γ$35$]Kleisli[F, A, γ$35$]]

implicit def catsDataMonadForKleisliId[A]: CommutativeMonad[[γ$15$]Kleisli[[A]A, A, γ$15$]]

implicit def catsDataMonoidForKleisli[F[_], A, B](implicit FB0: Monoid[F[B]]): Monoid[Kleisli[F, A, B]]

implicit def catsDataMonoidKForKleisli[F[_], A](implicit F0: MonoidK[F]): MonoidK[[γ$55$]Kleisli[F, A, γ$55$]]

implicit def catsDataParallelForKleisli[F[_], M[_], A](implicit P: Parallel[M, F]): Parallel[[γ$36$]Kleisli[M, A, γ$36$], [γ$37$]Kleisli[F, A, γ$37$]]

implicit def catsDataRepresentableForKleisli[M[_], R, E](implicit R: Aux[M, R], FK: Functor[[γ$31$]Kleisli[M, E, γ$31$]]): Aux[[γ$32$]Kleisli[M, E, γ$32$], (E, R)]

Witness for: Kleisli[M, E, A] <-> (E, R) => A if M is Representable

implicit def catsDataSemigroupForKleisli[F[_], A, B](implicit FB0: Semigroup[F[B]]): Semigroup[Kleisli[F, A, B]]

implicit def catsDataSemigroupKForKleisli[F[_], A](implicit F0: SemigroupK[F]): SemigroupK[[γ$66$]Kleisli[F, A, γ$66$]]

implicit def catsDataStrongForKleisli[F[_]](implicit F0: Functor[F]): Strong[[β$64$, γ$65$]Kleisli[F, β$64$, γ$65$]]

def clone(): AnyRef

def endoMonoidK[F[_]](implicit M: Monad[F]): MonoidK[[α]Kleisli[F, α, α]]

def endoSemigroupK[F[_]](implicit FM: FlatMap[F]): SemigroupK[[α]Kleisli[F, α, α]]

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

def liftF[F[_], A, B](x: F[B]): Kleisli[F, A, B]

Creates a Kleisli that ignores its input A and returns the given F[B].

scala> import cats.data.Kleisli, cats.implicits._
scala> val takeHead = Kleisli((_:List[Int]).headOption)
scala> val makeList = Kleisli.liftF[Option, Unit, List[Int]](Some(List(1,2,3)))
scala> (makeList andThen takeHead).run(())
res0: Option[Int] = Some(1)

def liftFunctionK[F[_], G[_], A](f: ~>[F, G]): ~>[[γ$6$]Kleisli[F, A, γ$6$], [γ$7$]Kleisli[G, A, γ$7$]]

Lifts a natural transformation of effects within a Kleisli to a transformation of Kleislis.

scala> import cats._, data._
scala> val f: (List ~> Option) = λ[List ~> Option](_.headOption)

scala> val k: Kleisli[List, String, Char] = Kleisli(_.toList)
scala> k.run("foo")
res0: List[Char] = List(f, o, o)

scala> val k2: Kleisli[Option, String, Char] = Kleisli.liftFunctionK(f)(k)
scala> k2.run("foo")
res1: Option[Char] = Some(f)

def liftK[F[_], A]: ~>[F, [γ$3$]Kleisli[F, A, γ$3$]]

Same as liftF, but expressed as a FunctionK for use with mapK

scala> import cats._, data._, implicits._
scala> val a: OptionT[Eval, Int] = 1.pure[OptionT[Eval, ?]]
scala> val b: OptionT[Kleisli[Eval, String, ?], Int] = a.mapK(Kleisli.liftK)
scala> b.value.run("").value
res0: Option[Int] = Some(1)

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

Modifies the input environment with f, without changing the input type of the Kleisli.

scala> import cats.data.Kleisli
scala> val takeHead = Kleisli[Option, List[Int], Int](_.headOption)
scala> Kleisli.local[Option, Int, List[Int]](1 :: _)(takeHead).run(List(2,3))
res0: Option[Int] = Some(1)

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def pure[F[_], A, B](x: B)(implicit F: Applicative[F]): Kleisli[F, A, B]

Creates a Kleisli arrow ignoring its input and lifting the given B into applicative context F.

scala> import cats.data.Kleisli, cats.implicits._
scala> val pureOpt = Kleisli.pure[Option, Unit, String]("beam me up!")
scala> pureOpt.run(())
res0: Option[String] = Some(beam me up!)

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 lift[F[_], A, B](x: F[B]): Kleisli[F, A, B]