Improved queue based `async` package
Tiny queue data structure
fast, tiny `queueMicrotask` shim for modern engines
A shim for the setImmediate efficient script yielding API
Promise queue with concurrency control
wrapper around async.queue to make some common usages simpler
The smallest and simplest JavaScript priority queue
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
Simple JS queue with auto run for node and browsers
In memory queue system prioritizing tasks
Promise-based queue
LRU 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.
Simple JS queue with auto run for node and browsers
Sequential asynchronous lock-based queue for promises
utilities for observable asynchronous control flow
asynchronous function queue with adjustable concurrency
Fast, in memory work queue
A promise based, dynamic priority queue runner, with concurrency limiting.
Microsoft Azure Storage SDK for JavaScript - Queue
Extremely fast double-ended queue implementation
Compatible version of p-queue
A simple elaboration on Ruby's native SizedQueue which allows using the queue object to re-awaken a blocked thread and cause it to abandon its blocking enqueue/dequeue operation. Useful for simplifying program logic, reducing the need for external flags/Muteces (yes, I said Muteces), and for cleanly resolving queues on program termination without risk of data loss or deadlock. Why use this queue? There are two reasons. For one thing, under several circumstances it is _considerably_ faster than Ruby's native SizedQueue. I admit I'm not entirely sure why, but I have tested this on multiple platforms and it seems to hold true as a generality. You can feel free to confirm or dispel that this advantage holds for your use case at your own leisure. The second reason is the aforementioned simplification of program logic. In the case that all data passing through the queues must be preserved on program termination, SizedQueue can require some elaborate trickery to ensure that even the most remote possibility of deadlock is removed. ImprovedSizedQueue solves this problem by making it possible to use the queue to pass control messages between threads, irrespective of the queue's actual content.
Delated_job (or DJ) encapsulates the common pattern of asynchronously executing longer tasks in the background.
Gruf::Queue provides enhanced thread pool management and intelligent request handling for Gruf gRPC servers. Features include automatic resource exhaustion protection, smart ActiveRecord connection management, and zero-configuration plugin architecture for improved performance and reliability in high-throughput environments.
No description provided.
No description provided.