\begin{ccRefConcept}{PolynomialTraits_d::SignAt}
\ccDefinition

This \ccc{AdaptableFunctor} returns the sign of a
\ccc{PolynomialTraits_d::Polynomial_d} $p$ at given Cartesian point represented 
as an iterator range.

This functor is well defined if \ccc{PolynomialTraits_d::Innermost_coefficient_type} is 
\ccc{RealEmbeddable}. 

\ccRefines 
\ccc{AdaptableFunctor}

\ccTypes

\ccSetThreeColumns{xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx}{xxx}{}
\ccCreationVariable{fo}
\ccTypedef{typedef CGAL::Sign                        result_type;}{}\ccGlue

\ccOperations
\ccMethod{
template <class InputIterator>
result_type operator()(PolynomialTraits_d::Polynomial_d  p,
                       InputIterator                     begin,
                       InputIterator                     end );}{ 
Returns the sign of $p$ at the given Cartesian point, where $begin$ is referring 
to the innermost variable.
\ccPrecond{(end-begin == \ccc{PolynomialTraits_d::d})}
\ccPrecond{\ccc{std::iterator_traits< InputIterator >::value_type} is  \ccc{ExplicitInteroperable} with  \ccc{PolynomialTraits_d::Innermost_coefficient_type}.} 
}
%\ccHasModels

\ccSeeAlso

\ccRefIdfierPage{Polynomial_d}\\
\ccRefIdfierPage{PolynomialTraits_d}\\

\end{ccRefConcept}