11–20 of 103 posts
There are a few talks like this, but there is one in particular where he goes into a lot of detail about it. I can't for the life of me find it again.
Anyone have a link to Alan Kay's talk, where he demos UIs and a compiler for UIs in ridiculously small # lines of code? There are a few talks like this, but there is one in particular where he goes into a lot of detail about it. I can't for the life of me find it again.
> Iterating over a two dimensional array by row is much faster than by column. Another fun fact is staggering array accesses is faster then linear acesses.
I wonder if this is language or even compiler dependent. Are there things that transpose memory organization? I for one always get confused which index is the row and which is the column when coding. Every damn time I've done a 2D iteration in the last 15+ years. Is it [col][row] or [row][col] ... I imagine it depends.
It would be interesting with some more analysis from the OP, namely what was learned that changed their thinking, and how their thinking was changed.
Fun to see Eskil (there's a typo but that's how you spell it) on here, that talk isn't very old. It would be interesting with some more analysis from the OP, namely what was learned that changed their thinking, and how their thinking was changed.
> Iterating over a two dimensional array by row is much faster than by column. Another fun fact is staggering array accesses is faster then linear acesses.
Can someone elaborate on this? I tried searching and wasn't having any luck. I always thought sequential linear access was fastest?
> Iterating over a two dimensional array by row is much faster than by column. Another fun fact is staggering array accesses is faster then linear acesses.
Can someone elaborate on this? I tried searching and wasn't having any luck. I always thought sequential linear access was fastest?