mirror of
https://github.com/hanzoai/core-js.git
synced 2026-09-24 16:58:15 +00:00
78 lines
3.0 KiB
JavaScript
78 lines
3.0 KiB
JavaScript
import { createIterable, createIterator, createSetLike } from '../helpers/helpers.js';
|
|
|
|
QUnit.test('Set#intersection', assert => {
|
|
const { intersection } = Set.prototype;
|
|
const { from } = Array;
|
|
|
|
assert.isFunction(intersection);
|
|
assert.arity(intersection, 1);
|
|
assert.name(intersection, 'intersection');
|
|
assert.looksNative(intersection);
|
|
assert.nonEnumerable(Set.prototype, 'intersection');
|
|
|
|
const set = new Set([1]);
|
|
assert.notSame(set.intersection(new Set()), set);
|
|
|
|
assert.deepEqual(from(new Set([1, 2, 3]).intersection(new Set([4, 5]))), []);
|
|
assert.deepEqual(from(new Set([1, 2, 3]).intersection(new Set([2, 3, 4]))), [2, 3]);
|
|
assert.deepEqual(from(new Set([1, 2, 3]).intersection(createSetLike([4, 5]))), []);
|
|
assert.deepEqual(from(new Set([1, 2, 3]).intersection(createSetLike([2, 3, 4]))), [2, 3]);
|
|
|
|
assert.deepEqual(from(new Set([1, 2, 3]).intersection(new Set([3, 2]))), [3, 2]);
|
|
assert.deepEqual(from(new Set([1, 2, 3]).intersection(new Set([3, 2, 1]))), [1, 2, 3]);
|
|
assert.deepEqual(from(new Set([1, 2, 3]).intersection(new Set([3, 2, 1, 0]))), [1, 2, 3]);
|
|
assert.deepEqual(from(new Set([1, 2, 3]).intersection(createSetLike([3, 2]))), [3, 2]);
|
|
assert.deepEqual(from(new Set([1, 2, 3]).intersection(createSetLike([3, 2, 1]))), [1, 2, 3]);
|
|
assert.deepEqual(from(new Set([1, 2, 3]).intersection(createSetLike([3, 2, 1, 0]))), [1, 2, 3]);
|
|
|
|
// TODO: drop from core-js@4
|
|
assert.deepEqual(from(new Set([1, 2, 3]).intersection([4, 5])), []);
|
|
assert.deepEqual(from(new Set([1, 2, 3]).intersection([2, 3, 4])), [2, 3]);
|
|
assert.deepEqual(from(new Set([1, 2, 3]).intersection(createIterable([2, 3, 4]))), [2, 3]);
|
|
|
|
assert.deepEqual(from(new Set([42, 43]).intersection({
|
|
size: Infinity,
|
|
has() {
|
|
return true;
|
|
},
|
|
keys() {
|
|
throw new Error('Unexpected call to |keys| method');
|
|
},
|
|
})), [42, 43]);
|
|
|
|
assert.throws(() => new Set().intersection({
|
|
size: -Infinity,
|
|
has() {
|
|
return true;
|
|
},
|
|
keys() {
|
|
throw new Error('Unexpected call to |keys| method');
|
|
},
|
|
}));
|
|
|
|
const s1 = new Set([1, 2, 3]);
|
|
assert.deepEqual(from(s1.intersection({
|
|
size: 10,
|
|
has(v) { s1.delete(v + 1); return true; },
|
|
keys() { throw new Error('Unexpected call to |keys| method'); },
|
|
})), [1, 3], 'Set.prototype.intersection re-checks SetDataHas after has()');
|
|
|
|
assert.throws(() => new Set([1, 2, 3]).intersection(), TypeError);
|
|
|
|
assert.throws(() => new Set([1, 2, 3]).intersection({
|
|
size: NaN,
|
|
has() { return true; },
|
|
keys() { return createIterator([]); },
|
|
}), TypeError, 'NaN size throws TypeError');
|
|
|
|
assert.throws(() => new Set([1, 2, 3]).intersection({
|
|
size: 4,
|
|
has() { throw new TypeError('has error'); },
|
|
keys() { return createIterator([]); },
|
|
}), TypeError, 'has() error propagates');
|
|
|
|
assert.throws(() => intersection.call({}, [1, 2, 3]), TypeError);
|
|
assert.throws(() => intersection.call(undefined, [1, 2, 3]), TypeError);
|
|
assert.throws(() => intersection.call(null, [1, 2, 3]), TypeError);
|
|
});
|