debug_check() [2/2]

template<typename Key>

int F4MonomialLookupTableT< Key >::debug_check ( mi_node * p, const mi_node * up ) const

private

Definition at line 450 of file f4-monlookup.cpp.

{
  mi_node *q;
  // First check the node 'p' itself
  assert(p != nullptr);
  assert(p->var >= 0);
  if (up != nullptr) assert(p->var < up->var);
  assert(p->header == p);
  assert(p->tag == mi_node::node);
  assert(p->down() == up);
  assert(p->left != nullptr);
  assert(p->right != nullptr);
 
  // Now loop through each element in left/right chain, checking that
  // v, e, left, right values are consistent.
  for (q = p->left; q != p; q = q->left)
    {
      assert(q->left != nullptr);
      assert(q->right != nullptr);
      assert(q->header == p);
      assert(q->right->left == q);
      assert(q->left->right == q);
      assert(q->var == p->var);
      assert((q->right == p) || (q->exp < q->right->exp));
      assert(q->exp >= 0);
    }
 
  // Now loop through again, this time descending into nodes
  int c = 0;
  for (q = p->right; q != p; q = q->right)
    if (q->tag == mi_node::node)
      c += debug_check(q->down(), q);
    else
      c++;
  return c;
}

References debug_check(), F4MonomialLookupTableT< Key >::mi_node::down, F4MonomialLookupTableT< Key >::mi_node::exp, F4MonomialLookupTableT< Key >::mi_node::header, F4MonomialLookupTableT< Key >::mi_node::left, F4MonomialLookupTableT< Key >::mi_node::node, p, F4MonomialLookupTableT< Key >::mi_node::right, F4MonomialLookupTableT< Key >::mi_node::tag, and F4MonomialLookupTableT< Key >::mi_node::var.

Referenced by debug_check(), and debug_check().