[Python-Dev] Pie-thon benchmarks (original) (raw)

Dan Sugalski dan at sidhe.org
Mon Dec 15 13:49:36 EST 2003

At 11:05 AM -0500 12/15/03, Tim Peters wrote:

[Michael Hudson]

If something important -- like a pieing -- depends on it, and the ints are long enough, it's not that hard to do better than Karatsuba multiplication... "Not that hard" depends on your background. The idea is to bury Dan under esoteric algorithms from a huge number of obscure specialties .

Heh. You're expecting me to do far too much work. I plan on tackling bytecode optimization only if it turns out that a straightforward transform from python bytecode to parrot bytecode is isn't sufficiently faster than CPython. Funky algorithms expressed entirely in python bytecode won't make much of a difference...

                                     Dan

--------------------------------------"it's like this"------------------- Dan Sugalski even samurai dan at sidhe.org have teddy bears and even teddy bears get drunk

More information about the Python-Dev mailing list