The function mod computes the remainder of division with remainder.
In case the argument types NT1 and NT2 differ,
the result_type is determined via Coercion_traits.
Thus, the result_type is well defined if NT1 and NT2
are a model of ExplicitInteroperable.
The actual mod is performed with the semantic of that type.
The function is guaranteed to be well defined in case result_type is a model of the EuclideanRing concept.
#include <CGAL/number_utils.h>
| ||
|
|
EuclideanRing
AlgebraicStructureTraits::DivMod
CGAL::div_mod
CGAL::div