find_strong_generators()

void MonomialTableZZ::find_strong_generators ( int nvars, const VECTOR(mpz_srcptr) & coeffs, const VECTOR(exponents_t) & exps, const VECTOR(int) & comps, VECTOR(int) & result_positions )

static

Definition at line 601 of file montableZZ.cpp.

{
  // Find the set of terms c*exp*comp such that every other one is divisible
  // by at least one of these.
 
  VECTOR(int) positions;
  positions.reserve(exps.size());
  for (unsigned int i = 0; i < exps.size(); i++) positions.push_back(i);
 
  /* The following sorts in ascending lex order, considering the component, exp
     vector
     and finally the coefficient */
  std::stable_sort(positions.begin(),
                   positions.end(),
                   montable_sorter_ZZ(nvars, coeffs, exps, comps));
 
#if 0
//   fprintf(stderr, "sorted terms: ");
//   for (int i=0; i<positions.size(); i++)
//     fprintf(stderr, "%d ", positions[i]);
//   fprintf(stderr, "\n");
#endif
 
  MonomialTableZZ *T = MonomialTableZZ::make(nvars);
  for (VECTOR(int)::iterator j = positions.begin(); j != positions.end(); j++)
    if (!T->is_strong_member(coeffs[*j], exps[*j], comps[*j]))
      {
        result_positions.push_back(*j);
        T->insert(coeffs[*j], exps[*j], comps[*j], *j);
      }
  /* We could return T if that is desired */
  //  freemem(T);
}

References make(), T, and VECTOR.