A performant double-ended queue (deque) implementation in javascript.

Zero-dependency circular deque with amortized constant-time end operations and bounded vacant storage

CLI authentication utility for Deque services

deque cauldron pattern library styles

Fully accessible react components library for Deque Cauldron

Deque

Python's deque data structure for JavaScript

Deques are a generalization of stacks and queues

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.

Zero-dependency circular deque with amortized constant-time end operations and bounded vacant storage

Production-ready TypeScript data structures: Heap, Deque, Trie, Graph, Red-Black Tree, TreeMap, TreeSet, and more. Zero dependencies, type-safe, with getRank/getByRank/rangeByRank support.

Zero-dependency circular deque with amortized constant-time end operations and bounded vacant storage

Zero-dependency circular deque with amortized constant-time end operations and bounded vacant storage

Consistent ESLint standards for Deque product development

Observable deque (linked list).

Zero-dependency circular deque with amortized constant-time end operations and bounded vacant storage

[](https://www.npmjs.com/package/@zimtsui/deque)

Deque implementation in JavaScript

deque datastructure

Zero-dependency circular deque with amortized constant-time end operations and bounded vacant storage