[libmath-prime-util-perl] 29/35: Change C99 comments that snuck in

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


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

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

commit e0cae1586550f8026e0c5b7b5ec7ac4915f9c302
Author: Dana Jacobsen <dana at acm.org>
Date:   Fri Nov 15 13:10:49 2013 -0800

    Change C99 comments that snuck in
---
 factor.c | 16 ++++++++--------
 1 file changed, 8 insertions(+), 8 deletions(-)

diff --git a/factor.c b/factor.c
index ab1c77d..3ca3579 100644
--- a/factor.c
+++ b/factor.c
@@ -851,7 +851,7 @@ typedef struct
   UV imax;
 } mult_t;
 
-// N < 2^63 (or 2^31).  *f == 1 if no factor found
+/* N < 2^63 (or 2^31).  *f == 1 if no factor found */
 static void squfof_unit(UV n, mult_t* mult_save, UV* f)
 {
   UV imax,i,Q0,b0,Qn,bn,P,bbn,Ro,S,So,t1,t2;
@@ -881,11 +881,11 @@ static void squfof_unit(UV n, mult_t* mult_save, UV* f)
     if (i & 0x1) {
       SQUARE_SEARCH_ITERATION;
     }
-    // i is now even
+    /* i is now even */
     while (1) {
-      // We need to know P, bn, Qn, Q0, iteration count, i  from prev
+      /* We need to know P, bn, Qn, Q0, iteration count, i  from prev */
       if (i >= imax) {
-        // save state and try another multiplier.
+        /* save state and try another multiplier. */
         mult_save->P = P;
         mult_save->bn = bn;
         mult_save->Qn = Qn;
@@ -897,22 +897,22 @@ static void squfof_unit(UV n, mult_t* mult_save, UV* f)
 
       SQUARE_SEARCH_ITERATION;
 
-      // Even iteration.  Check for square: Qn = S*S
+      /* Even iteration.  Check for square: Qn = S*S */
       if (is_perfect_square( Qn, &S ))
         break;
 
-      // Odd iteration.
+      /* Odd iteration. */
       SQUARE_SEARCH_ITERATION;
     }
     /* printf("found square %lu after %lu iterations with mult %d\n", Qn, i, mult_save->mult); */
 
-    // Reduce to G0
+    /*  Reduce to G0 */
     Ro = P + S*((b0 - P)/S);
     t1 = Ro;
     So = (n - t1*t1)/S;
     bbn = (b0+Ro)/So;
 
-    // Search for symmetry point
+    /* Search for symmetry point */
 #define SYMMETRY_POINT_ITERATION \
       t1 = Ro; \
       Ro = bbn*So - Ro; \

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