Processing math: 100%
CGAL 4.5 - Polynomial
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
PolynomialTraits_d::IsZeroAt Concept Reference

Definition

This AdaptableFunctor returns whether a PolynomialTraits_d::Polynomial_d p is zero at a given Cartesian point, which is represented as an iterator range.

Refines:

AdaptableFunctor

CopyConstructible

DefaultConstructible

See Also
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...
 

Member Function Documentation

template<class InputIterator >
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.

Precondition
(end-begin == PolynomialTraits_d::d)
std::iterator_traits< InputIterator >::value_type is ExplicitInteroperable with PolynomialTraits_d::Innermost_coefficient_type.