Re: NQP JVM prototype faster than Perl 5

2013-02-02 Thread Matthew Wilson
Did you mean to use $z in the say output of the nqp and perl versions of the microbenchmark, or did you mean to run it twice? On Sat, Feb 2, 2013 at 10:43 AM, Nicholas Clark wrote: > This is surprising, interesting and pleasing... > > There's some example NQP code to time calculating Fibonacci

NQP JVM prototype faster than Perl 5

2013-02-02 Thread Nicholas Clark
This is surprising, interesting and pleasing... There's some example NQP code to time calculating Fibonacci sequences. I've tweaked it a tiny bit to take an optional count on the command line. Unfortunately the NQP JVM prototype doesn't yet set @ARGS, so this isn't that useful. Anyway, the code i