On 31 Jul 2003, Luke Palmer wrote: > > It now runs amk's euclid.py perfectly now. > > Do we have a way to compare the speed vs python? :) > We just modify it to repeat 100,000 times or so, and compare that way.
Oh, duh. :) > Which I did. Parrot comes in about 3x slower than python on euclid. > From looking at the imcc code, though, I think it could be much much > better. No doubt. > One of my questions is, why do you make so many PerlNums when there > isn't a trace of a floating point number to be found...? Because I didn't read the docs that said PerlNum means "float". :) I'll switch it to PerlInt (or maybe int?) later... It's also using far more temporary variables than it needs. Right now I'm thinking that no matter how complicated the expression, it really only needs two extra registers: the result and a temporary variable, because all the operators are either unary or binary... I might try that after I get functions and classes working. > In any case, great work! :) thanks! Sincerely, Michal J Wallace Sabren Enterprises, Inc. ------------------------------------- contact: [EMAIL PROTECTED] hosting: http://www.cornerhost.com/ my site: http://www.withoutane.com/ --------------------------------------
