priority-queue-rs
v0.1.26 GrowingPriority Queue is more specialized data structure than Queue. Like ordinary queue, priority queue has same method but with a major difference. In Priority queue items are ordered by key value so that item with the lowest value of key is at front and item with the highest value of key is at rear or vice versa. So we're assigned priority to item based on its key value. Lower the value, higher the priority. Following are the principal methods of a Priority Queue.
Quick Verdict
- ✕Not updated for 4+ years
- !Pre-1.0: API may have breaking changes
- ✓Tiny footprint (3KB, 0 deps)
- ✓Permissive license (MIT)
Security
Deep Insights
28 downloads in the last 30 days (1/day), up 17% from the previous period.
Despite being 4+ years old, priority-queue-rs hasn't reached 1.0 yet. Expect potential API changes between versions.
priority-queue-rs has no external dependencies — minimal supply chain risk and fast compile times.
At 3KB, priority-queue-rs is lightweight. Small crate size correlates with focused, well-scoped functionality.
Health Breakdown
Recency, release consistency, active ratio
Yanked ratio, deps, size, maturity, features
Reverse deps, ownership, ecosystem
Downloads, momentum, growth trend
Docs, repo, license, metadata
