How do I set, clear, and toggle a single bit?

by

Setting a bit

Use the bitwise OR operator (|) to set a bit.

number |= 1UL << n;

That will set the nth bit of number. n should be zero, if you want to set the 1st bit and so on upto n-1, if you want to set the nth bit.

Use 1ULL if number is wider than unsigned long; promotion of 1UL << n doesn’t happen until after evaluating 1UL << n where it’s undefined behaviour to shift by more than the width of a long. The same applies to all the rest of the examples.

Clearing a bit

Use the bitwise AND operator (&) to clear a bit.

number &= ~(1UL << n);

That will clear the nth bit of number. You must invert the bit string with the bitwise NOT operator (~), then AND it.

Toggling a bit

The XOR operator (^) can be used to toggle a bit.

number ^= 1UL << n;

That will toggle the nth bit of number.

Checking a bit

You didn’t ask for this, but I might as well add it.

To check a bit, shift the number n to the right, then bitwise AND it:

bit = (number >> n) & 1U;

That will put the value of the nth bit of number into the variable bit.

Changing the nth bit to x

Setting the nth bit to either 1 or 0 can be achieved with the following on a 2’s complement C++ implementation:

number ^= (-x ^ number) & (1UL << n);

Bit n will be set if x is 1, and cleared if x is 0. If x has some other value, you get garbage. x = !!x will booleanize it to 0 or 1.

To make this independent of 2’s complement negation behaviour (where -1 has all bits set, unlike on a 1’s complement or sign/magnitude C++ implementation), use unsigned negation.

number ^= (-(unsigned long)x ^ number) & (1UL << n);

or

unsigned long newbit = !!x;    // Also booleanize to force 0 or 1
number ^= (-newbit ^ number) & (1UL << n);

It’s generally a good idea to use unsigned types for portable bit manipulation.

or

number = (number & ~(1UL << n)) | (x << n);

(number & ~(1UL << n)) will clear the nth bit and (x << n) will set the nth bit to x.

It’s also generally a good idea to not to copy/paste code in general and so many people use preprocessor macros (like the community wiki answer further down) or some sort of encapsulation.

More Related Contents:

  1. How do you set, clear, and toggle a single bit?
  2. Performance wise, how fast are Bitwise Operators vs. Normal Modulus?
  3. How to set, clear, and toggle a single bit?
  4. Determine if int is not 0 with no if statements
  5. Invalid solution for code challenge with operator restrictions
  6. Best practices for circular shift (rotate) operations in C++
  7. Position of least significant bit that is set
  8. What is Bit Masking?
  9. How to create a byte out of 8 bool values (and vice versa)?
  10. C/C++: Force Bit Field Order and Alignment
  11. What is the idea behind ^= 32, that converts lowercase letters to upper and vice versa?
  12. How to perform a bitwise operation on floating point numbers
  13. C/C++ check if one bit is set in, i.e. int variable
  14. Should I use #define, enum or const?
  15. Casting float to int (bitwise) in C
  16. What does the statement if (counter & (1
  17. Using bitwise operators for Booleans in C++
  18. get absolute value without using abs function nor if statement
  19. What happens when you bit shift beyond the end of a variable?
  20. Near constant time rotate that does not violate the standards
  21. What’s the fastest way to pack 32 0/1 values into the bits of a single 32-bit variable?
  22. Encoding int value as an IEEE-754 float (binary32)
  23. Efficient bitwise operations for counting bits or find the right|left most ones
  24. Decimal to Binary
  25. Branchless code that maps zero, negative, and positive to 0, 1, 2
  26. Difference between | and || , or & and && [duplicate]
  27. Fastest way to produce a mask with n ones starting at position i
  28. Fast divisibility tests (by 2,3,4,5,.., 16)?
  29. How can I test whether a number is a power of 2?
  30. What is bit masking?

Leave a Comment