next()

bool binomial_s_pair_set::next	(	const int *	d,
		binomial_s_pair &	result,
		int &	result_deg )

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

{
  if (_pairs->next == nullptr) return false;
  if (d != nullptr && _pairs->next->deg > *d) return false;
  s_pair_degree_list *thisdeg = _pairs->next;
  s_pair_lcm_list *thislcm = thisdeg->pairs;
  s_pair_elem *s = thislcm->pairs;
  result_deg = thisdeg->deg;
 
  thisdeg->n_elems--;
  _n_elems--;
  _npairs[2 * (thisdeg->deg) + 1]--;
 
  result = binomial_s_pair(s->f1, s->f2, thislcm->lcm);
 
  thislcm->pairs = s->next;
  if (thislcm->pairs == nullptr)
    {
      // Now we must remove this set
      thisdeg->pairs = thislcm->next;
      R->remove_monomial(_prev_lcm);
      _prev_lcm = thislcm->lcm;
      thislcm->lcm = nullptr;
      freemem(thislcm);
 
      if (thisdeg->pairs == nullptr)
        {
          // Now we must remove this larger degree list
          _pairs->next = thisdeg->next;
          freemem(thisdeg);
        }
    }
 
  freemem(s);
  return true;
}

References _n_elems, _npairs, _pairs, _prev_lcm, binomial_s_pair_set::s_pair_degree_list::deg, freemem(), binomial_s_pair_set::s_pair_lcm_list::lcm, binomial_s_pair_set::s_pair_degree_list::n_elems, binomial_s_pair_set::s_pair_degree_list::next, binomial_s_pair_set::s_pair_lcm_list::next, binomial_s_pair_set::s_pair_degree_list::pairs, binomial_s_pair_set::s_pair_lcm_list::pairs, R, result(), and s.