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

TypeScript definitions for double-ended-queue

A simple double ended queue datastructure

Tiny queue data structure

Useful TypeScript utilities.

Check if a stream has ended

fast, tiny `queueMicrotask` shim for modern engines

Javascript implementation of a doubly linked-list data structure

A shim for the setImmediate efficient script yielding API

a javascript implementation of LinkedList & DoublyLinkedList

Promise queue with concurrency control

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

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.

Standard TypeScript Library

In memory queue system prioritizing tasks

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

Sequential asynchronous lock-based queue for promises