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. final def >>=[B](f: (A) ⇒ Free[S, B]): Free[S, B]

   Alias for flatMap

7. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

8. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws()

9. def collect[B, C >: A](implicit ev: <~<[Free[S, C], Free.Source[B, C]], S: Functor[S]): (Vector[B], C)

   Runs a Source all the way to the end, tail-recursively, collecting the produced values.

10. def drain[E, B, C >: A](source: Free.Source[E, B])(implicit ev: <~<[Free[S, C], Free.Sink[E, C]], S: Functor[S]): (C, B)

    Feed the given source to this Sink.

11. def drive[E, B, C >: A](sink: Free.Sink[Option[E], B])(implicit ev: <~<[Free[S, C], Free.Source[E, C]], S: Functor[S]): (C, B)

    Drive this Source with the given Sink.

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

    Definition Classes

    AnyRef

13. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

14. def feed[E, C >: A](ss: Stream[E])(implicit ev: <~<[Free[S, C], Free.Sink[E, C]], S: Functor[S]): C

    Feed the given stream to this Source.

15. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws()

16. final def flatMap[B](f: (A) ⇒ Free[S, B]): Free[S, B]

    Binds the given continuation to the result of this computation.

    Binds the given continuation to the result of this computation. All left-associated binds are reassociated to the right.

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

    Definition Classes

    AnyRef → Any

18. def hashCode(): Int

    Definition Classes

    AnyRef → Any

19. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

20. final def map[B](f: (A) ⇒ B): Free[S, B]

21. final def mapSuspension[T[+_]](f: ~>[S, T])(implicit S: Functor[S]): Free[T, A]

    Modifies the suspension with the given natural transformation.

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

    Definition Classes

    AnyRef

23. final def notify(): Unit

    Definition Classes

    AnyRef

24. final def notifyAll(): Unit

    Definition Classes

    AnyRef

25. final def resume(implicit S: Functor[S]): Either[S[Free[S, A]], A]

    Evaluates a single layer of the free monad.

    Evaluates a single layer of the free monad.

    Annotations

    @tailrec()

26. def run[B >: A](implicit ev: <~<[Free[S, B], Free.Trampoline[B]], S: Functor[S]): B

    Runs a trampoline all the way to the end, tail-recursively.

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

    Definition Classes

    AnyRef

28. def toString(): String

    Definition Classes

    AnyRef → Any

29. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws()

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

    Definition Classes

    AnyRef

    Annotations

    @throws()

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

    Definition Classes

    AnyRef

    Annotations

    @throws()

32. def zipWith[B, C](tb: Free[S, B], f: (A, B) ⇒ C)(implicit S: Functor[S]): Free[S, C]

    Interleave this computation with another, combining the results with the given function.