| characteristic (defined in SparseUnivariatePolynomial< Ring >) | SparseUnivariatePolynomial< Ring > | |
| coefficient(int k) const | SparseUnivariatePolynomial< Ring > | inlinevirtual |
| content() const override | SparseUnivariatePolynomial< Ring > | inline |
| convertToConstant() | SparseUnivariatePolynomial< Ring > | inline |
| convertToDUQP() (defined in SparseUnivariatePolynomial< Ring >) | SparseUnivariatePolynomial< Ring > | inline |
| convertToDUZP() (defined in SparseUnivariatePolynomial< Ring >) | SparseUnivariatePolynomial< Ring > | inline |
| convertToExpressionTree() const (defined in SparseUnivariatePolynomial< Ring >) | SparseUnivariatePolynomial< Ring > | inline |
| degree() const | SparseUnivariatePolynomial< Ring > | inline |
| derivative(int k) const | SparseUnivariatePolynomial< Ring > | inlinevirtual |
| derivative() const | SparseUnivariatePolynomial< Ring > | inlinevirtual |
| differentiate(int k) | SparseUnivariatePolynomial< Ring > | inlinevirtual |
| differentiate() | SparseUnivariatePolynomial< Ring > | inlinevirtual |
| evaluate(const Ring &x) const | SparseUnivariatePolynomial< Ring > | inlinevirtual |
| evaluate(const LargerRing &x) const | SparseUnivariatePolynomial< Ring > | inline |
| fillChain(std::vector< SparseUnivariatePolynomial< Ring >> &chain) const (defined in SparseUnivariatePolynomial< Ring >) | SparseUnivariatePolynomial< Ring > | inline |
| gcd(const SparseUnivariatePolynomial< Ring > &q) const | SparseUnivariatePolynomial< Ring > | inline |
| integral() const | SparseUnivariatePolynomial< Ring > | inline |
| integrate() | SparseUnivariatePolynomial< Ring > | inline |
| isConstant() const | SparseUnivariatePolynomial< Ring > | inline |
| isConstantTermZero() const | SparseUnivariatePolynomial< Ring > | inline |
| isNegativeOne() const | SparseUnivariatePolynomial< Ring > | inline |
| isOne() const | SparseUnivariatePolynomial< Ring > | inline |
| isZero() const | SparseUnivariatePolynomial< Ring > | inline |
| lazyPseudoDivide(const SparseUnivariatePolynomial< Ring > &b, Ring *c, Ring *d=NULL) | SparseUnivariatePolynomial< Ring > | inlinevirtual |
| lazyPseudoDivide(const SparseUnivariatePolynomial< Ring > &b, SparseUnivariatePolynomial< Ring > *rem, Ring *c, Ring *d) const | SparseUnivariatePolynomial< Ring > | inlinevirtual |
| leadingCoefficient() const | SparseUnivariatePolynomial< Ring > | inline |
| monicDivide(const SparseUnivariatePolynomial< Ring > &b) | SparseUnivariatePolynomial< Ring > | inlinevirtual |
| monicDivide(const SparseUnivariatePolynomial< Ring > &b, SparseUnivariatePolynomial< Ring > *rem) const | SparseUnivariatePolynomial< Ring > | inlinevirtual |
| monomialBasisSubresultantChain(const SparseUnivariatePolynomial< Ring > &q) | SparseUnivariatePolynomial< Ring > | inline |
| negate() | SparseUnivariatePolynomial< Ring > | inline |
| negativeOne() | SparseUnivariatePolynomial< Ring > | inline |
| numberOfTerms() const | SparseUnivariatePolynomial< Ring > | inline |
| one() | SparseUnivariatePolynomial< Ring > | inline |
| operator!=(const SparseUnivariatePolynomial< Ring > &b) const | SparseUnivariatePolynomial< Ring > | inline |
| operator*(const SparseUnivariatePolynomial< Ring > &b) const | SparseUnivariatePolynomial< Ring > | inline |
| operator*(const Ring &c) const | SparseUnivariatePolynomial< Ring > | inline |
| operator*(const sfixn &e) const (defined in SparseUnivariatePolynomial< Ring >) | SparseUnivariatePolynomial< Ring > | inline |
| operator* (defined in SparseUnivariatePolynomial< Ring >) | SparseUnivariatePolynomial< Ring > | friend |
| operator* (defined in SparseUnivariatePolynomial< Ring >) | SparseUnivariatePolynomial< Ring > | friend |
| operator*=(const SparseUnivariatePolynomial< Ring > &b) | SparseUnivariatePolynomial< Ring > | inline |
| operator*=(const Ring &c) | SparseUnivariatePolynomial< Ring > | inline |
| operator*=(const sfixn &e) (defined in SparseUnivariatePolynomial< Ring >) | SparseUnivariatePolynomial< Ring > | inline |
| operator+(const SparseUnivariatePolynomial< Ring > &b) const | SparseUnivariatePolynomial< Ring > | inline |
| operator+(const Ring &e) const | SparseUnivariatePolynomial< Ring > | inline |
| operator+ (defined in SparseUnivariatePolynomial< Ring >) | SparseUnivariatePolynomial< Ring > | friend |
| operator+=(const SparseUnivariatePolynomial< Ring > &b) | SparseUnivariatePolynomial< Ring > | inline |
| operator+=(const Ring &e) | SparseUnivariatePolynomial< Ring > | inline |
| operator-() const | SparseUnivariatePolynomial< Ring > | inline |
| operator-(const SparseUnivariatePolynomial< Ring > &b) const | SparseUnivariatePolynomial< Ring > | inline |
| operator-(const Ring &e) const | SparseUnivariatePolynomial< Ring > | inline |
| operator- (defined in SparseUnivariatePolynomial< Ring >) | SparseUnivariatePolynomial< Ring > | friend |
| operator-=(const SparseUnivariatePolynomial< Ring > &b) | SparseUnivariatePolynomial< Ring > | inline |
| operator-=(const Ring &e) | SparseUnivariatePolynomial< Ring > | inline |
| operator/(const SparseUnivariatePolynomial< Ring > &b) const | SparseUnivariatePolynomial< Ring > | inline |
| operator/(const Ring &e) const | SparseUnivariatePolynomial< Ring > | inline |
| operator/ (defined in SparseUnivariatePolynomial< Ring >) | SparseUnivariatePolynomial< Ring > | friend |
| operator/=(const SparseUnivariatePolynomial< Ring > &b) | SparseUnivariatePolynomial< Ring > | inline |
| operator/=(const Ring &e) | SparseUnivariatePolynomial< Ring > | inline |
| operator<<(int k) const | SparseUnivariatePolynomial< Ring > | inlinevirtual |
| operator<<=(int k) | SparseUnivariatePolynomial< Ring > | inlinevirtual |
| operator=(const SparseUnivariatePolynomial< Ring > &b) | SparseUnivariatePolynomial< Ring > | inline |
| operator=(const Ring &r) | SparseUnivariatePolynomial< Ring > | inline |
| operator==(const SparseUnivariatePolynomial< Ring > &b) const | SparseUnivariatePolynomial< Ring > | inline |
| operator==(const DenseUnivariateRationalPolynomial &b) const (defined in SparseUnivariatePolynomial< Ring >) | SparseUnivariatePolynomial< Ring > | inline |
| operator==(const DenseUnivariateIntegerPolynomial &b) const (defined in SparseUnivariatePolynomial< Ring >) | SparseUnivariatePolynomial< Ring > | inline |
| operator>>(int k) const | SparseUnivariatePolynomial< Ring > | inlinevirtual |
| operator>>=(int k) | SparseUnivariatePolynomial< Ring > | inlinevirtual |
| operator^(long long int e) const | SparseUnivariatePolynomial< Ring > | inline |
| operator^=(long long int e) | SparseUnivariatePolynomial< Ring > | inline |
| primitivePart() const (defined in SparseUnivariatePolynomial< Ring >) | SparseUnivariatePolynomial< Ring > | inline |
| print(std::ostream &out) const | SparseUnivariatePolynomial< Ring > | inline |
| pseudoDivide(const SparseUnivariatePolynomial< Ring > &b, Ring *d=NULL) | SparseUnivariatePolynomial< Ring > | inlinevirtual |
| pseudoDivide(const SparseUnivariatePolynomial< Ring > &b, SparseUnivariatePolynomial< Ring > *rem, Ring *d) const | SparseUnivariatePolynomial< Ring > | inlinevirtual |
| resultant(const SparseUnivariatePolynomial< Ring > &q) | SparseUnivariatePolynomial< Ring > | inline |
| setCoefficient(int e, const Ring &c) | SparseUnivariatePolynomial< Ring > | inlinevirtual |
| setVariableName(const Symbol &c) | SparseUnivariatePolynomial< Ring > | inlinevirtual |
| SparseUnivariatePolynomial() | SparseUnivariatePolynomial< Ring > | inline |
| SparseUnivariatePolynomial(const SparseUnivariatePolynomial< Ring > &b) | SparseUnivariatePolynomial< Ring > | inline |
| SparseUnivariatePolynomial(int a) (defined in SparseUnivariatePolynomial< Ring >) | SparseUnivariatePolynomial< Ring > | inline |
| SparseUnivariatePolynomial(const Integer &c) (defined in SparseUnivariatePolynomial< Ring >) | SparseUnivariatePolynomial< Ring > | inline |
| SparseUnivariatePolynomial(const RationalNumber &c) (defined in SparseUnivariatePolynomial< Ring >) | SparseUnivariatePolynomial< Ring > | inline |
| SparseUnivariatePolynomial(const ComplexRationalNumber &c) (defined in SparseUnivariatePolynomial< Ring >) | SparseUnivariatePolynomial< Ring > | inline |
| SparseUnivariatePolynomial(const DenseUnivariateIntegerPolynomial &b) (defined in SparseUnivariatePolynomial< Ring >) | SparseUnivariatePolynomial< Ring > | inline |
| SparseUnivariatePolynomial(const DenseUnivariateRationalPolynomial &b) (defined in SparseUnivariatePolynomial< Ring >) | SparseUnivariatePolynomial< Ring > | inline |
| SparseUnivariatePolynomial(Symbol sym) (defined in SparseUnivariatePolynomial< Ring >) | SparseUnivariatePolynomial< Ring > | inline |
| squareFree() const | SparseUnivariatePolynomial< Ring > | inline |
| subresultantChain(const SparseUnivariatePolynomial< Ring > &q, int filled=0) const | SparseUnivariatePolynomial< Ring > | inline |
| trailingCoefficient() const (defined in SparseUnivariatePolynomial< Ring >) | SparseUnivariatePolynomial< Ring > | inline |
| unitCanonical(SparseUnivariatePolynomial< Ring > *u=NULL, SparseUnivariatePolynomial< Ring > *v=NULL) const (defined in SparseUnivariatePolynomial< Ring >) | SparseUnivariatePolynomial< Ring > | inline |
| variable() const | SparseUnivariatePolynomial< Ring > | inlinevirtual |
| zero() | SparseUnivariatePolynomial< Ring > | inline |
| ~SparseUnivariatePolynomial() | SparseUnivariatePolynomial< Ring > | inline |
1.8.13