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

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

Min/Max Heap & Heap Sort implementation in javascript

heap analysis plugins for memlab

Programmable interface to Clinic.js Heap Profiler

Lightweight Node heap growth sampling with v8 stats and simple leak-suspect heuristics.

binary heap priority queue

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

Parses V8 heap snapshots

Fast heap-based priority queue in JavaScript

Exposes node v8 garbage collection stats

Keep an eye on your memory usage, and discover and isolate leaks.

Make a dump of the V8 heap for later inspection.

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

memlab core libraries

Min Heap

Heap bridge helper for implementing JavaScript sdks on native platforms.