Priority queue implementation backed by heap
fast, tiny `queueMicrotask` shim for modern engines
The smallest and simplest JavaScript priority queue
A heap-based implementation of priority queue in javascript with typescript support.
Generic browser priority queue.
Priority queue data structures
Fast heap-based priority queue in JavaScript
The smallest and simplest JavaScript priority queue
Simple JS stack with auto run for node and browsers
Next tick shim that prefers process.nextTick over queueMicrotask for compat
Tiny queue data structure
Simple JS queue with auto run for node and browsers
A promise based, dynamic priority queue runner, with concurrency limiting.
A priority queue that shuffles elements with the same priority.
High-priority task queue for Node.js and browsers
Simple JS queue with auto run for node and browsers
A JS library for finding optimal label position inside a polygon
a simple priority queue data structure
an opinionated implementation of resque in node
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.
async/await simple priority queues
A shim for the setImmediate efficient script yielding API
Fast, in memory work queue
Cloud Tasks API client for Node.js