Kleisli

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 dimap[C, D](f: (C) ⇒ A, g: (B) ⇒ D)(implicit b: Functor[M]): Kleisli[M, C, D]

    

16. def endo(implicit M: Functor[M], ev: >~>[A, B]): Endomorphic[[β$3$, γ$4$]Kleisli[M, β$3$, γ$4$], A]

    

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

    

    Definition Classes

    AnyRef

18. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

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

    

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

    

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

    

    Definition Classes

    AnyRef → Any

22. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

24. def liftF(implicit F: Functor[[γ$7$]Kleisli[M, A, γ$7$]]): Free[[γ$8$]Kleisli[M, A, γ$8$], B]

    

25. def liftMK[T[_[_], _]](implicit T: MonadTrans[T], M: Monad[M]): Kleisli[[β$1$]T[M, β$1$], A, B]

    

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

    

27. def lower(implicit M: Applicative[M]): Kleisli[M, A, M[B]]

    

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

    

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

    

    alias for mapT

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

    

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

    

    Definition Classes

    AnyRef

32. final def notify(): Unit

    

    Definition Classes

    AnyRef

33. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

34. val run: (A) ⇒ M[B]

    

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

    

36. def state(implicit M: Monad[M]): StateT[M, A, B]

    

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

    

    Definition Classes

    AnyRef

38. def tap(implicit F: Applicative[M]): Kleisli[M, A, A]

    

39. def transform[N[_]](f: ~>[M, N]): Kleisli[N, A, B]

    

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

    

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

    

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

    

43. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

45. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )