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
-
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
kleisli[M[_], A, B](f: (A) ⇒ M[B]): Kleisli[M, A, B]
-
implicit
def
kleisliApplicative[F[_], R](implicit F0: Applicative[F]): Applicative[[γ]Kleisli[F, R, γ]]
-
implicit
def
kleisliApplicativePlus[F[_], R](implicit F0: ApplicativePlus[F]): ApplicativePlus[[γ]Kleisli[F, R, γ]]
-
implicit
def
kleisliApply[F[_], R](implicit F0: Apply[F]): Apply[[γ]Kleisli[F, R, γ]]
-
implicit
def
kleisliArrow[F[_]](implicit F0: Monad[F]): Arrow[[β, γ]Kleisli[F, β, γ]] with Choice[[β, γ]Kleisli[F, β, γ]]
-
implicit
def
kleisliBind[F[_], R](implicit F0: Bind[F]): Bind[[γ]Kleisli[F, R, γ]]
-
implicit
def
kleisliCatchable[F[_], A](implicit F0: Catchable[F]): Catchable[[γ]Kleisli[F, A, γ]]
-
implicit
def
kleisliCompose[F[_]](implicit F0: Bind[F]): Compose[[β, γ]Kleisli[F, β, γ]]
-
implicit
def
kleisliContravariant[F[_], A]: Contravariant[[β]Kleisli[F, β, A]]
-
implicit
def
kleisliDistributive[F[_], R](implicit F0: Distributive[F]): Distributive[[γ]Kleisli[F, R, γ]]
-
implicit
def
kleisliFn[M[_], A, B](k: Kleisli[M, A, B]): (A) ⇒ M[B]
-
implicit
def
kleisliFunctor[F[_], R](implicit F0: Functor[F]): Functor[[γ]Kleisli[F, R, γ]]
-
implicit
def
kleisliIdApplicative[R]: Applicative[[γ]Kleisli[[+X]X, R, γ]]
-
implicit
def
kleisliIdApply[R]: Apply[[γ]Kleisli[[+X]X, R, γ]]
-
implicit
def
kleisliIdFunctor[R]: Functor[[γ]Kleisli[[+X]X, R, γ]]
-
implicit
def
kleisliIdMonadReader[R]: MonadReader[[β, γ]Kleisli[[+X]X, β, γ], R]
-
implicit
def
kleisliMonadError[F[_, _], E, R](implicit F0: MonadError[F, E]): MonadError[[E0, A]Kleisli[[β]F[E0, β], R, A], E]
-
implicit
def
kleisliMonadPlus[F[_], A](implicit F0: MonadPlus[F]): MonadPlus[[γ]Kleisli[F, A, γ]]
-
implicit
def
kleisliMonadReader[F[_], R](implicit F0: Monad[F]): MonadReader[[β, γ]Kleisli[F, β, γ], 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[[γ]Kleisli[F, A, γ]]
-
implicit
def
kleisliPlusEmpty[F[_], A](implicit F0: PlusEmpty[F]): PlusEmpty[[γ]Kleisli[F, A, γ]]
-
implicit
def
kleisliProChoice[F[_]](implicit F0: Applicative[F]): ProChoice[[β, γ]Kleisli[F, β, γ]]
-
implicit
def
kleisliProfunctor[F[_]](implicit arg0: Functor[F]): Profunctor[[β, γ]Kleisli[F, β, γ]]
-
implicit
def
kleisliSemigroup[F[_], A, B](implicit FB0: Semigroup[F[B]]): Semigroup[Kleisli[F, A, B]]
-
implicit
def
kleisliStrong[F[_]](implicit F0: Functor[F]): Strong[[β, γ]Kleisli[F, β, γ]]
-
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[[γ]Kleisli[F, R, γ]]
-
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
-
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
Inherited from Serializable
Inherited from Serializable
Inherited from AnyRef
Inherited from Any
