CGAL 5.1 - Polynomial
PolynomialTraits_d::Shift Class Reference

#include <Concepts/PolynomialTraits_d--Shift.h>

Definition

This AdaptableBinaryFunction multiplies a PolynomialTraits_d::Polynomial_d by the given power of the specified variable.

This functor is provided for efficiency reasons, since multiplication by some variable will in general correspond to a shift of coefficients in the internal representation.

Refines:

AdaptableBinaryFunction

CopyConstructible

DefaultConstructible

See also
Polynomial_d
PolynomialTraits_d

Types

typedef PolynomialTraits_d::Polynomial_d result_type
 
typedef PolynomialTraits_d::Polynomial_d first_argument_type
 
typedef int second_argument_type
 

Operations

result_type operator() (first_argument_type p, second_argument_type e)
 Returns \( p * x_{d-1}^e\). More...
 
result_type operator() (first_argument_type p, second_argument_type e, int i)
 Returns \( p * x_{i}^e\). More...
 

Member Typedef Documentation

◆ first_argument_type

typedef PolynomialTraits_d::Polynomial_d PolynomialTraits_d::Shift::first_argument_type

◆ result_type

typedef PolynomialTraits_d::Polynomial_d PolynomialTraits_d::Shift::result_type

◆ second_argument_type

typedef int PolynomialTraits_d::Shift::second_argument_type

Member Function Documentation

◆ operator()() [1/2]

result_type PolynomialTraits_d::Shift::operator() ( first_argument_type  p,
second_argument_type  e 
)

Returns \( p * x_{d-1}^e\).

Precondition
\( 0 \leq e\).

◆ operator()() [2/2]

result_type PolynomialTraits_d::Shift::operator() ( first_argument_type  p,
second_argument_type  e,
int  i 
)

Returns \( p * x_{i}^e\).

Precondition
\( 0 \leq e\).
\( 0 \leq i < d\).