simplest possible queue which squashes intermediate events, yet guarantees at least one pending action is taken when applicable
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
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
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
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
Sequential asynchronous lock-based queue for promises
Simple JS queue with auto run for node and browsers
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
A heap-based implementation of priority queue in javascript with typescript support.
Compatible version of p-queue
a simple priority queue data structure
Database-backed Active Job backend.
minitest/rspec parallel test runner for CI environments
To parallelize your CI without having to balance your tests
queue_classic is a queueing library for Ruby apps. (Rails, Sinatra, Etc...) queue_classic features asynchronous job polling, database maintained locks and no ridiculous dependencies. As a matter of fact, queue_classic only requires pg.
Adds Redis::Queue class which can be used as Distributed-Queue based on Redis. Redis is often used as a messaging server to implement processing of background jobs or other kinds of messaging tasks. It implements Reliable-queue pattern decribed here: http://redis.io/commands/rpoplpush
A simple event bus on top of common background queues. Publish and subscribe to events as they occur using what you already have.
Background search indexing using existing worker systems.
A tunable work queue, designed to coordinate work between a producer and a pool of worker threads.
Dedupe tasks on a per-request basis
Plugin for running methods on ActiveRecord models after record is committed
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.
Fast priority queue implementation (c++ wrapper, see README.md for a comparison with other libraries)
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.
No description provided.
No description provided.
No description provided.