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

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

CLI authentication utility for Deque services

deque cauldron pattern library styles

Fully accessible react components library for Deque Cauldron

Deque

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

Python's deque data structure for JavaScript

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.

Lookahead brickwall limiter. A sliding-window maximum (monotonic deque) over

Observable deque (linked list).

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

deque datastructure

Just the cutest and tiniest queue/deque implementation!

Extremely fast double-ended queue implementation

Wrapper package for double-ended-queue

Consistent ESLint standards for Deque product development

Deque implementation in JavaScript

jest accessibility matching utilities with deque axe