Code Optimisation: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 7: | Line 7: | ||
==Loops== | ==Loops== | ||
These first two loop types are identical in speed, | These first two loop types are identical in speed (+/- 10%), and are more than 2x as fast the proceeding two loop types. | ||
*"_y" from 0 to (count [0,0,0,0] - 1) step 1 do { ... }; | *"_y" from 0 to (count [0,0,0,0] - 1) step 1 do { ... }; | ||
Revision as of 22:39, 20 January 2010
Adding elements to an array
- set is 56x faster than binary addition (_a set [count _a,_v] vs _a = _a + [_v])
Getting position
Loops
These first two loop types are identical in speed (+/- 10%), and are more than 2x as fast the proceeding two loop types.
- "_y" from 0 to (count [0,0,0,0] - 1) step 1 do { ... };
- { ... } foreach [0,0,0,0];
Where as these two loops are much slower, and for maximum performance, avoided.
- _y=0; while {_y = _y + 1; _y < count [0,0,0,0]} do { ... };
- for [{_y=0},{_y<(count [0,0,0,0])},{_y=_y+1}] do { ... }