final case class Kleisli[M[_], A, B](run: (A) ⇒ M[B]) extends Product with Serializable
Ordering
- Alphabetic
- By Inheritance
Inherited
- Kleisli
- Serializable
- Serializable
- Product
- Equals
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new Kleisli(run: (A) ⇒ M[B])
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
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: Any): Boolean
- Definition Classes
- AnyRef → Any
- 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
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
- 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[[β$3$, γ$4$]Kleisli[M, β$3$, γ$4$], A]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- 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(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def lift[L[_]](implicit arg0: Applicative[L]): Kleisli[[α]L[M[α]], A, B]
- def liftF(implicit F: Functor[[γ$7$]Kleisli[M, A, γ$7$]]): Free[[γ$8$]Kleisli[M, A, γ$8$], B]
- def liftMK[T[_[_], _]](implicit T: MonadTrans[T], M: Monad[M]): Kleisli[[β$1$]T[M, β$1$], A, B]
- def local[AA](f: (AA) ⇒ A): Kleisli[M, AA, B]
- def lower(implicit M: Applicative[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
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- 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: Monad[M]): StateT[M, A, B]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- def tap(implicit F: Applicative[M]): Kleisli[M, A, A]
- def transform[N[_]](f: ~>[M, N]): Kleisli[N, A, B]
- 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[[α$0$]N[α$0$], A, B]]): Reader[A, B]
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )