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.
68%
Total Score
50
100
89
67
The repository is owned by an individual account rather than an organization, so the project appears to rely on a narrow ownership base; this is a modest continuity concern, not evidence of abandonment by itself.
The package is mature at over nine years old with 24 releases, but only one release occurred in the last 12 months, indicating a slower recent cadence.
The repository recorded zero commits and zero active maintainers in the last three months, a concrete sign of recently slowed maintenance.
The project uses TypeScript, Rollup, and npm scripts, but no security scanning tools were detected, leaving a modest transparency and maintenance gap.
The repository has no security policy, so there is no documented process for reporting or handling vulnerabilities.
We didn't find any vulnerabilities for this package.
No direct dependencies.
Connect your repositories to instantly see whether vulnerable or malicious packages exist in your codebase.
Free. No credit card required.

I consent to receiving marketing communications based on Aikido’s Privacy Policy.
SOC 2Compliant
ISO 27001Compliant
ISO 42001Compliant© All Intel data is openly available and commercially licensed.