CGAL 4.12.1 - Polynomial
|
This AdaptableFunctor
returns whether a PolynomialTraits_d::Polynomial_d
\( p\) is zero at a given Cartesian point, which is represented as an iterator range.
Polynomial_d
PolynomialTraits_d
Types | |
typedef bool | result_type |
Operations | |
template<class InputIterator > | |
result_type | operator() (PolynomialTraits_d::Polynomial_d p, InputIterator begin, InputIterator end) |
Computes whether \( p\) is zero at the Cartesian point given by the iterator range, where begin is referring to the innermost variable. More... | |
result_type PolynomialTraits_d::IsZeroAt::operator() | ( | PolynomialTraits_d::Polynomial_d | p, |
InputIterator | begin, | ||
InputIterator | end | ||
) |
Computes whether \( p\) is zero at the Cartesian point given by the iterator range, where begin
is referring to the innermost variable.
PolynomialTraits_d::d
) std::iterator_traits< InputIterator >::value_type
is ExplicitInteroperable
with PolynomialTraits_d::Innermost_coefficient_type
.