Would have to agree, common data structures like linked lists and maps can't really be easily composed into this sort of sequential layout as required, and the main advantages only come about when you're searching through the data for something.
The other data we process a lot of is strings which are commonly variable in length and scattered around in separate mem allocations.
Still, the performance difference between the 2 examples was eye-opening so I'll definitely spend a bit of time looking at Data-Oriented Design book for some ideas.
The other data we process a lot of is strings which are commonly variable in length and scattered around in separate mem allocations.
Still, the performance difference between the 2 examples was eye-opening so I'll definitely spend a bit of time looking at Data-Oriented Design book for some ideas.