PolynomialTraits_d::Permute

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

PolynomialTraits_d::Permute

Definition

This AdaptableFunctor permutes the variables of the given polynomial with respect to a permutation , that is, each monomial x_i^e_i will be mapped to the monomial x_(i)^e_i. The permutation is given by the iterator range of length PolynomialTraits_d::d, which is supposed to contain the second row of the permutation.

For instance, let p be a polynomial in 4 variables and it is intended to change the order of the variables such that x₀ x₂, x₁ x₀, x₂ x₁ and x₃ x₃. In this case the iterator range should contain the sequence [2,0,1,3].

Refines

AdaptableFunctor

Types

typedef PolynomialTraits_d::Polynomial_d
	result_type;

Operations

template<class Input_iterator>

result_type

fo ( PolynomialTraits_d::Polynomial_d p , Input_iterator begin , Input_iterator end )

Returns

p with interchanged variables as defined by the iterator range.

Precondition:

(end-begin == PolynomialTraits_d::d)

Precondition:

std::iterator_traits< InputIterator >::value_type is convertible to int.

Precondition:

The iterator range contains each value in

{0,...,d-1} exactly once.