PolynomialTraits_d::ConstructPolynomial

Navigation: Up, Table of Contents, Package Overview, Bibliography, Index, Title Page , Acknowledging CGAL

PolynomialTraits_d::ConstructPolynomial

Definition

This AdaptableFunctor provides several operators to construct objects of type PolynomialTraits_d::Polynomial_d.

Refines

AdaptableFunctor

Types

typedef PolynomialTraits_d::Polynomial_d
	result_type;

Operations

result_type

fo ()

Construct the zero polynomial.

result_type

fo ( int i )

Construct the constant polynomial equal to

result_type

fo ( PolynomialTraits_d::Innermost_coefficient_type a )

Construct the constant polynomial equal to

result_type

fo ( PolynomialTraits_d::Coefficient_type a )

Construct the polynomial equal to

template < class InputIterator >

result_type

fo ( InputIterator begin , InputIterator end )

Precondition:

The value type of InputIterator is PolynomialTraits_d::Coefficient_type.

The operator constructs the a polynomial from the iterator range, with respect to the outermost variable, x_d-1.
The range starts with the coefficient for x_d-1⁰.
In case the range is empty, the zero polynomial is constructed.

template < class InputIterator >

result_type

fo ( InputIterator begin , InputIterator end , bool is_sorted= false )

Constructs a Polynomial_d from a given iterator range of std::pair<Exponent_vector, PolynomialTraits_d::Innermost_coefficient_type>.

The optional parameter is_sorted indicates whether the given iterator range is already sorted.

Precondition:

The value type of InputIterator is std::pair<Exponent_vector, PolynomialTraits_d::Innermost_coefficient_type>.

Precondition:

Each Exponent_vector must have size

Precondition:

All appearing Exponent_vectors are different.