Changeset 601105 in git for libpolys/coeffs/modulop.cc

Timestamp:

Nov 19, 2013, 6:39:47 PM (10 years ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

448b6571955b81192b53dc7300bb54a1984142e3

Parents:

9d864add8f262ed66a3af97f514c37d01844334c

Message:

chg: use syzComp in initenterstrongPairs

File:

• libpolys/coeffs/modulop.cc (modified) (22 diffs)

libpolys/coeffs/modulop.cc

@@ -35 +35 @@
 {
   assume( getCoeffType(r) == ID );
-  
+
 #if SIZEOF_LONG == 4
 #define ULONG64 (unsigned long long)(unsigned long)
@@ -41 +41 @@
 #define ULONG64 (unsigned long)
 #endif
-  return (number) 
+  return (number)
       (unsigned long)((ULONG64 a)*(ULONG64 b) % (ULONG64 r->ch));
 }
@@ -56 +56 @@
 {
   assume( n_Test(k, r) );
-  
+
   int h = (int)((long) k);
   return ((int)h !=0) && (h <= (r->ch>>1));
@@ -78 +78 @@
   number c = npMultM(a,b, r);
   assume( n_Test(c, r) );
-  return c;  
+  return c;
 }
 
@@ -92 +92 @@
   assume( n_Test(c, r) );
   return c;
-  
+
 }
 
@@ -102 +102 @@
 {
   assume( n_Test(n, r) );
-  
+
   if ((long)n > (((long)r->ch) >>1)) return (int)((long)n -((long)r->ch));
   else                               return (int)((long)n);
@@ -111 +111 @@
   assume( n_Test(a, r) );
   assume( n_Test(b, r) );
-  
+
   number c = npAddM(a,b, r);
 
   assume( n_Test(c, r) );
-  
+
   return c;
 }
@@ -123 +123 @@
   assume( n_Test(a, r) );
   assume( n_Test(b, r) );
-  
+
   number c = npSubM(a,b,r);
 
@@ -134 +134 @@
 {
   assume( n_Test(a, r) );
-  
+
   return 0 == (long)a;
 }
@@ -141 +141 @@
 {
   assume( n_Test(a, r) );
-  
+
   return 1 == (long)a;
 }
@@ -148 +148 @@
 {
   assume( n_Test(a, r) );
-  
+
   return ((r->npPminus1M == (long)a)&&((long)1!=(long)a));
 }
@@ -231 +231 @@
     return (number)0;
   number d;
-  
+
 #ifndef HAVE_DIV_MOD
   if ((long)b==0)
@@ -238 +238 @@
     return (number)0;
   }
-  
+
   int s = r->npLogTable[(long)a] - r->npLogTable[(long)b];
   if (s < 0)
@@ -250 +250 @@
   assume( n_Test(d, r) );
   return d;
-  
+
 }
 number  npInvers (number c, const coeffs r)
 {
   assume( n_Test(c, r) );
-  
+
   if ((long)c==0)
   {
@@ -262 +262 @@
   }
   number d = npInversM(c,r);
-  
+
   assume( n_Test(d, r) );
   return d;
-  
+
 }
 
@@ -271 +271 @@
 {
   assume( n_Test(c, r) );
-  
+
   if ((long)c==0) return c;
 
-#if 0  
-  number d = npNegM(c,r);  
+#if 0
+  number d = npNegM(c,r);
   assume( n_Test(d, r) );
   return d;
 #else
-  c = npNegM(c,r);  
+  c = npNegM(c,r);
   assume( n_Test(c, r) );
   return c;
-#endif  
+#endif
 }
 
@@ -298 +298 @@
   assume( n_Test(a, r) );
   assume( n_Test(b, r) );
-  
+
 //  return (long)a == (long)b;
-  
+
   return npEqualM(a,b,r);
 }
@@ -307 +307 @@
 {
   assume( n_Test(a, r) );
-  
+
   if ((long)a>(((long)r->ch) >>1)) StringAppend("-%d",(int)(((long)r->ch)-((long)a)));
   else                             StringAppend("%d",(int)((long)a));
@@ -436 +436 @@
 
   assume( c > 0 );
-  
+
   int i, w;
 
@@ -507 +507 @@
   r->convFactoryNSingN=npConvFactoryNSingN;
 #endif
-  
+
   // the variables:
   r->nNULL = (number)0;
@@ -539 +539 @@
                                % r->ch);
           r->npLogTable[r->npExpTable[i]] = i;
-          if /*(i == r->ch - 1 ) ||*/ (/*(*/ r->npExpTable[i] == 1 /*)*/) 
+          if /*(i == r->ch - 1 ) ||*/ (/*(*/ r->npExpTable[i] == 1 /*)*/)
             break;
         }
@@ -757 +757 @@
 #else
 /// TODO: use "long InvMod(long a, const coeffs R)"?!
-  
+
    long  s;
 
-   long  u, u0, u1, u2, q, r; // v0, v1, v2, 
+   long  u, u0, u1, u2, q, r; // v0, v1, v2,
 
    u1=1; // v1=0;