/ 
Math-Prime-Util-0.27
River stage two • 13 direct dependents • 21 total dependents

Changes for version 0.27

  • is_prime, is_prob_prime, next_prime, and prev_prime now all go straight to XS if possible. This makes them much faster for small inputs without having to use the -nobigint flag.
  • XS simple number validation to lower function call overhead. Still a lot more overhead compared to directly calling the XS functions, but it shaves a little bit of time off every call.
  • Speedup pure Perl factoring of small numbers.
  • is_prob_prime / is_prime about 10% faster for composites.
  • Allow '+N' as the second parameter to primes.pl. This allows: primes.pl 100 +30 to return the primes between 100 and 130. Or: primes.pl 'nth_prime(1000000000)' +2**8
  • Use EXTENDED_TESTING to turn on extra tests.

Modules

Math::Prime::Util
Utilities related to prime numbers, including fast sieves and factoring
Math::Prime::Util::ECAffinePoint
Elliptic curve operations for affine points
Math::Prime::Util::ECProjectivePoint
Elliptic curve operations for projective points
Math::Prime::Util::MemFree
An auto-free object for Math::Prime::Util
Math::Prime::Util::PP
Pure Perl version of Math::Prime::Util
Math::Prime::Util::PrimeArray
A tied array for primes
Math::Prime::Util::ZetaBigFloat
Perl Big Float versions of Riemann Zeta and R functions

Examples

Other files