Alaska array queue driver
Tiny queue data structure
The smallest and simplest JavaScript priority queue
queue-lit is a tiny queue data structure in case you `Array#push()` or `Array#shift()` on large arrays very often
Extremely fast double-ended queue implementation
asynchronous function queue with adjustable concurrency
Call an array of promise-returning functions, restricting concurrency to a specified limit.
Curated collection of data structures for the JavaScript/TypeScript.
fast, tiny `queueMicrotask` shim for modern engines
In memory queue system prioritizing tasks
A shim for the setImmediate efficient script yielding API
Promise queue with concurrency control
A simple tool to keep requests to be executed in order.
Simple FIFO queue implementation to avoid having to do shift() on an array, which is slow.
asynchronous function queue with adjustable concurrency
Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript. Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods.
Next tick shim that prefers process.nextTick over queueMicrotask for compat
Priority queue data structures
Promise-based queue
LRU Queue
Simple JS queue with auto run for node and browsers
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.
Simple JS queue with auto run for node and browsers
Sequential asynchronous lock-based queue for promises