Object/Class

scalaz

Free

Related Docs: class Free | package scalaz

Permalink

object Free extends FreeInstances with FreeFunctions

Source
Free.scala
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Free
  2. FreeFunctions
  3. FreeInstances
  4. SourceInstances
  5. SinkInstances
  6. TrampolineInstances
  7. FreeInstances00
  8. FreeInstances0
  9. FreeInstances1
  10. FreeInstances2
  11. FreeInstances3
  12. AnyRef
  13. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type FreeC[S[_], A] = Free[[x]Coyoneda[S, x], A]

    Permalink

    A free monad over the free functor generated by S

  2. type Sink[A, B] = Free[[x](⇒ A) ⇒ x, B]

    Permalink

    A computation that accepts values of type A, eventually resulting in a value of type B.

    A computation that accepts values of type A, eventually resulting in a value of type B. Note the similarity to an scalaz.iteratee.Iteratee.

  3. type Source[A, B] = Free[[x](A, x), B]

    Permalink

    A computation that produces values of type A, eventually resulting in a value of type B.

  4. type Trampoline[A] = Free[Function0, A]

    Permalink

    A computation that can be stepped through, suspended, and paused

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. def await[A]: Sink[A, A]

    Permalink

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

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

    Definition Classes
    FreeFunctions
  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. implicit def freeFoldable[F[_]](implicit arg0: Foldable[F], arg1: Functor[F]): Foldable[[α]Free[F, α]]

    Permalink
    Definition Classes
    FreeInstances3
  11. implicit def freeFoldable1[F[_]](implicit arg0: Foldable1[F], arg1: Functor[F]): Foldable1[[α]Free[F, α]]

    Permalink
    Definition Classes
    FreeInstances2
  12. implicit def freeMonad[S[_]](implicit arg0: Functor[S]): Monad[[x]Free[S, x]]

    Permalink
    Definition Classes
    FreeInstances00
  13. implicit def freeMonoid[S[_], A](implicit arg0: Functor[S], arg1: Monoid[A]): Monoid[Free[S, A]]

    Permalink
    Definition Classes
    FreeInstances
  14. implicit def freeSemigroup[S[_], A](implicit arg0: Functor[S], arg1: Semigroup[A]): Semigroup[Free[S, A]]

    Permalink
    Definition Classes
    FreeInstances0
  15. implicit def freeTraverse[F[_]](implicit arg0: Traverse[F]): Traverse[[α]Free[F, α]]

    Permalink
    Definition Classes
    FreeInstances1
  16. implicit def freeTraverse1[F[_]](implicit arg0: Traverse1[F]): Traverse1[[α]Free[F, α]]

    Permalink
    Definition Classes
    FreeInstances0
  17. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  18. def gosub[S[_], A, B](a0: () ⇒ Free[S, A])(f0: (A) ⇒ Free[S, B]): Free[S, B]

    Permalink
  19. def hashCode(): Int

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

    Permalink
    Definition Classes
    Any
  21. def joinF[S[_], A](value: Free[[α]Free[S, α], A])(implicit S: Functor[S]): Free[S, A]

    Permalink

    Monadic join for the higher-order monad Free

    Monadic join for the higher-order monad Free

    Definition Classes
    FreeFunctions
  22. def liftF[S[_], A](value: ⇒ S[A])(implicit S: Functor[S]): Free[S, 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.

    Definition Classes
    FreeFunctions
  23. def liftFC[S[_], A](s: S[A]): FreeC[S, A]

    Permalink

    A free monad over a free functor of S.

    A free monad over a free functor of S.

    Definition Classes
    FreeFunctions
  24. def liftFU[MA](value: ⇒ MA)(implicit MA: Unapply[Functor, MA]): Free[M, A]

    Permalink

    A version of liftF that infers the nested type constructor.

    A version of liftF that infers the nested type constructor.

    Definition Classes
    FreeFunctions
  25. final def ne(arg0: AnyRef): Boolean

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

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

    Permalink
    Definition Classes
    AnyRef
  28. def pause: Trampoline[Unit]

    Permalink

    A trampoline step that doesn't do anything.

    A trampoline step that doesn't do anything.

    Definition Classes
    FreeFunctions
  29. def point[S[_], A](value: ⇒ A): Free[S, A]

    Permalink

    Return the given value in the free monad.

    Return the given value in the free monad.

    Definition Classes
    FreeFunctions
  30. def produce[A](a: A): Source[A, Unit]

    Permalink

    A source that produces the given value.

    A source that produces the given value.

    Definition Classes
    FreeFunctions
  31. def pure[S[_], A](value: ⇒ A): Free[S, A]

    Permalink

    Alias for point

    Alias for point

    Definition Classes
    FreeFunctions
  32. def reset[A](r: Trampoline[A]): Trampoline[A]

    Permalink

    Collapse a trampoline to a single step.

    Collapse a trampoline to a single step.

    Definition Classes
    FreeFunctions
  33. def return_[S[_], A](value: ⇒ A)(implicit S: Applicative[S]): Free[S, A]

    Permalink

    Suspend the given computation in a single step.

    Suspend the given computation in a single step.

    Definition Classes
    FreeFunctions
  34. def runFC[S[_], M[_], A](sa: FreeC[S, A])(interp: ~>[S, M])(implicit M: Monad[M]): M[A]

    Permalink

    Interpret a free monad over a free functor of S via natural transformation to monad M.

    Interpret a free monad over a free functor of S via natural transformation to monad M.

    Definition Classes
    FreeFunctions
  35. implicit def sinkMonad[S]: Monad[[x]Free[[x](⇒ S) ⇒ x, x]]

    Permalink
    Definition Classes
    FreeInstancesSinkInstances
  36. implicit def sourceMonad[S]: Monad[[x]Free[[x](S, x), x]]

    Permalink
    Definition Classes
    FreeInstancesSourceInstances
  37. def suspend[S[_], A](value: ⇒ Free[S, A])(implicit S: Applicative[S]): Free[S, A]

    Permalink
    Definition Classes
    FreeFunctions
  38. final def synchronized[T0](arg0: ⇒ T0): T0

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

    Permalink
    Definition Classes
    AnyRef → Any
  40. implicit val trampolineInstance: Monad[Trampoline] with Comonad[Trampoline]

    Permalink
    Definition Classes
    FreeInstancesTrampolineInstances
  41. final def wait(): Unit

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

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

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

Inherited from FreeFunctions

Inherited from FreeInstances

Inherited from SourceInstances

Inherited from SinkInstances

Inherited from TrampolineInstances

Inherited from FreeInstances00

Inherited from FreeInstances0

Inherited from FreeInstances1

Inherited from FreeInstances2

Inherited from FreeInstances3

Inherited from AnyRef

Inherited from Any

Ungrouped