Gecko [ gandhischool.edu.np ]

Name	Size	Permission
hash	[ DIR ]	dr-xr-xr-x
ArrayHelpers.js	1.5 KB	-rw-rw-rw-
ArrayQueue.js	1.93 KB	-rw-rw-rw-
AsyncQueue.js	10.27 KB	-rw-rw-rw-
Hash.js	925 B	-rw-rw-rw-
IterableHelpers.js	958 B	-rw-rw-rw-
LazyBucketSortedSet.js	5.88 KB	-rw-rw-rw-
LazySet.js	5.01 KB	-rw-rw-rw-
MapHelpers.js	1.06 KB	-rw-rw-rw-
ParallelismFactorCalculator.js	1.73 KB	-rw-rw-rw-
Queue.js	1.04 KB	-rw-rw-rw-
Semaphore.js	1 KB	-rw-rw-rw-
SetHelpers.js	2.31 KB	-rw-rw-rw-
SortableSet.js	3.63 KB	-rw-rw-rw-
StackedCacheMap.js	3.31 KB	-rw-rw-rw-
StackedMap.js	3.34 KB	-rw-rw-rw-
StringXor.js	2.97 KB	-rw-rw-rw-
TupleQueue.js	1.3 KB	-rw-rw-rw-
TupleSet.js	3.05 KB	-rw-rw-rw-
URLAbsoluteSpecifier.js	2.48 KB	-rw-rw-rw-
WeakTupleMap.js	3.99 KB	-rw-rw-rw-
binarySearchBounds.js	4.12 KB	-rw-rw-rw-
chainedImports.js	4.18 KB	-rw-rw-rw-
cleverMerge.js	17.6 KB	-rw-rw-rw-
comparators.js	13.6 KB	-rw-rw-rw-
compileBooleanMatcher.js	6.45 KB	-rw-rw-rw-
concatenate.js	6.65 KB	-rw-rw-rw-
conventions.js	2.89 KB	-rw-rw-rw-
create-schema-validation.js	1.16 KB	-rw-rw-rw-
createHash.js	5.46 KB	-rw-rw-rw-
deprecation.js	8.13 KB	-rw-rw-rw-
deterministicGrouping.js	14.56 KB	-rw-rw-rw-
extractUrlAndGlobal.js	531 B	-rw-rw-rw-
findGraphRoots.js	6.02 KB	-rw-rw-rw-
fs.js	22.84 KB	-rw-rw-rw-
identifier.js	11.75 KB	-rw-rw-rw-
internalSerializables.js	10.87 KB	-rw-rw-rw-
magicComment.js	567 B	-rw-rw-rw-
makeSerializable.js	1.79 KB	-rw-rw-rw-
memoize.js	678 B	-rw-rw-rw-
nonNumericOnlyHash.js	562 B	-rw-rw-rw-
numberHash.js	2.86 KB	-rw-rw-rw-
objectToMap.js	343 B	-rw-rw-rw-
processAsyncTree.js	1.55 KB	-rw-rw-rw-
propertyAccess.js	727 B	-rw-rw-rw-
propertyName.js	1.31 KB	-rw-rw-rw-
registerExternalSerializer.js	7.72 KB	-rw-rw-rw-
runtime.js	15.79 KB	-rw-rw-rw-
semver.js	17.46 KB	-rw-rw-rw-
serialization.js	4.6 KB	-rw-rw-rw-
smartGrouping.js	5.14 KB	-rw-rw-rw-
source.js	1.72 KB	-rw-rw-rw-

Name

Size

Permission

Action

hash

[ DIR ]

dr-xr-xr-x

ArrayHelpers.js

1.5 KB

-rw-rw-rw-

ArrayQueue.js

1.93 KB

-rw-rw-rw-

AsyncQueue.js

10.27 KB

-rw-rw-rw-

Hash.js

925 B

-rw-rw-rw-

IterableHelpers.js

958 B

-rw-rw-rw-

LazyBucketSortedSet.js

5.88 KB

-rw-rw-rw-

LazySet.js

5.01 KB

-rw-rw-rw-

MapHelpers.js

1.06 KB

-rw-rw-rw-

ParallelismFactorCalculator.js

1.73 KB

-rw-rw-rw-

Queue.js

1.04 KB

-rw-rw-rw-

Semaphore.js

1 KB

-rw-rw-rw-

SetHelpers.js

2.31 KB

-rw-rw-rw-

SortableSet.js

3.63 KB

-rw-rw-rw-

StackedCacheMap.js

3.31 KB

-rw-rw-rw-

StackedMap.js

3.34 KB

-rw-rw-rw-

StringXor.js

2.97 KB

-rw-rw-rw-

TupleQueue.js

1.3 KB

-rw-rw-rw-

TupleSet.js

3.05 KB

-rw-rw-rw-

URLAbsoluteSpecifier.js

2.48 KB

-rw-rw-rw-

WeakTupleMap.js

3.99 KB

-rw-rw-rw-

binarySearchBounds.js

4.12 KB

-rw-rw-rw-

chainedImports.js

4.18 KB

-rw-rw-rw-

cleverMerge.js

17.6 KB

-rw-rw-rw-

comparators.js

13.6 KB

-rw-rw-rw-

compileBooleanMatcher.js

6.45 KB

-rw-rw-rw-

concatenate.js

6.65 KB

-rw-rw-rw-

conventions.js

2.89 KB

-rw-rw-rw-

create-schema-validation.js

1.16 KB

-rw-rw-rw-

createHash.js

5.46 KB

-rw-rw-rw-

deprecation.js

8.13 KB

-rw-rw-rw-

deterministicGrouping.js

14.56 KB

-rw-rw-rw-

extractUrlAndGlobal.js

531 B

-rw-rw-rw-

findGraphRoots.js

6.02 KB

-rw-rw-rw-

fs.js

22.84 KB

-rw-rw-rw-

identifier.js

11.75 KB

-rw-rw-rw-

internalSerializables.js

10.87 KB

-rw-rw-rw-

magicComment.js

567 B

-rw-rw-rw-

makeSerializable.js

1.79 KB

-rw-rw-rw-

memoize.js

678 B

-rw-rw-rw-

nonNumericOnlyHash.js

562 B

-rw-rw-rw-

numberHash.js

2.86 KB

-rw-rw-rw-

objectToMap.js

343 B

-rw-rw-rw-

processAsyncTree.js

1.55 KB

-rw-rw-rw-

propertyAccess.js

727 B

-rw-rw-rw-

propertyName.js

1.31 KB

-rw-rw-rw-

registerExternalSerializer.js

7.72 KB

-rw-rw-rw-

runtime.js

15.79 KB

-rw-rw-rw-

semver.js

17.46 KB

-rw-rw-rw-

serialization.js

4.6 KB

-rw-rw-rw-

smartGrouping.js

5.14 KB

-rw-rw-rw-

source.js

1.72 KB

-rw-rw-rw-

Code Editor : SetHelpers.js

/*
	MIT License http://www.opensource.org/licenses/mit-license.php
	Author Tobias Koppers @sokra
*/

"use strict";

/**
 * intersect creates Set containing the intersection of elements between all sets
 * @template T
 * @param {Set<T>[]} sets an array of sets being checked for shared elements
 * @returns {Set<T>} 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
 * @template T
 * @param {Set<T>} bigSet a Set which contains the original elements to compare against
 * @param {Set<T>} smallSet the set whose 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;
};

/**
 * @template T
 * @param {Set<T>} set a set
 * @param {function(T): boolean} fn selector function
 * @returns {T | undefined} found item
 */
const find = (set, fn) => {
	for (const item of set) {
		if (fn(item)) return item;
	}
};

/**
 * @template T
 * @param {Set<T> | ReadonlySet<T>} set a set
 * @returns {T | undefined} first item
 */
const first = set => {
	const entry = set.values().next();
	return entry.done ? undefined : entry.value;
};

/**
 * @template T
 * @param {Set<T>} a first
 * @param {Set<T>} b second
 * @returns {Set<T>} combined set, may be identical to a or b
 */
const combine = (a, b) => {
	if (b.size === 0) return a;
	if (a.size === 0) return b;
	const set = new Set(a);
	for (const item of b) set.add(item);
	return set;
};

module.exports.intersect = intersect;
module.exports.isSubset = isSubset;
module.exports.find = find;
module.exports.first = first;
module.exports.combine = combine;

${this.title}

Code Editor : SetHelpers.js