I want to find if a bit in a sequense is 1 or 0 (true or false) if i have some bitsequense of 11010011, how can i check if the 4th position is True or False?
example:
10010101 (4th bit) -> False
10010101 (3rd bit) -> True
Without the bit shifting:
if bits & 0b1000:
...
EDIT: Actually, (1 << 3)
is optimized out by the compiler.
>>> dis.dis(lambda x: x & (1 << 3))
1 0 LOAD_FAST 0 (x)
3 LOAD_CONST 3 (8)
6 BINARY_AND
7 RETURN_VALUE
>>> dis.dis(lambda x: x & 0b1000)
1 0 LOAD_FAST 0 (x)
3 LOAD_CONST 1 (8)
6 BINARY_AND
7 RETURN_VALUE
The two solutions are equivalent, choose the one that looks more readable in your context.
Bitwise left-shifting and bitwise AND operator is your friend. In general you can check if the nth bit is set/unset as below:
if (x & (1<<n))
## n-th bit is set (1)
else
## n-th bit is not set (0)
You can use bit shifting
>>> 0b10010101 >> 4 & 1
1
>>> 0b10010101 >> 3 & 1
0
bits = 0b11010011
if bits & (1 << 3):
...
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With