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 : ArrayQueue.js

/*
	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;
			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]() {
		return {
			next: () => {
				const item = this.dequeue();
				if (item) {
					return {
						done: false,
						value: item
					};
				}
				return {
					done: true,
					value: undefined
				};
			}
		};
	}
}

module.exports = ArrayQueue;

${this.title}

Code Editor : ArrayQueue.js