118 lines
3.4 KiB
JavaScript
118 lines
3.4 KiB
JavaScript
'use strict';
|
|
|
|
Object.defineProperty(exports, "__esModule", {
|
|
value: true
|
|
});
|
|
exports.merge = merge;
|
|
exports.mergeArray = mergeArray;
|
|
|
|
var _Stream = require('../Stream');
|
|
|
|
var _Stream2 = _interopRequireDefault(_Stream);
|
|
|
|
var _Pipe = require('../sink/Pipe');
|
|
|
|
var _Pipe2 = _interopRequireDefault(_Pipe);
|
|
|
|
var _IndexSink = require('../sink/IndexSink');
|
|
|
|
var _IndexSink2 = _interopRequireDefault(_IndexSink);
|
|
|
|
var _core = require('../source/core');
|
|
|
|
var _dispose = require('../disposable/dispose');
|
|
|
|
var dispose = _interopRequireWildcard(_dispose);
|
|
|
|
var _prelude = require('@most/prelude');
|
|
|
|
var base = _interopRequireWildcard(_prelude);
|
|
|
|
function _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) { newObj[key] = obj[key]; } } } newObj.default = obj; return newObj; } }
|
|
|
|
function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
|
|
|
|
/** @license MIT License (c) copyright 2010-2016 original author or authors */
|
|
/** @author Brian Cavalier */
|
|
/** @author John Hann */
|
|
|
|
var copy = base.copy;
|
|
var reduce = base.reduce;
|
|
|
|
/**
|
|
* @returns {Stream} stream containing events from all streams in the argument
|
|
* list in time order. If two events are simultaneous they will be merged in
|
|
* arbitrary order.
|
|
*/
|
|
function merge() /* ...streams */{
|
|
return mergeArray(copy(arguments));
|
|
}
|
|
|
|
/**
|
|
* @param {Array} streams array of stream to merge
|
|
* @returns {Stream} stream containing events from all input observables
|
|
* in time order. If two events are simultaneous they will be merged in
|
|
* arbitrary order.
|
|
*/
|
|
function mergeArray(streams) {
|
|
var l = streams.length;
|
|
return l === 0 ? (0, _core.empty)() : l === 1 ? streams[0] : new _Stream2.default(mergeSources(streams));
|
|
}
|
|
|
|
/**
|
|
* This implements fusion/flattening for merge. It will
|
|
* fuse adjacent merge operations. For example:
|
|
* - a.merge(b).merge(c) effectively becomes merge(a, b, c)
|
|
* - merge(a, merge(b, c)) effectively becomes merge(a, b, c)
|
|
* It does this by concatenating the sources arrays of
|
|
* any nested Merge sources, in effect "flattening" nested
|
|
* merge operations into a single merge.
|
|
*/
|
|
function mergeSources(streams) {
|
|
return new Merge(reduce(appendSources, [], streams));
|
|
}
|
|
|
|
function appendSources(sources, stream) {
|
|
var source = stream.source;
|
|
return source instanceof Merge ? sources.concat(source.sources) : sources.concat(source);
|
|
}
|
|
|
|
function Merge(sources) {
|
|
this.sources = sources;
|
|
}
|
|
|
|
Merge.prototype.run = function (sink, scheduler) {
|
|
var this$1 = this;
|
|
|
|
var l = this.sources.length;
|
|
var disposables = new Array(l);
|
|
var sinks = new Array(l);
|
|
|
|
var mergeSink = new MergeSink(disposables, sinks, sink);
|
|
|
|
for (var indexSink, i = 0; i < l; ++i) {
|
|
indexSink = sinks[i] = new _IndexSink2.default(i, mergeSink);
|
|
disposables[i] = this$1.sources[i].run(indexSink, scheduler);
|
|
}
|
|
|
|
return dispose.all(disposables);
|
|
};
|
|
|
|
function MergeSink(disposables, sinks, sink) {
|
|
this.sink = sink;
|
|
this.disposables = disposables;
|
|
this.activeCount = sinks.length;
|
|
}
|
|
|
|
MergeSink.prototype.error = _Pipe2.default.prototype.error;
|
|
|
|
MergeSink.prototype.event = function (t, indexValue) {
|
|
this.sink.event(t, indexValue.value);
|
|
};
|
|
|
|
MergeSink.prototype.end = function (t, indexedValue) {
|
|
dispose.tryDispose(t, this.disposables[indexedValue.index], this.sink);
|
|
if (--this.activeCount === 0) {
|
|
this.sink.end(t, indexedValue.value);
|
|
}
|
|
}; |