insert() [2/2]

void binomial_s_pair_set::insert

(

binomial_s_pair

p

)

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

{
  int deg = R->degree(s.lcm);
 
  // Statistics control
  if (deg > _max_degree)
    {
      // Extend _npairs:
      for (int i = 2 * _max_degree + 2; i < 2 * deg + 2; i++) _npairs.push_back(0);
      _max_degree = deg;
    }
  _npairs[2 * deg]++;
  _npairs[2 * deg + 1]++;
 
  s_pair_degree_list *q = _pairs;
  while (true)
    {
      if (q->next == nullptr || q->next->deg > deg)
        {
          // Insert new degree node
          s_pair_degree_list *q1 = new s_pair_degree_list;
          q1->next = q->next;
          q1->deg = deg;
          q1->pairs = nullptr;
          q->next = q1;
          break;
        }
      if (q->next->deg == deg) break;
      q = q->next;
    }
  q = q->next;
  insert_pair(q, s);
  _n_elems++;
  q->n_elems++;
}

References _max_degree, _n_elems, _npairs, _pairs, binomial_s_pair_set::s_pair_degree_list::deg, insert_pair(), 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_degree_list::pairs, R, and s.