Make queues more compact
Open
Nobody has claimed this yet.
performance
- Dominant language
- Haskell
- Stars
- 17
- Forks
- 12
- PR merge metrics
- No merged PRs in 30d
Description
For simple queues, the obvious place to start is something like
newtype Zero k = Zero k
For key-value queues, we could start by storing multiple entries in the leaves.
The next potential step would be switching from binomial queues to 3-nomial or even 4-nomial queues.
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 comparing the proposed representation for simple queues using newtype Zero k = Zero k with storing multiple entries in key-value queue leaves. Then evaluate the possible shift from binomial queues to 3-nomial or 4-nomial queues; done requires choosing and specifying a concrete approach for making queues more compact.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- haskell
- Domain
- backend
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100