Timeline for Java map generation
Current License: CC BY-SA 3.0
5 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jan 18, 2016 at 21:07 | comment | added | PRDeving | The difference is apreciable since you set a 2^2 map, but, if you set a 2048^2 map f.e. you can see how performance drops, won't be a big dropdown but its there, and added to other performance issues, could steal some fps to your final product | |
Jan 18, 2016 at 21:03 | comment | added | Draco18s no longer trusts SE | Ay what sufficiently large values of huge are you referring to? That is: how large does the array need to be before the performance makes a noticeable impact? | |
Jan 18, 2016 at 20:59 | comment | added | PRDeving | If you want to store an 8bit integer for cell in a 255^2 map the memory usage and performance will be near the same in a 1D or a 2D array, but in a bigger maps (I mean, huge), the performance will decrease in a 2D array, iterations over large 1D arrays are more efficient than looping through dimensions | |
Jan 18, 2016 at 18:17 | comment | added | Draco18s no longer trusts SE |
While 1D works 2D is easier on the developer in terms of actual code. It's a lot easier to write [x][y] than to write [x +(y*width)] and the performance impact is exceedingly minimal.
|
|
Jan 18, 2016 at 18:11 | history | answered | PRDeving | CC BY-SA 3.0 |