Mario Rugiero
Mario Rugiero
AFAIK you don't visit keys more than once with this approach. The sorting is just to exit before going through them all, but I don't think it makes much of...
I have an implementation that passes tests. However, I don't think it's the best code in terms of readability and I haven't written the benchmarks yet (there's none for `FastAnd`)....
I think it's related enough to mention it tho. This implementation uses the shotgun search approach to skip irrelevant containers.
It'd be nice to also refactor the normal cardinality computation as cardinality of range [0, (1
But probably applies for the containers' implementations.
Have we tried changing only the `New` function? I have the suspicion for the most part it's not about not passing pointers but about the escape analysis failing us, thus...
Yeah, I don't remember the flags but it's quite trivial. What I thought was either making a copy of the output in the same line (the object becomes unreachable, hopefully...
In any case, the change I propose is easy to try, and I only need the escape analysis output. I'll see if I can do it soon.
Would it help to reuse CRoaring's frozen bitmap format?
Right. I thought it was a format issue, that's why I suggested just recycling the old one instead of creating a new one. So it's just implementing a new load?