Object/Class

cats.free

Free

Related Docs: class Free | package free

Permalink

object Free extends Serializable

Linear Supertypes
Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Free
  2. Serializable
  3. Serializable
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. final class FreeInjectPartiallyApplied[F[_], G[_]] extends AnyRef

    Permalink

    Pre-application of an injection to a F[A] value.

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 catsFreeMonadForFree[S[_]]: Monad[[β]Free[S, β]] with RecursiveTailRecM[[β]Free[S, β]]

    Permalink

    Free[S, ?] has a monad for any type constructor S[_].

  6. def clone(): AnyRef

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

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

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. def foldLeftM[F[_], G[_], A, B](fa: F[A], z: B)(f: (B, A) ⇒ G[B])(implicit arg0: Foldable[F], arg1: Monad[G], arg2: RecursiveTailRecM[G]): G[B]

    Permalink

    Perform a stack-safe monadic fold from the source context F into the target monad G.

    Perform a stack-safe monadic fold from the source context F into the target monad G.

    This method can express short-circuiting semantics. Even when fa is an infinite structure, this method can potentially terminate if the foldRight implementation for F and the tailRecM implementation for G are sufficiently lazy.

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  13. def inject[F[_], G[_]]: FreeInjectPartiallyApplied[F, G]

    Permalink

    This method is used to defer the application of an Inject[F, G] instance.

    This method is used to defer the application of an Inject[F, G] instance. The actual work happens in FreeInjectPartiallyApplied#apply.

    This method exists to allow the F and G parameters to be bound independently of the A parameter below.

  14. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  15. def liftF[F[_], A](value: F[A]): Free[F, A]

    Permalink

    Lift an F[A] value into the free monad.

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

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

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

    Permalink
    Definition Classes
    AnyRef
  19. def pure[S[_], A](a: A): Free[S, A]

    Permalink

    Lift a pure A value into the free monad.

  20. def suspend[F[_], A](value: ⇒ Free[F, A]): Free[F, A]

    Permalink

    Suspend the creation of a Free[F, A] value.

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

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

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

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

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

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

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped