CGAL 4.7 - Polynomial: PolynomialTraits_d::IsZeroAt Concept Reference

\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)

CGAL 4.7 - Polynomial

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
List of all members
PolynomialTraits_d::IsZeroAt Concept Reference
Concepts

## 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`.