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

The fastest JavaScript priority queue out there. Zero dependencies.

TypeScript & Javascript Data Structures

Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript. Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods.

A sorted queue, based on an array-backed binary heap

A simple task runner which will run all tasks till completion, while maintaining concurrency limits.

Priority Queue in Typescript & Javascript

A standard collections library for JavaScript/TypeScript

A fast algorithm library for JavaScript/TypeScript.

Task queue with priority built with XState

Priority consumer powered by RxJS 🔥

An application to Visualize various pathfinding algorithm using React.js

Typescript priority queue

An advanced Axios request manager offering intelligent retry logic with token refresh, concurrency control, priority queuing, and a flexible plugin architecture, all built with TypeScript for robust HTTP client integrations.

Heap queue algorithm implementation for Typescript based on heapq.py module from CPython

Opinionated, type-safe, zero-dependency max/min priority queue for JavaScript and TypeScript projects.

Examples of some of the HTTP request orchestration techniques

⚡ A fast and lightweight priority queue implementation for JavaScript.

A flexible async task scheduler with multi-level priorities, concurrency control, and priority decay for Javascript and Typescript.

Priority Queue implementation in TypeScript