Packages

sealed abstract class FreeT[S[_], M[_], A] extends AnyRef

Source
FreeT.scala
Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. FreeT
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  9. final def flatMap[B](f: (A) => FreeT[S, M, B]): FreeT[S, M, B]

    Binds the given continuation to the result of this computation.

  10. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  11. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  12. def hoistM[N[_]](mn: ~>[M, N])(implicit S: Functor[S], M: Functor[M]): FreeT[S, N, A]

    Same as hoistN but different constraints

  13. 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

  14. 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.

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

    Same as interpretS but different constraints

  16. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  17. final def map[B](f: (A) => B)(implicit S: Functor[S], M: Functor[M]): FreeT[S, M, B]
  18. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  19. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  20. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  21. 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 *

  22. 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.

  23. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  24. def toString(): String
    Definition Classes
    AnyRef → Any
  25. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  26. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  27. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()

Inherited from AnyRef

Inherited from Any

Ungrouped