High-performance Deque (Double-Ended Queue) for DSA practice with O(1) operations

Check if a stream has ended

Tiny queue data structure

A simple double-ended queue (deque) implementation in TypeScript

fast, tiny `queueMicrotask` shim for modern engines

[DepUp] 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.

LRU Queue

Quantix — Ultra-fast hybrid circular-buffer, double-ended queue and ring-buffer in TypeScript. Pre-allocated memory, zero-copy O(1) slicing, TypedArray support, and V8-optimized iterators.

Promise queue with concurrency control

High-priority task queue for Node.js and browsers

The smallest and simplest JavaScript priority 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.

Deques are a generalization of stacks and queues

Queue data from a stream until a checkpoint is hit

Fast, in memory work queue

Evaluate asynchronous tasks with configurable concurrency.

A tiny FIFO task queue with explicit flow control for Node and browsers

In memory queue system prioritizing tasks

Sequential asynchronous lock-based queue for promises

A shim for the setImmediate efficient script yielding API