Queue with concurrency that starts tasks in order and runs them in parallel.
A unordered queue and ordered queue working together.
Tiny queue data structure
A super-simple mock for the node request library that uses an ordered queue
A simple tool to keep requests to be executed in order.
Priority queue with message-group based partitioning and equal attention guarantee for each message group based on Redis
ordered list extension for tiptap
Ordered queue with counter-based filtering for stream synchronization
Combines array of streams into one Readable stream in strict order.
Conversion of JavaScript primitives to and from Buffer with binary order matching natural primitive order
fast, tiny `queueMicrotask` shim for modern engines
Ensure values are ordered consistently in your CSS.
A shim for the setImmediate efficient script yielding API
Better Stack JavaScript logging tools (formerly Logtail)
Object literal maintaining its properties in the order they were added
A quick and dirty way to run an ordered queue of tasks focused on cross OS command line processes.
Promise queue with concurrency control
The smallest and simplest JavaScript priority queue
Priority queue data structures
queue-lit is a tiny queue data structure in case you `Array#push()` or `Array#shift()` on large arrays very often
remark-lint rule to warn when the markers of ordered lists violate a given style
Next tick shim that prefers process.nextTick over queueMicrotask for compat
remark-lint rule to check the marker value of ordered lists
Specialized fast async file writer
Pub Sub Queue for Redis that ensures ordered processing
The plugin is designed for sequential running of different jobs in the same queue across multiple queues. Specifically meant for running a variety of long-running background tasks scheduled ahead of time using something like reque-scheduler. May not be suitable for large scale operations.
Usually Resque workers work on queues in the given order (if there is something in the first, work it, otherwise if the there is something in the second, work on it, and so on). This plugin randomizes the order of the queues based on weights, so that a given queue will be the first queue to try based on a probability weight. Given queues A, B, C, D and weights 4, 3, 2, 1, repsectively, A will be first 40% of the time, B 30%, C 20%, and D 10%. In addition, when B is first, A will be second 4/7ths of the time (4 / [4+2+1]), and so on. The project is inspired by resque-fairly, which unfortunately mathematically does not give you this control over the weights.
High performance queueing system for Redis that ensures each publishers messages will be processed in order. Designed to work with 100s of thousands of publishers and an arbitrary number of competing consumers that need 0 knoweldge of what producer's message they are handling.
This engine allows users to inject requests into a queue to be processed. The queue handles bank account validations, credit payments, debit orders and collecting bank statements/notify me statements.
Avoid writing boilerplate code in order to consume messages from an AMQP message queue. Plug in queue configuration, and how to process each message.
Normally resque processes queues in a fixed order. This can lead to jobs in queues at the end of the list not getting process for very long periods. resque-fairly provides a mechanism where by workers are distributed across the set of queues with pending jobs fairly. This results in a much more predictable mean time to handling for jobs in queues that are not the first in the list.
Blue_colr provides simple DSL to enqueue processes in given order, using database table as a queue, and a deamon to run them
|> Distributed locks with "prioritized lock acquisition queue" capabilities based on the Redis Database. |> Each lock request is put into the request queue (each lock is hosted by its own queue separately from other queues) and processed in order of their priority (FIFO). |> Each lock request lives some period of time (RTTL) (with requeue capabilities) which guarantees the request queue will never be stacked. |> In addition to the classic `queued` (FIFO) strategy RQL supports `random` (RANDOM) lock obtaining strategy when any acquirer from the lock queue can obtain the lock regardless the position in the queue. |> Provides flexible invocation flow, parametrized limits (lock request ttl, lock ttl, queue ttl, lock attempts limit, fast failing, etc), logging and instrumentation.
Delay queue keeps it's elements ordered by a timestamp, popping off the items with the lowest timestamp first
Avoid writing boilerplate code in order to consume messages from an AMQP message queue. Plug in queue configuration, and how to process each message.
Ajaxmanager (by Alexander Farkas) packaged as a gem for Rails. Ajaxmanager helps you to manage AJAX requests and responses (i.e. abort requests, block requests, order requests). It is inspired by the AJAX Queue Plugin and the AjaxQueue document in the jQuery-Wiki.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.