heap-js
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.
View on Github
Activity
- Latest release
- 11mo ago
- Total releases
- 24
- Cadence
- ~3 months
- Last 12 months
- 0
Reach
- Stars
- —
Details
- License
- BSD-3-Clause
- First release
- Jul 26, 2017
Releases
| Version | Released | |
|---|---|---|
2.7.1
minor
| ||
2.6.0
minor
| ||
2.5.0
minor
| ||
2.3.0
minor
| ||
2.2.0
minor
| ||
2.1.6
patch
| ||
2.1.5
patch
| ||
2.1.4
patch
| ||
2.1.3
patch
| ||
2.1.2
patch
| ||
2.1.1
patch
| ||
2.1.0
minor
| ||
2.0.0
major
| ||
1.5.2
patch
| ||
1.5.1
patch
| ||
1.5.0
minor
| ||
1.4.1
patch
| ||
1.4.0
minor
| ||
1.3.0
minor
| ||
1.2.2
patch
| ||
1.2.1
patch
| ||
1.2.0
minor
| ||
1.1.1
patch
| ||
1.1.0
initial
|