Why is the range of unsigned byte is from -128 to 127? It’s not. An unsigned byte (assuming 8-bit) is from 0 to 255. The range of a signed byte using 2’s complement is from -128 to 127, directly from the definition of 2’s complement: 01111111 = +127 01111110 = +126 01111101 = +125 … … Read more
If you want all bits in the test mask to match: if((value & mask) == mask) {…} If you want any single bit in the test mask to match: if((value & mask) != 0) {…} The difference is most apparent when you are testing a value for multiple things. To test for exclusion: if ((value … Read more
You should be safe using that approach, yes. ~ in Python is simply implemented as -(x+1) (cf. the CPython source) and negative numbers are treated as if they have any required number of 1s padding the start. From the Python Wiki: Of course, Python doesn’t use 8-bit numbers. It USED to use however many bits … Read more
The obvious way; using the constructor that takes a byte array: BitArray bits = new BitArray(arrayOfBytes);
To set a bit, use: x |= 0b1; // set LSB bit x |= 0b10; // set 2nd bit from LSB to erase a bit use: x &= ~0b1; // unset LSB bit (if set) x &= ~0b10; // unset 2nd bit from LSB to toggle a bit use: x ^= 0b1; Notice I use … Read more
Can I check whether a number is positive/zero/negative without using any conditional statements/operators like if/ternary etc. Of course: bool is_positive = number > 0; bool is_negative = number < 0; bool is_zero = number == 0;
You can use bitshifting: out = 0 for bit in bitlist: out = (out << 1) | bit This easily beats the “int cast” method proposed by A. R. S., or the modified cast with lookup proposed by Steven Rumbalski: >>> def intcaststr(bitlist): … return int(“”.join(str(i) for i in bitlist), 2) … >>> def intcastlookup(bitlist): … Read more
I don’t think there’s anything better than the naive approach for the maximum. One attempt is using the identity x + y = min(x, y) + max(x, y) and thus max(ctz(x), ctz(y)) = ctz(x) + ctz(y) – min(ctz(x), ctz(y)) This way, we can reduce the max function to the min function we already optimized, albeit … Read more
The BitConverter class can be used for this, and of course, it can also be used on both little and big endian systems. Of course, you’ll have to keep track of the endianness of your data. For communications for instance, this would be defined in your protocol. You can then use the BitConverter class to … Read more
If I understand your question correctly, you just want the part after the decimal right? You don’t need it actually in a fraction (integer numerator and denominator)? So we have some number, say 3.14159 and we want to end up with just 0.14159. Assuming our number is stored in float f;, we can do this: … Read more