complexity()

size_t MutableComplex::complexity	(	const iterator &	i,
		const size_t	flags ) const

Definition at line 25 of file mutablecomplex.cpp.

{
  (void) flags;
  ring_elem e;
  const size_t n = i.index();
  const std::pair<size_t, size_t> u = *i;
  mDifferential[n]->get_entry(u.first, u.second, e);
  // Count terms in the column
  int s = 0;
  if (mLocalRing == nullptr)
    s = mPolynomialRing->n_terms(e);
  else
    s = mLocalRing->n_terms(e);
  for (size_t r = 0; r < mBetti[n]; ++r)
    {
      if (r == u.first) continue;
      mDifferential[n]->get_entry(r, u.second, e);
      if (mRing->is_zero(e)) continue;
      if (mLocalRing == nullptr)
        s += mPolynomialRing->n_terms(e);
      else
        s += mLocalRing->n_terms(e);
    }
  // Count terms in the row
  for (size_t c = 0; c < mBetti[n + 1]; ++c)
    {
      if (c == u.second) continue;
      mDifferential[n]->get_entry(u.first, c, e);
      if (mRing->is_zero(e)) continue;
      if (mLocalRing == nullptr)
        s += mPolynomialRing->n_terms(e);
      else
        s += mLocalRing->n_terms(e);
    }
  // std::cout<<s<<std::endl;
  // Local case: (size numerator elt) * (row/numerator/size//sum) *
  // (col/numerator/size//sum)
  return static_cast<size_t>(s);
}

References flags, mBetti, mLocalRing, mPolynomialRing, mRing, and s.

Referenced by find_unit().