An item processing queue with Promise
The smallest and simplest JavaScript priority queue
Tiny queue data structure
Extremely fast double-ended queue implementation
fast, tiny `queueMicrotask` shim for modern engines
Returns the next buffer/object in a stream's readable queue
A shim for the setImmediate efficient script yielding API
Efficient item queue utility for the Ethical framework.
Promise queue with concurrency control
Useful TypeScript utilities.
The smallest and simplest JavaScript priority queue
Priority queue data structures
A simple tool to keep requests to be executed in order.
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
Javascript implementation of a queue data structure
[](https://circleci.com/gh/segmentio/localstorage-retry)
Simple JS queue with auto run for node and browsers
In memory queue system prioritizing tasks
Promise-based queue
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.
LRU Queue
Simple JS queue with auto run for node and browsers
Sequential asynchronous lock-based queue for promises
A thread safe, Redis backed queue with the ability to delay items from being dequeued
Async queue system that batches items together based on time and size
Use it if you have way too many items in your worker gem queue
Qu::Scheduler is an extension to Qu that adds support for queueing items in the future.
It supports the usual enqueue and dequeue operations, along with methods for peeking at the first item, testing if the queue is empty and counting the number of items in the queue.
Messaging system based on the reactor pattern. You can publish messages to a queue and then a demultiplexer runs an event loop which pops items from the queue and hands it over to a dispatcher. The dispatcher hands over the message to the appropriate handler. You can choose your own queueing service.
Listen to multiple queues concurrently and return the value of the first queue to have an item pushed to it.
Delay queue keeps it's elements ordered by a timestamp, popping off the items with the lowest timestamp first
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.