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";

/**
 * @template T
 */
class ArrayQueue {
	/**
	 * @param {Iterable<T>=} items The initial elements.
	 */
	constructor(items) {
		/** @private @type {T[]} */
		this._list = items ? Array.from(items) : [];
		/** @private @type {T[]} */
		this._listReversed = [];
	}

/**
	 * Returns the number of elements in this queue.
	 * @returns {number} The number of elements in this queue.
	 */
	get length() {
		return this._list.length + this._listReversed.length;
	}

/**
	 * Empties the queue.
	 */
	clear() {
		this._list.length = 0;
		this._listReversed.length = 0;
	}

/**
	 * Appends the specified element to this queue.
	 * @param {T} item The element to add.
	 * @returns {void}
	 */
	enqueue(item) {
		this._list.push(item);
	}

/**
	 * Retrieves and removes the head of this queue.
	 * @returns {T | undefined} The head of the queue of `undefined` if this queue is empty.
	 */
	dequeue() {
		if (this._listReversed.length === 0) {
			if (this._list.length === 0) return undefined;
			if (this._list.length === 1) return this._list.pop();
			if (this._list.length < 16) return this._list.shift();
			const temp = this._listReversed;
			this._listReversed = this._list;
			this._listReversed.reverse();
			this._list = temp;
		}
		return this._listReversed.pop();
	}

/**
	 * Finds and removes an item
	 * @param {T} item the item
	 * @returns {void}
	 */
	delete(item) {
		const i = this._list.indexOf(item);
		if (i >= 0) {
			this._list.splice(i, 1);
		} else {
			const i = this._listReversed.indexOf(item);
			if (i >= 0) this._listReversed.splice(i, 1);
		}
	}

[Symbol.iterator]() {
		let i = -1;
		let reversed = false;
		return {
			next: () => {
				if (!reversed) {
					i++;
					if (i < this._list.length) {
						return {
							done: false,
							value: this._list[i]
						};
					}
					reversed = true;
					i = this._listReversed.length;
				}
				i--;
				if (i < 0) {
					return {
						done: true,
						value: undefined
					};
				}
				return {
					done: false,
					value: this._listReversed[i]
				};
			}
		};
	}
}

module.exports = ArrayQueue;