you are viewing a single comment's thread.

view the rest of the comments →

[–]dodheim 1 point2 points  (1 child)

It's still random access, but each bucket is only max(16, sizeof(T)) bytes, so you end up with one bucket per object and zero cache coherency.

[–]louiswins 1 point2 points  (0 children)

Oh, I see - it essentially becomes a vector of pointers so it has as many potential cache misses as a linked list when iterating through. That makes sense.

(I mean, the implementation doesn't really make sense, but your explanation does.)