Math::Prime::Util version 0.09
A set of utilities related to prime numbers. These include multiple sieving
methods, is_prime, prime_count, nth_prime, approximations and bounds for
the prime_count and nth prime, next_prime and prev_prime, factoring utilities,
The default sieving and factoring are intended to be the fastest on CPAN,
including Math::Prime::XS, Math::Prime::FastSieve, and
There are two main types of scripts here: benchmarks and correctness tests.
The test-* scripts are generally trying to test one part of the module
against another part of the module, an external module, or an external program.
These usually consist of a combination of fixed tests and a long sequence of
testing with random numbers, trying to find things the standard testing might
Revision history for Perl extension Math::Prime::Util.
0.09 25 June 2012
- Pure Perl code. Passes all tests, but 1 to 120x slower. Test suite
as a whole is 38x slower.
- Modifications to threading test:
- some machines were failing because they use non-TS rand. Fix by
making our own rand.
- Win32 was failing because of unique threading issues. It barfs