5 #include "../MultivariatePolynomial.h"
6 #include "../UnivariatePolynomial.h"
13 template<
typename C,
typename O,
typename P>
16 if (dividend == divisor) {
32 tam.template addTerm<true>(
id, factor);
40 tam.readTerms(
id, result.
terms());
42 result.template makeMinimallyOrdered<false, true>();
carl is the main namespace for the library.
Interval< Number > quotient(const Interval< Number > &_lhs, const Interval< Number > &_rhs)
Implements the division with remainder.
bool is_zero(const Interval< Number > &i)
Check if this interval is a point-interval containing 0.
bool is_one(const Interval< Number > &i)
Check if this interval is a point-interval containing 1.
The general-purpose multivariate polynomial class.
const TermsType & terms() const
bool is_consistent() const
Asserts that this polynomial complies with the requirements and assumptions for MultivariatePolynomia...
MultivariatePolynomial & strip_lterm()
Drops the leading term.
const Term< Coeff > & lterm() const
The leading term.
void subtractProduct(const Term< Coeff > &factor, const MultivariatePolynomial &p)
Subtract a term times a polynomial from this polynomial.
void reset_ordered() const
std::size_t nr_terms() const
Calculate the number of terms.
Represents a single term, that is a numeric coefficient and a monomial.
Term divide(const Coefficient &c) const