an opinionated implementation of resque in node
The smallest and simplest JavaScript priority queue
A heap-based implementation of priority queue in javascript with typescript support.
fast, tiny `queueMicrotask` shim for modern engines
Generic browser priority queue.
Priority queue data structures
Fast heap-based priority queue in JavaScript
The smallest and simplest JavaScript priority queue
Tiny queue data structure
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
Resque Queue for AdonisJS v6
A JS library for finding optimal label position inside a polygon
a simple priority queue data structure
async/await simple priority queues
A shim for the setImmediate efficient script yielding API
A Promise-based dynamic priority queue runner.
Promise queue with concurrency control
A simple tool to keep requests to be executed in order.
Lightweight utilities for debouncing, throttling, and more - designed for npm packages.
A tiny (139B to 204B) utility to regulate the execution rate of your functions
queue-lit is a tiny queue data structure in case you `Array#push()` or `Array#shift()` on large arrays very often
Next tick shim that prefers process.nextTick over queueMicrotask for compat
A resque plugin for specifying the priority between queues that workers use to determine what to work on next
resque plugin to have priority in the queue
Provides Resque with three levels of (named) priority for a single queue.
Provides Resque with three levels of (named) priority for a single queue.