Strange implementation of Guava LongMath.checkedAdd [duplicate]

Question

public static long checkedAdd(long a, long b) {
    long result = a + b;
    checkNoOverflow((a ^ b) < 0 | (a ^ result) >= 0);
    return result;
}

I am interested why boolean logical | is used here. Why not to use conditional short circuited ||?

Answer 1

The first comment in that class:

// NOTE: Whenever both tests are cheap and functional, it's faster to use 
// &, | instead of &&, ||

More context: https://stackoverflow.com/a/11412121/869736