Suspend

Instance Constructors

new Suspend(a: S[Free[S, A]])

Value Members

final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def !=(arg0: Any): Boolean

Definition Classes
Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def ==(arg0: Any): Boolean

Definition Classes
Any
final def >>=[B](f: (A) ⇒ Free[S, B]): Free[S, B]

Alias for flatMap
Alias for flatMap

Definition Classes
Free
val a: S[Free[S, A]]
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws()
def collect[B, C >: A](implicit ev: <~<[Free[S, C], Source[B, C]], S: Functor[S]): (Vector[B], C)

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

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

Feed the given source to this Sink.
Feed the given source to this Sink.

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

Drive this Source with the given Sink.
Drive this Source with the given Sink.

Definition Classes
Free
final def eq(arg0: AnyRef): Boolean

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

Feed the given stream to this Source.
Feed the given stream to this Source.

Definition Classes
Free
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws()
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.

Definition Classes
Free
final def getClass(): Class[_]

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

Definition Classes
Any
final def map[B](f: (A) ⇒ B): Free[S, B]

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

Modifies the suspension with the given natural transformation.
Modifies the suspension with the given natural transformation.

Definition Classes
Free
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
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.

Definition Classes
Free
Annotations
@tailrec()
def run[B >: A](implicit ev: <~<[Free[S, B], Trampoline[B]], S: Functor[S]): B

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

Definition Classes
Free
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws()
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.
Interleave this computation with another, combining the results with the given function.

Definition Classes
Free

case class Suspend[S[+_], +A](a: S[Free[S, A]]) extends Free[S, A] with Product with Serializable

Instance Constructors

new Suspend(a: S[Free[S, A]])

Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def >>=[B](f: (A) ⇒ Free[S, B]): Free[S, B]

val a: S[Free[S, A]]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

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

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

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

final def eq(arg0: AnyRef): Boolean

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

def finalize(): Unit

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

final def getClass(): Class[_]

final def isInstanceOf[T0]: Boolean

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

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

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

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

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

final def wait(): Unit

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

final def wait(arg0: Long): Unit

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

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from scala.Equals

Inherited from Free[S, A]

Inherited from AnyRef

Inherited from Any

Ungrouped