That said, yes, restrict was added for this kind of thing.
I'm sure he cackled into his pocket protector at the recent PHP/Java/gcc floating point parsing fiasco.
Unfortunately, "Am I FORTRAN?" is the question that goes hand in hand with "Am I realistic for scientific computing".
c'est la vie.
500 0.07 0.22
3,000 2.34 2.41
5,500 7.86 8.01
Intel Fortran
http://shootout.alioth.debian.org/u32/performance.php?test=s...
I mean, if I could really get C performance out of SBCL (and for my purposes, I can't), I'd sure as hell want to know.
Think cold fusion. Sure, "wolf" has been cried a lot of times, but you're still going to want to know as soon as it happens "for real".
If someone could show me that "yes, your Python programs are now AS FAST AS C!" then of course I'd be ecstatic to hear that; but the posts letting me know that "Python is as fast as C when approximating solutions to problem X, for some X you've never heard of and never will" get kind of old after the 137th time I read them.
For me this is comparable to someone posting about yet another problem in NP that is REALLY FRICKIN' HARD, so probably P=/=NP. I know many problems in NP are hard - you're not adding anything to the discussion by showing me yet another one. Let me know when you have an actual proof that P=/=NP.
[1] http://shootout.alioth.debian.org/u32/program.php?test=spect...
[2] http://shootout.alioth.debian.org/u32/program.php?test=spect...
If I can write my entire program in LANGUAGEX and just compile the inner loop a magic way and voila, the program runs at 85% C speed, we have a winner. We can use it in long-running programs which have a fierce compute time bounding.
This is an article explaining the magic way for a flavor of lisp.
The decent ones posted at least bother to do a comparison with several pseudo-representative tasks. This one just goes "hey, I played around with this ONE SPECIFIC TASK NOBODY GIVES A CRAP ABOUT and IT RAN 0.006 MILLISECONDS FASTER THAN IN C! WOOOOOOOOOOOO!"