| empty() const | MR::SparsePolynomial< C, D, M > | inline |
| fromUnsortedTerms(std::vector< Term > &&terms) | MR::SparsePolynomial< C, D, M > | static |
| get() const | MR::SparsePolynomial< C, D, M > | inline |
| isPositive() const | MR::SparsePolynomial< C, D, M > | |
| mulAs(const SparsePolynomial< C2, D2, M2 > &a, const SparsePolynomial< C2, D2, M2 > &b) | MR::SparsePolynomial< C, D, M > | friend |
| operator+(SparsePolynomial a, const SparsePolynomial &b) | MR::SparsePolynomial< C, D, M > | friend |
| operator+=(const SparsePolynomial &b) | MR::SparsePolynomial< C, D, M > | |
| operator-(SparsePolynomial a, const SparsePolynomial &b) | MR::SparsePolynomial< C, D, M > | friend |
| operator-=(const SparsePolynomial &b) | MR::SparsePolynomial< C, D, M > | |
| setZeroCoeff(D d) | MR::SparsePolynomial< C, D, M > | inline |
| SparsePolynomial()=default | MR::SparsePolynomial< C, D, M > | |
| SparsePolynomial(std::vector< Term > &&) | MR::SparsePolynomial< C, D, M > | |
| SparsePolynomial(C c0, D d1, C c1) | MR::SparsePolynomial< C, D, M > | |
| SparsePolynomial(C c0, D d1, C c1, D d2, C c2) | MR::SparsePolynomial< C, D, M > | |
| Term typedef | MR::SparsePolynomial< C, D, M > | |