sealed
trait
Kleisli[M[_], A, B] extends AnyRef
Abstract Value Members
-
abstract
def
apply(a: A): M[B]
Concrete Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
<=<[C](k: (C) ⇒ M[A])(implicit b: Bind[M]): Kleisli[M, C, B]
-
def
<=<[C](k: Kleisli[M, C, A])(implicit b: Bind[M]): Kleisli[M, C, B]
-
def
=<<[AA <: A](a: M[AA])(implicit m: Bind[M]): M[B]
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
def
>=>[C](k: (B) ⇒ M[C])(implicit b: Bind[M]): Kleisli[M, A, C]
-
def
>=>[C](k: Kleisli[M, B, C])(implicit b: Bind[M]): Kleisli[M, A, C]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
compose[N[_]](f: (M[B]) ⇒ N[B]): Kleisli[N, A, B]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
flatMap[C](f: (B) ⇒ M[C])(implicit m: Monad[M]): Kleisli[M, A, C]
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
map[C](f: (B) ⇒ C)(implicit m: Functor[M]): Kleisli[M, A, C]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
traverse[F[_], AA <: A](f: F[AA])(implicit a: Applicative[M], t: Traverse[F]): M[F[B]]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any