Daniel Lemire

I think we could support functions such as... - `roaring_bitmap_and_inplace_range(a, b, start, end)` - `roaring_bitmap_andnot_inplace_range(a, b, start, end)` - `roaring_bitmap_or_inplace_range(a, b, start, end)` - `roaring_bitmap_xor_inplace_range(a, b, start, end)` > would...

Right. So it is a non-trivial amount of work, for sure!!! My argument is that once you get started, it is not much more effort to do a symmetrical work....

Bitmaps are made of containers, these individual containers can be shared between bitmaps, or moved from one bitmap to another. And some users use memory-file mapping. So we would need...

No, we do not offer this functionality. The reverse is supported, however: ```C++ bool roaring_bitmap_to_bitset(const roaring_bitmap_t *r, bitset_t * bitset); ``` An implementation would not be very difficult. Pull request...

It is not a difficult problem, one just needs to flip the bytes around.

I need to write a better benchmark harness for this project. Give me a bit of time.

The benchmarks that come with the library were always so-so. I wrote most of them very quickly and we did not rely on them to optimize the library. We should...

Note that my PR will come 'soon'. (Not weeks or months.)

@huihan365 @CharlesChen888 Have a look at PR https://github.com/RoaringBitmap/CRoaring/pull/460 I will merge it as soon as the tests are green. This gives you a much better way to benchmark the code....

Ok. I merged the PR and we now have sensible benchmarks with Google Benchmarks. The instructions are... # Running microbenchmarks We have microbenchmarks constructed with the Google Benchmarks. Under Linux...