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

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

observable sequence

Queue + Stack ADTs.

Fast performance queue implementation

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

A pretty small ES6 API for Queue and Stack ADTs.

dequeue

indexed dequeue

Priority queue data structures

Tiny queue data structure

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

A simple and efficient implementation of a queue data structure in TypeScript. This package provides a generic Queue class which can be used in various JavaScript and TypeScript applications where queue functionality is needed.

A robust and efficient data structures library.