Typescript implementation for a queue that is also a set
Tiny queue data structure
Promise queue with concurrency control
A simple tool to keep requests to be executed in order.
Curated collection of data structures for the JavaScript/TypeScript.
fast, tiny `queueMicrotask` shim for modern engines
Missing keepalive http.Agent
A shim for the setImmediate efficient script yielding API
The smallest and simplest JavaScript priority queue
Microsoft Azure Storage SDK for JavaScript - 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
Better Queue for NodeJS
In memory queue system prioritizing tasks
Promise-based queue
Headless CLI client for the Agent Client Protocol (ACP) — talk to coding agents from the command line
LRU 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.
OCI NodeJS client for Queue Service
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
Unique Resque queues using redis 1.6.0 scripting, sets and not much else
Queue manager for Rails application. Based on Redis (Sorted Set)
A daemon that listens to an AMQP queue and responds to messages by invoking commands from a set of plugins
Log HTTP request queue time to statsd when the HTTP_X_REQUEST_START is set.
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.
Polls a single SQS queue and copies the body of any messages to a configurable set of child queues then deletes the message from the parent.
Save mementos of your delayed jobs and also set queue quotas.
resque-status is an extension to the resque queue system that provides simple trackable jobs. It provides a Resque::Plugins::Status::Hash class which can set/get the statuses of jobs and a Resque::Plugins::Status class that when included provides easily trackable/killable jobs.
resque-status is an extension to the resque queue system that provides simple trackable jobs. It provides a Resque::Plugins::Status::Hash class which can set/get the statuses of jobs and a Resque::Plugins::Status class that when included provides easily trackable/killable jobs.
== DESCRIPTION: NServer is a set of classes that provide a flexible notification system for Linux based systems. It sits in the systray, waiting for messages to be submitted for display. X.org standards (via Gtk) and libnotify are used. Messages can be submitted from the localhost, or via remote hosts, depending on settings. == FEATURES/PROBLEMS: * Persistent server with notification queueing * Uses X.org SYSTRAY specification (via gtk2) == SYNOPSIS:
<in development> AdtUtilit is a Ruby gem that provides a set of useful data type classes such as Linked List, Queue, Stack, StackQueue, and Polytree. Many intuitive methods are available for each class. See documentations for the details.
Calculates algorithms and data structures for sorting and searching. Selects best one to use for particular data set. Currently supports: Bubble Sort, Insertion Sort, Selection Sort, Merge Sort, Quick Sort, Heap Sort, Stack, Queue, Linked List, Binary Search Tree
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.