\( \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::ConstructCoefficientConstIteratorRange Concept Reference
Polynomial Reference » Concepts

Definition

This AdaptableUnaryFunction returns a const iterator range over the coefficients of the given polynomial, with respect to the outermost variable, \( x_{d-1}\). The range starts with the coefficient for \( x_{d-1}^0\).

Refines:

AdaptableUnaryFunction

CopyConstructible

DefaultConstructible

See also
Polynomial_d
PolynomialTraits_d

Types

typedef std::pair
< PolynomialTraits_d::Coefficient_const_iterator,
PolynomialTraits_d::Coefficient_const_iterator > 		result_type
 
typedef
PolynomialTraits_d::Polynomial_d 		argument_type
 

Operations

result_type operator() (argument_type p)
 Returns a const iterator range over the coefficients of \( p\). More...
 

Member Typedef Documentation

typedef PolynomialTraits_d::Polynomial_d PolynomialTraits_d::ConstructCoefficientConstIteratorRange::argument_type
typedef std::pair< PolynomialTraits_d::Coefficient_const_iterator, PolynomialTraits_d::Coefficient_const_iterator > PolynomialTraits_d::ConstructCoefficientConstIteratorRange::result_type

Member Function Documentation

result_type PolynomialTraits_d::ConstructCoefficientConstIteratorRange::operator() ( argument_type  p)

Returns a const iterator range over the coefficients of \( p\).