Double Ended Queue Datastructure - ordered collection with optimized access from its endpoints

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

Fully accessible react components library for Deque Cauldron

deque cauldron pattern library styles

Deque

Python's deque data structure for JavaScript

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

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

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

Observable deque (linked list).

Deque implementation in JavaScript

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

Consistent ESLint standards for Deque product development

Extremely fast double-ended queue implementation