Tiny queue data structure

Promise queue with concurrency control

fast, tiny `queueMicrotask` shim for modern engines

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

Fast, in memory work queue

asynchronous function queue with adjustable concurrency

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.

In memory queue system prioritizing tasks

Next tick shim that prefers process.nextTick over queueMicrotask for compat

Sequential asynchronous lock-based queue for promises

A shim for the setImmediate efficient script yielding API

Compatible version of p-queue

A simple tool to keep requests to be executed in order.

Extremely fast double-ended queue implementation

Queueing jobs in Postgres from Node.js like a boss

a simple priority queue data structure

A Node.js library for interacting with the Vercel Queue Service API

Call an array of promise-returning functions, restricting concurrency to a specified limit.

Generic browser priority queue.