Free

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. def apply[S[_], A](s: S[Free[S, A]]): Free[S, A]

   Absorb a step in S into the free monad for S

7. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

8. def await[A]: Sink[A, A]

   A sink that waits for a single value and returns it.

9. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

10. final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

11. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

12. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

13. implicit def freeFoldable[F[_]](implicit arg0: Foldable[F], arg1: Functor[F]): Foldable[[β$21$]Free[F, β$21$]]

    Definition Classes

    FreeInstances3

14. implicit def freeFoldable1[F[_]](implicit arg0: Foldable1[F], arg1: Functor[F]): Foldable1[[β$22$]Free[F, β$22$]]

    Definition Classes

    FreeInstances2

15. implicit def freeMonad[S[_]]: Monad[[β$26$]Free[S, β$26$]] with BindRec[[β$27$]Free[S, β$27$]]

    Definition Classes

    FreeInstances

16. implicit def freeMonoid[S[_], A](implicit arg0: Monoid[A]): Monoid[Free[S, A]]

    Definition Classes

    FreeInstances

17. implicit def freeSemigroup[S[_], A](implicit arg0: Semigroup[A]): Semigroup[Free[S, A]]

    Definition Classes

    FreeInstances0

18. implicit def freeTraverse[F[_]](implicit arg0: Traverse[F]): Traverse[[β$23$]Free[F, β$23$]]

    Definition Classes

    FreeInstances1

19. implicit def freeTraverse1[F[_]](implicit arg0: Traverse1[F]): Traverse1[[β$24$]Free[F, β$24$]]

    Definition Classes

    FreeInstances0

20. implicit def freeZip[S[_]](implicit F: Functor[S], Z: Zip[S]): Zip[[β$30$]Free[S, β$30$]]

    Definition Classes

    FreeInstances

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

    Definition Classes

    AnyRef → Any

22. def hashCode(): Int

    Definition Classes

    AnyRef → Any

23. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

24. def joinF[S[_], A](value: Free[[β$0$]Free[S, β$0$], A]): Free[S, A]

    Monadic join for the higher-order monad Free

25. def liftF[S[_], A](value: S[A]): Free[S, 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.

26. def liftFU[MA](value: ⇒ MA)(implicit MA: Unapply[Functor, MA]): Free[M, A]

    A version of liftF that infers the nested type constructor.

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

    Definition Classes

    AnyRef

28. final def notify(): Unit

    Definition Classes

    AnyRef

29. final def notifyAll(): Unit

    Definition Classes

    AnyRef

30. def pause: Trampoline[Unit]

    A trampoline step that doesn't do anything.

31. def point[S[_], A](value: A): Free[S, A]

    Return the given value in the free monad.

32. def produce[A](a: A): Source[A, Unit]

    A source that produces the given value.

33. def pure[S[_], A](value: A): Free[S, A]

    Alias for point

34. def reset[A](r: Trampoline[A]): Trampoline[A]

    Collapse a trampoline to a single step.

35. def return_[S[_], A](value: ⇒ A)(implicit S: Applicative[S]): Free[S, A]

    Suspend the given computation in a single step.

36. def roll[S[_], A](value: S[Free[S, A]]): Free[S, A]

    Absorb a step into the free monad.

37. implicit def sinkMonad[S]: Monad[[β$15$]Free[[β$5$](⇒ S) ⇒ β$5$, β$15$]]

    Definition Classes

    SinkInstances

38. implicit def sourceMonad[S]: Monad[[β$18$]Free[[β$4$](S, β$4$), β$18$]]

    Definition Classes

    SourceInstances

39. def suspend[S[_], A](value: ⇒ Free[S, A])(implicit S: Applicative[S]): Free[S, A]

    Suspend a computation in a pure step of the applicative functor S

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

    Definition Classes

    AnyRef

41. def toString(): String

    Definition Classes

    AnyRef → Any

42. implicit def trampolineComonad: Comonad[Trampoline]

    Definition Classes

    FreeInstances2

43. val trampolineInstance: Monad[Trampoline] with Comonad[Trampoline] with BindRec[Trampoline]

    Definition Classes

    TrampolineInstances

44. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )