We investigate how to make faster hash maps, trees, linked lists and vector of pointers by changing their data layout.

We investigate how to make faster hash maps, trees, linked lists and vector of pointers by changing their data layout.
We investigate the topic of premature optimizations, or more specifically, in what cases you want to think early about performance.