JuliaCollections / JuliaCollections/DataStructures.jl
PriorityQueue tie breaking
Nobody has claimed this yet.
- Dominant language
- Julia
- Stars
- 745
- Forks
- 261
- PR merge metrics
- No merged PRs in 30d
Description
For some applications it would be helpful to be able to specify some sort of tie breaking scheme for a PriorityQueue. As far as I am aware, there is no such feature at the moment? E.g. for some applications I would like to retrieve the newest key if there are two keys with equal priority.
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
The issue names PriorityQueue but no file or test entry point. Start by locating the PriorityQueue implementation and its tests, then examine how equal-priority keys are handled and what interface could support a tie-breaking scheme such as selecting the newest key. Done means the behavior and its expected semantics are implemented and tested.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- julia
- Domain
- data
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100