Speed up fromList
Nobody has claimed this yet.
- Dominant language
- Haskell
- Stars
- 17
- Forks
- 12
- PR merge metrics
- No merged PRs in 30d
Description
`fromList` creates a bunch of churn at the root of the structure. If we give up on list fusion (which only helps when the argument is a good producer, and doesn't help enough), we can easily built a forest from chunks of, say, eight elements each. Then just finish up the job. When the argument *is* a good producer, we could try to fuse with it a bit more cleverly; I'm not sure how far the optimizer will let us take that.
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 `fromList` implementation and tracing how it builds the priority-queue structure. Measure its current behavior, then evaluate the proposed chunked-forest approach and whether list fusion needs separate treatment. Done means the implementation is measurably faster without changing `fromList` behavior.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- haskell
- Domain
- performance
- Issue type
- Refactor
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 30/100