pp_Mult_nn__T.cc

Go to the documentation of this file.

/****************************************
*  Computer Algebra System SINGULAR     *
****************************************/
/***************************************************************
 *  File:    pp_Mult_nn__Template.cc
 *  Purpose: template for pp_Mult_nn
 *  Author:  obachman (Olaf Bachmann)
 *  Created: 8/00
 *******************************************************************/
 
/***************************************************************
 *
 *   Returns:  p*n
 *   Const:    p, n
 *
 ***************************************************************/
LINKAGE poly pp_Mult_nn__T(poly p, const number n, const ring r)
{
  pAssume(!n_IsZero__T(n,r->cf));
  p_Test(p, r);
  if (p == NULL) return NULL;
  spolyrec rp;
#ifdef HAVE_ZERODIVISORS
  rp.next = NULL;
#endif
  poly q = &rp;
  omBin bin = r->PolyBin;
  DECLARE_LENGTH(const unsigned long length = r->ExpL_Size);
 
  do
  {
#ifndef HAVE_ZERODIVISORS
    p_AllocBin(pNext(q), bin, r);
    pIter(q);
    number nc = pGetCoeff(p);
    pSetCoeff0(q, n_Mult__T(n, nc, r->cf));
    p_MemCopy__T(q->exp, p->exp, length);
#else
    number nc = pGetCoeff(p);
    number tmp = n_Mult__T(n, nc, r->cf);
    if (! n_IsZero__T(tmp,r->cf))
    {
      p_AllocBin(pNext(q), bin, r);
      pIter(q);
      pSetCoeff0(q, tmp);
      p_MemCopy__T(q->exp, p->exp, length);
    }
    else
      n_Delete__T(&tmp,r->cf);
#endif
    pIter(p);
  }
  while (p != NULL);
  pNext(q) = NULL;
 
  p_Test(rp.next, r);
  return rp.next;
}