Just the cutest and tiniest queue/deque implementation!

A spiral deque - high performance and dynamic queue size

Deque implementation in Typescript/Javascript

Wrapper package for double-ended-queue

Extremely fast double-ended queue implementation

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

A head-tail linked list, or deque, implementation in Javascript

jest accessibility matching utilities with deque axe

A Preload-Based Circular Deque Class.

Array-backed implementation of a deque. Supports O(1) random access, and amortized O(1) insertion and removal at the front and back of the deque

javascript standard data structure library which benchmark against C++ STL

Curated collection of data structures for the JavaScript/TypeScript.

Concise and fast javascript templating compatible with nodejs and other javascript environments

STL-style data structures and algorithms for TypeScript: Vector, Stack, Queue, Deque (double-ended queue), List, PriorityQueue, Map, Set, sort, binarySearch, graph utilities. Use like C++ STL.

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

Custom Playwright commands to inject axe-core and test for a11y

A modern JavaScript & TypeScript standard template library (STL) for data structures and algorithms. Includes high-performance implementations of Stack, Queue, Deque, Linked List, Vector, Set, Map, Tree, Heap, and Graph — inspired by C++ STL. Designed for

Stream powered by Deque circular queue for blazing fast performance

Iterator implementation

High-performance Deque (Double-Ended Queue) for DSA practice with O(1) operations