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 (eagerComplete=false) or one upstream completes (eagerComplete=true)

Cancels when downstream cancels

public sealed class Interleave<TIn, TOut> : GraphStage<UniformFanInShape<TIn, TOut>>
where TIn : TOut

[<SealedAttribute>]
type Interleave<'TIn, 'TOut when 'TIn : 'TOut> =  
    class
        inherit GraphStage<UniformFanInShape<'TIn, 'TOut>>
    end