Redis and Mongo backed light weight job queue
queue-lit is a tiny queue data structure in case you `Array#push()` or `Array#shift()` on large arrays very often
The smallest and simplest JavaScript priority queue
Extremely fast double-ended queue implementation
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
Blazing fast priority queue
A simple tool to keep requests to be executed in order.
Next tick shim that prefers process.nextTick over queueMicrotask for compat
The smallest and simplest JavaScript priority queue
LRU Queue
Promise-based queue
Simple JS queue with auto run for node and browsers
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.
Simple JS queue with auto run for node and browsers
Asynchronous queueing (producer-consumer style) with promises
Sequential asynchronous lock-based queue for promises
WebAudio for Rebels
Fast, in memory work queue
Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript. Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods.
asynchronous function queue with adjustable concurrency
Like Queue but with a pop timeout and a few other things
resque plugin that allows you to attach information when a job is put in redis, and to do whatever you want with the information when it is popped off the resque queue
A queue that refreshes itself when it gets empty or stale, so you can keep popping
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.
A simple client for using semq message servers. Supports push and pop methods to named queues. Pop can wait indefinitely, using long polling to remain lightweight.
A binary heap-based priority queue supporting min-heap, max-heap, and custom comparator modes. Features O(log n) push/pop, priority changes, merge operations, and FIFO tie-breaking.
Delay queue keeps it's elements ordered by a timestamp, popping off the items with the lowest timestamp first
CollectionUtils provide with basic collection templates like stack(push, pop, peek), queues(enqueue, dequeue), heaps/tree(MinHeap, MaxHeap, BST) and HashDeserializedObject(Converts a hash into object for easy access. All the keys will become attributes of the object). Check out the wiki at https://github.com/deeshugupta/collection_utils/wiki
No description provided.
No description provided.
No description provided.
No description provided.