Kleisli

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 =<<(a: M[A])(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 canEqual(arg0: Any): Boolean

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]

def dimap[C, D](f: (C) ⇒ A, g: (B) ⇒ D)(implicit b: Functor[M]): Kleisli[M, C, D]

def endo(implicit M: Functor[M], ev: >~>[A, B]): Endomorphic[[α, β]Kleisli[M, α, β], A]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

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

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

final def getClass(): java.lang.Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

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

def liftF(implicit F: Functor[[a]Kleisli[M, A, a]]): Free[[a]Kleisli[M, A, 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 lower(implicit M: Monad[M]): Kleisli[M, A, M[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]

alias for mapT

def mapT[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 productArity: Int

def productElement(arg0: Int): Any

def productIterator: Iterator[Any]

def productPrefix: String

val run: (A) ⇒ M[B]

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

def state(implicit M: Functor[M]): StateT[M, A, B]

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

def toString(): String

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

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

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

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def productElements: Iterator[Any]