[libmath-prime-util-perl] 10/50: Allow trial_primes to be more intelligent instead of always forcing true trial division

[Partha P. Mukherjee]

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 a9e3611576130ecdc890e1f49820393a490c4e20
Author: Dana Jacobsen <dana at acm.org>
Date:   Mon Oct 15 16:30:26 2012 -0600

    Allow trial_primes to be more intelligent instead of always forcing true trial division
---
 XS.xs | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/XS.xs b/XS.xs
index 477fe3f..11fa453 100644
--- a/XS.xs
+++ b/XS.xs
@@ -101,10 +101,10 @@ trial_primes(IN UV low, IN UV high)
   CODE:
     if (low <= high) {
       if (low >= 2) low--;   /* Make sure low gets included */
-      curprime = next_trial_prime(low);
+      curprime = _XS_next_prime(low);
       while (curprime <= high) {
         av_push(av,newSVuv(curprime));
-        curprime = next_trial_prime(curprime);
+        curprime = _XS_next_prime(curprime);
       }
     }
     RETVAL = newRV_noinc( (SV*) av );

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