Cancellable, async serial function execution
The operation queue
Adjustable asyncronous operation queue
A shim for the setImmediate efficient script yielding API
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.
Tiny queue data structure
fast, tiny `queueMicrotask` shim for modern engines
Extremely fast double-ended queue implementation
No description provided.
Promise queue with concurrency control
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
The smallest and simplest JavaScript priority queue
Next tick shim that prefers process.nextTick over queueMicrotask for compat
LRU Queue
Promise-based queue
Priority queue data structures
Simple JS queue with auto run for node and browsers
In memory queue system prioritizing tasks
Simple JS queue with auto run for node and browsers
Sequential asynchronous lock-based queue for promises
Add a callback to the next tick queue.
Fast, in memory work queue
asynchronous function queue with adjustable concurrency
A unique queue with atomic operations implemented in Redis.
Thread-safe queue and stack data structures with configurable capacity limits, blocking enqueue/dequeue with timeouts, and peek operations. Uses Mutex and ConditionVariable for safe concurrent access.
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.
simplistic postgresql based queue with support for batching and idempotent operations
Batsir is a platform for stage based operation queue execution
Simple ruby library for handling threaded workers operating on a queue
A thread-safe rate-limited work queue, which allows for background and foreground operations.
take default Queue from Ruby and allow multiple operations while holding lock
Lets you easily change messaging adapters for simple queue and poll operations
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.
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.
A Ruby implementation of the famous Doubly Linkedlist data structure with support to the Enumerable methods such as `each`, `to_a`, `map`, etc. following ruby idioms. Supports Queue operations as well as Stack operations. A Linkedlist is efficient in many specific cases(eg:- Queue operations) than other data structures such as Array.
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.