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.
Tiny queue data structure
A shim for the setImmediate efficient script yielding API
fast, tiny `queueMicrotask` shim for modern engines
Promise queue with concurrency control
A simple tool to keep requests to be executed in order.
Simple JS queue with auto run for node and browsers
Simple JS queue with auto run for node and browsers
In memory queue system prioritizing tasks
queue-lit is a tiny queue data structure in case you `Array#push()` or `Array#shift()` on large arrays very often
Promise-based queue
Fast, in memory work queue
High-priority task queue for Node.js and browsers
LRU Queue
Next tick shim that prefers process.nextTick over queueMicrotask for compat
A promise based, dynamic priority queue runner, with concurrency limiting.
The smallest and simplest JavaScript priority queue
Evaluate asynchronous tasks with configurable concurrency.
asynchronous function queue with adjustable concurrency
wrapper around async.queue to make some common usages simpler
Extremely fast double-ended queue implementation
The fastest javascript implementation of a double-ended queue. Used by the official Redis, MongoDB, MariaDB & MySQL libraries for Node.js and many other libraries. Maintains compatability with deque.
Compatible version of p-queue
A heap-based implementation of priority queue in javascript with typescript support.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.