kpriv/pkgsrc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
pkgsrc/math/p5-Math-Prime-Util/distinfo

6 lines
263 B
Text
Raw Normal View History

Update to 0.15 Upstream changes: 0.15 9 December 2012 - Lots of internal changes to Ei, li, Zeta, and R functions: - Native Zeta and R have slightly more accurate results. - For bignums, use Math::MPFR if possible. MUCH faster. Also allows extended precision while still being fast. - Better accuracy for standard bignums. - All four functions do: - XS if native input. - MPFR to whatever accuracy is desired, if Math::MPFR installed. - BigFloat versions if no MPFR and BigFloat input. - standard version if no MPFR and not a BigFloat. - Add tests for primorial, jordan_totient, and divisor_sum. - Revamp of the random_prime internals. Also fixes some issues with random n-bit and maurer primes. - The random prime and primorial functions now will return a Math::BigInt object if the result is greater than the native size. This includes loading up the Math::BigInt library if necessary.
2012-12-10 14:35:45 +01:00
$NetBSD: distinfo,v 1.3 2012/12/10 13:35:45 wen Exp $
Add new package for CPAN module Math::Prime::Util version 0.11 into math/p5-Math-Prime-Util. 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, and more.
2012-10-19 09:30:32 +02:00
Update to 0.15 Upstream changes: 0.15 9 December 2012 - Lots of internal changes to Ei, li, Zeta, and R functions: - Native Zeta and R have slightly more accurate results. - For bignums, use Math::MPFR if possible. MUCH faster. Also allows extended precision while still being fast. - Better accuracy for standard bignums. - All four functions do: - XS if native input. - MPFR to whatever accuracy is desired, if Math::MPFR installed. - BigFloat versions if no MPFR and BigFloat input. - standard version if no MPFR and not a BigFloat. - Add tests for primorial, jordan_totient, and divisor_sum. - Revamp of the random_prime internals. Also fixes some issues with random n-bit and maurer primes. - The random prime and primorial functions now will return a Math::BigInt object if the result is greater than the native size. This includes loading up the Math::BigInt library if necessary.
2012-12-10 14:35:45 +01:00
SHA1 (Math-Prime-Util-0.15.tar.gz) = 655a44be5b1a93c1f5e90b8da459966721f32c42
RMD160 (Math-Prime-Util-0.15.tar.gz) = c83b3b1519f6dc48a3daf26b429a34391bf52242
Size (Math-Prime-Util-0.15.tar.gz) = 184113 bytes
Reference in a new issue Copy permalink