tag:blogger.com,1999:blog-8378574.post109793099210551504..comments2023-04-13T03:57:37.221-04:00Comments on Croquet: Flag Time to RunDavid A. Smithhttp://www.blogger.com/profile/08378620295464558412noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-8378574.post-1098015024061136812004-10-17T08:10:00.000-04:002004-10-17T08:10:00.000-04:00Yes, you are right. I should have thought that we ...Yes, you are right. I should have thought that we would have such a method somewhere. The updated numbers look like:<br /><br />[1000 timesRepeat:[tf step]]timeToRun 8473<br />[1000 timesRepeat:[tt testCompute]]timeToRun 9009<br /><br />This is after removing some additional unused calculations.David A. Smithhttps://www.blogger.com/profile/08378620295464558412noreply@blogger.comtag:blogger.com,1999:blog-8378574.post-1098014349708997902004-10-17T07:59:00.000-04:002004-10-17T07:59:00.000-04:00Well, one obvious thing to optimize would be to *n...Well, one obvious thing to optimize would be to *not* calculate the vector's length twice in your "improved" B3DVector3>>normalized method ;-)<br />Actually, IMHO you should have used the existing #safelyNormalize(d?) method. Which of course could also be improved a teensy bit by using lengthSquared and doing the square root only if necessary.<br /><br />- Bert -Anonymousnoreply@blogger.com