A simple double ended queue datastructure

An iterator to iterate an array in random order with controls to requeue or dequeue elements during the iteration

Queues using linked list, faster than array.shift(), support enqueue,dequeue,enqueue all, dequeue all, clear, forEach, first, last

dequeue

Tiny queue data structure

indexed dequeue

A high-performance priority queue with O(1) enqueue/dequeue and FIFO ordering within priority levels.

Task and Message Queues with Multiple Providers

Dequeue implementation for TypeScript.

This library has a Queue with the following methods: enqueue and dequeue. Enqueue adds item(s) to end of the Queue. Dequeue removes and returns the first item from the beginning of the queue.

A modular and efficient implementation of a Priority Queue with enqueue-optimized and dequeue-optimized strategies.

Promise-based dequeue

This module implements the abstract data type Queue. All the standard Queue operations have been implemented (create, enqueue, dequeue, front & isEmpty).

Simple priority queue with stable ordering, built on btree-core.

Extremely fast double-ended queue implementation

A simple queue for JavaScript containing operations like enqueue, dequeue, etc

Priority queue data structures

A queue that will dequeue (call a provided function) at a given rate and has a max number concurrent (active functions running)

Queue data structure with enqueue, dequeue, peek, size and flush methods

Queue sync or async functions with max concurrency, max size, max age, and fifo/lifo ordering