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

indexed dequeue

Tiny queue data structure

dequeue

Promise-based dequeue

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.

Task and Message Queues with Multiple Providers

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

Dequeue implementation for TypeScript.

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

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

Extremely fast double-ended queue implementation

deq (dequeue) places records in a redis queue for high throughput and dequeues them into your choice of (slower write-speed) datastore

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

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

Priority queue data structures

Type-script based library for efficient implementation of some of the standard data structures like Stack, Queue, Dequeue, etc.

A message dequeuer for nodezoo