Tiny async queue with concurrency control. Like p-limit or fastq, but smaller and faster.

A queue implementation that can be iterated over

Vow-based task queue

A simple, fast, robust job/task queue, backed by Redis.

Priority queue data structures

TypeScript definitions for d3-queue

A really fast memory store for better-queue

Simple priority queue with stable ordering, built on btree-core.

An advanced RabbitMQ / AMQP client built on amqplib

Enqueues messages onto a given SQS queue

Merkle tree implemented as a persistent datastructure

A simple, dependency-free library for concurrent promise-based queues. Comes with with concurrency and timeout control.

A sorted list of key-value pairs in a fast, typed in-memory B+ tree with a powerful API.

A home for your AI agents

btree-core is a high-performance B+ tree implementation designed for modern JavaScript applications. It provides efficient ordered data structures, predictable performance characteristics, and a clean, developer-friendly API.

A contributed Node-RED node, that queues undeliverable messages to file for later delivery.

Express middleware to limit a number of simultaneously processing requests using queue

Throttles arbitrary code to execute a maximum number of times per interval. Best for making throttled API requests.

A Convex component for streaming durable text to the client, from LLMs and other sources.

A simple queue node that store incoming messages in memory queue and uses a feedback from a following action or trigger message to release the next message stored in the queue.