question: this computes the number of common most-significant bits in the mantissa . it does not count the hidden bit , which is always 1 . it does not determine whether the numbers have the same exponent - if they do not , the value computed by this function is meaningless . concode_field_sep int EXPONENT_BIAS concode_elem_sep long xBits concode_elem_sep double x concode_field_sep double truncateToPowerOfTwo concode_elem_sep void zeroLowerBits concode_elem_sep double maximumCommonMantissa concode_elem_sep String toBinaryString concode_elem_sep int biasedExponent concode_elem_sep double getDouble concode_elem_sep double powerOf2 concode_elem_sep String toString concode_elem_sep int getExponent concode_elem_sep int exponent concode_elem_sep int getBit
target: int function ( DoubleBits arg0 ) { for ( int loc0 = 0 ; loc0 < 52 ; loc0 ++ ) { int loc1 = loc0 + 12 ; if ( getBit ( loc0 ) != arg0 . getBit ( loc0 ) ) return loc0 ; } return 52 ; }