Faster way to find modulus in java

Asked Jul 26 '19 at 17:35

Active Jul 26 '19 at 20:13

Viewed 483 times

I'm interested to find x % y where x is long and y is always 8.

I've the following implementation:

int result = (int) (x & 7);

I observed the performance (getting execution time for millions of operations with random inputs) of the above code over the traditional "%" operator and I didn't see any improvement.

'&' should runs faster than '%' - Right?

asked Jul 26 '19 at 17:35

User_67128

1,230
8
21

3

Most likely JIT eliminated your test code. Implementing microbenchmarks in Java is very tricky. – Ivan Jul 26 '19 at 17:40
1

Not necessarily of duplicate of this, but likely highly relevant: https://stackoverflow.com/questions/504103/how-do-i-write-a-correct-micro-benchmark-in-java – Carcigenicate Jul 26 '19 at 17:41
1

See https://stackoverflow.com/a/37367833/2055998. – PM 77-1 Jul 26 '19 at 17:42
Why do you think that "'&' should runs faster than '%' " ? – David Soroko Jul 26 '19 at 20:32

Faster way to find modulus in java

0 Answers0