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.

Curated collection of data structures for the JavaScript/TypeScript.

binary heap (priority queue) algorithms (ported from Python's heapq module)

An implementation of the Fibonacci heap data structure

Min/Max Heap & Heap Sort implementation in javascript

heap analysis plugins for memlab

running node with maximum heap memory size

Tools for parsing Chromium heap snapshot (`*.heapsnapshot`) files and doing useful things with them

Heap dump, sample profiler and allocation timeline generator for Node.

Parses V8 heap snapshots

Fast heap-based priority queue in JavaScript

Load detection and shedding capabilities for http, express, restify and koa

Worker-thread implementation of the DeepSeek Harness code-execution seam

memlab is a framework that analyzes memory and finds memory leaks in JavaScript applications.

memlab core libraries

CPU and heap profiling and flamegraph visualization tool using @platformatic/react-pprof

Heap bridge helper for implementing JavaScript sdks on native platforms.

Programmable interface to Clinic.js Heap Profiler

Min Heap

A small collection of useful data structures