RoaringBitmap / RoaringBitmap/roaring
Try a branchless approach for the union of two sorted arrays (array containers)
Open
Nobody has claimed this yet.
performance
- Dominant language
- Go
- Stars
- 2.9k
- Forks
- 262
- Avg merge
- 2h 34m
- Merged PRs (30d)
- 8
Description
See blog post Faster sorted array unions by reducing branches
Related to PR https://github.com/RoaringBitmap/roaring/pull/301
credit @puzpuzpuz
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 reading the linked blog post and related PR #301, then locate the array-container union implementation in the repository. Compare the proposed branchless approach with the current behavior and verify that the union remains correct while assessing whether the change improves performance.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- go
- Domain
- performance
- Issue type
- Refactor
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 30/100