Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
ask[M[_], A](implicit arg0: Applicative[M]): Kleisli[M, A, A]
-
def
clone(): AnyRef
-
-
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
iso[D[_], I, O[_]](instance: ~>[[a](I) ⇒ O[a], D], decode: ~>[D, [a](I) ⇒ O[a]]): Isomorphism.<~>[D, [γ$42$]Kleisli[O, I, γ$42$]]
-
def
kleisli[M[_], A, B](f: (A) ⇒ M[B]): Kleisli[M, A, B]
-
implicit
def
kleisliApplicative[F[_], R](implicit F0: Applicative[F]): Applicative[[γ$16$]Kleisli[F, R, γ$16$]]
-
implicit
def
kleisliApplicativePlus[F[_], R](implicit F0: ApplicativePlus[F]): ApplicativePlus[[γ$20$]Kleisli[F, R, γ$20$]]
-
implicit
def
kleisliApply[F[_], R](implicit F0: Apply[F]): Apply[[γ$11$]Kleisli[F, R, γ$11$]]
-
implicit
def
kleisliArrow[F[_]](implicit F0: Monad[F]): Arrow[[β$34$, γ$35$]Kleisli[F, β$34$, γ$35$]] with Choice[[β$36$, γ$37$]Kleisli[F, β$36$, γ$37$]]
-
implicit
def
kleisliBind[F[_], R](implicit F0: Bind[F]): Bind[[γ$13$]Kleisli[F, R, γ$13$]]
-
implicit
def
kleisliBindRec[F[_], R](implicit F0: BindRec[F]): BindRec[[γ$18$]Kleisli[F, R, γ$18$]]
-
implicit
def
kleisliCatchable[F[_], A](implicit F0: Catchable[F]): Catchable[[γ$41$]Kleisli[F, A, γ$41$]]
-
implicit
def
kleisliCompose[F[_]](implicit F0: Bind[F]): Compose[[β$32$, γ$33$]Kleisli[F, β$32$, γ$33$]]
-
implicit
def
kleisliContravariant[F[_], A]: Contravariant[[β$38$]Kleisli[F, β$38$, A]]
-
implicit
def
kleisliDistributive[F[_], R](implicit F0: Distributive[F]): Distributive[[γ$12$]Kleisli[F, R, γ$12$]]
-
implicit
def
kleisliFn[M[_], A, B](k: Kleisli[M, A, B]): (A) ⇒ M[B]
-
implicit
def
kleisliFunctor[F[_], R](implicit F0: Functor[F]): Functor[[γ$10$]Kleisli[F, R, γ$10$]]
-
implicit
def
kleisliIdApplicative[R]: Applicative[[γ$26$]Kleisli[[X]X, R, γ$26$]]
-
implicit
def
kleisliIdApply[R]: Apply[[γ$29$]Kleisli[[X]X, R, γ$29$]]
-
implicit
def
kleisliIdFunctor[R]: Functor[[γ$25$]Kleisli[[X]X, R, γ$25$]]
-
implicit
def
kleisliIdMonadReader[R]: MonadReader[[γ$39$]Kleisli[[X]X, R, γ$39$], R]
-
implicit
def
kleisliMonadError[F[_], E, R](implicit F0: MonadError[F, E]): MonadError[[γ$22$]Kleisli[F, R, γ$22$], E]
-
implicit
def
kleisliMonadPlus[F[_], A](implicit F0: MonadPlus[F]): MonadPlus[[γ$23$]Kleisli[F, A, γ$23$]]
-
implicit
def
kleisliMonadReader[F[_], R](implicit F0: Monad[F]): MonadReader[[γ$24$]Kleisli[F, R, γ$24$], R]
-
implicit
def
kleisliMonadTrans[R]: Hoist[[α[_$1], β]Kleisli[α, R, β]]
-
implicit
def
kleisliMonoid[F[_], A, B](implicit FB0: Monoid[F[B]]): Monoid[Kleisli[F, A, B]]
-
implicit
def
kleisliPlus[F[_], A](implicit F0: Plus[F]): Plus[[γ$17$]Kleisli[F, A, γ$17$]]
-
def
kleisliPlusEmpty[F[_], A](implicit F0: PlusEmpty[F]): PlusEmpty[[γ$40$]Kleisli[F, A, γ$40$]]
-
implicit
def
kleisliPlusEmpty0[F[_], A](implicit F0: PlusEmpty[F]): PlusEmpty[[γ$19$]Kleisli[F, A, γ$19$]]
-
implicit
def
kleisliProChoice[F[_]](implicit F0: Applicative[F]): ProChoice[[β$30$, γ$31$]Kleisli[F, β$30$, γ$31$]]
-
implicit
def
kleisliSemigroup[F[_], A, B](implicit FB0: Semigroup[F[B]]): Semigroup[Kleisli[F, A, B]]
-
implicit
def
kleisliStrong[F[_]](implicit arg0: Functor[F]): Strong[[β$27$, γ$28$]Kleisli[F, β$27$, γ$28$]]
-
def
kleisliU[A, MB](f: (A) ⇒ MB)(implicit MB: Unapply[Bind, MB]): Kleisli[M, A, A]
-
implicit
def
kleisliZip[F[_], R](implicit F: Zip[F]): Zip[[γ$14$]Kleisli[F, R, γ$14$]]
-
def
local[M[_], A, R](f: (R) ⇒ R)(fa: Kleisli[M, R, A]): Kleisli[M, R, A]
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
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
