Instance Constructors
-
new
Interleave(inputPorts: Int, segmentSize: Int, eagerClose: Boolean)
Type Members
-
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
+(other: String): String
-
def
->[B](y: B): (Interleave[T], B)
-
final
def
==(arg0: Any): Boolean
-
-
final
def
asInstanceOf[T0]: T0
-
-
def
clone(): AnyRef
-
-
final
def
createLogicAndMaterializedValue(inheritedAttributes: Attributes): (GraphStageLogic, NotUsed)
-
val
eagerClose: Boolean
-
-
-
-
-
-
-
def
formatted(fmtstr: String): String
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
-
def
initialAttributes: Attributes
-
val
inputPorts: Int
-
final
def
isInstanceOf[T0]: Boolean
-
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
-
val
segmentSize: Int
-
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
-
def
→[B](y: B): (Interleave[T], B)
Deprecated Value Members
-
def
finalize(): Unit
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