基于一个中的对象是否不在另一个中来合并和操作查询集

const set1 = new Set([1, 2, 3]);
const set2 = new Set([3, 4, 5]);
const unionSet = new Set([...set1, ...set2]);
console.log(unionSet); // 输出：Set { 1, 2, 3, 4, 5 }

const set1 = new Set([1, 2, 3]);
const set2 = new Set([3, 4, 5]);
const intersectionSet = new Set([...set1].filter(x => set2.has(x)));
console.log(intersectionSet); // 输出：Set { 3 }

const set1 = new Set([1, 2, 3]);
const set2 = new Set([3, 4, 5]);
const differenceSet = new Set([...set1].filter(x => !set2.has(x)));
console.log(differenceSet); // 输出：Set { 1, 2 }

const set1 = new Set([1, 2, 3]);
const set2 = new Set([3, 4, 5]);
const symmetricDifferenceSet = new Set([...set1].filter(x => !set2.has(x)).concat([...set2].filter(x => !set1.has(x))));
console.log(symmetricDifferenceSet); // 输出：Set { 1, 2, 4, 5 }