This is an automated email from the git hooks/post-receive script.
carnil pushed a change to annotated tag upstream/0.53
in repository libmath-prime-util-perl.
at 5d75bd7 (tag)
tagging 49427a067b513cd1e6b9e42d8bb0ed26550a9fa0 (commit)
replaces upstream/0.52
tagged by Salvatore Bonaccorso
on Mon Sep 7 19:19:41 2015 +0200
- Log -----------------------------------------------------------------
Upstream version 0.53
Dana Jacobsen (63):
Fix MPFR old C library check
Minor tweak of sieve loop macro
Merge branch 'master' of https://github.com/danaj/Math-Prime-Util
Fix PP sum_primes when near end of 64-bit range
Double speed of sum_primes
Note sum_primes change
Speedups for PP sum_primes
Immediate overflow if range is too big
Call GMP chinese if available
New sieve walking method. forprimes about 35% faster
Finish sieve-walking rewrite
Rename const table name
Update a few performance numbers
Reduce overhead for forcomposites call, similar to forprimes
Fix fileno issue with 2-arg print_primes
Allow proper objectify to Math::GMP and Math::GMPz
Bump Exporter version required to match modern numbering
Off by one in PP sum_primes fast loop
Let sum_primes use XS to 6e14
Notes about combinatorial sum of primes
randomprime test should print the prime
Merge branch 'master' of github.com:danaj/Math-Prime-Util
Use MPFR in prime_count_lower and prime_count_upper
Bump random_nbit_prime nth-prime algorithm crossover from 18 to 20 bits
Fix some PP dependencies with recent changes
Change uint64 and uint128 defines, work on clang
Montgomery math for Frobenius-Khashin
Faster PrimeArray in some cases
Allow some exported arrays
PrimeArray works to 2^32
prime_iterator uses small segment sieve
Put is_primitive_root in util
Unambiguate constant use
Export if asked
Type changes for bigint types other than Math::BigInt
Comments and allow skip of up to 3k
Updae Exporter version
Missed a check for lastp in sieve walker
Faster gcd from FLINT
Add is_square_free()
use more trial division in is_prob_prime, modified gcd
Rename function
Update function lists
Bump version number
Merge pull request #14 from peterdettman/st-random
Note Peter Dettman's patch
Date change for Changes
Add Ramanujan Tau
Merge with master
Remove ambiguous -1
Add rudimentary pseudoprime code
Merge branch 'master' of github.com:danaj/Math-Prime-Util
Update for PP sigma
Use GMP sieve_twin_primes function
Add sumdigits
Tests for sumdigits
Bigint typing with primes return; lucas test with large P,Q and small
input
Return type for sumdigits
Work around borked-5.6.2 and ramanujan_tau
Update version for release
Allow magic in some functions, eg sumdigits, vecmin, ispower
Workarounds for ancient Perl
Update ppport.h
Peter Dettman (1):
Improve _ST_Random_Prime compliance with FIPS 186-4
Salvatore Bonaccorso (1):
Imported Upstream version 0.53
-----------------------------------------------------------------------
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-perl.git
_______________________________________________
Pkg-perl-cvs-commits mailing list
Pkg-perl-cvs-commits@lists.alioth.debian.org
http://lists.alioth.debian.org/cgi-bin/mailman/listinfo/pkg-perl-cvs-commits
