Object/Class

cats.free

FreeT

Related Docs: class FreeT | package free

Permalink

object FreeT extends FreeTInstances with Serializable

Linear Supertypes
Serializable, Serializable, FreeTInstances, FreeTInstances0, FreeTInstances1, FreeTInstances2, FreeTInstances3, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. FreeT
  2. Serializable
  3. Serializable
  4. FreeTInstances
  5. FreeTInstances0
  6. FreeTInstances1
  7. FreeTInstances2
  8. FreeTInstances3
  9. AnyRef
  10. 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. implicit def catsFreeCombineForFreeT[S[_], M[_]](implicit arg0: Applicative[M], arg1: SemigroupK[M]): SemigroupK[[γ]FreeT[S, M, γ]]

    Permalink
    Definition Classes
    FreeTInstances0
  6. implicit def catsFreeFlatMapForFreeT[S[_], M[_]](implicit M0: Applicative[M]): FlatMap[[γ]FreeT[S, M, γ]]

    Permalink
    Definition Classes
    FreeTInstances1
  7. implicit def catsFreeMonadCombineForFreeT[S[_], M[_]](implicit arg0: Alternative[M]): MonadCombine[[γ]FreeT[S, M, γ]]

    Permalink
    Definition Classes
    FreeTInstances
  8. implicit def catsFreeMonadErrorForFreeT[S[_], M[_], E](implicit arg0: RecursiveTailRecM[M], E: MonadError[M, E]): MonadError[[γ]FreeT[S, M, γ], E]

    Permalink
    Definition Classes
    FreeTInstances2
  9. implicit def catsFreeMonadForFreeT[S[_], M[_]](implicit M0: Applicative[M]): Monad[[γ]FreeT[S, M, γ]] with RecursiveTailRecM[[γ]FreeT[S, M, γ]]

    Permalink
    Definition Classes
    FreeTInstances0
  10. implicit def catsFreeMonadStateForFreeT[S[_], M[_], E](implicit M1: MonadState[M, E]): MonadState[[γ]FreeT[S, M, γ], E]

    Permalink
    Definition Classes
    FreeTInstances3
  11. implicit def catsFreeTransLiftForFreeT[S[_]]: Aux[[β[_$1], γ]FreeT[S, β, γ], Functor]

    Permalink
    Definition Classes
    FreeTInstances1
  12. def clone(): AnyRef

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

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

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  16. final def getClass(): Class[_]

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

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

    Permalink
    Definition Classes
    Any
  19. def liftF[S[_], M[_], A](value: S[A])(implicit M: Applicative[M]): FreeT[S, M, A]

    Permalink

    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.

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

    Permalink
  21. def liftTU[S[_], MA](value: MA)(implicit M: Unapply[Functor, MA]): FreeT[S, M, A]

    Permalink

    A version of liftT that infers the nested type constructor.

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

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

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

    Permalink
    Definition Classes
    AnyRef
  25. def pure[S[_], M[_], A](value: A)(implicit M: Applicative[M]): FreeT[S, M, A]

    Permalink

    Return the given value in the free monad.

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

    Permalink
  27. def suspend[S[_], M[_], A](a: M[Either[A, S[FreeT[S, M, A]]]])(implicit M: Applicative[M]): FreeT[S, M, A]

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

    Permalink
    Definition Classes
    AnyRef
  29. def tailRecM[S[_], M[_], A, B](a: A)(f: (A) ⇒ FreeT[S, M, Either[A, B]])(implicit arg0: Applicative[M]): FreeT[S, M, B]

    Permalink
  30. def toString(): String

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

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

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

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

Inherited from Serializable

Inherited from Serializable

Inherited from FreeTInstances

Inherited from FreeTInstances0

Inherited from FreeTInstances1

Inherited from FreeTInstances2

Inherited from FreeTInstances3

Inherited from AnyRef

Inherited from Any

Ungrouped