Class/Object

scalaz

FreeT

Related Docs: object FreeT | package scalaz

Permalink

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

Source
FreeT.scala
Linear Supertypes
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

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit

    Permalink
    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]

    Permalink

    Binds the given continuation to the result of this computation.

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

    Permalink
    Definition Classes
    AnyRef → Any
  11. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  12. def hoistM[N[_]](mn: ~>[M, N])(implicit S: Functor[S], M: Functor[M]): FreeT[S, N, A]

    Permalink

    Same as hoistN but different constraints

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

    Permalink

    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]

    Permalink

    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]

    Permalink

    Same as interpretS but different constraints

  16. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  17. final def map[B](f: (A) ⇒ B)(implicit S: Functor[S], M: Functor[M]): FreeT[S, M, B]

    Permalink
  18. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  19. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  20. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  21. def resume(implicit S: Functor[S], M0: BindRec[M], M1: Applicative[M]): M[\/[A, S[FreeT[S, M, A]]]]

    Permalink

    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]

    Permalink

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

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

    Permalink
    Definition Classes
    AnyRef
  24. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  25. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  26. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  27. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped