insert1()

template<typename Key>

void ResF4MonomialLookupTableT< Key >::insert1 ( mi_node *& p, const_varpower_monomial m, Key k )

private

Definition at line 90 of file res-f4-monlookup.cpp.

{
  count += 2;
  mi_node **p = &top, *up = nullptr;
  bool one_element = true;
 
  for (index_res_varpower_monomial i = b; i.valid();)
    {
      one_element = false;
      varpower_word insert_var = i.var();
      varpower_word insert_exp;
 
      if (*p == nullptr)
        {
          // make a new header node
          *p = new_mi_node(insert_var, 0, up);
          (*p)->header = (*p)->left = (*p)->right = *p;
        }
      else if ((*p)->var < insert_var)
        {
          // make a new layer
          mi_node *header_node, *zero_node;
          header_node = new_mi_node(insert_var, 0, up);
          zero_node = new_mi_node(insert_var, 0, *p);
 
          header_node->left = header_node->right = zero_node;
          (*p)->down() = zero_node;
          *p = header_node->header = zero_node->header = zero_node->left =
              zero_node->right = header_node;
        }
 
      if ((*p)->var > insert_var)
        {
          insert_var = (*p)->var;
          insert_exp = 0;
        }
      else
        {
          insert_exp = i.exponent();
          ++i;
        }
 
      mi_node *q = (*p)->right;
      while ((q != q->header) && (q->exp < insert_exp)) q = q->right;
      if (q->exp != insert_exp)
        {
          mi_node *insert_node;
 
          if (i.valid())
            {
              insert_node = new_mi_node(
                  insert_var, insert_exp, static_cast<mi_node *>(nullptr));
              q->insert_to_left(insert_node);
              q = insert_node;
            }
          else
            {
              insert_node = new_mi_node(insert_var, insert_exp, k);
              q->insert_to_left(insert_node);
              return;
            }
        }
 
      up = q;
      p = &(q->down());
    }
  if (one_element)
    {
      // insert a header node and a var/exp = 0/0 leaf
      top = new_mi_node(0, 0, static_cast<mi_node *>(nullptr));
      mi_node *leaf_node = new_mi_node(0, 0, k);
      top->left = top->right = leaf_node;
      top->header = leaf_node->header = leaf_node->left = leaf_node->right =
          top;
    }
}

References count, ResF4MonomialLookupTableT< Key >::mi_node::down, ResF4MonomialLookupTableT< Key >::mi_node::exp, ResF4MonomialLookupTableT< Key >::mi_node::header, ResF4MonomialLookupTableT< Key >::mi_node::insert_to_left(), ResF4MonomialLookupTableT< Key >::mi_node::left, new_mi_node(), p, and ResF4MonomialLookupTableT< Key >::mi_node::right.

Referenced by insert_minimal_vp().