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)

A fast, strongly typed in-memory B+ tree designed for managing sorted key-value data, featuring a comprehensive API optimized for performance, scalability, and developer productivity.

heap analysis plugins for memlab

Min/Max Heap & Heap Sort implementation in javascript

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.

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

Heap bridge SDK for React Native

Fast heap-based priority queue in JavaScript

TypeScript definitions for heap

IndexedDB-based stamper for @turnkey/http

Library of data structures

Webpack provides a really detailed `webpack.debug.ProfilingPlugin`, but it only does CPU Profiling. There are more to performance tuning with Webpack than CPU profile. This plugin provides heap sample information to show where memory is allocated after a

Array#filter() with also detecting indexes of filtered values

Min Heap