find_divisor() [1/2]

binomial_gb_elem * binomialGB::find_divisor

(

monomial0

m

)

const

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

{
  unsigned int mask = ~(R->mask(m));
  int d = R->degree(m);
  for (gbmin_elem *p = first; p != nullptr; p = p->next)
    {
      if (R->degree(p->elem->f.lead) > d) return nullptr;
      if (mask & p->mask) continue;
      if (R->divides(p->elem->f.lead, m)) return p->elem;
    }
  return nullptr;
}

References first, monomial, p, and R.