[libmath-prime-util-perl] 42/50: No timing messages from Lehmer, and reduce threshold since it's faster now
Partha P. Mukherjee
ppm-guest at moszumanska.debian.org
Thu May 21 18:45:39 UTC 2015
This is an automated email from the git hooks/post-receive script.
ppm-guest pushed a commit to annotated tag v0.13
in repository libmath-prime-util-perl.
commit f8943f75b5a532761429b1986cf0dbb639a809b4
Author: Dana Jacobsen <dana at acm.org>
Date: Sat Nov 17 13:50:02 2012 -0800
No timing messages from Lehmer, and reduce threshold since it's faster now
---
lehmer.c | 2 +-
lib/Math/Prime/Util.pm | 2 +-
2 files changed, 2 insertions(+), 2 deletions(-)
diff --git a/lehmer.c b/lehmer.c
index 8019f71..9a38c95 100644
--- a/lehmer.c
+++ b/lehmer.c
@@ -52,7 +52,7 @@
static int const verbose = 0;
#define DO_TIMING 0
-#ifdef DO_TIMING
+#if DO_TIMING
#include <sys/time.h>
#define DECLARE_TIMING_VARIABLES struct timeval t0, t1;
#define TIMING_START gettimeofday(&t0, 0);
diff --git a/lib/Math/Prime/Util.pm b/lib/Math/Prime/Util.pm
index f4a91e3..f94cbef 100644
--- a/lib/Math/Prime/Util.pm
+++ b/lib/Math/Prime/Util.pm
@@ -862,7 +862,7 @@ sub prime_count {
return 0 if $high < 2 || $low > $high;
if ($high <= $_XS_MAXVAL) {
- if ($high > 15_000_000) {
+ if ($high > 4_000_000) {
# These estimates need a lot of work.
#my $est_segment = 10.0 * 1.5**(log($high / 10**16) / log(10))
# + (($high-$low)/10**12);
--
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