mult_by_term1()

gbvector * GBRingPoly::mult_by_term1 ( const FreeModule * F, const gbvector * f, ring_elem u, const int * monom, int comp )

virtual

Implements GBRing.

Definition at line 98 of file gbring.cpp.

{
  (void) F;
  // Remember: this multiplies w/o regard to any quotient elements
  gbvector head;
  gbvector *inresult = &head;
  int monlen = M->monomial_size();
 
  for (const gbvector *s = f; s != nullptr; s = s->next)
    {
      gbvector *t = new_raw_term();
      t->next = nullptr;
      t->comp = s->comp + comp;
      t->coeff = K->mult(u, s->coeff);
      exponents::mult(monlen, monom, s->monom, t->monom);
      inresult->next = t;
      inresult = inresult->next;
    }
  inresult->next = nullptr;
  return head.next;
}

References gbvector::coeff, gbvector::comp, GBRing::K, GBRing::M, gbvector::monom, ExponentVector< int, true >::mult(), GBRing::new_raw_term(), gbvector::next, and s.