Zero-dependency typed Ring Buffer (circular buffer) — fixed-capacity FIFO, O(1) push/pop/peek, overwrite or throw on overflow. Inspired by Python deque(maxlen), Java ArrayDeque, C# CircularBuffer.

Misc TS data structures such as Sets, Maps and Collections

[Link to npm](https://www.npmjs.com/package/@a-arsenij/std)

Zero-dependency data structures: linked lists (doubly/singly linked, circular), deques, ring buffers, unrolled lists, caches (LRU, LFU, SLRU, Clock, FIFO), heaps (binary, indexed, pairing), timer wheels, object pools, queues, stacks, splay trees, skip lis

Class inspired by the Rust struct: https://doc.rust-lang.org/std/collections/struct.VecDeque.html

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.

[](https://github.com/withhaibun/haibun-web-accessibility-axe/actions/workflows/test.yml)

A collection of tools, utilities, and helpers for TypeScript

JavaScript utility classes toolbox

A lightweight, fully typed TypeScript library of essential data structures: LinkedList, Stack, Queue, and MinHeap.

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

No description provided.

Typescript version of the JS data structures book made by Loiane Groner.

Open-source accessibility scoring CLI — aggregates axe-core, eslint-plugin-jsx-a11y, and more into a unified score.

Metarhia Skills

this is some of Data Structures for JavaScript

Build-time guards and rigs shared by Webgrip Astro static sites: the CSP validator, the production-faithful dist server, the axe scan engine, the mail-auth drift check, the copy-claims guard, and the newsletter mail pipeline.

Run 1300 web accessibility tests from 12 tools and get a standardized report

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

Foundation data structures and utilities for spot market trading bookkeeping, backtesting, and algorithmic trading