ANN: Pyrex - a language for writing Python extension modules

[Boris Borcic]

David Eppstein wrote:

> In article <3CB13147.89F02706 at cosc.canterbury.ac.nz>,
>  Greg Ewing <greg at cosc.canterbury.ac.nz> wrote:
> 
>>The point of the example isn't to show how to find prime numbers 
>>quickly. It's just a representative CPU-intensive task that 
>>demonstrates what Pyrex can achieve. Using a more efficient algorithm 
>>wouldn't make that point any more effectively.
>>
> 
> But I think your example makes a different point even more effectively:


If such was true, the different point would not need explicitation.
Frankly I feel you are being overly pedantic. While the sieve is 
efficient, it's neither secret magic nor particularly readable as an 
expression of the definition of prime numbers. And I do feel Greg's 
efforts deserve more relevant feedback.

Regards, Boris Borcic
--
python >>> filter(lambda W : W not in "ILLITERATE","BULLSHIT")