#include <algorithm>
#include <cassert>
#include <utility>
#include <vector>
Go to the source code of this file.
|
| namespace | MR |
| | only for bindings generation
|
|
| template<typename T, typename D, D M> |
| using | MR::SparsePolynomialProduct = SparsePolynomial<decltype( std::declval<T>() * std::declval<T>() ), D, M> |
| | the type of the polynomial with coefficients of the type of the product of two values of type T
|
|
| template<typename T, typename C, typename D, D M> |
| SparsePolynomialProduct< T, D, M > | MR::mulAs (const SparsePolynomial< C, D, M > &a, const SparsePolynomial< C, D, M > &b) |
| template<typename C, typename D, D M> |
| SparsePolynomial< C, D, M > | MR::operator* (const SparsePolynomial< C, D, M > &a, const SparsePolynomial< C, D, M > &b) |
| | computes the product of two polynomials with the coefficients of the same type
|
| template<typename T, typename C, typename D, D M> |
| int | MR::signOfProductsDiff (const SparsePolynomial< C, D, M > &a, const SparsePolynomial< C, D, M > &b, const SparsePolynomial< C, D, M > &c, const SparsePolynomial< C, D, M > &d) |