It was thus said that the Great Jim Leonard once stated:
Sean Conner wrote:
It took me a few days, but I was finally able to
figure out the problem.
And no, it wasn't the code I wrote (in Perl or C) that was the problem.
Nor
the computer (slow as it was).
What was it?
Who ever compiled the regex library for that particular distro of Linux
must have used the "really dumb mode" of the compiler and not optimized it,
or it was optimized for an 80386 and not an 80486 or something. Now that
the server is back up and I'm reading the actual entry I made at the time:
http://boston.conman.org/2003/01/12.1
I see that it wasn't Perl but a *shell script* that was beating the
compiled program. And in the entry above, you can see what I went through
in figuring out the problem.
So it could be said that a program in an interpreted language could be
faster than a compiled program that does the same thing if the interpreter
is itself optimized and the compiled program isn't.
-spc (And really, when you get right down to it, isn't it all
turtles^H^H^H^H^H^H^Hinterpreters all the way down?)