On 12/13/04 Martin Hansen wrote:
> > > for ( int n=0; n<=(1000* 1000 * 1000) ;n+=1 )
> > > {
> > > sum *= 1.0;
> > > }
> <cut>
> > Not meaning to flame but isn't that test a bit of a no brainer for
> > performance issues, I mean its simply an aggressive loop that
> > will take
> > any langugage / platform a while to work through
> No there is some obvius places for an optimizer. Whithout any
Yep, we should remove mul by 1.0 (and also change mul by 2.0 with an
addition, for example).
That said, as you point out, that benchmark is not one of the
most useful ones:-)
lupus
--
-----------------------------------------------------------------
[EMAIL PROTECTED] debian/rules
[EMAIL PROTECTED] Monkeys do it better
_______________________________________________
Mono-list maillist - [EMAIL PROTECTED]
http://lists.ximian.com/mailman/listinfo/mono-list
