8 Best Vanilla JavaScript Heap Libraries

List hand-picked by Openbase Experts
Learn More

dj

🔷 data structures implementation in javascript & typescript.

334
154
No support
MIT
mne

Curated collection of data structures for the JavaScript/TypeScript language.

1.5M
2K
Built-in
MIT
hea

A binary heap implementation in CoffeeScript/JavaScript.

911K
112
DefinitelyTyped
MIT
hj

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.

403K
53
Built-in
BSD-3-Clause
hea

The fastest JavaScript priority queue out there. Zero dependencies.

235
682
Built-in
MIT
bj

Buckets is a complete, fully tested and documented data structure library written in pure JavaScript.

188
No support
MIT
jh

A javascript heap implementation

99
5
No support
MIT
dsj

Implementation of commonly used data structures and utilities in JavaScript.

30
No support
MIT
Description
Author
License
Type Definitions
ESM Support
Tree Shakeable
Popularity
Downloads/wk
GitHub Stars
Reviews
User Rating
Voted Good Docs
Voted Easy of Use
Voted Performant
Top Positive Review
Top Negative Review
Issues
Total Issues
Open Issues
Avg Time to Close
Pull Requests
Total Pull Requests
Open Pull Requests
Avg Time to Merge
Community
Maintainers
Contributors
Contributors with 3+ commits
Top Committers
GitHub Forks
Versions
# of Versions
Latest
Next
Beta
Newest
Oldest
Major Every
Minor Every
Patch Every
Dependencies
Dependencies
Dev Dependencies
Links
More Info
README
Tutorials
Install Command
There's Nothing Here
No packages are selected.
Select a few packages to compare.