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 asInstanceOf[T0]: T0

   Definition Classes

   Any

5.  def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

6.  def either[O2 >: O, O3](p2: Process[Task, O3])(implicit S: Strategy): Process[Task, \/[O2, O3]]

   Non-deterministic interleave of both streams.

   Non-deterministic interleave of both streams. Emits values whenever either is defined. Note this terminates after BOTH sides terminate

   Definition Classes

   WyeOps

7.  final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

8.  def equals(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

9.  def finalize(): Unit

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( classOf[java.lang.Throwable] )

10.  def forwardFill(implicit S: Strategy): Process[Task, O]

    Produce a continuous stream from a discrete stream by using the most recent value.

11.  final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

12.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

13.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

14.  def merge[O2 >: O](p2: Process[Task, O2])(implicit S: Strategy): Process[Task, O2]

    Non-deterministic interleave of both streams.

    Non-deterministic interleave of both streams. Emits values whenever either is defined. Note this terminates after BOTH sides terminate

    Definition Classes

    WyeOps

15.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

16.  final def notify(): Unit

    Definition Classes

    AnyRef

17.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

18.  def observeThrough[O2](ch: Channel[Task, O, O2]): Process[Task, (O, O2)]

    Returns result of channel evaluation tupled with original value passed to channel.

19.  val self: Process[Task, O]

    Definition Classes

    SourceSyntax → WyeOps

20.  final def stepAsync(cb: (\/[Cause, (Seq[O], Cont[Task, O])]) ⇒ Unit)(implicit S: Strategy): (EarlyCause) ⇒ Unit

    Asynchronous stepping of this Process.

    Asynchronous stepping of this Process. Note that this method is not resource safe unless callback is called with _left_ side completed. In that case it is guaranteed that all cleanups has been successfully completed. User of this method is responsible for any cleanup actions to be performed by running the next Process obtained on right side of callback.

    This method returns a function, that when applied, causes the running computation to be interrupted. That is useful of process contains any asynchronous code, that may be left with incomplete callbacks. If the evaluation of the process is interrupted, then the interruption is only active if the callback was not completed before, otherwise interruption is no-op.

    There is chance, that cleanup code of intermediate Await will get called twice on interrupt, but always at least once. The second cleanup invocation in that case may run on different thread, asynchronously.

    Please note that this method is *not* intended for external use! It is the Await analogue of step, which is also an internal-use function.

    cb

    result of the asynchronous evaluation of the process. Note that, the callback is never called on the right side, if the sequence is empty.

    S

    Strategy to use when evaluating the process. Note that Strategy.Sequential may cause SOE.

    returns

    Function to interrupt the evaluation

    Attributes

    protected[org.specs2.codata]

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

    Definition Classes

    AnyRef

22.  def toSignal(implicit S: Strategy): Signal[O]

    converts process to signal *

23.  def toString(): String

    Definition Classes

    AnyRef → Any

24.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

26.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

27.  final def wye[O2, O3](p2: Process[Task, O2])(y: Wye[O, O2, O3])(implicit S: Strategy): Process[Task, O3]

    Like tee, but we allow the Wye to read non-deterministically from both sides at once.

    Like tee, but we allow the Wye to read non-deterministically from both sides at once.

    If y is in the state of awaiting Both, this implementation will continue feeding y from either left or right side, until either it halts or _both_ sides halt.

    If y is in the state of awaiting L, and the left input has halted, we halt. Likewise for the right side.

    For as long as y permits it, this implementation will _always_ feed it any leading Emit elements from either side before issuing new F requests. More sophisticated chunking and fairness policies do not belong here, but should be built into the Wye and/or its inputs.

    The strategy passed in must be stack-safe, otherwise this implementation will throw SOE. Preferably use one of the Strategys.Executor(es) based strategies

    Definition Classes

    WyeOps

28.  def yip[O2](p2: Process[Task, O2])(implicit S: Strategy): Process[Task, (O, O2)]

    Non-deterministic version of zip.

    Non-deterministic version of zip. Note this terminates whenever one of streams terminate

    Definition Classes

    WyeOps

29.  def yipWith[O2, O3](p2: Process[Task, O2])(f: (O, O2) ⇒ O3)(implicit S: Strategy): Process[Task, O3]

    Non-deterministic version of zipWith.

    Non-deterministic version of zipWith. Note this terminates whenever one of streams terminate

    Definition Classes

    WyeOps