Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Implement contains_range / range_cardinality functions #235

Closed
apps4uco opened this issue Aug 27, 2022 · 0 comments · Fixed by #237
Closed

Implement contains_range / range_cardinality functions #235

apps4uco opened this issue Aug 27, 2022 · 0 comments · Fixed by #237

Comments

@apps4uco
Copy link

Thanks for the all the work put in.

For my use case I want to test if there is anything set in a given range.

I know I could use rank of upper bound and subtract rank of lower bound
or create a bit set of the range and then call intersection_len
however both these options presumably will be slower than an optimized single call.

I see the java library has methods to get these results.

Would it be possible to implement these methods?
@Dr-Emann Dr-Emann mentioned this issue Aug 29, 2022
Merged
@bors bors bot closed this as completed in 6ec322f Aug 31, 2022
not-jan pushed a commit to not-jan/roaring-rs that referenced this issue Aug 31, 2022
@bors @Dr-Emann
Merge RoaringBitmap#237
996675b 
237: contains_range / range_cardinality functions r=Kerollmops a=Dr-Emann

Fixes RoaringBitmap#235 

Co-authored-by: Zachary Dremann <[email protected]>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging a pull request may close this issue.

contains_range / range_cardinality functions
1 participant
@apps4uco