object Kleisli extends KleisliInstances with KleisliFunctions with KleisliFunctionsBinCompat with KleisliExplicitInstances with Serializable
- Alphabetic
- By Inheritance
- Kleisli
- Serializable
- Serializable
- KleisliExplicitInstances
- KleisliFunctionsBinCompat
- KleisliFunctions
- KleisliInstances
- KleisliInstances0
- KleisliInstances0_5
- KleisliInstances1
- KleisliInstances2
- KleisliInstances3
- KleisliInstances4
- KleisliInstances5
- KleisliInstances6
- KleisliInstances7
- KleisliInstances8
- KleisliInstances9
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
applyK[F[_], A](a: A): ~>[[γ$0$]Kleisli[F, A, γ$0$], F]
Creates a
FunctionK
that transforms aKleisli[F, A, B]
into anF[B]
by applying the value of typea:A
.Creates a
FunctionK
that transforms aKleisli[F, A, B]
into anF[B]
by applying the value of typea:A
.scala> import cats.{~>}, cats.data.{Kleisli, EitherT} scala> def f(i: Int): Option[Either[Char, Char]] = if (i > 0) Some(Right('n')) else if (i < 0) Some(Left('z')) else None scala> type KOI[A] = Kleisli[Option, Int, A] scala> val b: KOI[Either[Char, Char]] = Kleisli[Option, Int, Either[Char, Char]](f _) scala> val nt: Kleisli[Option, Int, ?] ~> Option = Kleisli.applyK[Option, Int](1) scala> nt(b) res0: Option[Either[Char, Char]] = Some(Right('n')) scala> type EKOIC[A] = EitherT[KOI, Char, A] scala> val c: EKOIC[Char] = EitherT[KOI, Char, Char](b) scala> c.mapK(nt).value res1: Option[Either[Char, Char]] = Some(Right('n')) scala> val ntz = Kleisli.applyK[Option, Int](0) scala> c.mapK(ntz).value res2: Option[Either[Char, Char]] = None
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
ask[F[_], A](implicit F: Applicative[F]): Kleisli[F, A, A]
- Definition Classes
- KleisliFunctions
-
implicit
def
catsDataAlternativeForKleisli[F[_], A](implicit F0: Alternative[F]): Alternative[[γ$54$]Kleisli[F, A, γ$54$]]
- Definition Classes
- KleisliInstances2
-
implicit
def
catsDataApplicativeErrorForKleisli[F[_], E, A](implicit F0: ApplicativeError[F, E]): ApplicativeError[[γ$68$]Kleisli[F, A, γ$68$], E]
- Definition Classes
- KleisliInstances5
-
implicit
def
catsDataApplicativeForKleisli[F[_], A](implicit A: Applicative[F]): Applicative[[γ$69$]Kleisli[F, A, γ$69$]]
- Definition Classes
- KleisliInstances6
-
implicit
def
catsDataApplyForKleisli[F[_], A](implicit A: Apply[F]): Apply[[γ$70$]Kleisli[F, A, γ$70$]]
- Definition Classes
- KleisliInstances7
-
implicit
def
catsDataArrowChoiceForKleisli[F[_]](implicit M: Monad[F]): ArrowChoice[[β$28$, γ$29$]Kleisli[F, β$28$, γ$29$]]
- Definition Classes
- KleisliInstances0_5
-
implicit
def
catsDataChoiceForKleisli[F[_]](implicit M: Monad[F]): Choice[[β$58$, γ$59$]Kleisli[F, β$58$, γ$59$]]
- Definition Classes
- KleisliInstances3
-
implicit
val
catsDataChoiceForKleisliId: Choice[[β$60$, γ$61$]Kleisli[[A]A, β$60$, γ$61$]]
- Definition Classes
- KleisliInstances3
-
implicit
def
catsDataCommutativeArrowForKleisli[F[_]](implicit M: CommutativeMonad[F]): CommutativeArrow[[β$21$, γ$22$]Kleisli[F, β$21$, γ$22$]] with ArrowChoice[[β$23$, γ$24$]Kleisli[F, β$23$, γ$24$]]
- Definition Classes
- KleisliInstances0
-
implicit
val
catsDataCommutativeArrowForKleisliId: CommutativeArrow[[β$16$, γ$17$]Kleisli[[A]A, β$16$, γ$17$]]
- Definition Classes
- KleisliInstances
-
implicit
def
catsDataCommutativeFlatMapForKleisli[F[_], A](implicit F0: CommutativeFlatMap[F]): CommutativeFlatMap[[γ$56$]Kleisli[F, A, γ$56$]]
- Definition Classes
- KleisliInstances3
-
implicit
def
catsDataCommutativeMonadForKleisli[F[_], A](implicit F0: CommutativeMonad[F]): CommutativeMonad[[γ$25$]Kleisli[F, A, γ$25$]]
- Definition Classes
- KleisliInstances0
-
implicit
def
catsDataComposeForKleisli[F[_]](implicit FM: FlatMap[F]): Compose[[β$62$, γ$63$]Kleisli[F, β$62$, γ$63$]]
- Definition Classes
- KleisliInstances3
-
implicit
def
catsDataContravariantForKleisli[F[_], C]: Contravariant[[β$52$]Kleisli[F, β$52$, C]]
- Definition Classes
- KleisliInstances1
-
implicit
def
catsDataContravariantMonoidalForKleisli[F[_], A](implicit F0: ContravariantMonoidal[F]): ContravariantMonoidal[[γ$30$]Kleisli[F, A, γ$30$]]
- Definition Classes
- KleisliInstances0_5
-
implicit
def
catsDataDeferForKleisli[F[_], A](implicit F: Defer[F]): Defer[[γ$18$]Kleisli[F, A, γ$18$]]
- Definition Classes
- KleisliInstances
-
implicit
def
catsDataDistributiveForKleisli[F[_], R](implicit F0: Distributive[F]): Distributive[[γ$71$]Kleisli[F, R, γ$71$]]
- Definition Classes
- KleisliInstances8
-
implicit
def
catsDataFlatMapForKleisli[F[_], A](implicit FM: FlatMap[F]): FlatMap[[γ$67$]Kleisli[F, A, γ$67$]]
- Definition Classes
- KleisliInstances4
-
implicit
def
catsDataFunctorFilterForKleisli[F[_], A](implicit ev: FunctorFilter[F]): FunctorFilter[[γ$20$]Kleisli[F, A, γ$20$]]
- Definition Classes
- KleisliInstances
-
implicit
def
catsDataFunctorForKleisli[F[_], A](implicit F0: Functor[F]): Functor[[γ$72$]Kleisli[F, A, γ$72$]]
- Definition Classes
- KleisliInstances9
-
implicit
def
catsDataMonadErrorForKleisli[F[_], A, E](implicit ME: MonadError[F, E]): MonadError[[γ$27$]Kleisli[F, A, γ$27$], E]
- Definition Classes
- KleisliInstances0_5
-
implicit
def
catsDataMonadForKleisli[F[_], A](implicit M: Monad[F]): Monad[[γ$35$]Kleisli[F, A, γ$35$]]
- Definition Classes
- KleisliInstances1
-
implicit
def
catsDataMonadForKleisliId[A]: CommutativeMonad[[γ$15$]Kleisli[[A]A, A, γ$15$]]
- Definition Classes
- KleisliInstances
-
implicit
def
catsDataMonoidForKleisli[F[_], A, B](implicit FB0: Monoid[F[B]]): Monoid[Kleisli[F, A, B]]
- Definition Classes
- KleisliInstances0_5
-
implicit
def
catsDataMonoidKForKleisli[F[_], A](implicit F0: MonoidK[F]): MonoidK[[γ$55$]Kleisli[F, A, γ$55$]]
- Definition Classes
- KleisliInstances3
-
implicit
def
catsDataParallelForKleisli[F[_], M[_], A](implicit P: Parallel[M, F]): Parallel[[γ$36$]Kleisli[M, A, γ$36$], [γ$37$]Kleisli[F, A, γ$37$]]
- Definition Classes
- KleisliInstances1
-
implicit
def
catsDataRepresentableForKleisli[M[_], R, E](implicit R: Aux[M, R], FK: Functor[[γ$31$]Kleisli[M, E, γ$31$]]): Aux[[γ$32$]Kleisli[M, E, γ$32$], (E, R)]
Witness for: Kleisli[M, E, A] <-> (E, R) => A if M is Representable
Witness for: Kleisli[M, E, A] <-> (E, R) => A if M is Representable
- Definition Classes
- KleisliInstances0_5
-
implicit
def
catsDataSemigroupForKleisli[F[_], A, B](implicit FB0: Semigroup[F[B]]): Semigroup[Kleisli[F, A, B]]
- Definition Classes
- KleisliInstances3
-
implicit
def
catsDataSemigroupKForKleisli[F[_], A](implicit F0: SemigroupK[F]): SemigroupK[[γ$66$]Kleisli[F, A, γ$66$]]
- Definition Classes
- KleisliInstances4
-
implicit
def
catsDataStrongForKleisli[F[_]](implicit F0: Functor[F]): Strong[[β$64$, γ$65$]Kleisli[F, β$64$, γ$65$]]
- Definition Classes
- KleisliInstances3
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
endoMonoidK[F[_]](implicit M: Monad[F]): MonoidK[[α]Kleisli[F, α, α]]
- Definition Classes
- KleisliExplicitInstances
-
def
endoSemigroupK[F[_]](implicit FM: FlatMap[F]): SemigroupK[[α]Kleisli[F, α, α]]
- Definition Classes
- KleisliExplicitInstances
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
liftF[F[_], A, B](x: F[B]): Kleisli[F, A, B]
- Definition Classes
- KleisliFunctions
-
def
liftFunctionK[F[_], G[_], A](f: ~>[F, G]): ~>[[γ$6$]Kleisli[F, A, γ$6$], [γ$7$]Kleisli[G, A, γ$7$]]
Lifts a natural transformation of effects within a Kleisli to a transformation of Kleislis.
Lifts a natural transformation of effects within a Kleisli to a transformation of Kleislis.
Equivalent to running
mapK(f) on a Kleisli.
scala> import cats._, data._ scala> val f: (List ~> Option) = λ[List ~> Option](_.headOption) scala> val k: Kleisli[List, String, Char] = Kleisli(_.toList) scala> k.run("foo") res0: List[Char] = List(f, o, o) scala> val k2: Kleisli[Option, String, Char] = Kleisli.liftFunctionK(f)(k) scala> k2.run("foo") res1: Option[Char] = Some(f)
- Definition Classes
- KleisliFunctionsBinCompat
-
def
liftK[F[_], A]: ~>[F, [γ$3$]Kleisli[F, A, γ$3$]]
Same as liftF, but expressed as a FunctionK for use with mapK
Same as liftF, but expressed as a FunctionK for use with mapK
scala> import cats._, data._, implicits._ scala> val a: OptionT[Eval, Int] = 1.pure[OptionT[Eval, ?]] scala> val b: OptionT[Kleisli[Eval, String, ?], Int] = a.mapK(Kleisli.liftK) scala> b.value.run("").value res0: Option[Int] = Some(1)
- Definition Classes
- KleisliFunctions
-
def
local[M[_], A, R](f: (R) ⇒ R)(fa: Kleisli[M, R, A]): Kleisli[M, R, A]
- Definition Classes
- KleisliFunctions
-
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()
-
def
pure[F[_], A, B](x: B)(implicit F: Applicative[F]): Kleisli[F, A, B]
- Definition Classes
- KleisliFunctions
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
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( ... )