Merge the given SourceTOut, TMat to this FlowTIn, TOut, TMat, taking elements as they arrive from input streams, picking always the smallest of the available elements(waiting for one element from each side to be available). This means that possible contiguity of the input streams is not exploited to avoid waiting for elements, this merge will block when one of the inputs does not have more elements(and does not complete).

Emits when one of the inputs has an element available

Backpressures when downstream backpressures

Completes when all upstreams complete

Cancels when downstream cancels

public static Flow<TIn, TOut, TMat> MergeSorted<TIn, TOut, TMat>(
	this Flow<TIn, TOut, TMat> flow,
	IGraph<SourceShape<TOut>, TMat> other,
	Func<TOut, TOut, int> orderFunc
)

[<ExtensionAttribute>]
static member MergeSorted : 
        flow : Flow<'TIn, 'TOut, 'TMat> * 
        other : IGraph<SourceShape<'TOut>, 'TMat> * 
        orderFunc : Func<'TOut, 'TOut, int> -> Flow<'TIn, 'TOut, 'TMat>