FreeT

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

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

Binds the given continuation to the result of this computation.

def foldMap(f: ~>[S, M])(implicit M0: BindRec[M], M1: Applicative[M]): M[A]

Runs to completion, mapping the suspension with the given transformation at each step and accumulating into the monad M.

final def getClass(): Class[_]

def hashCode(): Int

def hoist[N[_]](mn: ~>[M, N]): FreeT[S, N, A]

Changes the underlying Monad for this FreeT, ie.

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

Change the base functor S for a FreeT action.

final def isInstanceOf[T0]: Boolean

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

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

Evaluates a single layer of the free monad *

def resumeC(implicit M0: BindRec[M], M1: Applicative[M]): M[\/[Coyoneda[S, FreeT[S, M, A]], A]]

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.

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

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

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

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

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