High-performance d-ary heap priority queue with O(1) item lookup, configurable arity, and min/max heap support

d-ary heap data structure library for JavaScript

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

OLPC JSON canonicalization

Various heap implementations for arbitrary values and with customizable ordering

Parses V8 heap snapshots

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

Programmable interface to Clinic.js Heap Profiler

Heap bridge helper for implementing JavaScript sdks on native platforms.

binary heap priority queue

Make a dump of the V8 heap for later inspection.

Heap bridge SDK for React Native

A small JS+SVG library for drawing railroad syntax diagrams.

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

A small collection of useful data structures