CGAL 4.7 - Polynomial: PolynomialTraits_d::Move 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::Move Concept Reference
Concepts

## Definition

This `AdaptableFunctor` moves a variable at position \( i\) to a new position \( j\). The relative order of the other variables is preserved, that is, the variables between \( x_i\) and \( x_j\) (including \( x_j\)) are moved by one position while \( x_i\) is moved to the former position of \( x_j\).

This function may be used to make a certain variable the outer most variable.

Refines:

  `AdaptableFunctor`

  `CopyConstructible`

  `DefaultConstructible`

See Also
  `Polynomial_d`
  `PolynomialTraits_d`

## Types

typedef PolynomialTraits_d::Polynomial_d | result_type

## Operations

result_type | operator() (PolynomialTraits_d::Polynomial_d, int i, int j)
| This function moves the variable at position \( i\) to its new position \( j\) and returns the new polynomial. More...

## Member Function Documentation

result_type PolynomialTraits_d::Move::operator() | ( | PolynomialTraits_d::Polynomial_d | ,
|  | int | i,
|  | int | j
| ) |  |

This function moves the variable at position \( i\) to its new position \( j\) and returns the new polynomial.

The relative order of the other variables is preserved.

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