Example analysis of java using Boolean operations instead of bit operations

Boolean operations instead of bit operations

Although bit operations are much faster than arithmetic operations, it is a very wrong choice to use bit operations instead of Boolean operations when making conditional judgments. .

When judging conditions, Java will fully optimize Boolean operations. Suppose there are expressions a, b, c that perform the Boolean operation "a&&b&&c". According to the characteristics of logical AND, as long as one item in the entire Boolean expression returns false, the entire expression returns false. Therefore, when the expression a is false , the expression will return false immediately without evaluating expressions b and c. In the same way, the same applies when the calculation expression is "a||b||c".

If bitwise operations (bitwise AND "&", bitwise OR "|") are used instead of logical AND and logical OR, although the bitwise operation itself has no performance problem, the bitwise operation always requires all sub- After all expressions are evaluated, the final result is given. Therefore, from this perspective, using bitwise operations instead of Boolean operations will cause the system to perform a lot of invalid calculations.

The above is the detailed content of Example analysis of java using Boolean operations instead of bit operations. For more information, please follow other related articles on the PHP Chinese website!