RoaringBitmap / RoaringBitmap/roaring-rs
Heuristic for a faster contains
Nobody has claimed this yet.
- Dominant language
- Rust
- Stars
- 957
- Forks
- 119
- Avg merge
- 3d 3h
- Merged PRs (30d)
- 1
Description
Hello and thank you for creating this library.
I wanted to ask you if the contains operation could be made faster by pre-computing while building the bitmap the minimum and maximum value and before executing the binary search first check if the given value is within the min-max range.
If this is reasonable I will proceed to implement it and send a pull request.
Best,
Luca
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 locating the contains operation and the bitmap-building entry point in the Rust library, then review the issue's existing discussion before deciding whether the heuristic is appropriate. Done means the proposed min-max optimization is evaluated and its behavior is covered by the relevant tests or benchmarks.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- data
- Issue type
- Feature
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 38/100