This is an automated email from the git hooks/post-receive script.
ppm-guest pushed a commit to annotated tag v0.32
in repository libmath-prime-util-perl.
commit 291efcd97687b6ffa8d00e2695bf97ce6e6b17df
Author: Dana Jacobsen <d...@acm.org>
Date: Fri Oct 11 16:01:03 2013 -0700
Update Changes
---
Changes | 51 +++++++++++++++++++++++++++++----------------------
Makefile.PL | 7 +++++--
2 files changed, 34 insertions(+), 24 deletions(-)
diff --git a/Changes b/Changes
index d6d7489..68b2c81 100644
--- a/Changes
+++ b/Changes
@@ -1,25 +1,20 @@
Revision history for Perl module Math::Prime::Util
-0.32 2013-09
+0.32 2013-10-13
- [Functions Added]
- - is_proven_prime
- - is_proven_prime_with_cert
- - carmichael_lambda
- - znorder
- - prime_iterator_object
- - miller_rabin_random
+ [ADDED]
- - Added Math::Prime::Util::PrimeIterator. A more feature-rich iterator
- than the simple closure one from prime_iterator. Experimental.
+ - is_proven_prime
+ - is_proven_prime_with_cert
+ - carmichael_lambda
+ - znorder
+ - prime_iterator_object
+ - miller_rabin_random
- - Input validation accepts bigint objects and converts them to scalars
- entirely in XS.
+ [NEW FEATURES]
- - random_nbit_prime now uses Fouque and Tibouchi A1 for 65+ bits.
- Slightly better uniformity and typically a bit faster.
-
- - Use MPU::GMP::pn_primorial if we have it.
+ - Added Math::Prime::Util::PrimeIterator. A more feature-rich iterator
+ than the simple closure one from prime_iterator. Experimental.
- Make LMO primecount work (albeit a simplistic version). Memory
limiting features added to phi calculations, so the phi calculations
@@ -32,6 +27,21 @@ Revision history for Perl module Math::Prime::Util
second arguments, the result will automatically be a bigint if needed.
It is also much faster for larger inputs.
+ - factor() can be called in scalar context to give the number of
+ prime factors. The XS function was ignoring the context, and now
+ is more consistent. It also slightly speeds up looking at the
+ number of factors, e.g. Omega(x) A001222.
+
+ [FUNCTIONALITY AND PERFORMANCE]
+
+ - Use MPU::GMP::pn_primorial if we have it.
+
+ - Input validation accepts bigint objects and converts them to scalars
+ entirely in XS.
+
+ - random_nbit_prime now uses Fouque and Tibouchi A1 for 65+ bits.
+ Slightly better uniformity and typically a bit faster.
+
- Incorporate Montgomery reduction for primality testing, thanks to
Wojciech Izykowski. This is a 1.3 to 1.5x speedup for is_prob_prime,
is_prime, and is_strong_pseudoprime for numbers > 2^32 on x86_64.
@@ -40,8 +50,6 @@ Revision history for Perl module Math::Prime::Util
- Montgomery reduction used in Lucas and Frobenius tests. Up to 2x
speedup for 33 to 64-bit inputs on x86_64/gcc platforms.
- - Primality functions moved to their own file primality.c.
-
- Some fixes around near maxint primes, forprimes, etc.
- Bytes::Random::Secure is loaded only when random prime functionality
@@ -49,10 +57,9 @@ Revision history for Perl module Math::Prime::Util
- Speedups for Perl (no GMP) primality and random primes.
- - factor() can be called in scalar context to give the number of
- prime factors. The XS function was ignoring the context, and now
- is more consistent. It also slightly speeds up looking at the
- number of factors, e.g. Omega(x) A001222.
+ [MISC]
+
+ - Primality functions moved to their own file primality.c.
0.31 2013-08-07
diff --git a/Makefile.PL b/Makefile.PL
index dd62160..17eff05 100644
--- a/Makefile.PL
+++ b/Makefile.PL
@@ -39,9 +39,12 @@ WriteMakefile1(
version => '2',
url => 'http://search.cpan.org/perldoc?CPAN::Meta::Spec',
},
- resources => {
+ resources => {
+ license => [ 'http://dev.perl.org/licenses/' ],
homepage => 'https://github.com/danaj/Math-Prime-Util',
- repository => 'https://github.com/danaj/Math-Prime-Util',
+ repository => {
+ url => 'https://github.com/danaj/Math-Prime-Util',
+ },
},
prereqs => {
runtime => {
--
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
