-
Notifications
You must be signed in to change notification settings - Fork 52
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
Tracker: binary heaps #2067
Labels
Comments
anshumanmohan
added
C: Queues
One of the queue-style frontends
Type: Tracker
Track various tasks
labels
May 28, 2024
Does this issue have a PR or a branch? |
PR for the first task coming soon. My intention is to leave the other tasks for my BURE undergrads. |
Merged
@ethanuppal see #2074 if you're curious! |
11 tasks
This was referenced Jun 13, 2024
polybeandip
added a commit
that referenced
this issue
Jul 1, 2024
More progress towards #2067! This PR takes a stab at tweaking `docs/frontends/queues.md` to incorporate additions from PRs #2164 and #2174. --------- Co-authored-by: Anshuman Mohan <[email protected]>
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
#1999 motivates the need for a general PIFO. It also discusses a made-up strategy for implementing such a PIFO. It leaves on the table, however, another straightforward solution: binary heaps.
This is a tracker for the things we need.
push
es them into a min-heap ordered by value. Done via Queues: binary heap #2074push
a (value, rank) tuple ordered by rank. Done via Queues: extend binary heap #2145peek
andpop
functionality. Done via Queues: extend binary heap #2145Done via Queues: randomized testing for binary heaps #2174
Done via Queues: randomized testing for binary heaps #2174
The text was updated successfully, but these errors were encountered: