Heap Packages

Data structures and algorithms written in JavaScript with TypeScript types

A performant updatable priority queue which can pop AND shift.

Data Sturctures package for javascript that adds new data structures and improves existing ones

ds-kit is an NPM package provide ready to use famous data structures to JavaScript. It draws inspiration from the structured beauty of C++ STL.

A high-performance JavaScript and TypeScript library offering a comprehensive set of efficient data structures. Simplify your algorithm implementation and data manipulation with optimized, easy-to-use tools.

data structures including algorithms

ES6 JS lightweight data structures (Priority Queue, Binary Search Tree (BST), Graph, Bloom Filters, Trie, Queue, Stack, Linked-List)

Ember addon to track heap analytics

authentic and production-ready data structures implementation in javascript.

Express middleware that exposes pprof endpoints for easy profiling

Temporary file you can easily dump any v8 serializer compatible object to, exchanging it for a function, which when called, loads the object back in to memory. Utility for processing large streams, where you may need to reorder or reduce the data after it

Priority Queue(JavaScript, TS)

Simultaneously sort two strided arrays based on the sort order of the first array using heapsort.

Sort a strided array using heapsort.

Sort a double-precision floating-point strided array using heapsort.

Simultaneously sort two single-precision floating-point strided arrays based on the sort order of the first array using heapsort.

Sort a single-precision floating-point strided array using heapsort.

Simultaneously sort two double-precision floating-point strided arrays based on the sort order of the first array using heapsort.