heap-js vulnerabilities

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.

Package versions

24 VERSIONS IN TOTAL
versionpublisheddirect vulnerabilities
2.7.130 Sep, 2025
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
2.6.028 Dec, 2024
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
2.5.01 Mar, 2024
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
2.3.024 May, 2023
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
2.2.010 May, 2022
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
2.1.612 Jul, 2021
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
2.1.526 Mar, 2021
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
2.1.418 Dec, 2020
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
2.1.323 Nov, 2020
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
2.1.21 Sep, 2020
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
2.1.128 May, 2020
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
2.1.028 May, 2020
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
2.0.02 May, 2020
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
1.5.230 Mar, 2020
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
1.5.114 Feb, 2020
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
1.5.014 Feb, 2020
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
1.4.119 Aug, 2019
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
1.4.019 Aug, 2019
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
1.3.016 Apr, 2019
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
1.2.227 Jul, 2017
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L

Automatically find and fix vulnerabilities affecting your projects. Snyk scans for vulnerabilities and provides fixes for free.

Get started free