find_divisor() [2/2]

binomialGB::monomial_list * binomialGB::find_divisor	(	binomialGB::monomial_list *	I,
		monomial0	m ) const

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

{
  unsigned int mask = ~(R->mask(m));
  int d = R->degree(m);
  for (monomial_list *p = I; p != nullptr; p = p->next)
    {
      if (R->degree(p->m) > d) return nullptr;
      if (mask & p->mask) continue;
      if (R->divides(p->m, m)) return p;
    }
  return nullptr;
}

References monomial, p, and R.

Referenced by ideal_quotient(), reduce(), and reduce_monomial().