Curated collection of data structures for the JavaScript/TypeScript.
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.
binary heap (priority queue) algorithms (ported from Python's heapq module)
An implementation of the Fibonacci heap data structure
walk paths fast and efficiently
Min/Max Heap & Heap Sort implementation in javascript
heap analysis plugins for memlab
Bridging the gap between buffers and typed arrays
Parses V8 heap snapshots
Heap dump, sample profiler and allocation timeline generator for Node.
Allow parsing of class static blocks
A small collection of useful data structures
Tools for parsing Chromium heap snapshot (`*.heapsnapshot`) files and doing useful things with them
Heap bridge SDK for React Native
A document model for rich text editors
Serve static files
Transform class static blocks
Min Heap
Transform static class fields assignments that are affected by https://crbug.com/v8/12421
Library of data structures
Adds a static `extend` method to a class, to simplify inheritance. Extends the static properties, prototype properties, and descriptors from a `Parent` constructor onto `Child` constructors.
Programmable interface to Clinic.js Heap Profiler
A custom element for extending the native media elements (<audio> or <video>)
Fast heap-based priority queue in JavaScript