\( \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.6.3 - Polynomial
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
List of all members
PolynomialTraits_d::MultivariateContent Concept Reference
Concepts

Definition

This AdaptableUnaryFunction computes the content of a PolynomialTraits_d::Polynomial_d with respect to the symmetric view on the polynomial, that is, it computes the gcd of all innermost coefficients.

This functor is well defined if PolynomialTraits_d::Innermost_coefficient_type is a Field or a UniqueFactorizationDomain.

Refines:

AdaptableUnaryFunction

CopyConstructible

DefaultConstructible

See Also
Polynomial_d
PolynomialTraits_d

Types

typedef
PolynomialTraits_d::Innermost_coefficient_type 		result_type
 
typedef
PolynomialTraits_d::Polynomial_d 		argument_type
 

Operations

result_type operator() (argument_type p)
 Computes the \( gcd\) of all innermost coefficients of \( p\).