Dequeue Packages

Tiny queue data structure

Priority queue data structures

Priority queue data structures

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

A simple and fast FIFO collection for enqueuing and dequeuing items.

A small ES6 package for execute functions sequentially.

A spiral deque - high performance and dynamic queue size

observable sequence

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

Queue + Stack ADTs.

Fast performance queue implementation

A pretty small ES6 API for Queue and Stack ADTs.

Collection of elements where insert, delete happens only at the ends.

dequeue

indexed dequeue

Priority queue data structures

Tiny queue data structure

Just the cutest and tiniest queue/deque implementation!

Queue data structure

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.