[libmath-prime-util-perl] 113/181: Go back to 200M threshold vs. 2M for looking in cache

[Partha P. Mukherjee]

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

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

commit 59238c0f5e2d8cc6c4eb51bc6b2fdc6686cc8812
Author: Dana Jacobsen <dana at acm.org>
Date:   Sat Jan 4 00:57:36 2014 -0800

    Go back to 200M threshold vs. 2M for looking in cache
---
 util.c | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/util.c b/util.c
index cac9bdc..6d1f225 100644
--- a/util.c
+++ b/util.c
@@ -200,7 +200,7 @@ int _XS_is_prime(UV n)
   if (n <= 10)
     return (n == 2 || n == 3 || n == 5 || n == 7) ? 2 : 0;
 
-  if (n < UVCONST(2000000)) {
+  if (n < UVCONST(200000000)) {
     UV d = n/30;
     UV m = n - d*30;
     unsigned char mtab = masktab30[m];  /* Bitmask in mod30 wheel */

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