Changeset f33f035 in git

Timestamp:

Feb 24, 1998, 10:52:22 AM (26 years ago)

Author:

Thomas Siebert <siebert@…>

Branches:

(u'spielwiese', '2fa36c576e6a4ddbb1093b43c7f8e9835e17e52a')

Children:

d8a975b55b29a53c2376599810b7b74deefd9a33

Parents:

b257014f6f377126c7f9a83d3507e0359642b730

Message:

*** empty log message ***


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

File:

• Singular/ideals.cc (modified) (7 diffs)

Singular/ideals.cc

@@ -2 +2 @@
 *  Computer Algebra System SINGULAR     *
 ****************************************/
-/* $Id: ideals.cc,v 1.18 1998-02-19 12:45:38 siebert Exp $ */
+/* $Id: ideals.cc,v 1.19 1998-02-24 09:52:22 siebert Exp $ */
 /*
 * ABSTRACT - all basic methods to manipulate ideals
@@ -2235 +2235 @@
       }
     }
+    idTest(result);
     idDelete((ideal*)&a);
     return;
@@ -2242 +2243 @@
   pp = pCopy(p);   //we had to store barDiv for the remaining loops
   matrix nextStep = mpOneStepBareiss(a,barDiv,&r,&c);
+//Print("next row is: %d, next col: %d\n",r,c);
+/*--- there is no pivot - the matrix is zero -------------*/
+  if (r*c==0)
+  {
+    idDelete((ideal*)&a);
+    return;
+  }
 /*--- we read out the r-1 x c-1 matrix for the next step--*/
   if ((a->nrows-1)*(a->ncols-1)>0)
@@ -2260 +2268 @@
   }
 /*--- now we have to take out the r-th row...------------*/
-//Print("back for rows on Level: %d\n",ar);
   if (((a->nrows)>1) && (rowToChose==0))
   {
@@ -2283 +2290 @@
   }
 /*--- now we have to take out the c-th col...------------*/
-//Print("back for cols on Level: %d\n",ar);
   if ((a->nrows)>1)
   {
@@ -2303 +2309 @@
       }
     }
+/*--- and to perform the algorithm with the rest---------*/
     idDelete((ideal*)&a);
-/*--- and to perform the algorithm with the rest---------*/
     idRecMin(nextStep,ar,&p,result,nextPlace,r);
     nextStep = NULL;
@@ -2329 +2335 @@
   poly barDiv=NULL;
   ideal result=idInit(16,0);
+  idTest(result);
 
   idRecMin(mpCopy(a),ar-1,&barDiv,result,&i);