13 releases
0.5.0 | Sep 30, 2022 |
---|---|
0.4.1 | Jan 6, 2021 |
0.4.0 | Sep 29, 2020 |
0.3.1 | Sep 24, 2020 |
0.1.4 | May 18, 2018 |
#62 in Data structures
64,312 downloads per month
Used in 24 crates
(17 directly)
80KB
890 lines
binary-heap-plus-rs
Enhancement over Rust's
std::collections::BinaryHeap
.
It supports the following heaps and still maintains backward compatibility.
- Max heap
- Use
BinaryHeap::new()
or::with_capacity()
- Use
- Min heap
- Use
BinaryHeap::new_min()
or::with_capacity_min()
- Use
- Heap ordered by closure
- Use
BinaryHeap::new_by()
or::with_capacity_by()
- Use
- Heap ordered by key generated by closure
- Use
BinaryHeap::new_by_key()
or::with_capacity_by_key()
- Use
Other notable added methods are:
BinaryHeap::from_vec_cmp()
andBinaryHeap::from_vec()
for more generic construction..into_iter_sorted()
which is less-surprising version of.into_iter()
. The implementation is backported fromstd
..replace_cmp()
which replace the comparator of the existing heap.
Compatibility and MSRV (Minimum Supported Rust Version)
This crate is based on the standard library's implementation of
BinaryHeap
from Rust 1.62.0.
The minimum supported Rust version is 1.56.0.
Changes
See CHANGELOG.md.
Thanks
- I received many valuable feedback from Pre-RFC thread [1].
- The current design is based on @ExpHP's suggestion that compiles on stable compiler.
- DDOtten, steven099, CAD97, ExpHP, scottmcm, Nemo157 and gnzlbg, thanks for looking into the design!
- @ulysseB sent me a first pull request!
- @inesseq contributed feature
serde1
. - @davidli2010 contributed comparator update and
unsafe
perf optimization.
References
See the following discussions for the background of the crate:
Dependencies
~195KB