Daniel Lemire comments

Results 1864 comments of


                                            Daniel Lemire

Heuristic for a faster contains

Hopefully, you are not computing the intersection between two bitmaps using "contains" calls? Yes, I have worked on the intersection of sorted arrays... see for example... * [SIMD Compression and...

Datastructures passed around components (Enc,SP,TP,TM,Anom,Classif) must use same type

Sorry. I somehow only realize now that I was pinged on this. Since I do not know enough about the application at hand it is hard for me to comment...

Datastructures passed around components (Enc,SP,TP,TM,Anom,Classif) must use same type

If you do have a benchmark, with actual data, I'll be glad to have a look if you want.

Prototype Roaring Bitmap Usage as SDR impls and later Matrix ops

Saw the code. Will get back to you.

Prototype Roaring Bitmap Usage as SDR impls and later Matrix ops

Good. Please note that `RoaringBitmap.bitmapOf` is quite happy with unsorted data. Here is what the spec. says right now: > The provided integers values don't have to be in sorted...

Prototype Roaring Bitmap Usage as SDR impls and later Matrix ops

Yes. Looks ok.

Ability to set the line separator for the final file

That’s reasonable. Please submit a pull request!

Randomizer

Yes. The sort of the blocks should become a shuffle and then we need some slightly tricky merge process (not hard but it needs to be done well). If you...

Randomizer

@tkram01 Great. So I suggest you start by forking the project. Create a new class that looks like the existing sorted, give it a good name. Then ping me (just...