int value = 0; for (int i = 0; i < bits.length; i++) { boolean isSet = bits[i]; if (isSet) { value += 1 << bits.length - i - 1; return value; ...
return (b1 & 0xFF) | ((b2 & 0xFF) << 8) | ((b3 & 0xFF) << 16) | ((b4 & 0xFF) << 24);
int b0 = byte3 << 24; int b1 = (byte2 << 24) >>> 8; int b2 = (byte1 << 24) >>> 16; int b3 = (byte0 << 24) >>> 24; return (b0 | b1 | b2 | b3);
return toInt(toShort(byte3, byte2), toShort(byte1, byte0));
return (in0 & 0xFF) | ((in1 & 0xFF) << 8) | ((in2 & 0xFF) << 16) | ((in3 & 0xFF) << 24);
int n = 0; n ^= mostSignificant & 0xFF; n <<= 8; n ^= leastSignificant & 0xFF; return n;