RoaringBitmap / RoaringBitmap/roaring
Or and Xor in-place functions should be optimized
Nobody has claimed this yet.
- Dominant language
- Go
- Stars
- 2.9k
- Forks
- 262
- Avg merge
- 2h 34m
- Merged PRs (30d)
- 8
Description
Currently, the binary And, Or, Xor and AndNot in-place functions do not attempt to do the computation in-place.
A genuine in-place implementation, as is available in the Java counterpart https://github.com/lemire/RoaringBitmap would use less memory and be faster in some instances (because it would avoid memory allocation and unnecessary copies).
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
Locate the binary And, Or, Xor, and AndNot in-place functions and read their current implementations first. Confirm the desired behavior against the Java RoaringBitmap counterpart linked in the issue; done means these operations genuinely reuse the destination where possible while preserving their results and avoiding unnecessary allocation or copying.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- go
- Domain
- performance
- Issue type
- Refactor
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100