@reactivex/ix-es5-esm
Version:
The Interactive Extensions for JavaScript
101 lines (99 loc) • 4.1 kB
JavaScript
import { __extends, __generator, __values } from "tslib";
import { IterableX } from '../iterablex.js';
import { arrayIndexOf } from '../../util/arrayindexof.js';
import { comparer as defaultComparer } from '../../util/comparer.js';
/** @ignore */
var UnionIterable = /** @class */ (function (_super) {
__extends(UnionIterable, _super);
function UnionIterable(left, right, comparer) {
var _this = _super.call(this) || this;
_this._left = left;
_this._right = right;
_this._comparer = comparer;
return _this;
}
UnionIterable.prototype[Symbol.iterator] = function () {
var map, _a, _b, lItem, e_1_1, _c, _d, rItem, e_2_1;
var e_1, _e, e_2, _f;
return __generator(this, function (_g) {
switch (_g.label) {
case 0:
map = [];
_g.label = 1;
case 1:
_g.trys.push([1, 6, 7, 8]);
_a = __values(this._left), _b = _a.next();
_g.label = 2;
case 2:
if (!!_b.done) return [3 /*break*/, 5];
lItem = _b.value;
if (!(arrayIndexOf(map, lItem, this._comparer) === -1)) return [3 /*break*/, 4];
map.push(lItem);
return [4 /*yield*/, lItem];
case 3:
_g.sent();
_g.label = 4;
case 4:
_b = _a.next();
return [3 /*break*/, 2];
case 5: return [3 /*break*/, 8];
case 6:
e_1_1 = _g.sent();
e_1 = { error: e_1_1 };
return [3 /*break*/, 8];
case 7:
try {
if (_b && !_b.done && (_e = _a.return)) _e.call(_a);
}
finally { if (e_1) throw e_1.error; }
return [7 /*endfinally*/];
case 8:
_g.trys.push([8, 13, 14, 15]);
_c = __values(this._right), _d = _c.next();
_g.label = 9;
case 9:
if (!!_d.done) return [3 /*break*/, 12];
rItem = _d.value;
if (!(arrayIndexOf(map, rItem, this._comparer) === -1)) return [3 /*break*/, 11];
map.push(rItem);
return [4 /*yield*/, rItem];
case 10:
_g.sent();
_g.label = 11;
case 11:
_d = _c.next();
return [3 /*break*/, 9];
case 12: return [3 /*break*/, 15];
case 13:
e_2_1 = _g.sent();
e_2 = { error: e_2_1 };
return [3 /*break*/, 15];
case 14:
try {
if (_d && !_d.done && (_f = _c.return)) _f.call(_c);
}
finally { if (e_2) throw e_2.error; }
return [7 /*endfinally*/];
case 15: return [2 /*return*/];
}
});
};
return UnionIterable;
}(IterableX));
export { UnionIterable };
/**
* Produces the set union of two sequences by using the given equality comparer.
*
* @template TSource The type of the elements of the input sequences.
* @param {AsyncIterable<TSource>} right An iterable sequence whose distinct elements form the second set for the union.
* @param {((x: TSource, y: TSource) => boolean)} [comparer=defaultComparer] The equality comparer to compare values.
* @returns {MonoTypeOperatorFunction<TSource>} An iterable sequence that contains the elements from both input sequences,
* excluding duplicates.
*/
export function union(right, comparer) {
if (comparer === void 0) { comparer = defaultComparer; }
return function unionOperatorFunction(left) {
return new UnionIterable(left, right, comparer);
};
}
//# sourceMappingURL=union.js.map