[libmath-prime-util-perl] 01/04: Add some items to do

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


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

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

commit b7d0e69d923455e8928db9802383d555e699095b
Author: Dana Jacobsen <dana at acm.org>
Date:   Mon Jun 4 11:09:08 2012 -0600

    Add some items to do
---
 TODO                   | 10 ++++++++++
 lib/Math/Prime/Util.pm |  6 +++---
 2 files changed, 13 insertions(+), 3 deletions(-)

diff --git a/TODO b/TODO
index 180084b..4180b9f 100644
--- a/TODO
+++ b/TODO
@@ -6,3 +6,13 @@
 - prime_count and nth_prime with very large inputs.
 
 - factoring (Fermat, Pollard Rho, HOLF, etc.)
+
+- Add test to check maxbits in compiled library vs. Perl
+
+- Fill in the synopsis!
+
+- Li(n)
+
+- Pure perl implementations
+
+- input validation (in XS, or do we need to make Perl wrappers for everything?)
diff --git a/lib/Math/Prime/Util.pm b/lib/Math/Prime/Util.pm
index aa95762..8087970 100644
--- a/lib/Math/Prime/Util.pm
+++ b/lib/Math/Prime/Util.pm
@@ -379,7 +379,7 @@ also amenable to massively parallel searching.
 For 64-bit input, these are unlikely to be of too much use.  An optimized
 SQUFOF implementation takes under 20 milliseconds to find a factor for any
 62-bit input on modern desktop computers.  Lightweight quadratic sieves
-are typically much faster for moderate in the 19+ digit range.
+are typically much faster for inputs in the 19+ digit range.
 
 
 =head1 LIMITATIONS
@@ -405,7 +405,7 @@ Pi(10^10) = 455,052,511.
        5.6  Tomás Oliveira e Silva's segmented sieve v2 (Sep 2010)
        6.6  primegen (optimized Sieve of Atkin)
       11.2  Tomás Oliveira e Silva's segmented sieve v1 (May 2003)
-  
+
       15.6  My Sieve of Eratosthenes using a mod-30 wheel
       17.2  A slightly modified verion of Terje Mathisen's mod-30 sieve
       35.5  Basic Sieve of Eratosthenes on odd numbers
@@ -420,7 +420,7 @@ Perl modules, counting the primes to C<800_000_000> (800 million), in seconds:
       11.7  Math::Prime::XS             0.29
       15.0  Bit::Vector                 7.2
    (hours)  Math::Primality             0.04
-    
+
 
 =head1 AUTHORS
 

-- 
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