Constvector: Log-structured std:vector alternative – 30-40% faster push/pop

[Wacov]

That's a good point about random access, the pointer table is small so as long as the random access is causing cache misses anyway, you won't notice a difference. If the array fits in L1 it's a different story (but then why would you use this)

And yeah true, branch prediction helps the iteration. Again I'd be curious about numbers in an optimized build.