Free

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

5. implicit def catsFreeMonadForFree[S[_]]: Monad[[β$11$]Free[S, β$11$]]

   

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

6. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

7. def compile[F[_], G[_]](fk: FunctionK[F, G]): FunctionK[[β$3$]Free[F, β$3$], [β$4$]Free[G, β$4$]]

   

   a FunctionK, suitable for composition, which calls compile

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. def foldLeftM[F[_], G[_], A, B](fa: F[A], z: B)(f: (B, A) ⇒ G[B])(implicit arg0: Foldable[F], arg1: Monad[G]): G[B]

    

    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.

12. def foldMap[F[_], M[_]](fk: FunctionK[F, M])(implicit arg0: Monad[M]): FunctionK[[β$8$]Free[F, β$8$], M]

    

    a FunctionK, suitable for composition, which calls foldMap

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

    

    Definition Classes

    AnyRef → Any

14. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

15. def inject[F[_], G[_]]: FreeInjectPartiallyApplied[F, G]

    

    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.

16. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

17. def liftF[F[_], A](value: F[A]): Free[F, A]

    

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

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

    

    Definition Classes

    AnyRef

19. final def notify(): Unit

    

    Definition Classes

    AnyRef

20. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

21. def pure[S[_], A](a: A): Free[S, A]

    

    Lift a pure A value into the free monad.

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

    

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

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

    

    Definition Classes

    AnyRef

24. def toString(): String

    

    Definition Classes

    AnyRef → Any

25. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

27. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )