Changeset 4dcfb4f in git

Timestamp:

Jan 21, 2005, 5:16:16 PM (18 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'spielwiese', '828514cf6e480e4bafc26df99217bf2a1ed1ef45')

Children:

1b61353ce8e537757677d798cb81d4f53609e999

Parents:

a70d5e8c3b16c9476e9db55b342df53dac31b1bb

Message:

*hannes: const Bigint&)0


git-svn-id: file:///usr/local/Singular/svn/trunk@7681 2c84dea3-7e68-4137-9b89-c4e89433aadc

Location:

IntegerProgramming

Files:

• LLL.cc (modified) (5 diffs)
• matrix.cc (modified) (15 diffs)

IntegerProgramming/LLL.cc

@@ -160 +160 @@
   BigInt _lambda=lambda[k][k-1];
 
-  if(_lambda==(const BigInt&)0)
+  if(_lambda==BigInt(0))
   {
     d[k]=d[k-1];
@@ -235 +235 @@
 
     for(short m=0;m<vector_dimension;m++)
-      if(b[0][m]!=(const BigInt&)0)
+      if(b[0][m]!=BigInt(0))
         // nonzero entry detected
         r=0;
@@ -296 +296 @@
   // Now, H equals the matrix I_(number_of_vectors).
 
-  if(t!=(const BigInt&)0)
+  if(t!=BigInt(0))
   {
     d[1]=t;
@@ -343 +343 @@
           else
             // j==k
-            if(u!=(const BigInt&)0)
+            if(u!=BigInt(0))
             {
               d[k+1]=u;
@@ -532 +532 @@
       }
 
-      if(d[k+1]==(const BigInt&)0)
+      if(d[k+1]==BigInt(0))
       {
         cerr<<"\nERROR: void integral_LLL(BigInt**, const short&, const "

IntegerProgramming/matrix.cc

@@ -322 +322 @@
     M[i]=0;
     for(short j=0;j<columns;j++)
-      if(H[i][j]==(const BigInt&)0)
+      if(H[i][j]==BigInt(0))
         M[i]++;
   }
@@ -350 +350 @@
   short min_index=-1;
   for(short i=0;i<_kernel_dimension;i++)
-    if(M[i]>(const BigInt&)0)
+    if(M[i]>BigInt(0))
       if(min_index==-1)
         min_index=i;
@@ -387 +387 @@
     BOOLEAN found=TRUE;
     for(short j=0;j<columns;j++)
-      if(H[0][j]==(const BigInt&)0)
+      if(H[0][j]==BigInt(0))
         found=FALSE;
 
@@ -407 +407 @@
 
     for(short j=0;j<columns;j++)
-      if(H[0][j]==(const BigInt&)0)
+      if(H[0][j]==BigInt(0))
       {
         remaining_zero_components++;
         for(short i=current_position;i<_kernel_dimension;i++)
-          if(H[i][j]==(const BigInt&)0)
+          if(H[i][j]==BigInt(0))
             M[i]++;
       }
@@ -444 +444 @@
     short min_index=0;
     for(short i=current_position;i<_kernel_dimension;i++)
-      if(M[i]>(const BigInt&)0)
+      if(M[i]>BigInt(0))
         if(min_index==0)
           min_index=i;
@@ -479 +479 @@
       // mult*H[current_position]
       for(short j=0;j<columns;j++)
-        if(H[0][j]!=(const BigInt&)0)
+        if(H[0][j]!=BigInt(0))
           if(H[0][j]+(const BigInt&)mult*H[current_position][j]
-            ==(const BigInt&)0)
+            ==BigInt(0))
             found=FALSE;
 
@@ -496 +496 @@
         // mult*H[current_position]
         for(short j=0;j<columns;j++)
-          if(H[0][j]!=(const BigInt&)0)
+          if(H[0][j]!=BigInt(0))
             if(H[0][j]-(const BigInt&)mult*H[current_position][j]
-              ==(const BigInt&)0)
+              ==BigInt(0))
               found=FALSE;
 
@@ -534 +534 @@
 
   for(short j=0;j<columns;j++)
-    if(H[0][j]<(const BigInt&)0)
+    if(H[0][j]<BigInt(0))
       r++;
   // remember that all components of H[0] are !=0
@@ -551 +551 @@
     short counter=0;
     for(short j=0;j<columns;j++)
-      if(H[0][j]>(const BigInt&)0)
+      if(H[0][j]> BigInt(0))
       {
         F[counter]=j;
@@ -565 +565 @@
     short counter=0;
     for(short j=0;j<columns;j++)
-      if(H[0][j]<(const BigInt&)0)
+      if(H[0][j]< BigInt(0))
       {
         F[counter]=j;
@@ -625 +625 @@
       if(ideal_saturated_by_var[j]==FALSE)
       {
-        if(H[k][j]>(const BigInt&)0)
+        if(H[k][j]> BigInt(0))
           pos_sat_var++;
         else
-          if(H[k][j]<(const BigInt&)0)
+          if(H[k][j]< BigInt(0))
             neg_sat_var++;
       }
@@ -639 +639 @@
       for(short j=0;j<columns;j++)
         if(ideal_saturated_by_var[j]==FALSE)
-          if(H[k][j]>(const BigInt&)0)
+          if(H[k][j]> BigInt(0))
             // ideal has to be saturated by the variables corresponding
             // to positive components
@@ -648 +648 @@
           }
           else
-            if(H[k][j]<(const BigInt&)0)
+            if(H[k][j]< BigInt(0))
               // then the ideal is automatically saturated by the variables
               // corresponding to negative components
@@ -657 +657 @@
       for(short j=0;j<columns;j++)
         if(ideal_saturated_by_var[j]==FALSE)
-          if(H[k][j]<(const BigInt&)0)
+          if(H[k][j]< BigInt(0))
             // ideal has to be saturated by the variables corresponding
             // to negative components
@@ -666 +666 @@
           }
           else
-            if(H[k][j]>(const BigInt&)0)
+            if(H[k][j]> BigInt(0))
               // then the ideal is automatically saturated by the variables
               // corresponding to positive components