add_marked_elems()

void MarkedGB::add_marked_elems ( const VECTOR(gbvector *) & leadterms, const VECTOR(POLY) & polys0, bool auto_reduced )

virtual

Definition at line 61 of file reducedgb-marked.cpp.

{
  (void) auto_reduced;
  // First sort these elements via increasing lex order (or monomial order?)
  // Next insert minimal elements into T, and polys
  const Monoid *M = originalR->getMonoid();
 
  leadterms = newarray(gbvector *, leadterms0.size());
 
  // Now loop through each element, and see if the lead monomial is in T.
  // If not, add it in , and place element into 'polys'.
 
  for (int i = 0; i < leadterms0.size(); i++)
    {
      POLY h;
      ring_elem junk;
 
      gbvector *f = polys0[i].f;
      gbvector *inf = leadterms0[i];
 
      h.f = R->gbvector_copy(f);
      h.fsyz = R->gbvector_copy(polys0[i].fsyz);
 
      gbvector *iinf = nullptr;
      for (gbvector *t = h.f; t != nullptr; t = t->next)
        if (inf->comp == t->comp && EQ == M->compare(inf->monom, t->monom))
          {
            iinf = t;
            break;
          }
      if (!iinf)
        {
          ERROR("lead term does not appear in the polynomial!");
          iinf = f;
        }
      leadterms[i] = iinf;
 
      exponents_t e = R->exponents_make();
      R->gbvector_get_lead_exponents(F, iinf, e);
 
      //      if (auto_reduced)
      //        remainder(h,false,junk); // This auto-reduces h. MES MES!! Maybe
      //        not for marked GB!!
 
      R->gbvector_remove_content(h.f, h.fsyz);
 
      T->insert(e, iinf->comp, i);
      polys.push_back(h);
    }
 
  auto_reduce();
}

References auto_reduce(), gbvector::comp, Monoid::compare(), EQ, ERROR, ReducedGB::F, POLY::f, POLY::fsyz, leadterms, gbvector::monom, newarray, gbvector::next, ReducedGB::originalR, POLY, ReducedGB::R, and T.

Referenced by GBDeclared::GBDeclared().