Object

scalaz.stream

wye

Related Doc: package stream

Permalink

object wye

Source
wye.scala
Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. wye
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Type Members

  1. trait Request extends AnyRef

    Permalink

    Indicates required request side

  2. type WyeAwaitBoth[I, I2, O] = Await[Y, Y[ReceiveY[I, I2]], O]

    Permalink
  3. type WyeAwaitL[I, I2, O] = Await[Y, Is[I], O]

    Permalink
  4. type WyeAwaitR[I, I2, O] = Await[Y, T[I2], O]

    Permalink

Value Members

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

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  4. object AwaitBoth

    Permalink
  5. object AwaitL

    Permalink
  6. object AwaitR

    Permalink
  7. object Request

    Permalink
  8. def apply[L, R, O](pl: Process[Task, L], pr: Process[Task, R])(y0: Wye[L, R, O])(implicit S: Strategy): Process[Task, O]

    Permalink

    Implementation of wye.

    Implementation of wye.

    L

    Type of left process element

    R

    Type of right process elements

    O

    Output type of resulting process

    pl

    left process

    pr

    right process

    y0

    wye to control queueing and merging

    S

    strategy, preferably executor service based

    returns

    Process with merged elements.

  9. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  10. def attachL[I0, I, I2, O](p1: Process1[I0, I])(y: Wye[I, I2, O]): Wye[I0, I2, O]

    Permalink

    Transform the left input of the given Wye using a Process1.

  11. def attachR[I, I1, I2, O](p: Process1[I1, I2])(w: Wye[I, I2, O]): Wye[I, I1, O]

    Permalink

    Transform the right input of the given Wye using a Process1.

  12. def boundedQueue[I](n: Int): Wye[Any, I, I]

    Permalink

    A Wye which emits values from its right branch, but allows up to n elements from the left branch to enqueue unanswered before blocking on the right branch.

  13. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  14. def detach1L[I, I2, O](y: Wye[I, I2, O]): Wye[I, I2, O]

    Permalink

    Transforms the wye so it will stop to listen on left side.

    Transforms the wye so it will stop to listen on left side. Instead all requests on the left side are converted to termination with Kill, and will terminate once the right side will terminate as well. Transforms AwaitBoth to AwaitR Transforms AwaitL to termination with End

  15. def detach1R[I, I2, O](y: Wye[I, I2, O]): Wye[I, I2, O]

    Permalink

    right alternative of detach1L

  16. def disconnectL[I, I2, O](cause: EarlyCause)(y: Wye[I, I2, O]): Wye[I, I2, O]

    Permalink

    Signals to wye, that Left side terminated.

    Signals to wye, that Left side terminated. Reason for termination is cause. Any Left requests will be terminated with cause Wye will be switched to listen only on Right side, that means Await(Both) is converted to Await(R)

  17. def disconnectR[I, I2, O](cause: EarlyCause)(y: Wye[I, I2, O]): Wye[I, I2, O]

    Permalink

    Right side alternative for disconnectL

  18. def dynamic[I, I2](f: (I) ⇒ Request, g: (I2) ⇒ Request): Wye[I, I2, ReceiveY[I, I2]]

    Permalink

    After each input, dynamically determine whether to read from the left, right, or both, for the subsequent input, using the provided functions f and g.

    After each input, dynamically determine whether to read from the left, right, or both, for the subsequent input, using the provided functions f and g. The returned Wye begins by reading from the left side and is left-biased--if a read of both branches returns a These(x,y), it uses the signal generated by f for its next step.

  19. def dynamic1[I](f: (I) ⇒ Request): Wye[I, I, I]

    Permalink

    Invokes dynamic with I == I2, and produces a single I output.

    Invokes dynamic with I == I2, and produces a single I output. Output is left-biased: if a These(i1,i2) is emitted, this is translated to an emitSeq(List(i1,i2)).

  20. def echoLeft[A]: Wye[A, Any, A]

    Permalink

    Continuous wye, that first reads from Left to get A, Then when A is not available it reads from R echoing any A that was received from Left Will halt once any of the sides halt

  21. def either[I, I2]: Wye[I, I2, \/[I, I2]]

    Permalink

    Nondeterminstic interleave of both inputs.

    Nondeterminstic interleave of both inputs. Emits values whenever either of the inputs is available.

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

    Permalink
    Definition Classes
    AnyRef
  23. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  24. def feed1[I, I2, O](r: ReceiveY[I, I2])(w: Wye[I, I2, O]): Wye[I, I2, O]

    Permalink

    Feed a single ReceiveY value to a Wye.

  25. def feed1L[I, I2, O](i: I)(w: Wye[I, I2, O]): Wye[I, I2, O]

    Permalink

    Feed a single value to the left branch of a Wye.

  26. def feed1R[I, I2, O](i2: I2)(w: Wye[I, I2, O]): Wye[I, I2, O]

    Permalink

    Feed a single value to the right branch of a Wye.

  27. def feedL[I, I2, O](is: Seq[I])(y: Wye[I, I2, O]): Wye[I, I2, O]

    Permalink

    Feed a sequence of inputs to the left side of a Wye.

  28. def feedR[I, I2, O](i2s: Seq[I2])(y: Wye[I, I2, O]): Wye[I, I2, O]

    Permalink

    Feed a sequence of inputs to the right side of a Wye.

  29. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  30. def flip[I, I2, O](y: Wye[I, I2, O]): Wye[I2, I, O]

    Permalink

    Convert right requests to left requests and vice versa.

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

    Permalink
    Definition Classes
    AnyRef → Any
  32. def haltL[I, I2, O](cause: Cause)(y: Wye[I, I2, O]): Wye[I, I2, O]

    Permalink

    Signals to wye that left side halted with cause.

    Signals to wye that left side halted with cause. Wye will be fed with HaltL(cause) and will disconnect from Left side.

  33. def haltR[I, I2, O](cause: Cause)(y: Wye[I, I2, O]): Wye[I, I2, O]

    Permalink

    Right alternative for haltL

  34. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  35. def interrupt[I]: Wye[Boolean, I, I]

    Permalink

    Let through the right branch as long as the left branch is false, listening asynchronously for the left branch to become true.

    Let through the right branch as long as the left branch is false, listening asynchronously for the left branch to become true. This halts as soon as the right or left branch halts.

  36. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  37. def merge[I]: Wye[I, I, I]

    Permalink

    Non-deterministic interleave of both inputs.

    Non-deterministic interleave of both inputs. Emits values whenever either of the inputs is available.

    Will terminate once both sides terminate.

  38. def mergeHaltBoth[I]: Wye[I, I, I]

    Permalink

    Like merge, but terminates whenever one side terminate.

  39. def mergeHaltL[I]: Wye[I, I, I]

    Permalink

    Like merge, but terminates whenever left side terminates.

    Like merge, but terminates whenever left side terminates. use flip to reverse this for the right side

  40. def mergeHaltR[I]: Wye[I, I, I]

    Permalink

    Like merge, but terminates whenever right side terminates

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

    Permalink
    Definition Classes
    AnyRef
  42. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  43. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  44. def receiveBoth[I, I2, O](rcv: (ReceiveY[I, I2]) ⇒ Wye[I, I2, O]): Wye[I, I2, O]

    Permalink
  45. def receiveBothOr[I, I2, O](fb: (EarlyCause) ⇒ Wye[I, I2, O])(rcv: (ReceiveY[I, I2]) ⇒ Wye[I, I2, O]): Wye[I, I2, O]

    Permalink
  46. def receiveL[I, I2, O](rcv: (I) ⇒ Wye[I, I2, O]): Wye[I, I2, O]

    Permalink
  47. def receiveLOr[I, I2, O](fb: (EarlyCause) ⇒ Wye[I, I2, O])(rcv: (I) ⇒ Wye[I, I2, O]): Wye[I, I2, O]

    Permalink
  48. def receiveR[I, I2, O](rcv: (I2) ⇒ Wye[I, I2, O]): Wye[I, I2, O]

    Permalink
  49. def receiveROr[I, I2, O](fb: (EarlyCause) ⇒ Wye[I, I2, O])(rcv: (I2) ⇒ Wye[I, I2, O]): Wye[I, I2, O]

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

    Permalink
    Definition Classes
    AnyRef
  51. def timedQueue[I](d: Duration, maxSize: Int = Int.MaxValue): Wye[Duration, I, I]

    Permalink

    A Wye which blocks on the right side when either a) the age of the oldest unanswered element from the left size exceeds the given duration, or b) the number of unanswered elements from the left exceeds maxSize.

  52. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  53. def unboundedQueue[I]: Wye[Any, I, I]

    Permalink

    Wye which repeatedly awaits both branches, emitting any values received from the right.

    Wye which repeatedly awaits both branches, emitting any values received from the right. Useful in conjunction with connect, for instance src.connect(snk)(unboundedQueue)

  54. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  57. def yip[I, I2]: Wye[I, I2, (I, I2)]

    Permalink

    Nondeterministic version of zip which requests both sides in parallel.

  58. def yipL[I, I2](n: Int): Wye[I, I2, (I, I2)]

    Permalink

    Left-biased, buffered version of yip.

    Left-biased, buffered version of yip. Allows up to n elements to enqueue on the left unanswered before requiring a response from the right. If buffer is empty, always reads from the left.

  59. def yipWith[I, I2, O](f: (I, I2) ⇒ O): Wye[I, I2, O]

    Permalink

    Nondeterministic version of zipWith which requests both sides in parallel.

  60. def yipWithL[I, O, O2](n: Int)(f: (I, O) ⇒ O2): Wye[I, O, O2]

    Permalink

    Left-biased, buffered version of yipWith.

    Left-biased, buffered version of yipWith. Allows up to n elements to enqueue on the left unanswered before requiring a response from the right. If buffer is empty, always reads from the left.

Inherited from AnyRef

Inherited from Any

Ungrouped