Changeset c5a888 in git for Singular/spolys0.cc

Timestamp:

May 4, 1998, 7:18:23 PM (25 years ago)

Author:

Olaf Bachmann <obachman@…>

Branches:

(u'spielwiese', '0d6b7fcd9813a1ca1ed4220cfa2b104b97a0a003')

Children:

386c6bc814514586879cb19ec90ecaa64971b294

Parents:

e54eb45c84188f8b4408403f6b00d223ab8140c0

Message:

* rm'ed long commented source code


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

File:

• Singular/spolys0.cc (modified) (2 diffs)

Singular/spolys0.cc

@@ -2 +2 @@
 *  Computer Algebra System SINGULAR     *
 ****************************************/
-/* $Id: spolys0.cc,v 1.10 1998-03-18 14:28:54 obachman Exp $ */
+/* $Id: spolys0.cc,v 1.11 1998-05-04 17:18:23 obachman Exp $ */
 
 /*
@@ -844 +844 @@
 }
 
-/*2
-* creates the last term of the S-polynomial of p1 and p2
-* in order to compute the ecart
-* do not destroy p1 and p2
-* remarks:
-*   1. the coefficient is undefined
-*   2. see above
-*/
-/*
-*static poly spGSpolyLast(poly p1, poly p2)
-*{
-*  poly a1 = pNext(p1), a2 = pNext(p2);
-*  poly m, b, L1, L2;
-*  number ta,tb,t;
-*  int c;
-*
-*  m = pNew();
-*  b = pNew();
-*  spMemcpy(m,p2);
-*  spMonSub(m,p1);
-*  pSetComp(b,pGetComp(p1));
-*  if (a2)
-*  {
-*    while (pNext(a2))
-*      pIter(a2);
-*  }
-*  if (a1)
-*  {
-*    while (pNext(a1))
-*      pIter(a1);
-*    spMemcpy(b,a1);
-*    spMonAdd(b,m);
-*  }
-*  else
-*  {
-*    spShort2(b,a2,m);
-*    return b;
-*  }
-*  if(!a2)
-*  {
-*    spShort1(b,a1,m);
-*    return b;
-*  }
-*  for (; ; )
-*  {
-*    c = pComp0(b, a2);
-*    if (c == -1)
-*    {
-*      spShort1(b,a1,m);
-*      return b;
-*    }
-*    else if (c == 1)
-*    {
-*      spShort2(b,a2,m);
-*      return b;
-*    }
-*    else
-*    {
-*      if (nIsOne(pGetCoeff(p1)))
-*      {
-*        if (nIsOne(pGetCoeff(p2)))
-*          t = nSub(pGetCoeff(a2), pGetCoeff(a1));
-*        else
-*        {
-*          ta = nMult(pGetCoeff(a1), pGetCoeff(p2));
-*          t = nSub(ta, pGetCoeff(a2));
-*          nDelete(&ta);
-*        }
-*      }
-*      else
-*      {
-*        if (nIsOne(pGetCoeff(p2)))
-*        {
-*          ta = nMult(pGetCoeff(a2), pGetCoeff(p1));
-*          t = nSub(ta, pGetCoeff(a1));
-*        }
-*        else
-*        {
-*          ta = nMult(pGetCoeff(a1), pGetCoeff(p2));
-*          tb = nMult(pGetCoeff(a2), pGetCoeff(p1));
-*          t = nSub(ta, tb);
-*          nDelete(&tb);
-*        }
-*        nDelete(&ta);
-*      }
-*      if (!nIsZero(t))
-*      {
-*        nDelete(&t);
-*        spShort1(b,a1,m);
-*        return b;
-*      }
-*      nDelete(&t);
-*      if (a1 != pNext(p1))
-*      {
-*        L1 = a1;
-*        a1 = pNext(p1);
-*        while (pNext(a1) != L1)
-*          pIter(a1);
-*        spMemcpy(b,a1);
-*        spMonAdd(b,m);
-*      }
-*      if (a2 != pNext(p2))
-*      {
-*        L2 = a2;
-*        a2 = pNext(p2);
-*        while (pNext(a2) != L2)
-*          pIter(a2);
-*      }
-*    }
-*  }
-*}
-*/
-/*2
-* creates the leading term of the S-polynomial of p1 and p2
-* and computes the ecart under the assumtion that
-* the last term of the S-polynomial is the greatest
-* do not destroy p1 and p2
-*/
-/*
-*poly spGSpolyShortMora(poly p1, poly p2, int *ecart)
-*{
-*  poly p, q;
-*
-*  p = spGSpolyShortBba(p1, p2, ecart);
-*  *ecart = 0;
-*  if(p)
-*  {
-*    if(spNoether==NULL)
-*    {
-*      q = spGSpolyLast(p1, p2);
-*      *ecart = pFDeg(q) - pFDeg(p);
-*      pFree1(q);
-*      return p;
-*    }
-*    if (pComp(p, spNoether) == -1)
-*    {
-*      pFree1(p);
-*      return NULL;
-*    }
-*    q = spGSpolyLast(p1, p2);
-*    if (pComp(q, spNoether) == -1)
-*      *ecart = pFDeg(spNoether) - pFDeg(p);
-*    else
-*      *ecart = pFDeg(q) - pFDeg(p);
-*    pFree1(q);
-*  }
-*  return p;
-*}
-*/