Changeset 0c6135 in git for Singular/kstdfac.cc

Timestamp:

Nov 2, 1998, 10:05:43 AM (26 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'fieker-DuVal', '117eb8c30fc9e991c4decca4832b1d19036c4c65')(u'spielwiese', '38dfc5131670d387a89455159ed1e071997eec94')

Children:

a693ce0179a5c04bc94f843a2c264a12ceac2a86

Parents:

9dfc1bc6ba8cf5acb1a7ae30117ba921fadca819

Message:

*hannes: Print optimized


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

File:

• Singular/kstdfac.cc (modified) (8 diffs)

Singular/kstdfac.cc

@@ -2 +2 @@
 *  Computer Algebra System SINGULAR     *
 ****************************************/
-/* $Id: kstdfac.cc,v 1.19 1998-06-12 17:41:30 obachman Exp $ */
+/* $Id: kstdfac.cc,v 1.20 1998-11-02 09:05:39 Singular Exp $ */
 /*
 *  ABSTRACT -  Kernel: factorizing alg. of Buchberger
@@ -103 +103 @@
       if(i>o->tl)
       {
-        Print("poly p1 not found in T:");wrp(p);PrintLn();
+        PrintS("poly p1 not found in T:");wrp(p);PrintLn();
         l[j].p1=pCopy(p);
         break;
@@ -122 +122 @@
       if(i>o->tl)
       {
-        Print("poly p2 not found in T:");wrp(p);PrintLn();
+        PrintS("poly p2 not found in T:");wrp(p);PrintLn();
         l[j].p2=pCopy(p);
         break;
@@ -515 +515 @@
         }
         if (strat->redTailChange)
-        {
+        {
           idDelete(&fac);
           fac=singclap_factorize(strat->P.p,NULL,1);
@@ -527 +527 @@
           idDelete(&fac_copy);
           fac_copy=idInit(IDELEMS(fac),1);
-        }
-        if ((IDELEMS(fac)==1)&&(facdeg==pFDeg(fac->m[0])))
-        {
-          pDelete(&(fac->m[0]));
-          fac->m[0]=strat->P.p;
-        }
+        }
+        if ((IDELEMS(fac)==1)&&(facdeg==pFDeg(fac->m[0])))
+        {
+          pDelete(&(fac->m[0]));
+          fac->m[0]=strat->P.p;
+        }
       }
       if (strat->P.lcm!=NULL) pFree1(strat->P.lcm);
@@ -597 +597 @@
 
         //if (n->redTailChange)
-        //{
-        //  int pos = n->posInL(n->L,n->Ll,n->P,n);
-        //  enterL(&n->L,&n->Ll,&n->Lmax,n->P,pos);
-        //}
-        //else
-        {
+        //{
+        //  int pos = n->posInL(n->L,n->Ll,n->P,n);
+        //  enterL(&n->L,&n->Ll,&n->Lmax,n->P,pos);
+        //}
+        //else
+        {
           if (TEST_OPT_DEBUG)
           {
@@ -619 +619 @@
             enterTBba(n->P,pos,n);
           }
-        }
+        }
 
         /* construct D */
@@ -665 +665 @@
                   messageSets(n);
                 }
-                //if (n->Ll >=0) Print("Ll:%d|",n->Ll);
+                //if (n->Ll >=0) Print("Ll:%d|",n->Ll);
                 while (n->Ll >= 0) deleteInL(n->L,&n->Ll,n->Ll,n);
-                //if (n->tl >=0) Print("tl:%d|",n->tl);
+                //if (n->tl >=0) Print("tl:%d|",n->tl);
                 while (n->tl >= 0) { pDelete(&n->T[n->tl].p); n->tl--; }
                 memset(n->Shdl->m,0,IDELEMS(n->Shdl)*sizeof(poly));