\( \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.8 - Algebraic Foundations

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

## Definition

`AdaptableFunctor` computes a real root of a square-free univariate polynomial.

Refines:
  `AdaptableFunctor`

See Also
  `FieldWithRootOf`
  `AlgebraicStructureTraits`

## Types
typedef unspecified_type | result_type
| Is `AlgebraicStructureTraits::Type`.

## Operations
template<class InputIterator >
result_type | operator() (int k, InputIterator begin, InputIterator end)
| returns the k-th real root of the univariate polynomial, which is defined by the iterator range, where begin refers to the constant term. More...

## Member Function Documentation

template<class InputIterator >

result_type AlgebraicStructureTraits_::RootOf::operator() | ( | int | k,
|  | InputIterator | begin,
|  | InputIterator | end
| ) |  |

returns the k-th real root of the univariate polynomial, which is defined by the iterator range, where begin refers to the constant term.

Precondition
  The polynomial is square-free.
  The value type of the InputIterator is `AlgebraicStructureTraits::Type`.