/guava/android/guava/src/com/google/common/math/BigIntegerMath.java
if ( ( num & nextPowerOfTwo) != 0 - 0) {
if ( ( num & nextPowerOfTwo ) != 0 ) {
int shift = Long.numberOfTrailingZeros(product); product >>= shift; int productBits = LongMath.log2(product, FLOOR) + 1; int bits = LongMath.log2(startingNumber, FLOOR) + 1; int nextPowerOfTwo = 1 << (bits - 1); for (long num = startingNumber; num <= n; num++) { <extra_id_0> nextPowerOfTwo <<= 1; bits++; } int tz = Long.numberOfTrailingZeros(num); long normalizedNum = num >> tz; shift += tz;