Skip to content

Documented BinaryHeap performance. #59698

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 5 commits into from
Closed

Documented BinaryHeap performance. #59698

Changes from all commits
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
b2ff5ed
Documented BinaryHeap performance.
Apr 4, 2019
2920719
Break documentation at the right place.
Apr 5, 2019
dd35395
Rephrased the performance details of BinaryHeap.
Apr 9, 2019
4b82287
Rephrased the documentation of BinaryHeap.
Apr 20, 2019
20a5586
Update src/liballoc/collections/binary_heap.rs
mzji May 4, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 4 additions & 0 deletions src/liballoc/collections/binary_heap.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -165,6 +165,10 @@ use super::SpecExtend;
/// trait, changes while it is in the heap. This is normally only possible
/// through `Cell`, `RefCell`, global state, I/O, or unsafe code.
///
/// The costs of `push` and `pop` and `peek` can be performed in `O(1)` time.
/// Note that these are non-amortized costs. The amortized cost for `push`
/// and `pop` are `O(log(N))` due to re-allocations and maintaining the heap property.
///
/// # Examples
///
/// ```
Expand Down