find_all_divisors1()

template<typename Key>

void F4MonomialLookupTableT< Key >::find_all_divisors1 ( mi_node * mi, const_ntuple_monomial exp, std::vector< Key > & result_k ) const

private

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

{
  mi_node *p = mi;
 
  for (;;)
    {
      p = p->right;
 
      if (p == p->header)
        {
          if ((p = p->down()) == nullptr) return;
          continue;
        }
 
      if (p->exp > exp[p->var])
        {
          if ((p = p->header->down()) == nullptr) return;
          continue;
        }
 
      if (p->tag == mi_node::leaf)
        {
          result_k.push_back(p->key());
        }
      else
        p = p->down();
    }
}

References F4MonomialLookupTableT< Key >::mi_node::leaf, and p.

Referenced by find_all_divisors_packed(), and find_all_divisors_vp().