Gecko [ unitednationsplay.com ]

Name	Size	Permission	Date
hash	[ DIR ]	drwxrwxr-x	2022-08-30 11:49
ArrayHelpers.js	1.45 KB	-rw-rw-r--	2022-08-30 11:49
ArrayQueue.js	2.15 KB	-rw-rw-r--	2022-08-30 11:49
AsyncQueue.js	9.41 KB	-rw-rw-r--	2022-08-30 11:49
Hash.js	925 B	-rw-rw-r--	2022-08-30 11:49
IterableHelpers.js	962 B	-rw-rw-r--	2022-08-30 11:49
LazyBucketSortedSet.js	5.6 KB	-rw-rw-r--	2022-08-30 11:49
LazySet.js	4.46 KB	-rw-rw-r--	2022-08-30 11:49
MapHelpers.js	472 B	-rw-rw-r--	2022-08-30 11:49
ParallelismFactorCalculator.js	1.49 KB	-rw-rw-r--	2022-08-30 11:49
Queue.js	1.02 KB	-rw-rw-r--	2022-08-30 11:49
Semaphore.js	1008 B	-rw-rw-r--	2022-08-30 11:49
SetHelpers.js	2.26 KB	-rw-rw-r--	2022-08-30 11:49
SortableSet.js	3.55 KB	-rw-rw-r--	2022-08-30 11:49
StackedCacheMap.js	2.23 KB	-rw-rw-r--	2022-08-30 11:49
StackedMap.js	3.37 KB	-rw-rw-r--	2022-08-30 11:49
StringXor.js	1.09 KB	-rw-rw-r--	2022-08-30 11:49
TupleQueue.js	1.29 KB	-rw-rw-r--	2022-08-30 11:49
TupleSet.js	2.84 KB	-rw-rw-r--	2022-08-30 11:49
URLAbsoluteSpecifier.js	2.49 KB	-rw-rw-r--	2022-08-30 11:49
WeakTupleMap.js	3.36 KB	-rw-rw-r--	2022-08-30 11:49
binarySearchBounds.js	1.86 KB	-rw-rw-r--	2022-08-30 11:49
cleverMerge.js	16.15 KB	-rw-rw-r--	2022-08-30 11:49
comparators.js	12.15 KB	-rw-rw-r--	2022-08-30 11:49
compileBooleanMatcher.js	5.68 KB	-rw-rw-r--	2022-08-30 11:49
create-schema-validation.js	711 B	-rw-rw-r--	2022-08-30 11:49
createHash.js	4.71 KB	-rw-rw-r--	2022-08-30 11:49
deprecation.js	6.3 KB	-rw-rw-r--	2022-08-30 11:49
deterministicGrouping.js	13.44 KB	-rw-rw-r--	2022-08-30 11:49
extractUrlAndGlobal.js	531 B	-rw-rw-r--	2022-08-30 11:49
findGraphRoots.js	5.97 KB	-rw-rw-r--	2022-08-30 11:49
fs.js	11.15 KB	-rw-rw-r--	2022-08-30 11:49
identifier.js	10.79 KB	-rw-rw-r--	2022-08-30 11:49
internalSerializables.js	10.4 KB	-rw-rw-r--	2022-08-30 11:49
makeSerializable.js	640 B	-rw-rw-r--	2022-08-30 11:49
memoize.js	604 B	-rw-rw-r--	2022-08-30 11:49
nonNumericOnlyHash.js	556 B	-rw-rw-r--	2022-08-30 11:49
numberHash.js	1.04 KB	-rw-rw-r--	2022-08-30 11:49
objectToMap.js	346 B	-rw-rw-r--	2022-08-30 11:49
processAsyncTree.js	1.45 KB	-rw-rw-r--	2022-08-30 11:49
propertyAccess.js	1.16 KB	-rw-rw-r--	2022-08-30 11:49
registerExternalSerializer.js	7.73 KB	-rw-rw-r--	2022-08-30 11:49
runtime.js	14.26 KB	-rw-rw-r--	2022-08-30 11:49
semver.js	15.36 KB	-rw-rw-r--	2022-08-30 11:49
serialization.js	3.92 KB	-rw-rw-r--	2022-08-30 11:49
smartGrouping.js	5.15 KB	-rw-rw-r--	2022-08-30 11:49
source.js	1.72 KB	-rw-rw-r--	2022-08-30 11:49

Rename

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

"use strict";

const makeSerializable = require("./makeSerializable.js");

/**
 * @template T
 * @param {Set<T>} targetSet set where items should be added
 * @param {Set<Iterable<T>>} toMerge iterables to be merged
 * @returns {void}
 */
const merge = (targetSet, toMerge) => {
	for (const set of toMerge) {
		for (const item of set) {
			targetSet.add(item);
		}
	}
};

/**
 * @template T
 * @param {Set<Iterable<T>>} targetSet set where iterables should be added
 * @param {Array<LazySet<T>>} toDeepMerge lazy sets to be flattened
 * @returns {void}
 */
const flatten = (targetSet, toDeepMerge) => {
	for (const set of toDeepMerge) {
		if (set._set.size > 0) targetSet.add(set._set);
		if (set._needMerge) {
			for (const mergedSet of set._toMerge) {
				targetSet.add(mergedSet);
			}
			flatten(targetSet, set._toDeepMerge);
		}
	}
};

/**
 * Like Set but with an addAll method to eventually add items from another iterable.
 * Access methods make sure that all delayed operations are executed.
 * Iteration methods deopts to normal Set performance until clear is called again (because of the chance of modifications during iteration).
 * @template T
 */
class LazySet {
	/**
	 * @param {Iterable<T>=} iterable init iterable
	 */
	constructor(iterable) {
		/** @type {Set<T>} */
		this._set = new Set(iterable);
		/** @type {Set<Iterable<T>>} */
		this._toMerge = new Set();
		/** @type {Array<LazySet<T>>} */
		this._toDeepMerge = [];
		this._needMerge = false;
		this._deopt = false;
	}

_flatten() {
		flatten(this._toMerge, this._toDeepMerge);
		this._toDeepMerge.length = 0;
	}

_merge() {
		this._flatten();
		merge(this._set, this._toMerge);
		this._toMerge.clear();
		this._needMerge = false;
	}

_isEmpty() {
		return (
			this._set.size === 0 &&
			this._toMerge.size === 0 &&
			this._toDeepMerge.length === 0
		);
	}

get size() {
		if (this._needMerge) this._merge();
		return this._set.size;
	}

/**
	 * @param {T} item an item
	 * @returns {this} itself
	 */
	add(item) {
		this._set.add(item);
		return this;
	}

/**
	 * @param {Iterable<T> | LazySet<T>} iterable a immutable iterable or another immutable LazySet which will eventually be merged into the Set
	 * @returns {this} itself
	 */
	addAll(iterable) {
		if (this._deopt) {
			const _set = this._set;
			for (const item of iterable) {
				_set.add(item);
			}
		} else {
			if (iterable instanceof LazySet) {
				if (iterable._isEmpty()) return this;
				this._toDeepMerge.push(iterable);
				this._needMerge = true;
				if (this._toDeepMerge.length > 100000) {
					this._flatten();
				}
			} else {
				this._toMerge.add(iterable);
				this._needMerge = true;
			}
			if (this._toMerge.size > 100000) this._merge();
		}
		return this;
	}

clear() {
		this._set.clear();
		this._toMerge.clear();
		this._toDeepMerge.length = 0;
		this._needMerge = false;
		this._deopt = false;
	}

/**
	 * @param {T} value an item
	 * @returns {boolean} true, if the value was in the Set before
	 */
	delete(value) {
		if (this._needMerge) this._merge();
		return this._set.delete(value);
	}

entries() {
		this._deopt = true;
		if (this._needMerge) this._merge();
		return this._set.entries();
	}

/**
	 * @param {function(T, T, Set<T>): void} callbackFn function called for each entry
	 * @param {any} thisArg this argument for the callbackFn
	 * @returns {void}
	 */
	forEach(callbackFn, thisArg) {
		this._deopt = true;
		if (this._needMerge) this._merge();
		this._set.forEach(callbackFn, thisArg);
	}

/**
	 * @param {T} item an item
	 * @returns {boolean} true, when the item is in the Set
	 */
	has(item) {
		if (this._needMerge) this._merge();
		return this._set.has(item);
	}

keys() {
		this._deopt = true;
		if (this._needMerge) this._merge();
		return this._set.keys();
	}

values() {
		this._deopt = true;
		if (this._needMerge) this._merge();
		return this._set.values();
	}

[Symbol.iterator]() {
		this._deopt = true;
		if (this._needMerge) this._merge();
		return this._set[Symbol.iterator]();
	}

/* istanbul ignore next */
	get [Symbol.toStringTag]() {
		return "LazySet";
	}

serialize({ write }) {
		if (this._needMerge) this._merge();
		write(this._set.size);
		for (const item of this._set) write(item);
	}

static deserialize({ read }) {
		const count = read();
		const items = [];
		for (let i = 0; i < count; i++) {
			items.push(read());
		}
		return new LazySet(items);
	}
}

makeSerializable(LazySet, "webpack/lib/util/LazySet");

module.exports = LazySet;