RoaringBitmap / RoaringBitmap/roaring
ContainsRange ?
Nobody has claimed this yet.
- Dominant language
- Go
- Stars
- 2.9k
- Forks
- 262
- Avg merge
- 2h 34m
- Merged PRs (30d)
- 8
Description
I was trying to use roaring.Bitmap in place of an interval tree when I dont want to recover the interval, I just want to see if there's overlap.
This works OK, but suffers because I have to either run Contains for each base in my query interval or to create a new Bitmap for each query interval and then use AddRange and then Intersects
a ContainsRange, could have several optimizations to this to extend the use-cases of the roaring bitmap.
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 existing Bitmap Contains, AddRange, and Intersects APIs first, and determine the intended range-boundary behavior from their current semantics. The issue is complete when a ContainsRange API supports overlap checks without per-value iteration or constructing a temporary bitmap, with focused coverage for the supported cases.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- go
- Domain
- backend
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100