- Original Message -
From: "David Oswald"
I've also taken Dana's suggestion and used unsigned longs internally
(and longs as parameters). This allows Perl's built with long support
to handle (theoretically) sieves up to 9.2e18. ( 2^64 / 2 --- if we
were passing unsigned longs as par
Thanks to some great patches from Dana Jacobsen (and some version
numbering snafu from me), we have arrived at Math::Prime::FastSieve
v0.12.
Don't bother with v0.11 (I uploaded with inconsistent version numbering).
v0.12 provides the following enhancements over v0.10:
The prime sieve's bit vecto
