roaring

roaring copied to clipboard

https://github.com/RoaringBitmap/RoaringBitmap/pull/133

lemire

currently these functions are just stubbed out. Once implemented, the whole lazy combination system could be groomed and tuned.

glycerine

(code might give the impression of possible) integer overflows in binary search

8

Both the C and the java binary search implementations are subject to a classic integer overflow bug in binary search; e.g. at https://github.com/RoaringBitmap/CRoaring/blob/master/include/roaring/containers/run.h#L91 instead of int32_t middleIndex = (low +...

glycerine

https://docs.google.com/document/d/1e8kOo3r51b2BWtTs_1uADIA5djfXhPT36s6eHVRIvaU/edit

lemire

ContainsRange ?

4

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...

brentp

HICAMP Bitmaps, any inspiration

4

I ran across a paper about HICAMP Bitmaps from folks at Stanford, and wondered if there were any good ideas to be learned from it. http://web.stanford.edu/~hlitz/papers/a7-wang.pdf

glycerine

The Java version contains many more optimizations...

lemire

Implement a fast "IsSubset" comparison function between bitmaps... It is already implemented in the C version of Roaring... https://github.com/RoaringBitmap/CRoaring/commit/91390da961546afcaa7a89b4fbc01b8039520e22

lemire

Our coverage is below 90%

12

More testing is needed: https://gocover.io/github.com/RoaringBitmap/roaring

lemire

Iterate over the unset bits

5

It should be possible to iterate over the unset bits.

lemire