roaring-rs
roaring-rs copied to clipboard
RoaringBitmap
A better compressed bitset in Rust
let _B1_, _B2_ = some roaring bitmaps let _N1_ = number of containers in B1 let _N2_ = number of containers in B2 Currently binary operations such as _B1 |...
[Cow](https://doc.rust-lang.org/std/borrow/enum.Cow.html) would allow optimizations that borrow containers. For a trivial example. Imagine an `|` operation over two containers whose containers are disjoint. I think the best design for this would...
Closes #58 Closes #109 Fixes #57 Adds operators to iterators of bitmaps # TODO - [ ] Treemap ops - [ ] Tests - [ ] Examples in docs
Most of the Array-Array operations use a two pointer walk. I think there may be gains to be had from "galloping" while merging. To my knowledge this is a novel...
Allow users to trim any variably sized containers similar to https://doc.rust-lang.org/std/vec/struct.Vec.html#method.shrink_to_fit
It would be useful to have built-in serde support for storing and retrieving bitmaps from this library. Could the existing serialization functions be used to implement this efficiently?
The java impl contains a `ReadOnlyRoaringBitmap` that can be backed by a byte buffer. Is there any interest in including a Roaring bitmap that's backed by a borrowed byte slice...
Fixes #45. This is a first draft, we could maybe implement some kind of wrapper or helping method to update the `RoaringBitmap` length more easily. It is currently based on...
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...
