day18.js

//ser operations
// perform union operation
// contain elements of both sets
function union(a, b) {
  let unionSet = new Set(a);
  for (let i of b) {
    unionSet.add(i);
  }
  return unionSet;
}

// two sets of fruits
const setA = new Set(["apple", "mango", "orange"]);
const setB = new Set(["grapes", "apple", "banana"]);

const result = union(setA, setB);

console.log(result);

// perform intersection operation
// elements of set a that are also in set b
function intersection(setA, setB) {
  let intersectionSet = new Set();

  for (let i of setB) {
    if (setA.has(i)) {
      intersectionSet.add(i);
    }
  }
  return intersectionSet;
}

// two sets of fruits
const setA = new Set(["apple", "mango", "orange"]);
const setB = new Set(["grapes", "apple", "banana"]);

const result = intersection(setA, setB);

console.log(result);

// perform difference operation
// elements of set a that are not in set b
function difference(setA, setB) {
  let differenceSet = new Set(setA);
  for (let i of setB) {
    differenceSet.delete(i);
  }
  return differenceSet;
}

// two sets of fruits
const setA = new Set(["apple", "mango", "orange"]);
const setB = new Set(["grapes", "apple", "banana"]);

const result = difference(setA, setB);

console.log(result);

// perform subset operation
// true if all elements of set b is in set a
function subset(setA, setB) {
  for (let i of setB) {
    if (!setA.has(i)) {
      return false;
    }
  }
  return true;
}

// two sets of fruits
const setA = new Set(["apple", "mango", "orange"]);
const setB = new Set(["apple", "orange"]);

const result = subset(setA, setB);

console.log(result);