TypeScript definitions for double-ended-queue

A numeric container backed by a TypedArray ring buffer, with both stack (FILO) and queue (FIFO) methods.

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

High-performance data structures (Deque, PriorityQueue) for DSA practice with optimal time complexity

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

A map with ordered insertion and removal

deque data structures missing in ES. keeping similar API syntax and behavior as Map, Set and Array

A simple double ended queue datastructure

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

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

A simple package for various statically allocated global data structures (e.g., counter, deque, hashtable)

A simple double-ended queue (deque) implementation in TypeScript

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

Axe DevTools accessibility analysis and remediation MCP Server for AI coding agents

A simple double-ended queue.

[DepUp] 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.

A constant-time typed double-ended queue.

Dequeue implementation for TypeScript.

production-ready data structures implementation in javascript & typescript.

Dynamic accessibility analysis for React using axe-core