|
|
|
|
|
by rao-v
12 days ago
|
|
I was thinking about just asking the compiler to do the expensive reshuffle when I need it to, but you could go further and expect the compiler to figure out the likely access pattern and spend the transformation budget. Heck memory is cheap (fine was cheap) give me a data structure that amortizes writes cleverly by maintaining both SoA and AoS at the same time |
|
How do you imagine it's possible to write to every SoA and every AoS and have that as cheap as only the first step?