object Kleisli extends KleisliInstances with Serializable
- Source
- Kleisli.scala
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Kleisli
- Serializable
- Serializable
- KleisliInstances
- KleisliInstances0
- KleisliInstances1
- KleisliInstances2
- KleisliInstances3
- KleisliInstances4
- KleisliInstances5
- KleisliInstances6
- KleisliInstances7
- KleisliInstances8
- KleisliInstances9
- KleisliInstances10
- KleisliInstances11
- KleisliInstances12
- KleisliInstances13
- AnyRef
- Any
- Hide All
- Show All
Visibility
- 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
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
ask[M[_], A](implicit arg0: Applicative[M]): Kleisli[M, A, A]
Pure Kleisli arrow
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[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 iso[D[_], I, O[_]](instance: ~>[[a](I) ⇒ O[a], D], decode: ~>[D, [a](I) ⇒ O[a]]): Isomorphism.<~>[D, [γ$42$]Kleisli[O, I, γ$42$]]
-
def
kleisli[M[_], A, B](f: (A) ⇒ M[B]): Kleisli[M, A, B]
Construct a Kleisli from a Function1
-
implicit
def
kleisliApplicative[F[_], R](implicit F0: Applicative[F]): Applicative[[γ$16$]Kleisli[F, R, γ$16$]]
- Definition Classes
- KleisliInstances8
-
implicit
def
kleisliApplicativePlus[F[_], R](implicit F0: ApplicativePlus[F]): ApplicativePlus[[γ$20$]Kleisli[F, R, γ$20$]]
- Definition Classes
- KleisliInstances6
-
implicit
def
kleisliApply[F[_], R](implicit F0: Apply[F]): Apply[[γ$11$]Kleisli[F, R, γ$11$]]
- Definition Classes
- KleisliInstances12
-
implicit
def
kleisliArrow[F[_]](implicit F0: Monad[F]): Arrow[[β$34$, γ$35$]Kleisli[F, β$34$, γ$35$]] with Choice[[β$36$, γ$37$]Kleisli[F, β$36$, γ$37$]]
- Definition Classes
- KleisliInstances
-
implicit
def
kleisliBind[F[_], R](implicit F0: Bind[F]): Bind[[γ$13$]Kleisli[F, R, γ$13$]]
- Definition Classes
- KleisliInstances10
-
implicit
def
kleisliBindRec[F[_], R](implicit F0: BindRec[F]): BindRec[[γ$18$]Kleisli[F, R, γ$18$]]
- Definition Classes
- KleisliInstances7
-
implicit
def
kleisliCatchable[F[_], A](implicit F0: Catchable[F]): Catchable[[γ$41$]Kleisli[F, A, γ$41$]]
- Definition Classes
- KleisliInstances
-
implicit
def
kleisliCompose[F[_]](implicit F0: Bind[F]): Compose[[β$32$, γ$33$]Kleisli[F, β$32$, γ$33$]]
- Definition Classes
- KleisliInstances0
-
implicit
def
kleisliContravariant[F[_], A]: Contravariant[[β$38$]Kleisli[F, β$38$, A]]
- Definition Classes
- KleisliInstances
-
implicit
def
kleisliDistributive[F[_], R](implicit F0: Distributive[F]): Distributive[[γ$12$]Kleisli[F, R, γ$12$]]
- Definition Classes
- KleisliInstances11
-
implicit
def
kleisliFn[M[_], A, B](k: Kleisli[M, A, B]): (A) ⇒ M[B]
Implicitly unwrap the Function1 represented by the Kleisli
-
implicit
def
kleisliFunctor[F[_], R](implicit F0: Functor[F]): Functor[[γ$10$]Kleisli[F, R, γ$10$]]
- Definition Classes
- KleisliInstances13
-
implicit
def
kleisliIdApplicative[R]: Applicative[[γ$26$]Kleisli[[X]X, R, γ$26$]]
- Definition Classes
- KleisliInstances1
-
implicit
def
kleisliIdApply[R]: Apply[[γ$29$]Kleisli[[X]X, R, γ$29$]]
- Definition Classes
- KleisliInstances0
-
implicit
def
kleisliIdFunctor[R]: Functor[[γ$25$]Kleisli[[X]X, R, γ$25$]]
- Definition Classes
- KleisliInstances2
-
implicit
def
kleisliIdMonadReader[R]: MonadReader[[γ$39$]Kleisli[[X]X, R, γ$39$], R]
- Definition Classes
- KleisliInstances
-
implicit
def
kleisliMonadError[F[_], E, R](implicit F0: MonadError[F, E]): MonadError[[γ$22$]Kleisli[F, R, γ$22$], E]
- Definition Classes
- KleisliInstances5
-
implicit
def
kleisliMonadPlus[F[_], A](implicit F0: MonadPlus[F]): MonadPlus[[γ$23$]Kleisli[F, A, γ$23$]]
- Definition Classes
- KleisliInstances4
-
implicit
def
kleisliMonadReader[F[_], R](implicit F0: Monad[F]): MonadReader[[γ$24$]Kleisli[F, R, γ$24$], R]
- Definition Classes
- KleisliInstances3
-
implicit
def
kleisliMonadTrans[R]: Hoist[[α[_], β]Kleisli[α, R, β]]
- Definition Classes
- KleisliInstances
-
implicit
def
kleisliMonoid[F[_], A, B](implicit FB0: Monoid[F[B]]): Monoid[Kleisli[F, A, B]]
- Definition Classes
- KleisliInstances
-
implicit
def
kleisliPlus[F[_], A](implicit F0: Plus[F]): Plus[[γ$17$]Kleisli[F, A, γ$17$]]
- Definition Classes
- KleisliInstances8
-
def
kleisliPlusEmpty[F[_], A](implicit F0: PlusEmpty[F]): PlusEmpty[[γ$40$]Kleisli[F, A, γ$40$]]
- Definition Classes
- KleisliInstances
-
implicit
def
kleisliPlusEmpty0[F[_], A](implicit F0: PlusEmpty[F]): PlusEmpty[[γ$19$]Kleisli[F, A, γ$19$]]
- Definition Classes
- KleisliInstances7
-
implicit
def
kleisliProChoice[F[_]](implicit F0: Applicative[F]): ProChoice[[β$30$, γ$31$]Kleisli[F, β$30$, γ$31$]]
- Definition Classes
- KleisliInstances0
-
implicit
def
kleisliSemigroup[F[_], A, B](implicit FB0: Semigroup[F[B]]): Semigroup[Kleisli[F, A, B]]
- Definition Classes
- KleisliInstances6
-
implicit
def
kleisliStrong[F[_]](implicit arg0: Functor[F]): Strong[[β$27$, γ$28$]Kleisli[F, β$27$, γ$28$]]
- Definition Classes
- KleisliInstances1
-
def
kleisliU[A, MB](f: (A) ⇒ MB)(implicit MB: Unapply[Bind, MB]): Kleisli[M, A, A]
A version of
kleislithat infers the type constructorM, whenMisBindA version of
kleislithat infers the type constructorM, whenMisBindKleisli.kleisliU{s: String => try \/-(s.toInt) catch{ case e: NumberFormatException => -\/(e) }}
Example: -
implicit
def
kleisliZip[F[_], R](implicit F: Zip[F]): Zip[[γ$14$]Kleisli[F, R, γ$14$]]
- Definition Classes
- KleisliInstances9
- def local[M[_], A, R](f: (R) ⇒ R)(fa: Kleisli[M, R, A]): Kleisli[M, R, A]
-
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()
-
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
- @throws( ... ) @native()