Packages

final class Interleave[T] extends GraphStage[UniformFanInShape[T, T]]

Interleave represents deterministic merge which takes N elements per input stream, in-order of inputs, emits them downstream and then cycles/"wraps-around" the inputs.

Emits when element is available from current input (depending on phase)

Backpressures when downstream backpressures

Completes when all upstreams complete (eagerClose=false) or one upstream completes (eagerClose=true)

Cancels when downstream cancels

Source
Graph.scala
Linear Supertypes
GraphStage[UniformFanInShape[T, T]], GraphStageWithMaterializedValue[UniformFanInShape[T, T], NotUsed], Graph[UniformFanInShape[T, T], NotUsed], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Interleave
  2. GraphStage
  3. GraphStageWithMaterializedValue
  4. Graph
  5. AnyRef
  6. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Interleave(inputPorts: Int, segmentSize: Int, eagerClose: Boolean)

Type Members

  1. type Shape = UniformFanInShape[T, T]

    Type-level accessor for the shape parameter of this graph.

    Type-level accessor for the shape parameter of this graph.

    Definition Classes
    Graph

Value Members

  1. def addAttributes(attr: Attributes): Graph[UniformFanInShape[T, T], NotUsed]

    Add the given attributes to this Graph.

    Add the given attributes to this Graph. If the specific attribute was already present on this graph this means the added attribute will be more specific than the existing one. If this Source is a composite of multiple graphs, new attributes on the composite will be less specific than attributes set directly on the individual graphs of the composite.

    Definition Classes
    Graph
  2. def async(dispatcher: String, inputBufferSize: Int): Graph[UniformFanInShape[T, T], NotUsed]

    Put an asynchronous boundary around this Graph

    Put an asynchronous boundary around this Graph

    dispatcher

    Run the graph on this dispatcher

    inputBufferSize

    Set the input buffer to this size for the graph

    Definition Classes
    Graph
  3. def async(dispatcher: String): Graph[UniformFanInShape[T, T], NotUsed]

    Put an asynchronous boundary around this Graph

    Put an asynchronous boundary around this Graph

    dispatcher

    Run the graph on this dispatcher

    Definition Classes
    Graph
  4. def async: Graph[UniformFanInShape[T, T], NotUsed]

    Put an asynchronous boundary around this Graph

    Put an asynchronous boundary around this Graph

    Definition Classes
    Graph
  5. def createLogic(inheritedAttributes: Attributes): GraphStageLogic
    Definition Classes
    Interleave → GraphStage
  6. final def createLogicAndMaterializedValue(inheritedAttributes: Attributes): (GraphStageLogic, NotUsed)
    Definition Classes
    GraphStage → GraphStageWithMaterializedValue
  7. val eagerClose: Boolean
  8. val in: IndexedSeq[Inlet[T]]
  9. val inputPorts: Int
  10. def named(name: String): Graph[UniformFanInShape[T, T], NotUsed]
    Definition Classes
    Graph
  11. val out: Outlet[T]
  12. val segmentSize: Int
  13. val shape: UniformFanInShape[T, T]

    The shape of a graph is all that is externally visible: its inlets and outlets.

    The shape of a graph is all that is externally visible: its inlets and outlets.

    Definition Classes
    Interleave → Graph
  14. def toString(): String
    Definition Classes
    Interleave → AnyRef → Any
  15. final def withAttributes(attr: Attributes): Graph[UniformFanInShape[T, T], NotUsed]
    Definition Classes
    GraphStageWithMaterializedValue → Graph