For a given (multivariate) monomial the vector of its exponents is called the exponent vector. The class Exponent_vector is meant to represent such a vector.
A vector is considered as valid, in case it represents a valid monomial. that is, it should not contain negative exponents. We decided to use int as the value type, since negative exponents may appear in intermediate results. The set of exponent vectors with elementwise addition forms an Abelian Group.
Beside the constructors Exponent_vector has almost the same interface as an std::vector<int>. Moreover the comparison is changed such that the lexicographic order starts the comparison at the last entry. This reflects the fact that the last entry corresponds to the outermost variable of a multivariate polynomial.
#include <CGAL/Exponent_vector.h>
Random Access Container
Back Insertion Sequence
DefaultConstructible
Assignable
CopyConstructible
EqualityComparable
LessThanComparable
| |||
introduces an uninitialized variable fo.
| |||
| |||
The copy constructor
| |||
| |||
Creates a vector containing the given element.
| |||
| |||
Creates a vector containing the given elements.
| |||
| |||
Creates a vector containing the given elements.
| |||
| |||
Creates a vector containing the given elements.
| |||
| |||
| |||
Creates a vector with a copy of the given range.
|
|
| Returns true if all entries of ev are not negative. |
Group Operation:
|
|
|||
|
|
|||
|
|
| ||
|
|
| ||
|
|
| ||
|
|
|
EqualityComparable:
|
|
|
|
|
LessThanComparable:
|
| Lexicographic compare, starting with the last variable. |
Polynomial_d
PolynomialTraits_d