Basic Polynomial Algebra Subprograms (BPAS)
v. 1.791
|
A sparsely represented univariate polynomial over an arbitrary ring. More...
#include <upolynomial.h>
Public Types | |
typedef SparseUnivariateTempPoly< Ring, SparseUnivariatePolynomial< Ring > > | Base |
Public Member Functions | |
SparseUnivariatePolynomial< Ring > & | operator= (const SparseUnivariatePolynomial< Ring > &other) |
SparseUnivariatePolynomial< Ring > & | operator= (SparseUnivariatePolynomial< Ring > &&other) |
SparseUnivariatePolynomial< Ring > & | operator= (const Ring &r) |
SparseUnivariatePolynomial (const SparseUnivariatePolynomial< Ring > &other) | |
SparseUnivariatePolynomial (SparseUnivariatePolynomial< Ring > &&other) | |
SparseUnivariatePolynomial (int a) | |
SparseUnivariatePolynomial (const Integer &a) | |
SparseUnivariatePolynomial (const RationalNumber &a) | |
SparseUnivariatePolynomial (const ComplexRationalNumber &a) | |
SparseUnivariatePolynomial (const DenseUnivariateIntegerPolynomial &b) | |
SparseUnivariatePolynomial (const DenseUnivariateRationalPolynomial &b) | |
SparseUnivariatePolynomial (Symbol sym) | |
SparseUnivariatePolynomial (const Base &b) | |
~SparseUnivariatePolynomial () | |
Destroy the polynomial. More... | |
A sparsely represented univariate polynomial over an arbitrary ring.
This class automatically adapts its inheritance structure and interface depending on if the template parameter listed is a field or not.
Inheritance of proper base class, and exporting of proper functions, is automatic when the Ring template parameter is specified at compile time by means of std::conditional.
|
inline |
Destroy the polynomial.