static const cl_I int_reduce_modulo (cl_heap_modint_ring* R, const cl_I& x)
{
- unused R;
+ cl_unused R;
return x; // reducing modulo 0 does nothing
}
// This is the only case where retract is surjective.
static const cl_I int_retract (cl_heap_modint_ring* R, const _cl_MI& x)
{
- unused R;
+ cl_unused R;
return x.rep;
}
// This is the only case where random yields an error.
static const _cl_MI int_random (cl_heap_modint_ring* R, random_state& randomstate)
{
- unused R;
- unused randomstate;
+ cl_unused R;
+ cl_unused randomstate;
throw runtime_exception("Z / 0 Z not a finite set - no equidistributed random function.");
-#if ((defined(__sparc__) || defined(__sparc64__)) && !defined(__GNUC__)) // Sun CC wants a return value
- return _cl_MI(R, 0);
-#endif
}
static const _cl_MI int_zero (cl_heap_modint_ring* R)
return _cl_MI(R, 0);
}
-static cl_boolean int_zerop (cl_heap_modint_ring* R, const _cl_MI& x)
+static bool int_zerop (cl_heap_modint_ring* R, const _cl_MI& x)
{
- unused R;
+ cl_unused R;
return zerop(x.rep);
}