Python's deque data structure for JavaScript

Extremely fast double-ended queue implementation

Deques are a generalization of stacks and queues

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

Zero-dependency circular deque with amortized constant-time end operations and bounded vacant storage

Curated collection of data structures for the JavaScript/TypeScript.

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.

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

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

TypeScript definitions for double-ended-queue

Deque

A simple double ended queue datastructure

A graph data structure with topological sort.

TypeScript-STL (Standard Template Library, migrated from C++)

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

A Light–weight CSS Preprocessor

Powerful ESLint plugin with rules to help you achieve a scalable, consistent, and well-structured project. Create your own framework! Define your folder structure, file composition, advanced naming conventions, and create independent modules. Take your pr

This package provides support for the [RedisTimeSeries](https://redis.io/docs/data-types/timeseries/) module, which adds a time series data structure to Redis.

OpenTelemetry semantic conventions

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