Howdy, I just ran another slight variant of this algorithm, which eschews Integer PMCs and just uses named integer registers via .local . Surprisingly. Parrot 1.3.0 sneaks just ahead of trunk (r42903) in this case.
http://gist.github.com/250132 Duke On Sun, Dec 6, 2009 at 12:25 AM, Jonathan Leto <[email protected]> wrote: > Howdy, > > Summary: EP #2 is to find the sum of the integers less than 1000 which > are divisible by 3 or 5. > > This benchmark is simple, with no function calls and only simple > Integer PMCs being created, with a few mod, inc and add ops going on. > Trunk (r42903) is the fastest ever. Great job, people! > > http://gist.github.com/250129 > > Duke > > > -- > Jonathan "Duke" Leto > [email protected] > http://leto.net > -- Jonathan "Duke" Leto [email protected] http://leto.net _______________________________________________ http://lists.parrot.org/mailman/listinfo/parrot-dev
