Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
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[[X_kp2]Kleisli[F, R, X_kp2]]
-
implicit
def
kleisliApplicativePlus[F[_], R](implicit F0: ApplicativePlus[F]): ApplicativePlus[[X_kp2]Kleisli[F, R, X_kp2]]
-
implicit
def
kleisliApply[F[_], R](implicit F0: Apply[F]): Apply[[X_kp2]Kleisli[F, R, X_kp2]]
-
implicit
def
kleisliArrow[F[_]](implicit F0: Monad[F]): Arrow[[X_kp1, X_kp2]Kleisli[F, X_kp1, X_kp2]] with Choice[[X_kp1, X_kp2]Kleisli[F, X_kp1, X_kp2]]
-
implicit
def
kleisliCatchable[F[_], A](implicit F0: Catchable[F]): Catchable[[X_kp2]Kleisli[F, A, X_kp2]]
-
implicit
def
kleisliCompose[F[_]](implicit F0: Bind[F]): Compose[[X_kp1, X_kp2]Kleisli[F, X_kp1, X_kp2]]
-
implicit
def
kleisliContravariant[F[_], A]: Contravariant[[X_kp1]Kleisli[F, X_kp1, A]]
-
implicit
def
kleisliDistributive[F[_], R](implicit F0: Distributive[F]): Distributive[[X_kp2]Kleisli[F, R, X_kp2]]
-
implicit
def
kleisliFn[M[_], A, B](k: Kleisli[M, A, B]): (A) ⇒ M[B]
-
implicit
def
kleisliFunctor[F[_], R](implicit F0: Functor[F]): Functor[[X_kp2]Kleisli[F, R, X_kp2]]
-
implicit
def
kleisliIdApplicative[R]: Applicative[[X_kp2]Kleisli[[+X]X, R, X_kp2]]
-
implicit
def
kleisliIdApply[R]: Apply[[X_kp2]Kleisli[[+X]X, R, X_kp2]]
-
implicit
def
kleisliIdFunctor[R]: Functor[[X_kp2]Kleisli[[+X]X, R, X_kp2]]
-
implicit
def
kleisliIdMonadReader[R]: MonadReader[[X_kp1, X_kp2]Kleisli[[+X]X, X_kp1, X_kp2], R]
-
implicit
def
kleisliMonadPlus[F[_], A](implicit F0: MonadPlus[F]): MonadPlus[[X_kp2]Kleisli[F, A, X_kp2]]
-
implicit
def
kleisliMonadReader[F[_], R](implicit F0: Monad[F]): MonadReader[[X_kp1, X_kp2]Kleisli[F, X_kp1, X_kp2], 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[[X_kp2]Kleisli[F, A, X_kp2]]
-
implicit
def
kleisliPlusEmpty[F[_], A](implicit F0: PlusEmpty[F]): PlusEmpty[[X_kp2]Kleisli[F, A, X_kp2]]
-
implicit
def
kleisliProChoice[F[_]](implicit F0: Applicative[F]): ProChoice[[X_kp1, X_kp2]Kleisli[F, X_kp1, X_kp2]]
-
implicit
def
kleisliProfunctor[F[_]](implicit arg0: Functor[F]): Profunctor[[X_kp1, X_kp2]Kleisli[F, X_kp1, X_kp2]]
-
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[[X_kp1, X_kp2]Kleisli[F, X_kp1, X_kp2]]
-
def
kleisliU[A, MB](f: (A) ⇒ MB)(implicit MB: Unapply[Bind, MB]): Kleisli[M, A, A]
-
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