Daniel Lemire

icon indicating a website link http://lemire.me/en/ icon indicating an email [email protected]

icon company Université du Québec (TELUQ) icon location Montreal, Quebec, Canada icon location Daniel Lemire is a computer science professor. His research is on software performance in data engineering.

Results 1864 comments of Daniel Lemire

Performance: RoaringIntIterator#advanceIfNeeded

Indeed. The code could be faster in such cases.

Avoid unnecessary container allocations

I will document it better soon.

Avoid unnecessary container allocations

Sorry for the delay. Here are code samples that could be improved: ``` final Container c1 = x1.highLowContainer.getContainerAtIndex(pos1); final Container c2 = x2.highLowContainer.getContainerAtIndex(pos2); final Container c = c1.and(c2); if (c.getCardinality()...

Avoid unnecessary container allocations

@richardstartin Indeed. So there are multiple opportunities for optimization.

Avoid unnecessary container allocations

@richardstartin For clarity I turned your point into a distinct issue: https://github.com/RoaringBitmap/RoaringBitmap/issues/239

Avoid unnecessary container allocations

@richardstartin wrote: > I’d be tempted to verify the container isn’t scalarised before optimising this. If you get a significantly worse result and different allocation rates from -prof gc when...

Avoid unnecessary container allocations

@ppiotrow This does not sound bad. It might work!

Avoid unnecessary container allocations

@richardstartin That's possible too.

Question/advice: iterating over an a.and(b) bitmap whilst keeping ranks of elements from 'a'

> It seems having two running iterators might be the 'best' way to do this? I would not call this approach "minimum overhead". Using iterators brings about a lot of...

Support PositiveIntIterator

@leventov This is valid code in Roaring: ``` RoaringBitmap rb = new RoaringBitmap(); rb.add(0, 1L