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.

Extremely fast double-ended queue implementation

A simple double ended queue datastructure

TypeScript definitions for double-ended-queue

A slim and efficient in-memory Deque (doubly-ended queue) for Node.js projects, designed with Data-Oriented Design principles and implemented using a cyclic buffer to optimize memory layout through sequential item allocation. A notable real-world use case

Useful TypeScript utilities.

Tiny queue data structure

Check if a stream has ended

Javascript implementation of a doubly linked-list data structure

fast, tiny `queueMicrotask` shim for modern engines

A shim for the setImmediate efficient script yielding API

Promise queue with concurrency control

A simple tool to keep requests to be executed in order.

a javascript implementation of LinkedList & DoublyLinkedList

The smallest and simplest JavaScript priority queue

queue-lit is a tiny queue data structure in case you `Array#push()` or `Array#shift()` on large arrays very often

Finite key-value map using the Least Recently Used (LRU) algorithm where the most recently used objects are keept in the map while less recently used items are evicted to make room for new ones.

Wrapper package for double-ended-queue

Next tick shim that prefers process.nextTick over queueMicrotask for compat

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