process_pair()

void binomialGB_comp::process_pair ( binomial_s_pair p )

private

Definition at line 1096 of file gb-toric.cpp.

{
  bool ismin, subringmin;
  binomial f;
 
  if (s.f2 == nullptr)
    {
      // A generator
      ismin = true;
      subringmin = true;
      f = R->copy_binomial(
          s.f1->f);  // This is probably being left for garbage...
    }
  else
    {
      if (s.f1->smaller != nullptr || s.f2->smaller != nullptr)
        {
          if (s.f1->smaller != s.f2 && s.f2->smaller != s.f1)
            {
              return;
            }
        }
 
      if (M2_gbTrace >= 5)
        {
          buffer o;
          o << "pair [";
          R->elem_text_out(o, s.f1->f);
          o << " ";
          R->elem_text_out(o, s.f2->f);
          o << "]" << newline;
          emit(o.str());
        }
      if (!R->calc_s_pair(s, f))
        {
          // The pair already reduces to zero.
          return;
        }
      ismin = false;
      subringmin = (R->weight(s.lcm) > 0);
    }
 
  if (Gmin->reduce(f))
    {
      if (M2_gbTrace >= 5)
        {
          buffer o;
          o << "  reduced to ";
          R->elem_text_out(o, f);
          emit_line(o.str());
        }
      subringmin = (subringmin && R->weight(f.lead) == 0);
      binomial_gb_elem *p = new binomial_gb_elem(f);
      Gmin->make_new_pairs(Pairs, p);
      Gmin->minimalize_and_insert(p);
      if (ismin) mingens.push_back(p);
      if (subringmin) mingens_subring.push_back(p);
      G.push_back(p);
    }
  else
    R->remove_binomial(f);
}

References emit(), emit_line(), G, Gmin, binomial::lead, M2_gbTrace, newline, p, Pairs, R, s, and buffer::str().

Referenced by start_computation().