mirror of https://github.com/CGAL/cgal
41 lines
1.2 KiB
TeX
41 lines
1.2 KiB
TeX
\begin{ccRefConcept}{AlgebraicStructureTraits::RootOf}
|
|
|
|
\begin{ccAdvanced}
|
|
\ccDefinition
|
|
|
|
\ccc{AdaptableUnaryFunction} computes the real root of a univariate polynomial.
|
|
|
|
\ccRefines
|
|
|
|
\ccc{AdaptableFunction}
|
|
|
|
\ccTypes
|
|
|
|
\ccSetThreeColumns{xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx}{xxx}{}
|
|
\ccTypedef{typedef AlgebraicStructureTraits::AS result_type;}{}
|
|
%\ccTypedef{typedef AlgebraicStructureTraits::AS AS;}{}
|
|
|
|
\ccOperations
|
|
\ccMethod{
|
|
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. \\
|
|
precond: The value type of the InputIterator is AlgebraicStructureTraits::AS\\ }
|
|
|
|
\ccMethod{
|
|
template<class InputIterator>
|
|
result_type operator()(const AS& lower, const AS& upper,
|
|
InputIterator begin, InputIterator end);}{returns the only real root within the interval [lower,upper] of the univariate polynomial,
|
|
which is defined by the iterator range, where begin refers to the constant term.\\
|
|
precond: The value type of the InputIterator is AlgebraicStructureTraits::AS\\
|
|
}
|
|
|
|
%\ccHasModels
|
|
|
|
\ccSeeAlso
|
|
|
|
\ccRefIdfierPage{AlgebraicStructureTraits}
|
|
|
|
\end{ccAdvanced}
|
|
\end{ccRefConcept} |