Re: A problem with Math::Prime::XS
- From: Ilya Zakharevich <nospam-abuse@xxxxxxxxx>
- Date: Thu, 16 Feb 2006 04:10:07 +0000 (UTC)
[A complimentary Cc of this posting was sent to
Tassilo v. Parseval
<tassilo.von.parseval@xxxxxxxxxxxxxx>], who wrote in article <45erkeF6esajU1@xxxxxxxxxxxxxx>:
INIT:
long primes[number], psum[number];
long i, n, pcount, square_root;
bool is_prime;
For your input of 1234567, this will try to create two arrays 'primes'
and 'psum' of longs, each 1234567 elements long on the stack!
Wow? Is it in C99, or what?
Thank,
Ilya
.
- Follow-Ups:
- Re: A problem with Math::Prime::XS
- From: Tassilo v. Parseval
- Re: A problem with Math::Prime::XS
- References:
- A problem with Math::Prime::XS
- From: ofer
- Re: A problem with Math::Prime::XS
- From: Tassilo v. Parseval
- A problem with Math::Prime::XS
- Prev by Date: Re: win32::SerialPort are_match just won't work
- Next by Date: Re: NET::Telnet
- Previous by thread: Re: A problem with Math::Prime::XS
- Next by thread: Re: A problem with Math::Prime::XS
- Index(es):
Relevant Pages
|
|