What does the statement if (counter & (1

by

The statement:

if (counter & (1<<j))

checks if the j-th bit of counter is set. In more detail, 1 << j uses shifting of 1 to generate a bit mask in which only the j-th bit is set. The & operator then masks out the j-bit of counter; if the result is not zero (which means that the j-th bit of counter was set), the condition is satisfied.

Consider the following example. If counter is 320, its binary representation is 101000000, which means that the 6th bit (the one corresponding to the value of 64) is set; let’s test for that bit. The bit mask is generated by shifting 1, which has the binary representation 000000001, 6 places to the right, which results in the binary value 001000000. The value of counter, namely:

101000000

is combined with &, which is the bitwise and-operator, with the bit mask as follows:

  101000000
& 001000000
  ---------
  001000000

The value 001000000 again corresponds to the value of 64; however this is not important here, it only matters that it is not zero (as it has a nonzero bit, namely the bit for which we intended to check). In total, the condition

if ( 64 )

is satisfied. In the semantics of C (which does not feature a native Boolean data type) any nonzero value is treated as true when checked with if.

More Related Contents:

  1. Arithmetic bit-shift on a signed integer
  2. Are the shift operators () arithmetic or logical in C?
  3. What is Bit Masking?
  4. Bitwise operators and “endianness”
  5. Casting float to int (bitwise) in C
  6. warning: left shift count >= width of type
  7. Encoding int value as an IEEE-754 float (binary32)
  8. Why use the Bitwise-Shift operator for values in a C enum definition?
  9. Decimal to Binary
  10. What is bit masking?
  11. What is the fastest/most efficient way to find the highest set bit (msb) in an integer in C?
  12. How can I multiply and divide using only bit shifting and adding?
  13. What is CHAR_BIT?
  14. Are the results of bitwise operations on signed integers defined?
  15. What does the C standard say about bitshifting more bits than the width of type?
  16. How do I set, clear, and toggle a single bit?
  17. Operator precedence (bitwise ‘&’ lower than ‘==’)
  18. Weird behavior of right shift operator (1 >> 32)
  19. Java: right shift on negative number
  20. What’s bad about shifting a 32-bit variable 32 bits?
  21. c get nth byte of integer
  22. set the m-bit to n-bit [closed]
  23. Compound condition in C: if (0.0 < a < 1.0)
  24. Performance wise, how fast are Bitwise Operators vs. Normal Modulus?
  25. Check if a number is non zero using bitwise operators in C
  26. How to get position of right most set bit in C
  27. How to replace bits in a bitfield without affecting other bits using C
  28. Bitwise shifting array of char’s
  29. How to set, clear, and toggle a single bit?
  30. How to implement Bitcount using only Bitwise operators?

Leave a Comment