Extremely fast double-ended queue implementation

TypeScript definitions for double-ended-queue

A simple double ended queue datastructure

A performant double-ended queue (deque) implementation in 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.

Wrapper package for double-ended-queue

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

very fast double-ended queue, stack and circular buffer

A double-ended priority queue based on min-max heaps.

Zero-dependency, zero-GC family of O(1) data structures that witnesses its constant: SparseSet (O(1) add/has/delete/clear/iterate), RingDeque (O(1) fixed-capacity numeric double-ended queue), UnionFind (near-O(1) amortized disjoint-set), MonoDeque (O(1)-a

A simple double-ended queue.

A constant-time typed double-ended queue.

A JavaScript package that implements the Double-ended Queue (Deque) data structure with various important methods for efficient data handling.

Double-ended slice method (Array.prototype.slice).

Check if a stream has ended

Double Ended Queue data structure

Deques are a generalization of stacks and queues (the name is pronounced “deck” and is short for “double-ended queue”).

yet another double-ended queue.

Core interfaces loud double-ended queues.

Double Ended Queue Data Structure - Vasile Sambor