Greg Ewing <greg at cosc.canterbury.ac.nz> writes:
>> It struck me with force when I was looking at Perl's version of an
>> adaptive mergesort last year, and got jealous of how much shorter and
>> clearer the C code could be when every stinkin' call didn't have to be
>> followed by an error test-and-branch.
>
> Rewrite they Python core in Pyrex.
That wouldn't alleviate the runtime cost, would it?
Maybe one day this sort of fundamental rearrangement will be easier to
play with, thanks to PyPy.
Cheers,
mwh
(who has some similarly impractical ideas about memory management...)
--
If i don't understand lisp, it would be wise to not bray about
how lisp is stupid or otherwise criticize, because my stupidity
would be archived and open for all in the know to see.
-- Xah, comp.lang.lisp
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4