Method dequeue

lib/util/ArrayQueue.js:61–72

* Removes and returns the next item in FIFO order, switching to a reversed * buffer when that is cheaper than shifting from the front of the array. * @returns {T | undefined} The head of the queue of `undefined` if this queue is empty.

()

	 * @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();
	}

	/**
	 * Removes the first matching item from whichever internal buffer currently