Changeset 23ca1f7 in git

Timestamp:

Aug 31, 2016, 2:53:53 PM (7 years ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

(u'spielwiese', '828514cf6e480e4bafc26df99217bf2a1ed1ef45')

Children:

9a1960b6e0ed640233d9cfb3dc5fc29208eee68c

Parents:

e180f5613c396d33aa3316cd450d3a1e80d69129

Message:

fix: tr. #762 (hres(ideal(1),0))

File:

• kernel/GBEngine/syz2.cc (modified) (1 diff)

kernel/GBEngine/syz2.cc

@@ -909 +909 @@
 {
   ideal reor,toreor;
-  int i,j,k,l,m,togo;
+  int k,l,m,togo;
   syzstr->betti = new intvec(maxdeg,maxindex+1,0);
-  (*syzstr->betti)[0] = 1;
-  for (i=1;i<=syzstr->length;i++)
-  {
-    if ((syzstr->orderedRes[i]!=NULL) && !idIs0(syzstr->orderedRes[i]))
-    {
-      toreor = syzstr->orderedRes[i];
-      k = IDELEMS(toreor);
-      while ((k>0) && (toreor->m[k-1]==NULL)) k--;
-      reor = idInit(k,toreor->rank);
-      togo = IDELEMS(syzstr->res[i]);
-      for (j=0;j<k;j++)
-      {
-        if (toreor->m[j]!=NULL) (IMATELEM(*syzstr->betti,p_FDeg(toreor->m[j],currRing)-i+1,i+1))++;
-        reor->m[j] = toreor->m[j];
-        toreor->m[j] = NULL;
-      }
-      m = 0;
-      for (j=0;j<togo;j++)
-      {
-        if (syzstr->res[i]->m[j]!=NULL)
+  if (syzstr->betti->length()>0)
+  {
+    (*syzstr->betti)[0] = 1;
+    for (int i=1;i<=syzstr->length;i++)
+    {
+      if ((syzstr->orderedRes[i]!=NULL) && !idIs0(syzstr->orderedRes[i]))
+      {
+        toreor = syzstr->orderedRes[i];
+        k = IDELEMS(toreor);
+        while ((k>0) && (toreor->m[k-1]==NULL)) k--;
+        reor = idInit(k,toreor->rank);
+        togo = IDELEMS(syzstr->res[i]);
+        for (int j=0;j<k;j++)
         {
-          l = 0;
-          while ((l<k) && (syzstr->res[i]->m[j]!=reor->m[l])) l++;
-          if (l<k)
+          if (toreor->m[j]!=NULL) (IMATELEM(*syzstr->betti,p_FDeg(toreor->m[j],currRing)-i+1,i+1))++;
+          reor->m[j] = toreor->m[j];
+          toreor->m[j] = NULL;
+        }
+        m = 0;
+        for (int j=0;j<togo;j++)
+        {
+          if (syzstr->res[i]->m[j]!=NULL)
           {
-            toreor->m[m] = reor->m[l];
-            reor->m[l] = NULL;
-            m++;
+            l = 0;
+            while ((l<k) && (syzstr->res[i]->m[j]!=reor->m[l])) l++;
+            if (l<k)
+            {
+              toreor->m[m] = reor->m[l];
+              reor->m[l] = NULL;
+              m++;
+            }
           }
         }
-      }
-      idDelete(&reor);
+        idDelete(&reor);
+      }
     }
   }