RoaringBitmap / RoaringBitmap/CRoaring
Avoid unnecessary heap allocations
Nobody has claimed this yet.
- Dominant language
- C
- Stars
- 1.9k
- Forks
- 334
- Avg merge
- 2d 5h
- Merged PRs (30d)
- 17
Description
Generally, CRoaring does far too many heap allocations. This slows down the code in some instances, and it can make it more fragile.
In many instances, especially when computing intersections, we generate empty containers that are immediately garbage collected.
There are clever tricks we could use to start scanning the input containers, advance up to the point where there might be values to be intersected, and bail out without generating an empty container if the intersection is empty.
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 tracing the intersection operations described in the issue and measuring where empty containers are allocated and immediately discarded. Compare allocation counts and performance before and after any focused change, and verify that empty intersections still produce the correct result. The issue names no specific files or tests, so the relevant implementation and validation paths must first be located.
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