scalaz

Kleisli

final case class Kleisli[M[_], A, B](run: (A) ⇒ M[B]) extends Product with Serializable

Represents a function A => M[B].

Self Type
Kleisli[M, A, B]
Source
Kleisli.scala
Linear Supertypes
Serializable, Serializable, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Kleisli
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. AnyRef
  7. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Kleisli(run: (A) ⇒ M[B])

Value Members

  1. final def !=(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Definition Classes
    AnyRef → Any
  3. def <=<[C](k: Kleisli[M, C, A])(implicit b: Bind[M]): Kleisli[M, C, B]

    alias for compose

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

  5. def =<<(a: M[A])(implicit m: Bind[M]): M[B]

  6. final def ==(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  7. def >==>[C](k: (B) ⇒ M[C])(implicit b: Bind[M]): Kleisli[M, A, C]

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

    alias for andThen

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

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

  11. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  12. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  13. def compose[C](k: Kleisli[M, C, A])(implicit b: Bind[M]): Kleisli[M, C, B]

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

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

  16. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  17. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  18. def flatMap[C](f: (B) ⇒ Kleisli[M, A, C])(implicit M: Bind[M]): Kleisli[M, A, C]

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

  20. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  21. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  22. def lift[L[_]](implicit arg0: Applicative[L]): Kleisli[[α]L[M[α]], A, B]

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

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

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

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

  27. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  28. final def notify(): Unit

    Definition Classes
    AnyRef
  29. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  30. val run: (A) ⇒ M[B]

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

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

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

    Definition Classes
    AnyRef
  34. def traverse[F[_]](f: F[A])(implicit M: Applicative[M], F: Traverse[F]): M[F[B]]

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

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

  37. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  38. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  39. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped