Offer untopped queues
Nobody has claimed this yet.
- Dominant language
- Haskell
- Stars
- 17
- Forks
- 12
- PR merge metrics
- No merged PRs in 30d
Description
`BinomHeap` can easily be wrapped up in a `newtype` to offer basic binomial queues that don't track size and don't store the minimal entry separately. For some applications, such as heapsort, this should be significantly more efficient. Let's do it.
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
Start by locating the BinomHeap implementation and the existing priority-queue API. Compare how size and the minimal entry are currently tracked, then determine the public shape of a newtype wrapper for queues without those fields. Done means the basic binomial queue API exists and remains usable for applications such as heapsort, with appropriate tests for its operations.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- haskell
- Domain
- backend
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100