A min-max heap in Rust. Useful for efficient top-n, capped priority queues, etc.
If you need just a basic max heap, you're looking for std::collections::PriorityQueue.
A min-max heap in Rust. Useful for efficient top-n, capped priority queues, etc.
If you need just a basic max heap, you're looking for std::collections::PriorityQueue.