Method dequeue

source/priority-queue.ts:82–100

()

	}

	dequeue(): RunFunction | undefined {
		if (this.#head === this.#queue.length) {
			return undefined;
		}

		const item = this.#queue[this.#head];
		this.#head++;

		if (this.#head === this.#queue.length) {
			// Fully drained queues are reset immediately so the next enqueue starts from a clean array.
			this.#queue.length = 0;
			this.#head = 0;
		} else if (this.#head > compactionThreshold && this.#head > this.#queue.length / 2) {
			// Keep repeated dequeues cheap, but stop the consumed prefix from growing without bound.
			this.#compact();
		}

		return item?.run;
	}

	filter(options: Readonly<Partial<PriorityQueueOptions>>): RunFunction[] {
		const result: RunFunction[] = [];