FreeT

Value Members

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

   Definition Classes

   AnyRef

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

   Definition Classes

   Any

3. final def ##(): Int

   Definition Classes

   AnyRef → Any

4. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

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

   Definition Classes

   Any

6. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

7. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

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

   Definition Classes

   AnyRef

9. def equals(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

10. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

11. final def flatMap[B](f: (A) ⇒ FreeT[S, M, B]): FreeT[S, M, B]

    Binds the given continuation to the result of this computation.

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

    Definition Classes

    AnyRef → Any

13. def hashCode(): Int

    Definition Classes

    AnyRef → Any

14. def hoistM[N[_]](mn: ~>[M, N])(implicit S: Functor[S], M: Functor[M]): FreeT[S, N, A]

    Same as hoistN but different constraints

15. def hoistN[N[_]](mn: ~>[M, N])(implicit S: Functor[S], N: Functor[N]): FreeT[S, N, A]

    Changes the underlying Monad for this FreeT, ie.

    Changes the underlying Monad for this FreeT, ie. turning this FreeT[S, M, A] into a FreeT[S, N, A] given Functors for S and N

16. def interpretS[T[_]](st: ~>[S, T])(implicit S: Functor[S], M: Functor[M]): FreeT[T, M, A]

    Change the base functor S for a FreeT action.

17. def interpretT[T[_]](st: ~>[S, T])(implicit T: Functor[T], M: Functor[M]): FreeT[T, M, A]

    Same as interpretS but different constraints

18. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

19. final def map[B](f: (A) ⇒ B)(implicit S: Functor[S], M: Functor[M]): FreeT[S, M, B]

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

    Definition Classes

    AnyRef

21. final def notify(): Unit

    Definition Classes

    AnyRef

22. final def notifyAll(): Unit

    Definition Classes

    AnyRef

23. def resume(implicit S: Functor[S], M0: BindRec[M], M1: Applicative[M]): M[\/[A, S[FreeT[S, M, A]]]]

    Evaluates a single layer of the free monad *

24. def runM(interp: (S[FreeT[S, M, A]]) ⇒ M[FreeT[S, M, A]])(implicit S: Functor[S], M0: BindRec[M], M1: Applicative[M]): M[A]

    Runs to completion, using a function that maps the resumption from S to a monad M.

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

    Definition Classes

    AnyRef

26. def toString(): String

    Definition Classes

    AnyRef → Any

27. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )