[libmath-prime-util-perl] 51/59: Update TODO, add Math::Big to performance

Partha P. Mukherjee ppm-guest at moszumanska.debian.org
Thu May 21 18:45:03 UTC 2015


This is an automated email from the git hooks/post-receive script.

ppm-guest pushed a commit to annotated tag v0.10
in repository libmath-prime-util-perl.

commit 60d5b636aa3497713e16699501fa892545f6fc2e
Author: Dana Jacobsen <dana at acm.org>
Date:   Mon Jul 16 11:41:20 2012 -0600

    Update TODO, add Math::Big to performance
---
 TODO                   | 24 +++---------------------
 lib/Math/Prime/Util.pm |  1 +
 2 files changed, 4 insertions(+), 21 deletions(-)

diff --git a/TODO b/TODO
index 9afd4df..7ac403a 100644
--- a/TODO
+++ b/TODO
@@ -15,29 +15,11 @@
 
 - Faster SQUFOF
 
-- better prime count upper/lower bounds (under RH for 64-bit).
+- better prime count upper/lower bounds:
+    - Dusart 2010 "Estimates of Some Functions Over Primes without R.H."
+    - Schoenfeld or Stoll for with-RH limits
 
 - Move .c / .h files into separate directory.
   version does it in a painful way.  Something simpler to be had?
 
 - finish test suite for bignum.  Work on making it faster.
-
-- Need to add more bignum factoring support:
-   - GMP prho
-   - GMP pminus1
-   - GMP SQUFOF
-   - GMP tinyqs
-  The first three should give us reasonable support up to ~30 digits.  Adding
-  a tinyQS (e.g. yafu, msieve, flint) would both be faster and extend to ~40
-  digits (in a reasonable time).  Going beyong that is going to need full
-  MPQS or SIQS.  Another possibility is to see if the GMP-ECM library is
-  installed and call that, but I'm not sure how much it will help if we get
-  the above running.
-
-- Tune the Lucas sequence code, especially try using more BigInt features.
-
-- Add tests for strong lucas pseudoprime
-
-- Speedup random_prime.
-
-- Add random maurer prime.
diff --git a/lib/Math/Prime/Util.pm b/lib/Math/Prime/Util.pm
index 2b26683..508d5a0 100644
--- a/lib/Math/Prime/Util.pm
+++ b/lib/Math/Prime/Util.pm
@@ -1923,6 +1923,7 @@ Perl modules, counting the primes to C<800_000_000> (800 million), in seconds:
      170.0   Faster Perl sieve (net)     2012-01  array of odds
      548.1   RosettaCode sieve (net)     2012-06  simplistic Perl
    >5000     Math::Primality             0.04     Perl + GMP
+  >20000     Math::Big                   1.12     Perl, > 26GB RAM used
 
 
 

-- 
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/pkg-perl/packages/libmath-prime-util-perl.git



More information about the Pkg-perl-cvs-commits mailing list