mirror of https://github.com/CGAL/cgal
43 lines
1.2 KiB
TeX
43 lines
1.2 KiB
TeX
\begin{ccRefConcept}{PolynomialTraits_d::ConstructPolynomial_d}
|
|
|
|
\ccDefinition
|
|
|
|
This \ccc{Functor} provides several operators
|
|
to construct objects of type \ccc{PolynomialTraits_d::Polynomial_d}.
|
|
|
|
\ccRefines
|
|
|
|
\ccTypes
|
|
|
|
\ccSetThreeColumns{xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx}{xxx}{}
|
|
\ccTypedef{typedef PolynomialTraits_d::Polynomial_d result_type;}{}
|
|
|
|
\ccOperations
|
|
\ccMethod{result_type operator()();}
|
|
{Construct the zero polynomial.}
|
|
|
|
\ccMethod{result_type operator()(int i);}
|
|
{Construct the constant polynomial equal to $i$. }
|
|
|
|
\ccMethod{tempalte < class InputIterator >
|
|
result_type operator()(InputIterator begin, InputIterator end);}
|
|
{\ccPrecond \ccc{InputIterator} must allow the value type
|
|
\ccc{PolynomialTraits_d::Coefficient}. \\
|
|
|
|
The operator constructs the a polynomial from the iterator range,
|
|
with respect ot the outermost variable, $x_d$. \\
|
|
The range starts with the coeffcient for $x_d^0$. \\
|
|
In case the range is empty, the zero polynomial is constructed.
|
|
}
|
|
|
|
|
|
%\ccHasModels
|
|
|
|
\ccSeeAlso
|
|
|
|
\ccRefIdfierPage{Polynomial_d}\\
|
|
\ccRefIdfierPage{PolynomialTraits_d}\\
|
|
\ccRefIdfierPage{PolynomialTraits_d::TotalDegree}
|
|
|
|
\end{ccRefConcept}
|