STL-style data structures and algorithms for TypeScript: Vector, Stack, Queue, Deque (double-ended queue), List, PriorityQueue, Map, Set, sort, binarySearch, graph utilities. Use like C++ STL.

An autotracked implementation of a double-ended queue, implemented as a ring-buffer backed by a native JavaScript array.

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

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

Double Ended Queue with O(1) performance and array-like api

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

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

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

Quantix — Ultra-fast hybrid circular-buffer, double-ended queue and ring-buffer in TypeScript. Pre-allocated memory, zero-copy O(1) slicing, TypedArray support, and V8-optimized iterators.

node package for top and bottom plus lifo/ fifo queues, stack, priority queues, double ended queues, circular queues, wait queues, and semaphore queues implementation

Merge multiple streams into a unified stream

Call a callback when a readable/writable/duplex stream has completed or failed.

Callbag factory that merges data from multiple callbag sources

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.

Helper module for loading your native module's .node file

Type-safe, structured communication between worker threads and parent processes via TypeScript meta-programming.

Read arrays as standard WhatWG streams.

Support for representing 64-bit integers in JavaScript

Use double-position gradients in CSS

Parse JSON with more helpful errors