|
carl
25.04
Computer ARithmetic Library
|
Implements utility functions concerning the (total) degree of monomials, terms and polynomials. More...


Go to the source code of this file.
Namespaces | |
| carl | |
| carl is the main namespace for the library. | |
Functions | |
| auto | carl::total_degree (const Monomial &m) |
| Gives the total degree, i.e. More... | |
| bool | carl::is_constant (const Monomial &m) |
| Checks whether the monomial is a constant. More... | |
| bool | carl::is_linear (const Monomial &m) |
| Checks whether the monomial has exactly degree one. More... | |
| bool | carl::is_at_most_linear (const Monomial &m) |
| Checks whether the monomial has at most degree one. More... | |
| template<typename Coeff > | |
| std::size_t | carl::total_degree (const Term< Coeff > &t) |
| Gives the total degree, i.e. More... | |
| template<typename Coeff > | |
| bool | carl::is_constant (const Term< Coeff > &t) |
| Checks whether the monomial is a constant. More... | |
| template<typename Coeff > | |
| bool | carl::is_linear (const Term< Coeff > &t) |
| Checks whether the monomial has exactly the degree one. More... | |
| template<typename Coeff > | |
| bool | carl::is_at_most_linear (const Term< Coeff > &t) |
| Checks whether the monomial has at most degree one. More... | |
| template<typename Coeff , typename Ordering , typename Policies > | |
| std::size_t | carl::total_degree (const MultivariatePolynomial< Coeff, Ordering, Policies > &p) |
| Calculates the max. More... | |
| template<typename Coeff , typename Ordering , typename Policies > | |
| bool | carl::is_constant (const MultivariatePolynomial< Coeff, Ordering, Policies > &p) |
| Check if the polynomial is linear. More... | |
| template<typename Coeff , typename Ordering , typename Policies > | |
| bool | carl::is_linear (const MultivariatePolynomial< Coeff, Ordering, Policies > &p) |
| Check if the polynomial is linear. More... | |
| template<typename Coeff > | |
| std::size_t | carl::total_degree (const UnivariatePolynomial< Coeff > &p) |
| Returns the total degree of the polynomial, that is the maximum degree of any monomial. More... | |
| template<typename Coeff > | |
| bool | carl::is_constant (const UnivariatePolynomial< Coeff > &p) |
| Checks whether the polynomial is constant with respect to the main variable. More... | |
| template<typename Coeff > | |
| bool | carl::is_linear (const UnivariatePolynomial< Coeff > &p) |
Implements utility functions concerning the (total) degree of monomials, terms and polynomials.
Definition in file Degree.h.