Changeset 40a823 in git

Timestamp:

Aug 3, 2011, 2:57:37 PM (12 years ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')

Children:

a2cca6db4133a6ed0ac5e4a090d562ab1b927021

Parents:

b44f5efd50dcfa0bb89204f55621946bbb67238d

git-author:

Hans Schoenemann <hannes@mathematik.uni-kl.de>2011-08-03 14:57:37+02:00

git-committer:

Mohamed Barakat <mohamed.barakat@rwth-aachen.de>2011-11-09 13:14:13+01:00

Message:

fix also tgb.cc for tgb.og

File:

• kernel/tgb_internal.h (modified) (9 diffs)

kernel/tgb_internal.h

@@ -930 +930 @@
   const tgb_uint32 prime=n_GetChar(currRing->cf);
   const tgb_uint32 c=F4mat_to_number_type(coef);
-  assume(!(npIsZero(coef)));
+  assume(!(n_IsZero(coef,currRing->cf)));
   for(j=0;j<len;j=j+256)
   {
@@ -954 +954 @@
       int idx=idx_array[i];
       assume(bpos<256);
-      assume(!(npIsZero((number)(long) buffer[bpos])));
+      assume(!(n_IsZero((number)(long) buffer[bpos],currRing->cf)));
       temp_array[idx]=F4mat_to_number_type(n_Add((number)(long) temp_array[idx], (number)(long) buffer[bpos++],currRing->cf));
       assume(idx<temp_size);
@@ -971 +971 @@
   const tgb_uint32 prime=n_GetChar(currRing->cf);
   const tgb_uint32 c=F4mat_to_number_type(coef);
-  assume(!(npIsZero(coef)));
+  assume(!(n_IsZero(coef,currRing->cf)));
   for(j=0;j<len;j=j+256)
   {
@@ -1541 +1541 @@
     assume(start<ncols);
     int other_row;
-    assume(!(npIsZero((number)(long) row_array[start])));
+    assume(!(n_IsZero((number)(long) row_array[start],currRing->cf)));
     if (!(n_IsOne((number)(long) coef,currRing->cf)))
       multiplyRow(r,F4mat_to_number_type(n_Invers((number)(long) coef,currRing->cf)));
@@ -1573 +1573 @@
         }
         updateStartIndex(other_row,start);
-        assume(npIsZero((number)(long) other_row_array[start]));
+        assume(n_IsZero((number)(long) other_row_array[start],currRing->cf));
       }
     }
@@ -1580 +1580 @@
   {
     number_type* row_array=rows[row];
-    assume((lower_bound<0)||(npIsZero((number)(long) row_array[lower_bound])));
+    assume((lower_bound<0)||(n_IsZero((number)(long) row_array[lower_bound],currRing->cf)));
     int i;
     //number_type zero=npInit(0);
@@ -1663 +1663 @@
     {
       assume(startIndices[i]<ncols);
-      assume(!(npIsZero((number)(long) rows[i][startIndices[i]])));
+      assume(!(n_IsZero((number)(long) rows[i][startIndices[i]],currRing->cf)));
       assume(startIndices[i]>=i);
       updateLastReducibleIndex(i,nonZeroUntil+1);
@@ -1692 +1692 @@
     number_type zero=0;//npInit(0);
     number_type* row_array=rows[r];
-    assume((!(npIsZero((number)(long) row_array[start]))));
+    assume((!(n_IsZero((number)(long) row_array[start],currRing->cf))));
     assume(start<ncols);
     int other_row;
@@ -1710 +1710 @@
         number_type* other_row_array=rows[other_row];
         number coef=n_Neg((number)(long) other_row_array[start],currRing->cf);
-        assume(!(npIsZero(coef)));
+        assume(!(n_IsZero(coef,currRing->cf)));
         int i;
         assume(start>startIndices[other_row]);