8659f5eeee
0.70 2017-12-02
[FIXES]
- prime_count(a,b) incorrect for a={3..7} and b < 66000000.
First appeared in v0.65 (May 2017).
Reported by Trizen. Fixed.
- Also impacted were nth_ramanujan_prime and _lower/_upper for
small input values.
[FUNCTIONALITY AND PERFORMANCE]
- Some utility functions used prime counts. Unlink for more isolation.
- prime_count_approx uses full precision for bigint or string input.
- LogarithmicIntegral and ExponentialIntegral will try to use
our GMP backend if possible.
- Work around old Math::BigInt::FastCalc (as_int() doesn't work right).
- prime_memfree also calls GMP's memfree function. This will clear the
cached constants (e.g. Pi, Euler).
- Calling srand or csrand will also result in the GMP backend CSPRNG
functions being called. This gives more consistent behavior.
[OTHER]
- Turned off threads testing unless release or extended testing is used.
A few smokers seem to have threads lib that die before we event start.
- Removed all Math::MPFR code and references. The latest GMP backend
has everything we need.
- The MPU_NO_XS and MPU_NO_GMP environment variables are documented.
6 lines
432 B
Text
6 lines
432 B
Text
$NetBSD: distinfo,v 1.17 2017/12/03 08:41:29 wiz Exp $
|
|
|
|
SHA1 (Math-Prime-Util-0.70.tar.gz) = 1847d4a7ebe3c98df39b0d1beee47b8b4b6e65aa
|
|
RMD160 (Math-Prime-Util-0.70.tar.gz) = af70efa674e9481b7a277c1e2c0b1949ed29be37
|
|
SHA512 (Math-Prime-Util-0.70.tar.gz) = c05964c8a3f76bb7881cbcafa0d31b76ac34ff3aa931e834ee151ae79f5f582b5681b31ad75f51d63d3129b9c11246a458b196635ca7c242dbd6dedaddb64298
|
|
Size (Math-Prime-Util-0.70.tar.gz) = 593408 bytes
|