scalaz

FreeT

object FreeT extends FreeTInstances

Source
FreeT.scala
Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. FreeT
  2. FreeTInstances
  3. FreeTInstances0
  4. FreeTInstances1
  5. FreeTInstances2
  6. FreeTInstances3
  7. FreeTInstances4
  8. FreeTInstances5
  9. FreeTInstances6
  10. AnyRef
  11. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

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. implicit def freeTBind[S[_], M[_]](implicit S0: Functor[S], M0: Functor[M]): Bind[[γ$13$]FreeT[S, M, γ$13$]]

    Definition Classes
    FreeTInstances2
  12. implicit def freeTFoldable[S[_], M[_]](implicit arg0: Foldable[S], arg1: Functor[S], arg2: Foldable[M], arg3: Applicative[M], arg4: BindRec[M]): Foldable[[γ$22$]FreeT[S, M, γ$22$]]

    Definition Classes
    FreeTInstances2
  13. implicit def freeTHoist[S[_]](implicit arg0: Functor[S]): Hoist[[β$14$[_$1], γ$15$]FreeT[S, β$14$, γ$15$]]

    Definition Classes
    FreeTInstances2
  14. implicit def freeTMonad[S[_], M[_]](implicit S0: Functor[S], M0: Applicative[M]): Monad[[γ$24$]FreeT[S, M, γ$24$]] with BindRec[[γ$25$]FreeT[S, M, γ$25$]]

    Definition Classes
    FreeTInstances0
  15. implicit def freeTMonadError[S[_], M[_], E](implicit arg0: Functor[S], arg1: BindRec[M], E: MonadError[M, E]): MonadError[[γ$11$]FreeT[S, M, γ$11$], E]

    Definition Classes
    FreeTInstances3
  16. implicit def freeTMonadPlus[S[_], M[_]](implicit arg0: Functor[S], arg1: ApplicativePlus[M], arg2: BindRec[M]): MonadPlus[[γ$27$]FreeT[S, M, γ$27$]]

    Definition Classes
    FreeTInstances
  17. implicit def freeTMonadReader[S[_], M[_], E](implicit arg0: Functor[S], M1: MonadReader[M, E]): MonadReader[[γ$6$]FreeT[S, M, γ$6$], E]

    Definition Classes
    FreeTInstances5
  18. implicit def freeTMonadState[S[_], M[_], E](implicit arg0: Functor[S], M1: MonadState[M, E]): MonadState[[γ$9$]FreeT[S, M, γ$9$], E]

    Definition Classes
    FreeTInstances4
  19. implicit def freeTMonadTell[S[_], M[_], E](implicit arg0: Functor[S], M1: MonadTell[M, E]): MonadTell[[γ$4$]FreeT[S, M, γ$4$], E]

    Definition Classes
    FreeTInstances6
  20. implicit def freeTPlus[S[_], M[_]](implicit arg0: Functor[S], arg1: Applicative[M], arg2: BindRec[M], arg3: Plus[M]): Plus[[γ$26$]FreeT[S, M, γ$26$]]

    Definition Classes
    FreeTInstances0
  21. implicit def freeTTraverse[S[_], M[_]](implicit arg0: Traverse[S], arg1: Traverse[M], arg2: Applicative[M], arg3: BindRec[M]): Traverse[[γ$23$]FreeT[S, M, γ$23$]]

    Definition Classes
    FreeTInstances1
  22. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  23. def gosub[S[_], M[_], B, C0](a0: FreeT[S, M, C0])(f0: (C0) ⇒ FreeT[S, M, B]): FreeT[S, M, B]

  24. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  25. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  26. def isoFree[S[_]](implicit S: Functor[S]): Isomorphism.<~>[[γ$0$]FreeT[S, [X]X, γ$0$], [β$1$]Free[S, β$1$]]

  27. def liftF[S[_], M[_], A](value: S[A])(implicit S: Functor[S], M: Applicative[M]): FreeT[S, M, A]

    Suspends a value within a functor in a single step.

    Suspends a value within a functor in a single step. Monadic unit for a higher-order monad.

  28. def liftM[S[_], M[_], A](value: M[A])(implicit M: Functor[M]): FreeT[S, M, A]

  29. def liftMU[S[_], MA](value: MA)(implicit M: Unapply[Functor, MA]): FreeT[S, M, A]

    A version of liftM that infers the nested type constructor.

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

    Definition Classes
    AnyRef
  31. final def notify(): Unit

    Definition Classes
    AnyRef
  32. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  33. def point[S[_], M[_], A](value: A)(implicit M: Applicative[M]): FreeT[S, M, A]

    Return the given value in the free monad.

  34. def roll[S[_], M[_], A](value: S[FreeT[S, M, A]])(implicit S: Functor[S], M: Applicative[M]): FreeT[S, M, A]

  35. def suspend[S[_], M[_], A](a: M[\/[A, S[FreeT[S, M, A]]]]): FreeT[S, M, A]

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

    Definition Classes
    AnyRef
  37. def tailrecM[S[_], M[_], A, B](f: (A) ⇒ FreeT[S, M, \/[A, B]])(a: A)(implicit arg0: Applicative[M]): FreeT[S, M, B]

  38. def toString(): String

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

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from FreeTInstances

Inherited from FreeTInstances0

Inherited from FreeTInstances1

Inherited from FreeTInstances2

Inherited from FreeTInstances3

Inherited from FreeTInstances4

Inherited from FreeTInstances5

Inherited from FreeTInstances6

Inherited from AnyRef

Inherited from Any

Ungrouped