Adam Stylinski

So, putting on some exploit mitigation goggles, I do worry about this one a tiny bit: > While doing alloc(), we now store pointer to corresponding free(), avoiding crashes with...

Sorry I realize some of this was poorly articulated. Looking at the code now, I see it's set in the strm struct, not per allocation as I had anticipated based...

I'm sure this project never made the claim, I just recall Phoronix touting something like a 10x gain when numpy used it in place of std::sort. I'm sure there'll be...

I had tried that initially to try to get 32 bit values for indices and it wasn't working for me correctly for whatever reason. I didn't try it with size_t...

Yes, last commit I was trying against was: d9c97379049cd549d5e386849d744c31f21a2f83 And it was wrong, and not wrong because it was unstable, but something very wonky. I'm computing a voxelization index and...

Yeah, even with signed 32 bit types for the index I'm getting 4 unique voxel nodes instead of 47198 like there should be for this particular set of arguments. Also...

If you can't reproduce this issue with random data I can gladly provide you this data in ascii since it's just indices, but it's going to be about 123 million...

numVals == ~103 million, which is certainly smaller than the 2.5ish billion value of UINT32_MAX. Like I said before, I switched around vals and idxs in case I was confusing...

> Also, I am assuming vals is a copy of your data because the key-value sort will sort both vals and idxs arrays. In this circumstance it's ok to be...

Ok, yeah that was it. Thanks for the tip. Here's the timing: `radix sort time: 3825.987119, kvSort time = 4555.936716` So radix sort is still winning there by a fair...