Salut Laurent,
I totally agree, recursive fibonacci is not the most realwold routine, but
still I think it yields some significant data.
The benchmark will probably get some sequel, I will try then with an AOT
compilation, also maybe 0.7 will be out by that time, looking forward to it!
thanks fo
I forgot one more thing: you might want to try AOT compilation too, for even
better results.
$ macrubyc test.rb -o test
$ ./test
Laurent
On Sep 25, 2010, at 2:20 PM, Laurent Sansonetti wrote:
> Bonjour Louis-Philippe :)
>
> That's a cool micro-benchmark. I'm not sure if recursive arithmetic
Bonjour Louis-Philippe :)
That's a cool micro-benchmark. I'm not sure if recursive arithmetic algorithms
really represent the real world, but it's cool anyways.
If you remove the startup times from the final number you should see better
results for MacRuby. But I agree that the current MacRuby
Hi All,
I had fun building this benchmark which involves MacRuby:
http://www.untilnil.com/2010/09/recursivefibbench/
I think there might be some points of interest to MacRuby developers in
there.
L-P
___
MacRuby-devel mailing list
MacRuby-devel@lists.m
