RoaringBitmap / RoaringBitmap/CRoaring
Try a branchless approach for the union of two sorted arrays (array containers)
Open
Nobody has claimed this yet.
- Dominant language
- C
- Stars
- 1.9k
- Forks
- 334
- Avg merge
- 2d 5h
- Merged PRs (30d)
- 17
Description
See blog post Faster sorted array unions by reducing branches
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
Read the linked blog post first, then locate the array-container implementation for the union of two sorted arrays. Determine how a branchless approach would fit the existing behavior and how its performance would be evaluated. Done means the approach is implemented and its correctness and performance are demonstrated.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- c
- Domain
- performance
- Issue type
- Refactor
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100