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.

A robust & optimized `String.prototype.includes` polyfill, based on the ECMAScript 6 specification.

ECMAScript 6 Symbol polyfill

A robust & optimized `String.prototype.repeat` polyfill, based on the ECMAScript 6 specification.

Easily-extendable error for use with ES6 classes

Parses V8 heap snapshots

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

Get the dependencies of an ES6 module

Fast heap-based priority queue in JavaScript

ES5 shim for ES6 (ECMAScript 6) Reflect and Proxy objects

Min Heap

ECMAScript6 Set polyfill

A robust & optimized `String.prototype.codePointAt` polyfill, based on the ECMAScript 6 specification.

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