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

## Definition

For a given `PolynomialTraits_d::Polynomial_d` \( p\) this `AdaptableUnaryFunction` returns the degree vector, that is, it returns the exponent vector of the monomial of highest order in \( p\), where the monomial order is the lexicographic order giving outer variables a higher priority. In particular, this is the monomial that belongs to the innermost leading coefficient of \( p\).

Refines:

  `AdaptableUnaryFunction`

  `CopyConstructible`

  `DefaultConstructible`

See Also
  `Polynomial_d`
  `PolynomialTraits_d`
  `PolynomialTraits_d::Degree`
  `PolynomialTraits_d::TotalDegree`
  `PolynomialTraits_d::InnermostLeadingCoefficient`

## Types

typedef CGAL::Exponent_vector | result_type
typedef PolynomialTraits_d::Polynomial_d | argument_type

## Operations

result_type | operator() (argument_type p)
| Returns the degree vector.