[libmath-prime-util-gmp-perl] annotated tag upstream/0.46 created (now 6e57256)
gregor herrmann
gregoa at debian.org
Fri Aug 4 21:44:48 UTC 2017
This is an automated email from the git hooks/post-receive script.
gregoa pushed a change to annotated tag upstream/0.46
in repository libmath-prime-util-gmp-perl.
at 6e57256 (tag)
tagging c30ef4c5697c3f62d447503dddb39c109dcf1c91 (commit)
replaces upstream/0.41
tagged by gregor herrmann
on Fri Aug 4 17:39:13 2017 -0400
- Log -----------------------------------------------------------------
Upstream version 0.46
Dana Jacobsen (55):
Fix is_power behaviour for -1 and odd k
Adjust zeta algorithm crossover
LambertW implementation
Speedup for is_primitive_root
Make sure BPSW returns 2 instead of 1 for inputs under 4
Improvements to zeta and lambertw.
Add some missing tests
Make sure bls75 intermedia is correct for very small inputs. Fixes an internal assert.
Add lambertw test
More precision when very close to -1/e
Fix chinese with zero modulus
Speedup stirling()
Small efficiency gain for Rho/Brent factoring
Fix problem with divisors(1)
Move partitions function from XS to gmp_main
Add ISAAC, all randomness uses it, and add random prime functions.
Add is_semiprime
Update version number
Add new files to manifest
Slightly more efficient random_nbit_prime
Update test for modified nbit prime generator
Add a header, edit Changes
Add tests for stirling(..,3) : Lah numbers
Reduce sieve_primes depth for small widths
Add random_strong_prime
Update Changes file date
Merge branch 'master' of https://github.com/danaj/Math-Prime-Util-GMP
Add urandomb, urandomr, random_maurer_prime
Tests for urandomb and urandomr
Add irand64(nbits) internal func
Update version and document random prime funcs
Small speedup for tests
Add random proven prime certificates, both algorithms, and support for theorem 5 Maurer primes (currently unused)
Portability updates
Update Changes date
Merge exp_mangoldt and is_prime_power to single core
Doc update
Init local randstate before using, free after
Merge branch 'master' of https://github.com/danaj/Math-Prime-Util-GMP
Small performance improvement to znprimroot
Speedup to cluster sieve
is_primitive_root with negative arguments
Speedup urandom test with large bigints if they have really slow Math::BigInt
Add random_bytes function
Add irand, irand64, drand, urandomm
One arg allowed for prime_count, random_prime, urandomr
Bump version number
Update for release
Don't use exp2
Trap negative bases sent to mrr
Limit silly number of bases to MRR
Bump version number
Allow single argument for miller rabin random. Bump version.
Fix AKS primitive root utility
prev_prime return undef for 2 or less
gregor herrmann (1):
New upstream version 0.46
-----------------------------------------------------------------------
No new revisions were added by this update.
--
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/pkg-perl/packages/libmath-prime-util-gmp-perl.git
More information about the Pkg-perl-cvs-commits
mailing list