A robust and efficient data structures library.
Queue + Stack ADTs.
IB CS Data Structures in JS for experimenting!
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
Just the cutest and tiniest queue/deque implementation!
Priority queue data structures
A lightweight and dependency-free collection of essential data structures and graph algorithms, written entirely in TypeScript. This library supports CommonJS, ESM, and browser environments, and includes utility functions for practical, everyday tasks in
quick singly-linked list
observable sequence
Collection of useful and efficient JS tools
A simple and efficient implementation of a queue data structure in TypeScript. This package provides a generic Queue class which can be used in various JavaScript and TypeScript applications where queue functionality is needed.
Tiny queue data structure
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
Collection of elements where insert, delete happens only at the ends.
Tiny queue data structure