Express middleware to limit a number of simultaneously processing requests using queue
Incoming file uploader using queue
A shim for the setImmediate efficient script yielding API
fast, tiny `queueMicrotask` shim for modern engines
Tiny queue data structure
Extremely fast double-ended queue implementation
Promise queue with concurrency control
Promise-based queue
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
asynchronous function queue with adjustable concurrency
Next tick shim that prefers process.nextTick over queueMicrotask for compat
CouchDB session store for Connect, using queue and changesets to avoid race conditions
Task and Message Queues with Multiple Providers
Simple JS queue with auto run for node and browsers
LRU 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.
Promise queue with concurrency control. This is a fork of sindresorhus/p-queue, but with CommonJS support.
Simple JS queue with auto run for node and browsers
Sequential asynchronous lock-based queue for promises
Generic browser priority queue.
High-priority task queue for Node.js and browsers
This gem is a Logstash plugin required to be installed on top of the Logstash core pipeline using $LS_HOME/bin/logstash-plugin install gemname. This gem is not a stand-alone program
Light-weight priority queue implementation using a heap
To parallelize your CI without having to balance your tests
Useful extras for Queue Classic
Manages rotation of proxies using a queuing system and STOMP
A job queueing and background workers system using Beanstalkd. Inspired by the Minion gem.
Cloudist is a simple, highly scalable job queue for Ruby applications, it can run within Rails, DaemonKit or your own custom application. Refer to github page for examples
DSL for asynchronic pipeline
A priority queue which implements a lazy binomial heap. It supports the change priority operation, being suitable for algorithms like Dijkstra's shortest path and Prim's minimum spanning tree. It can be instantiated as a min-priority queue as well as a max-priority queue.
Meta adapter that allow Lita to spawn multiple processes and load balance the work
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.
Allows going through delayed job queues using threads instead of processes
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.