On Sun, 26 Mar 2006 15:36:29 +0200 steven mestdagh <steven_(_dot_)_mestdagh_(_at_)_esat_(_dot_)_kuleuven_(_dot_)_be> wrote: > Jasper Lievisse Adriaanse [2006-03-25, 15:28:59]: > > DESCR: Math::Prime::XS calculates/detects prime numbers by either applying > > Modulo operator division, the Sieve of Eratosthenes, Trial division or a > > Summing calculation. > > > > Tested on alpha, i386 and sgi. > > > > Port is attached and at > > http://nedbsd.nl/~jasper/obsd/ports/p5-Math-Prime-XS.tgz > > > > Please test and comment. > > the following gives me a SIGSEGV. the backtrace points to XS.xs line 93. > > use Math::Prime::XS qw(primes is_prime); > @allprimes = primes(1e6); i see that yes. this does work though: @allprimes = primes(1e5); i'll have a more closer look at it. > > steven jasper > > Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm > -- Humppa is a serious thing!
Description: PGP signature