12 return (a != d *
b) ? (d - int((a < 0) != (
b < 0))) : d;
48 result = (
b != 0) ? (a /
b) : 0;
60 if (base == 1 || base == -1) {
61 return (base < 0 && (exponent & 1) != 0) ? -1 : 1;
66 while (exponent != 0) {
67 if ((exponent & 1) != 0) {
116 result = (gcd != 0) ?
abs(a / gcd *
b) : 0;
128 result = int(0 < a) - int(a < 0);
147 int sign_b = int(0 <
b) - int(
b < 0);
149 result = ((abs_b != 0) ? ((2 * a + abs_b) / (2 * abs_b)) : 0) * sign_b;
152 result = -((abs_b != 0) ? ((2 * -a + abs_b) / (2 * abs_b)) : 0) * sign_b;
160 result = (
b != 0) ? a - (a /
b) *
b : 0;
int divide_floor(int a, int b)
void integer_math_divide_round(int a, int b, int, int &result)
void integer_math_absolute(int a, int, int, int &result)
void integer_math_negate(int a, int, int, int &result)
void integer_math_divide_floor(int a, int b, int, int &result)
void integer_math_subtract(int a, int b, int, int &result)
void integer_math_sign(int a, int, int, int &result)
void integer_math_modulo(int a, int b, int, int &result)
void integer_math_divide_ceil(int a, int b, int, int &result)
void integer_math_divide(int a, int b, int, int &result)
void integer_math_multiply(int a, int b, int, int &result)
void integer_math_power(int base, int exponent, int, int &result)
void integer_math_floored_modulo(int a, int b, int, int &result)
void integer_math_gcd(int a, int b, int, int &result)
void integer_math_lcm(int a, int b, int, int &result)
int euclid_gcd(int a, int b)
void integer_math_minimum(int a, int b, int, int &result)
void integer_math_maximum(int a, int b, int, int &result)
int integer_power(int base, int exponent)
void integer_math_add(int a, int b, int, int &result)
void integer_math_multiply_add(int a, int b, int c, int &result)