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)

Min/Max Heap & Heap Sort implementation in javascript

heap analysis plugins for memlab

ECMAScript 6 Symbol polyfill

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

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

Get the dependencies of an ES6 module

ECMAScript 6 (Harmony) compatibility shims for legacy JavaScript engines

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

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

ECMAScript6 Set polyfill

Programmable interface to Clinic.js Heap Profiler

JavaScript parser, mangler/compressor and beautifier toolkit for ES6+

Min Heap

Array.prototype.find ES6 polyfill.

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

Converts callback-based functions to ES6 Promises