Javascript implementation of a queue data structure
A call queue (fifo)
A fifo rdf-resolve-hypermedia-links-queue actor
A superfast and lightweight Queue (FIFO) implementations in JavaScript.
Tiny queue data structure
A numeric container backed by a TypedArray ring buffer, with both stack (FILO) and queue (FIFO) methods.
A queue/FIFO data structure.
A fast fifo implementation similar to the one powering nextTick in Node.js core
A simple tool to keep requests to be executed in order.
SQS adapter for message-queue-toolkit
Queue(FIFO) implementation using LocalStorage API
A real queue (FIFO) built on top of a mongodb collection.
A simple double ended queue datastructure
SNS adapter for message-queue-toolkit
a simple fifo queue
Discord Player Utilities
Lightweight utilities for debouncing, throttling, and more - designed for npm packages.
Better Stack JavaScript logging tools (formerly Logtail)
FIFO queue implemented using a double linked-list
Simple FIFO queue implementation to avoid having to do shift() on an array, which is slow.
fast, tiny `queueMicrotask` shim for modern engines
Promised First-In-First-Out buffer. Await on push to be told when a value is consumed and await on shift for a value to consume when the buffer is empty.
Utilities for debouncing, throttling, rate-limiting, queuing, and more.
Re-drive dead letter queue messages to another queue
Implements a federated fifo queue with consistent hashing on top of resque
A Redis-backed FIFO queue
An audio driver for Hallon, a ruby client for the official Spotify API. Streams audio into a raw PCM-formatted FIFO queue, ideal for input into other applications.
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.
Stomp messaging server with file/dbm/memory/activerecord based FIFO queues, queue monitoring, and basic authentication. == SYNOPSYS: Handles basic message queue processing
Borium is a distributed super-queue engine, capable of storing many different kinds of queues (fifo).
Accepts and serves arbitrary namespaced queue entries atomically on a FIFO basis
Changes your queues from FIFO to numeric priority based ones.
An extension for Sidekiq allowing jobs in a single queue to be executed by a priority score rather than FIFO
|> 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.
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.
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.