This is an automated email from the git hooks/post-receive script. ppm-guest pushed a commit to annotated tag v0.33 in repository libmath-prime-util-perl.
commit 6a3502885dc67c1d1b835362d10313537e57264e Author: Dana Jacobsen <d...@acm.org> Date: Mon Nov 18 23:54:59 2013 -0800 Update for release --- Changes | 3 ++- TODO | 3 +++ 2 files changed, 5 insertions(+), 1 deletion(-) diff --git a/Changes b/Changes index 77deb7f..e6ac9c7 100644 --- a/Changes +++ b/Changes @@ -25,7 +25,8 @@ Revision history for Perl module Math::Prime::Util - prime_count uses Lehmer below a threshold (8000M), LMO above. This keeps good performance while still using low memory. A small - speedup for small (3-6M) inputs has been added. + speedup for small (3-6M) inputs has been added. Overall memory use + has been reduced by 2-4x for large inputs. - Perl RiemannZeta changes: diff --git a/TODO b/TODO index 0d0a1c1..6bbf5b0 100644 --- a/TODO +++ b/TODO @@ -56,3 +56,6 @@ API (small factors, isprime, then call main code) and main code (just the algorithm). The PP code isn't doing that, which means we're doing lots of extra primality checks, which aren't cheap in PP. + +- I believe we can make the Lehmer/LMO small primes uint32_t, which will + give some more memory reduction and a little speed. -- 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