Example Analysis of java using Boolean Operation instead of bit Operation

This article will explain in detail the example analysis of java using Boolean operation instead of bit operation. The editor thinks it is very practical, so I share it with you for reference. I hope you can get something after reading this article.

Boolean operation instead of bit operation

Although the speed of bit operation is much higher than that of arithmetic operation, it is a very wrong choice to use bit operation instead of Boolean operation in condition judgment.

When judging the condition, Java will optimize the Boolean operation quite fully. Suppose there is an expression "a&&b&&c" for Boolean operation "a&&b&&c". According to the characteristics of logic and, as long as one item in the whole Boolean expression returns false, the whole expression will return false, so when the expression an is false, the expression will immediately return false instead of evaluating expressions b and c. Similarly, the same is true when the evaluation expression is "a | | b | | c".

If you use bitwise operations (bitwise and "&", bitwise or "|") instead of logic and logic OR, although the bitwise operation itself has no performance problem, the bitwise operation always gives the final result after all the subexpressions have been evaluated. Therefore, from this point of view, using bit operations instead of Boolean operations will cause the system to do a lot of invalid calculations.

This is the end of the article on "example analysis of java using Boolean operations instead of bit operations". I hope the above content can be of some help to you, so that you can learn more knowledge. if you think the article is good, please share it for more people to see.