scalaz.Free

Gosub

Related Doc: package 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

Call a subroutine and continue with the given function.

Source
Free.scala
Linear Supertypes
Serializable, Serializable, Product, Equals, Free[S, B], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Gosub
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. Free
  7. AnyRef
  8. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

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

Value Members

  1. final def !=(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

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

    Definition Classes
    AnyRef → Any
  4. final def >>=[B](f: (B) ⇒ Free[S, B]): Free[S, B]

    Alias for flatMap

    Alias for flatMap

    Definition Classes
    Free
  5. val a: () ⇒ Free[S, A]

  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  7. 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
  8. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. 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
  10. 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
  11. 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
  12. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  13. val f: (A) ⇒ Free[S, B]

  14. 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
  15. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  16. 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
  17. final def flatMapSuspension[T[+_]](f: ~>[S, [α]Free[T, α]])(implicit S: Functor[S], T: Functor[T]): Free[T, B]

    Substitutes a free monad over the given functor into the suspension functor of this program.

    Substitutes a free monad over the given functor into the suspension functor of this program. Free is a monad in an endofunctor category and this is its monadic bind.

    Definition Classes
    Free
  18. final def foldMap[M[_], AA >: B](f: ~>[S, M])(implicit arg0: Monad[M]): M[AA]

    Catamorphism for Free.

    Catamorphism for Free. Runs to completion, mapping the suspension with the given transformation at each step and accumulating into the monad M.

    Definition Classes
    Free
    Since

    7.0.5

  19. final def foldRight[G[_], AA >: B](z: ~>[Id.Id, G])(f: ~>[[α]S[G[α]], G]): G[AA]

    Folds this free recursion to the right using the given natural transformations.

    Folds this free recursion to the right using the given natural transformations.

    Definition Classes
    Free
    Since

    7.0.5

  20. 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
  21. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  22. 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
  23. final def isInstanceOf[T0]: Boolean

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

    Definition Classes
    Free
  25. 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
  26. 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
  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. 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()
  31. 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
  32. final def runM[M[_], AA >: B](f: (S[Free[S, AA]]) ⇒ M[Free[S, AA]])(implicit arg0: Monad[M]): M[AA]

    Runs to completion, using a function that maps the resumption from S to a monad M.

    Runs to completion, using a function that maps the resumption from S to a monad M.

    Definition Classes
    Free
    Since

    7.0.1

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

    Definition Classes
    AnyRef
  34. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  37. 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
  38. 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
  39. 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

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from Free[S, B]

Inherited from AnyRef

Inherited from Any

Ungrouped