|
Frobby 0.10.0
|
#include <UniHashPolynomial.h>
Public Member Functions | |
| void | add (bool plus, const mpz_class &exponent) |
| void | add (int coef, size_t exponent) |
| void | add (const mpz_class &coef, const mpz_class &exponent) |
| void | feedTo (CoefBigTermConsumer &consumer, bool inCanonicalOrder=false) const |
| size_t | getTermCount () const |
A sparse univariate polynomial represented by a hash table mapping terms to coefficients. This allows to avoid duplicate terms without a large overhead.
| void UniHashPolynomial::add | ( | bool | plus, |
| const mpz_class & | exponent ) |
Add +t^exponent or -t^exponent to the polynomial depending on whether plus is true or false, respectively.
| void UniHashPolynomial::add | ( | const mpz_class & | coef, |
| const mpz_class & | exponent ) |
Add coef*t^exponent to the polynomial.
| void UniHashPolynomial::add | ( | int | coef, |
| size_t | exponent ) |
Add coef*t^exponent to the polynomial.