Skip to content

Pop on binary heaps does not have constant time complexity. #19450

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.

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

Merged
merged 1 commit into from
Dec 2, 2014

Conversation

jbapple
Copy link

@jbapple jbapple commented Dec 2, 2014

pop calls siftdown, siftdown calls siftdown_range, and siftdown_range
loops on an index that can start as low as 0 and approximately doubles
each iteration.

pop calls siftdown, siftdown calls siftdown_range, and siftdown_range
loops on an index that can start as low as 0 and approximately doubles
each iteration.
@rust-highfive
Copy link
Contributor

Thanks for the pull request, and welcome! The Rust team is excited to review your changes, and you should hear from @brson (or someone else) soon.

@Gankra
Copy link
Contributor

Gankra commented Dec 2, 2014

Took me a while to process that this was a PR and not just an issue demanding O(1) pop. 🐫

bors added a commit that referenced this pull request Dec 2, 2014
pop calls siftdown, siftdown calls siftdown_range, and siftdown_range
loops on an index that can start as low as 0 and approximately doubles
each iteration.
@bors bors closed this Dec 2, 2014
@bors bors merged commit 0212dff into rust-lang:master Dec 2, 2014
lnicola pushed a commit to lnicola/rust that referenced this pull request Apr 28, 2025
minor: Simplify impl-ty parse validation
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

5 participants