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 NONE = Symbol("not sorted");

/**
 * A subset of Set that offers sorting functionality
 * @template T item type in set
 * @extends {Set<T>}
 */
class SortableSet extends Set {
	/**
	 * Create a new sortable set
	 * @param {Iterable<T>=} initialIterable The initial iterable value
	 * @typedef {function(T, T): number} SortFunction
	 * @param {SortFunction=} defaultSort Default sorting function
	 */
	constructor(initialIterable, defaultSort) {
		super(initialIterable);
		/** @private @type {undefined | function(T, T): number}} */
		this._sortFn = defaultSort;
		/** @private @type {typeof NONE | undefined | function(T, T): number}} */
		this._lastActiveSortFn = NONE;
		/** @private @type {Map<Function, any> | undefined} */
		this._cache = undefined;
		/** @private @type {Map<Function, any> | undefined} */
		this._cacheOrderIndependent = undefined;
	}

/**
	 * @param {T} value value to add to set
	 * @returns {this} returns itself
	 */
	add(value) {
		this._lastActiveSortFn = NONE;
		this._invalidateCache();
		this._invalidateOrderedCache();
		super.add(value);
		return this;
	}

/**
	 * @param {T} value value to delete
	 * @returns {boolean} true if value existed in set, false otherwise
	 */
	delete(value) {
		this._invalidateCache();
		this._invalidateOrderedCache();
		return super.delete(value);
	}

/**
	 * @returns {void}
	 */
	clear() {
		this._invalidateCache();
		this._invalidateOrderedCache();
		return super.clear();
	}

/**
	 * Sort with a comparer function
	 * @param {SortFunction} sortFn Sorting comparer function
	 * @returns {void}
	 */
	sortWith(sortFn) {
		if (this.size <= 1 || sortFn === this._lastActiveSortFn) {
			// already sorted - nothing to do
			return;
		}

const sortedArray = Array.from(this).sort(sortFn);
		super.clear();
		for (let i = 0; i < sortedArray.length; i += 1) {
			super.add(sortedArray[i]);
		}
		this._lastActiveSortFn = sortFn;
		this._invalidateCache();
	}

sort() {
		this.sortWith(this._sortFn);
		return this;
	}

/**
	 * Get data from cache
	 * @template R
	 * @param {function(SortableSet<T>): R} fn function to calculate value
	 * @returns {R} returns result of fn(this), cached until set changes
	 */
	getFromCache(fn) {
		if (this._cache === undefined) {
			this._cache = new Map();
		} else {
			const result = this._cache.get(fn);
			const data = /** @type {R} */ (result);
			if (data !== undefined) {
				return data;
			}
		}
		const newData = fn(this);
		this._cache.set(fn, newData);
		return newData;
	}

/**
	 * Get data from cache (ignoring sorting)
	 * @template R
	 * @param {function(SortableSet<T>): R} fn function to calculate value
	 * @returns {R} returns result of fn(this), cached until set changes
	 */
	getFromUnorderedCache(fn) {
		if (this._cacheOrderIndependent === undefined) {
			this._cacheOrderIndependent = new Map();
		} else {
			const result = this._cacheOrderIndependent.get(fn);
			const data = /** @type {R} */ (result);
			if (data !== undefined) {
				return data;
			}
		}
		const newData = fn(this);
		this._cacheOrderIndependent.set(fn, newData);
		return newData;
	}

/**
	 * @private
	 * @returns {void}
	 */
	_invalidateCache() {
		if (this._cache !== undefined) {
			this._cache.clear();
		}
	}

/**
	 * @private
	 * @returns {void}
	 */
	_invalidateOrderedCache() {
		if (this._cacheOrderIndependent !== undefined) {
			this._cacheOrderIndependent.clear();
		}
	}

/**
	 * @returns {T[]} the raw array
	 */
	toJSON() {
		return Array.from(this);
	}
}

module.exports = SortableSet;