2018-01-20 00:06:59 +08:00
|
|
|
"use strict";
|
|
|
|
|
|
|
|
exports.intersect = sets => {
|
2018-02-25 09:00:20 +08:00
|
|
|
if (sets.length === 0) return new Set();
|
|
|
|
if (sets.length === 1) return new Set(sets[0]);
|
2018-01-20 00:06:59 +08:00
|
|
|
let minSize = Infinity;
|
|
|
|
let minIndex = -1;
|
2018-02-25 09:00:20 +08:00
|
|
|
for (let i = 0; i < sets.length; i++) {
|
2018-01-20 00:06:59 +08:00
|
|
|
const size = sets[i].size;
|
2018-02-25 09:00:20 +08:00
|
|
|
if (size < minSize) {
|
2018-01-20 00:06:59 +08:00
|
|
|
minIndex = i;
|
|
|
|
minSize = size;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
const current = new Set(sets[minIndex]);
|
2018-02-25 09:00:20 +08:00
|
|
|
for (let i = 0; i < sets.length; i++) {
|
|
|
|
if (i === minIndex) continue;
|
2018-01-20 00:06:59 +08:00
|
|
|
const set = sets[i];
|
2018-02-25 09:00:20 +08:00
|
|
|
for (const item of current) {
|
|
|
|
if (!set.has(item)) {
|
2018-01-20 00:06:59 +08:00
|
|
|
current.delete(item);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return current;
|
|
|
|
};
|
2018-02-17 16:48:40 +08:00
|
|
|
|
|
|
|
exports.isSubset = (bigSet, smallSet) => {
|
2018-02-25 09:00:20 +08:00
|
|
|
if (bigSet.size < smallSet.size) return false;
|
|
|
|
for (const item of smallSet) {
|
|
|
|
if (!bigSet.has(item)) return false;
|
2018-02-17 16:48:40 +08:00
|
|
|
}
|
|
|
|
return true;
|
|
|
|
};
|