Tiny queue data structure

Powerful, clinical-aware patient triage and queue optimization engine for healthcare platforms.

fast, tiny `queueMicrotask` shim for modern engines

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.

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

Intelligent queue optimization system for telemedicine platforms. Reduces wait times, improves fairness, and optimizes doctor utilization using ML-based priority scoring.

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

Promise-based queue

In memory queue system prioritizing tasks

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

LRU Queue

Sequential asynchronous lock-based queue for promises

Simple JS queue with auto run for node and browsers

asynchronous function queue with adjustable concurrency

Fast, in memory work queue

Extremely fast double-ended queue implementation