Changeset bd10ed in git

Timestamp:

Feb 22, 2018, 4:55:36 PM (6 years ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

6198629402663b11697d755d8512ff5ca032226c

Parents:

1867cd7ce4ee1a90996f9ff18e5331575cc63701

Message:

compiler warnings

File:

• libpolys/polys/kbuckets.cc (modified) (9 diffs)

libpolys/polys/kbuckets.cc

@@ -104 +104 @@
   #endif
   pFalseReturn(p_Test(bucket->buckets[i], bucket->bucket_ring));
-  if (bucket->buckets_length[i] != pLength(bucket->buckets[i]))
+  if ((unsigned)bucket->buckets_length[i] != pLength(bucket->buckets[i]))
   {
     dReportError("Bucket %d lengths difference should:%d has:%d",
@@ -334 +334 @@
   //assume(false);
   assume(bucket != NULL);
-  assume(length <= 0 || length == pLength(lm));
+  assume(length <= 0 || (unsigned)length == pLength(lm));
   assume(kBucketIsCleared(bucket));
 
@@ -434 +434 @@
     assume(bucket->coef[i]==NULL);
   #endif
-  assume(pLength(p) == (int) pl);
+  assume(pLength(p) == (unsigned)pl);
   //if (TEST_OPT_PROT) { Print("C(%d)",pl); }
   kbTest(bucket);
@@ -734 +734 @@
     if ((i <= bucket->buckets_used) && (bucket->buckets[i] != NULL))
     {
-      assume(pLength(bucket->buckets[i])==bucket->buckets_length[i]);
+      assume(pLength(bucket->buckets[i])==(unsigned)bucket->buckets_length[i]);
 //#ifdef USE_COEF_BUCKETS
 //     if(bucket->coef[i]!=NULL)
@@ -804 +804 @@
 {
     assume((!rIsPluralRing(bucket->bucket_ring))||p_IsConstant(m, bucket->bucket_ring));
-  assume(l <= 0 || pLength(p) == l);
+  assume(l <= 0 || pLength(p) == (unsigned)l);
   int i, l1;
   poly p1 = p;
@@ -1035 +1035 @@
       if (q != NULL)
       {
-        assume(pLength(q) == lq);
+        assume(pLength(q) == (unsigned)lq);
         bucket->buckets_length[i] -= lq;
-        assume(pLength(bucket->buckets[i]) == bucket->buckets_length[i]);
+        assume(pLength(bucket->buckets[i]) == (unsigned)bucket->buckets_length[i]);
         p = p_Add_q(p, q, lp, lq, bucket->bucket_ring);
       }
@@ -1067 +1067 @@
   assume(p1 != NULL &&
          p_DivisibleBy(p1,  kBucketGetLm(bucket), r));
-  assume(pLength(p1) == (int) l1);
+  assume(pLength(p1) == (unsigned) l1);
 
   poly a1 = pNext(p1), lm = kBucketExtractLm(bucket);
@@ -1125 +1125 @@
   l1--;
 
-  assume(l1==pLength(a1));
+  assume((unsigned)l1==pLength(a1));
 #if 0
   BOOLEAN backuped=FALSE;
@@ -1171 +1171 @@
 
   number nn=pGetCoeff(bucket->buckets[0]);
-  if ((bucket->buckets_used==0)
-  &&(!n_IsOne(nn,cf)))
-  {
-    if (TEST_OPT_PROT) PrintS("@");
-    p_SetCoeff(bucket->buckets[0],n_Init(1,cf),r);
-    return;
-  }
+  //if ((bucket->buckets_used==0)
+  //&&(!n_IsOne(nn,cf)))
+  //{
+  //  if (TEST_OPT_PROT) PrintS("@");
+  //  p_SetCoeff(bucket->buckets[0],n_Init(1,cf),r);
+  //  return;
+  //}
 
   if (n_Size(nn,cf)<2) return;