Priority queue with message-group based partitioning and equal attention guarantee for each message group based on Redis
Tiny queue data structure
A simple tool to keep requests to be executed in order.
Promise queue with concurrency control
A really simple message queue based on Redis
ordered list extension for tiptap
An async iterable interface for redis streams
Combines array of streams into one Readable stream in strict order.
Redis utilities for redis instrumentations
Conversion of JavaScript primitives to and from Buffer with binary order matching natural primitive order
fast, tiny `queueMicrotask` shim for modern engines
Bull / BullMQ queue command line REPL
Ensure values are ordered consistently in your CSS.
Compatible version of p-queue
Job manager
A robust, performance-focused and full-featured Redis client for Node.js.
A simple, fast, robust job/task queue, backed by Redis.
A modern, high performance Redis client
Better Stack JavaScript logging tools (formerly Logtail)
This package provides support for the [RedisBloom](https://redis.io/docs/data-types/probabilistic/) module, which adds additional probabilistic data structures to Redis.
Object literal maintaining its properties in the order they were added
Redis Event Bus Module for Medusa
A shim for the setImmediate efficient script yielding API
OpenTelemetry instrumentation for `redis` database client for Redis
Pub Sub Queue for Redis that ensures ordered processing
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.
|> 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.