Asynchronously go through an array with concurrency and queue
Tiny queue data structure
asynchronous function queue with adjustable concurrency
asynchronous function queue with adjustable concurrency
Promise queue with concurrency control
The smallest and simplest JavaScript priority queue
Sequential asynchronous lock-based queue for promises
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
Call an array of promise-returning functions, restricting concurrency to a specified limit.
Curated collection of data structures for the JavaScript/TypeScript.
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.
wrapper around async.queue to make some common usages simpler
Evaluate asynchronous tasks with configurable concurrency.
Fast, in memory work queue
fast, tiny `queueMicrotask` shim for modern engines
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
Compatible version of p-queue
Async control for arrays
No-bullshit, ultra-simple, 35-lines-of-code async parallel forEach / map function for JavaScript.
Minimal async jobs utility library, with streams support
A shim for the setImmediate efficient script yielding API