CGAL 4.7 - Polynomial: PolynomialTraits_d::Translate Concept Reference

\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)

CGAL 4.7 - Polynomial

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
List of all members
PolynomialTraits_d::Translate Concept Reference
Concepts

## Definition

This `AdaptableBinaryFunction` translates a `PolynomialTraits_d::Polynomial_d` with respect to one variable, that is, for a given polynomial \( p\) and constant \( c\) it computes \( p(x+c)\).

Note that this functor operates on the polynomial in the univariate view, that is, the polynomial is considered as a univariate polynomial in one specific variable.

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 PolynomialTraits_d::Innermost_coefficient_type | second_argument_type

## Operations

result_type | operator() (first_argument_type p, second_argument_type c)
| Returns \( p(x+c)\), with respect to the outermost variable.
result_type | operator() (first_argument_type p, second_argument_type c, int i)
| Same as first operator but for variable \( x_i\). More...

## Member Function Documentation

result_type PolynomialTraits_d::Translate::operator() | ( | first_argument_type | p,
|  | second_argument_type | c,
|  | int | i
| ) |  |

Same as first operator but for variable \( x_i\).

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