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.

An implementation of the Fibonacci heap data structure

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

heap analysis plugins for memlab

Min/Max Heap & Heap Sort implementation in javascript

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

Parses V8 heap snapshots

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

Fast heap-based priority queue in JavaScript

A small collection of useful data structures

Min Heap

Programmable interface to Clinic.js Heap Profiler

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

memlab core libraries

Heap bridge helper for implementing JavaScript sdks on native platforms.

Provides safe and convenient methods to allocate, read, and write numeric values, strings, and typed arrays, within an ArrayBuffer heap, like the one used within WebAssembly and Emscripten modules.

Heap bridge SDK for React Native

binary heap priority queue

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