These work for integers of any size, even greater than 32 bit: def set_bit(value, bit): return value | (1<<bit) def clear_bit(value, bit): return value & ~(1<<bit) If you like things short, you can just use: >>> val = 0b111 >>> val |= (1<<3) >>> ‘{:b}’.format(val) ‘1111’ >>> val &=~ (1<<1) ‘1101’
First remember that machine words are of fixed size. Say 4, and that your input is: +—+—+—+—+ | a | b | c | d | +—+—+—+—+ Then pushing everything one position to the left gives: +—+—+—+—+ | b | c | d | X | +—+—+—+—+ Question what to put as X? with a … Read more
Convert.ToString(MyVeryOwnByte, 2).PadLeft(8, ‘0’); This will fill the empty space to the left with ‘0’ for a total of 8 characters in the string
29 = 512 values, because that’s how many combinations of zeroes and ones you can have. What those values represent however will depend on the system you are using. If it’s an unsigned integer, you will have: 000000000 = 0 (min) 000000001 = 1 … 111111110 = 510 111111111 = 511 (max) In two’s complement, … Read more
Read the bits from a file, low bits first. def bits(f): bytes = (ord(b) for b in f.read()) for b in bytes: for i in xrange(8): yield (b >> i) & 1 for b in bits(open(‘binary-file.bin’, ‘r’)): print b
Another way to do this is by using the bitstring module: >>> from bitstring import BitArray >>> input_str=”0xff” >>> c = BitArray(hex=input_str) >>> c.bin ‘0b11111111’ And if you need to strip the leading 0b: >>> c.bin[2:] ‘11111111’ The bitstring module isn’t a requirement, as jcollado‘s answer shows, but it has lots of performant methods for … Read more
Some 2+ years after I asked this question I’d like to explain it the way I’d want it explained back when I was still a complete newb and would be most beneficial to people who want to understand the process. First of all, forget the “11111111” example value, which is not really all that suited … Read more
Method 1: Use Integer.toBinaryString(a) where a is an Int. This method is from the Java platform and can be used in Kotlin. Find more about this method at https://docs.oracle.com/javase/7/docs/api/java/lang/Integer.html#toBinaryString(int) Note: This method works for both positive and negative integers. Method 2: Use a.toString(2) where a is an Int, 2 is the radix Note: This method … Read more
public byte getBit(int position) { return (ID >> position) & 1; } Right shifting ID by position will make bit #position be in the furthest spot to the right in the number. Combining that with the bitwise AND & with 1 will tell you if the bit is set. position = 2 ID = 5 … Read more
That’s mostly a matter of tradition. It is not even always true. For example, floating-point units in processors (even contemporary ones) have 80-bits registers. And there’s nothing that would force us to have 8-bit bytes instead of 13-bit bytes. Sometimes this has mathematical reasoning. For example, if you decide to have an N bits byte … Read more