How can an integer be read bit by bit?...

Arithmetic shift-right integers with half rounding toward zero...

What's the simplest way to reverse the order of bits in a byte in C/C++?...

Implementing safe shift-left...

Branchless add or subtract depending on separate sign bit...

Convert 0x1234 to 0x11223344...

Interleave bits efficiently...

How to interleave two uint32_t values into one uint64_t?...

How to efficiently de-interleave bits (inverse Morton)...

Bits twiddling hack: most efficient way to remove one bit every n bits?...

Standard C++11 code equivalent to the PEXT Haswell instruction (and likely to be optimized by compil...

What's the fastest way to divide an integer by 3?...

Fastest way to strip trailing zeroes from an unsigned int...

What's the meaning of "shift operates on bits individually"?...

Count 1-bits of an integer as fast as GCC's __builtin__popcount(int)...

Fastest way to compute log₂(n) where n is of form 2ᵏ?...

What's the quickest way to compute log2 of an integer in C#?...

Templatized branchless int max/min function...

Is -(uintN_t)x or unsigned inverse in other words guaranteed to work in two's complement by the ...

Rounding up to next power of 2...

Bitwise operations: online resources?...

Will bit-shift by zero bits work correctly?...

Setting all bits before first '1'...

How to efficiently find Bitwise OR of a range of numbers...

Efficient (bit-wise) division by 24...

Multiply by 27 using only bit shifting, addition and subtraction as few times as possible...

Swap first and last 5 bits in a 16-bit number...

How does an arithmetic bit-shift affect a signed integer?...

In C, can the Arithmetic Right Shift 1>>31 result in -1?...

How to turn a 16-bit number in one's complement into it's 7-segment display equivalence?...