Enqueue Packages

A modular and efficient implementation of a Priority Queue with enqueue-optimized and dequeue-optimized strategies.

A simple and efficient implementation of a queue data structure in TypeScript. This package provides a generic Queue class which can be used in various JavaScript and TypeScript applications where queue functionality is needed.

A robust and efficient data structures library.

Queue for your project.

Deque

Compatible version of p-map

Compatible version of p-queue

Promise queue with concurrency control

Promise queue with concurrency control for the browser

Promise queue with concurrency control. A fork of p-queue for commonjs.

Promise queue with concurrency control

Promise queue with concurrency control

Queue tasks to run in intervals sequentially with fixed concurrency.

Just the cutest and tiniest queue/deque implementation!

Queue data structure

This library has a Queue with the following methods: enqueue and dequeue. Enqueue adds item(s) to end of the Queue. Dequeue removes and returns the first item from the beginning of the queue.

Promise queue with concurrency control

Promise queue with concurrency control

Promise queue with concurrency control

Fetcher Controller enqueues and throttles fetch requests and gives you information about the status and the result thereof.