Changeset 871f01 in git

Timestamp:

Mar 17, 2011, 12:08:31 PM (12 years ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

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

Children:

fbb23ba606a10b85b9967f56b46d70c6ed807282

Parents:

3df116abe842435d60d8e8dc559ed7309d4ef38f

Message:

porting:solaris

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

File:

• kernel/gfan.cc (modified) (11 diffs)

kernel/gfan.cc

@@ -924 +924 @@
                 }
 
-                LObject *P = new sLObject();TODO What's the difference between sLObject and LObject?
+                LObject *P = new sLObject();//TODO What's the difference between sLObject and LObject?
                 memset(P,0,sizeof(LObject));
 
@@ -938 +938 @@
                                 if(P->p!=NULL)  spoly non zero=?
                                 {
-                                        poly p;NOTE Don't use pInit here. Evil memleak will follow
+                                        poly p;//NOTE Don't use pInit here. Evil memleak will follow
                                         poly q;
                                         poly pDel,qDel;
@@ -1206 +1206 @@
                 dd_FreeMatrix(posRestr);
         }
-        Clean up but don't delete the return value!
+        //Clean up but don't delete the return value!
         dd_FreeMatrix(ddineq);
         set_free(ddredrows);check
@@ -1674 +1674 @@
         TODO Not sufficient -> vol2 II/125&127
         NOTE Sufficient according to cddlibs doc. These ARE rays
-        What the hell... let's just take interior points
+        //What the hell... let's just take interior points
         if(gcone::hasHomInput==FALSE)
         {
@@ -1837 +1837 @@
         ideal srcRing_HH;
         srcRing_H=idrCopyR(H,tmpRing);
-        H is needed further below, so don't idDelete here
+        //H is needed further below, so don't idDelete here
         srcRing_HH=ffG(srcRing_H,this->gcBasis);
         idDelete(&srcRing_H);
@@ -1859 +1859 @@
         for (int ii=0;ii<IDELEMS(srcRing_HH);ii++)
         {
-                poly aktpoly=(poly)srcRing_HH->m[ii];This is a pointer, so don't pDelete
+                poly aktpoly=(poly)srcRing_HH->m[ii];//This is a pointer, so don't pDelete
                 iPMatrixRows = iPMatrixRows+pLength(aktpoly);
         }
@@ -1871 +1871 @@
         {
                 markingsAreCorrect=FALSE;       crucial to initialise here
-                poly aktpoly=srcRing_HH->m[ii]; Only a pointer, so don't pDelete
+                poly aktpoly=srcRing_HH->m[ii]; //Only a pointer, so don't pDelete
                 /*Comparison of leading monomials is done via exponent vectors*/
                 for (int jj=0;jj<IDELEMS(H);jj++)
@@ -1965 +1965 @@
                 dd_set_si(intPointMatrix->matrix[aktrow][jj],1);
         }
-        Let's make sure we compute interior points from the positive orthant
+        //Let's make sure we compute interior points from the positive orthant
         dd_MatrixPtr posRestr=dd_CreateMatrix(this->numVars,this->numVars+1);
 
@@ -2209 +2209 @@
         ideal srcRing_HH;
         srcRing_H=idrCopyR(H,tmpRing);
-        H is needed further below, so don't idDelete here
+        //H is needed further below, so don't idDelete here
         srcRing_HH=ffG(srcRing_H,this->gcBasis);
         idDelete(&srcRing_H);
@@ -2287 +2287 @@
         {
                 poly initialFormElement;
-                poly aktpoly = (poly)gb->m[ii];Ptr, so don't pDelete(aktpoly)
+                poly aktpoly = (poly)gb->m[ii];//Ptr, so don't pDelete(aktpoly)
                 int *leadExpV=(int *)omAlloc((this->numVars+1)*sizeof(int));
                 pGetExpV(aktpoly,leadExpV);     find the leading exponent in leadExpV[1],...,leadExpV[n], use pNext(p)
@@ -2942 +2942 @@
         for(int k=1;k<n;k++)
         {
-                Let's find a j s.t. m[j][k]!=0 && c[j]=0
+                //Let's find a j s.t. m[j][k]!=0 && c[j]=0
                 int condCtr=0;Check each row for zeroness
                 for(int j=1;j<m;j++)