Why is this code with several “or” statements slightly faster than using a lookup table in Java?

Question

While looking at a micro-optimization question that I asked yesterday (here), I found something strange: an or statement in Java is running slightly faste

Answer 1

It's an interesting piece of code, but 2% is a really small difference. I don't think you can conclude very much from that.