Gosub

Instance Constructors

new Gosub(a: () ⇒ Free[S, A], f: (A) ⇒ Free[S, B])(implicit arg0: Functor[S])

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: (B) ⇒ Free[S, B]): Free[S, B]

Alias for flatMap
Alias for flatMap

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

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

Runs a single step, using a function that extracts the resumption from its suspension functor.
Runs a single step, using a function that extracts the resumption from its suspension functor.

Definition Classes
Free
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def collect[B, C >: B](implicit ev: <~<[Free[S, C], Source[B, C]]): (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 >: B](source: Source[E, B])(implicit ev: <~<[Free[S, C], Sink[E, C]]): (C, B)

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

Definition Classes
Free
def drive[E, B, C >: B](sink: Sink[Option[E], B])(implicit ev: <~<[Free[S, C], Source[E, C]]): (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
val f: (A) ⇒ Free[S, B]
def feed[E, C >: B](ss: Stream[E])(implicit ev: <~<[Free[S, C], Sink[E, C]]): 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( classOf[java.lang.Throwable] )
final def flatMap[B](f: (B) ⇒ 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 foldRun[B, AA >: B](b: B)(f: (B, S[Free[S, AA]]) ⇒ (B, Free[S, AA])): (B, AA)

Runs to completion, allowing the resumption function to thread an arbitrary state of type B.
Runs to completion, allowing the resumption function to thread an arbitrary state of type B.

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

Definition Classes
AnyRef → Any
final def go[AA >: B](f: (S[Free[S, AA]]) ⇒ Free[S, AA]): AA

Runs to completion, using a function that extracts the resumption from its suspension functor.
Runs to completion, using a function that extracts the resumption from its suspension functor.

Definition Classes
Free
final def isInstanceOf[T0]: Boolean

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

Definition Classes
Free
final def mapFirstSuspension(f: ~>[S, S]): Free[S, B]

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

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

Changes the suspension functor by the given natural transformation.
Changes the suspension functor by 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: \/[S[Free[S, B]], B]

Evaluates a single layer of the free monad.
Evaluates a single layer of the free monad.

Definition Classes
Free
Annotations
@tailrec()
def run[B >: B](implicit ev: <~<[Free[S, B], Trampoline[B]]): 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 runM[M[_], AA >: B](f: (S[Free[S, AA]]) ⇒ M[Free[S, AA]])(implicit arg0: Monad[M]): M[AA]

Definition Classes
Free
Since
7.0.1
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( ... )
final def zap[G[+_], B](fs: Cofree[G, (B) ⇒ B])(implicit G: Functor[G], d: Zap[S, G]): B

Applies a function in a comonad to the corresponding value in this monad, annihilating both.
Applies a function in a comonad to the corresponding value in this monad, annihilating both.

Definition Classes
Free
final def zapWith[G[+_], B, C](bs: Cofree[G, B])(f: (B, B) ⇒ C)(implicit G: Functor[G], d: Zap[S, G]): C

Applies a function f to a value in this monad and a corresponding value in the dual comonad, annihilating both.
Applies a function f to a value in this monad and a corresponding value in the dual comonad, annihilating both.

Definition Classes
Free
def zipWith[B, C](tb: Free[S, B], f: (B, B) ⇒ C): 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 Gosub[S[+_], A, +B](a: () ⇒ Free[S, A], f: (A) ⇒ Free[S, B])(implicit evidence$3: Functor[S]) extends Free[S, B] with Product with Serializable

Instance Constructors

new Gosub(a: () ⇒ Free[S, A], f: (A) ⇒ Free[S, B])(implicit arg0: Functor[S])

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: (B) ⇒ Free[S, B]): Free[S, B]

val a: () ⇒ Free[S, A]

final def asInstanceOf[T0]: T0

final def bounce[AA >: B](f: (S[Free[S, B]]) ⇒ Free[S, AA]): Free[S, AA]

def clone(): AnyRef

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

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

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

final def eq(arg0: AnyRef): Boolean

val f: (A) ⇒ Free[S, B]

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

def finalize(): Unit

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

final def foldRun[B, AA >: B](b: B)(f: (B, S[Free[S, AA]]) ⇒ (B, Free[S, AA])): (B, AA)

final def getClass(): Class[_]

final def go[AA >: B](f: (S[Free[S, AA]]) ⇒ Free[S, AA]): AA

final def isInstanceOf[T0]: Boolean

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

final def mapFirstSuspension(f: ~>[S, S]): Free[S, B]

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

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def resume: \/[S[Free[S, B]], B]

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

final def runM[M[_], AA >: B](f: (S[Free[S, AA]]) ⇒ M[Free[S, AA]])(implicit arg0: Monad[M]): M[AA]

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

final def zap[G[+_], B](fs: Cofree[G, (B) ⇒ B])(implicit G: Functor[G], d: Zap[S, G]): B

final def zapWith[G[+_], B, C](bs: Cofree[G, B])(f: (B, B) ⇒ C)(implicit G: Functor[G], d: Zap[S, G]): C

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

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from Free[S, B]

Inherited from AnyRef

Inherited from Any

Ungrouped