Returns the value obtained by rotating the two's complement binary
representation of the specified {@code int} value left by the
specified number of bits. (Bits shifted out of the left hand, or
high-order, side reenter on the right, or low-order.)
<p>Note that left rotation with a negative distance is equivalent to
right rotation: {@code rotateLeft(val, -distance) == rotateRight(val,
distance)}. Note also that rotation by any multiple of 32 is a
no-op, so all but the last five bits of the rotation distance can be
ignored, even if the distance is negative: {@code rotateLeft(val,
distance) == rotateLeft(val, distance & 0x1F)}.
@param i the value whose bits are to be rotated left
@param distance the number of bit positions to rotate left
@return the value obtained by rotating the two's complement binary
representation of the specified {@code int} value left by the
specified number of bits.
Returns the value obtained by rotating the two's complement binary representation of the specified {@code int} value left by the specified number of bits. (Bits shifted out of the left hand, or high-order, side reenter on the right, or low-order.)
<p>Note that left rotation with a negative distance is equivalent to right rotation: {@code rotateLeft(val, -distance) == rotateRight(val, distance)}. Note also that rotation by any multiple of 32 is a no-op, so all but the last five bits of the rotation distance can be ignored, even if the distance is negative: {@code rotateLeft(val, distance) == rotateLeft(val, distance & 0x1F)}.
@param i the value whose bits are to be rotated left @param distance the number of bit positions to rotate left @return the value obtained by rotating the two's complement binary representation of the specified {@code int} value left by the specified number of bits.