Kleisli

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

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

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

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

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

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

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

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

implicit val catsDataChoiceForKleisliId: Choice[[β$52$, γ$53$]Kleisli[[A]A, β$52$, γ$53$]]

implicit def catsDataCommutativeArrowForKleisli[F[_]](implicit M: CommutativeMonad[F]): CommutativeArrow[[β$13$, γ$14$]Kleisli[F, β$13$, γ$14$]] with ArrowChoice[[β$15$, γ$16$]Kleisli[F, β$15$, γ$16$]]

implicit val catsDataCommutativeArrowForKleisliId: CommutativeArrow[[β$8$, γ$9$]Kleisli[[A]A, β$8$, γ$9$]]

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

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

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

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

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

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

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

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

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

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

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

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

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

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[[γ$47$]Kleisli[F, A, γ$47$]]

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

implicit def catsDataRepresentableForKleisli[M[_], R, E](implicit R: Aux[M, R], FK: Functor[[γ$23$]Kleisli[M, E, γ$23$]]): Aux[[γ$24$]Kleisli[M, E, γ$24$], (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[[γ$58$]Kleisli[F, A, γ$58$]]

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

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]

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

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]

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]

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]