Kleisli

abstract def run(a: A): M[B]

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def <=<[C](k: Kleisli[M, C, A])(implicit b: Bind[M]): Kleisli[M, C, B]

alias for compose

def <==<[C](k: (C) ⇒ M[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]

alias for andThen

def andThen[C](k: Kleisli[M, B, C])(implicit b: Bind[M]): Kleisli[M, A, C]

def andThenK[C](k: (B) ⇒ M[C])(implicit b: Bind[M]): Kleisli[M, A, C]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def compose[C](k: Kleisli[M, C, A])(implicit b: Bind[M]): Kleisli[M, C, B]

def composeK[C](k: (C) ⇒ M[A])(implicit b: Bind[M]): Kleisli[M, C, B]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def flatMap[C, AA <: A](f: (B) ⇒ Kleisli[M, AA, C])(implicit M: Bind[M]): Kleisli[M, AA, C]

def flatMapK[C](f: (B) ⇒ M[C])(implicit M: Bind[M]): Kleisli[M, A, C]

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def lift[L[+_]](implicit arg0: Applicative[L]): Kleisli[[+α]L[M[α]], A, B]

def liftMK[T[_[_], _]](implicit T: MonadTrans[T], M: Monad[M]): Kleisli[[+a]T[M, a], A, B]

def local[AA](f: (AA) ⇒ A): Kleisli[M, AA, B]

def map[C](f: (B) ⇒ C)(implicit M: Functor[M]): Kleisli[M, A, C]

def mapK[N[+_], C](f: (M[B]) ⇒ N[C]): Kleisli[N, A, C]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def rwst[W, S](implicit M: Functor[M], W: Monoid[W]): ReaderWriterStateT[M, A, W, S, B]

def state[AA <: A, BB >: B](implicit M: Functor[M]): StateT[M, AA, BB]

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

def traverse[F[_], AA <: A, BB >: B](f: F[AA])(implicit M: Applicative[M], F: Traverse[F]): M[F[BB]]

def unlift[N[+_], FF[+_], AA <: A, BB >: B](implicit M: Comonad[N], ev: <~<[Kleisli.this.type, Kleisli[[+α]N[FF[α]], AA, BB]]): Kleisli[FF, AA, BB]

def unliftId[N[+_], AA <: A, BB >: B](implicit M: Comonad[N], ev: <~<[Kleisli.this.type, Kleisli[[+α]N[α], AA, BB]]): Reader[AA, BB]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit