Difference between revisions of "Thread:User talk:Rednaxela/FastTrig/Faster normalXAngle -- faster sin,cos,tan/reply (8)"
Jump to navigation
Jump to search
Skilgannon (talk | contribs) (Reply to Faster normalXAngle --> faster sin,cos,tan) |
(No difference)
|
Latest revision as of 17:21, 8 April 2013
I generate a list of random numbers in an array and then time how long it takes for each of the functions to process the entire array in a loop. The result of each function I add to a running total, and I print the total at the end to make sure it doesn't get optimised away, and also to see how accurate they are. I could also calculate the overhead if I just add the results of the array, but I haven't tried that yet, and I think it might get optimised into SSE ops anyway.