minimalize()

void ReducedGB_ZZ::minimalize ( const VECTOR(POLY) & polys0, bool auto_reduced )

virtual

Reimplemented from ReducedGB.

Definition at line 66 of file reducedgb-ZZ.cpp.

{
  // First sort these elements via increasing lex order (or monomial order?)
  // Next insert minimal elements into T, and polys
 
  VECTOR(int) positions;
  positions.reserve(polys0.size());
 
  for (int i = 0; i < polys0.size(); i++) positions.push_back(i);
 
  std::stable_sort(
      positions.begin(), positions.end(), ReducedGB_ZZ_sorter(R, F, polys0));
 
  // 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 (VECTOR(int)::iterator i = positions.begin(); i != positions.end(); i++)
    {
      gbvector *f = polys0[*i].f;
      exponents_t e = R->exponents_make();
      R->gbvector_get_lead_exponents(F, f, e);
      if ((!ringtableZZ ||
           !ringtableZZ->find_term_divisors(1, f->coeff.get_mpz(), e, 1)) &&
          T->find_term_divisors(1, f->coeff.get_mpz(), e, f->comp) == 0)
        {
          // Keep this element
 
          POLY h;
          ring_elem junk;
 
          h.f = R->gbvector_copy(f);
          h.fsyz = R->gbvector_copy(polys0[*i].fsyz);
 
          if (auto_reduced) remainder(h, false, junk);  // This auto-reduces h.
 
          if (h.f != nullptr && mpz_sgn(h.f->coeff.get_mpz()) < 0)
            {
              R->gbvector_mult_by_coeff_to(h.f, globalZZ->minus_one());
              R->gbvector_mult_by_coeff_to(h.fsyz, globalZZ->minus_one());
            }
 
          T->insert(h.f->coeff.get_mpz(), e, h.f->comp, INTSIZE(polys));
          polys.push_back(h);
        }
      else
        R->exponents_delete(e);
    }
}

References gbvector::coeff, gbvector::comp, ReducedGB::F, POLY::f, POLY::fsyz, ring_elem::get_mpz(), globalZZ, INTSIZE, POLY, ReducedGB::R, remainder(), ringtableZZ, T, and VECTOR.