Gecko [ fernandoquevedodop.com ]

Name	Size	Permission
LazyBucketSortedSet.js	5.58 KB	-rw-r--r--
Queue.js	940 B	-rw-r--r--
Semaphore.js	1007 B	-rw-r--r--
SetHelpers.js	1.34 KB	-rw-r--r--
SortableSet.js	3.16 KB	-rw-r--r--
StackedSetMap.js	2.79 KB	-rw-r--r--
TrackingSet.js	537 B	-rw-r--r--
cachedMerge.js	1.07 KB	-rw-r--r--
cleverMerge.js	2.12 KB	-rw-r--r--
createHash.js	3.31 KB	-rw-r--r--
deterministicGrouping.js	7 KB	-rw-r--r--
identifier.js	3.45 KB	-rw-r--r--
objectToMap.js	405 B	-rw-r--r--

Code Editor : SetHelpers.js

"use strict";

/**
 * intersect creates Set containing the intersection of elements between all sets
 * @param {Set[]} sets an array of sets being checked for shared elements
 * @returns {Set<TODO>} returns a new Set containing the intersecting items
 */
const intersect = sets => {
	if (sets.length === 0) return new Set();
	if (sets.length === 1) return new Set(sets[0]);
	let minSize = Infinity;
	let minIndex = -1;
	for (let i = 0; i < sets.length; i++) {
		const size = sets[i].size;
		if (size < minSize) {
			minIndex = i;
			minSize = size;
		}
	}
	const current = new Set(sets[minIndex]);
	for (let i = 0; i < sets.length; i++) {
		if (i === minIndex) continue;
		const set = sets[i];
		for (const item of current) {
			if (!set.has(item)) {
				current.delete(item);
			}
		}
	}
	return current;
};

/**
 * Checks if a set is the subset of another set
 * @param {Set<TODO>} bigSet a Set which contains the original elements to compare against
 * @param {Set<TODO>} smallSet the set whos elements might be contained inside of bigSet
 * @returns {boolean} returns true if smallSet contains all elements inside of the bigSet
 */
const isSubset = (bigSet, smallSet) => {
	if (bigSet.size < smallSet.size) return false;
	for (const item of smallSet) {
		if (!bigSet.has(item)) return false;
	}
	return true;
};

exports.intersect = intersect;
exports.isSubset = isSubset;

${this.title}

Code Editor : SetHelpers.js