Remainder of float division.

[RandomLetters]

Is there a way to get a remainder for float division?

So for example 1.3 mod 0.9 = 0.4.

[Insectoid]

What is 130 mod 9?

[RandomLetters]

1?

[Insectoid]

No, try again.

[RandomLetters]

oh fail. 4.

However, the floats can be much larger than integers.

[apython1992]

If there's no way to do it in the language already, you can write it in yourself.

[apython1992]

Two seconds of googling tells me that Java's mod operator (%) works with integers, floats, and doubles.

[RandomLetters]

Wow, how did I miss that, lol. Thanks

[apython1992]

No problem Google is your friend!

[Insectoid]

Even if Java's mod operator didn't work on floats, you could easily write a function (does Java allow operator overloading?) to find the number of significant digits of both parameters, select the greater number, n, and multiply both numbers by 10^n, do your modulus, and divide the result by n.

I'm sure there's a more efficient way to do this (using math, and not the mod operator at all), though float division is notoriously slow, so it might not make a difference.

[apython1992]

I don't think Java supports operator overloading, so that would have to be written as a method.

The better way I think would be to take the integer result from the division (the quotient floored to the nearest integer), which is the number of times the divisor goes completely into the dividend. Multiply the floored integer by the divisor, and subtract that result from the dividend to get your remainder. Example:

4.6 / 1.3 = 3.54 -> floored to 3
1.3 * 3 = 3.9
4.6 - 3.9 = 0.7 -> the remainder