How this calculation works
Rotate a bit pattern in both directions without discarding any bits.
THE FORMULA
Split at the rotation point and wrap the displaced bitsA worked example
Rotating 10000001 left by one gives 00000011.
Good to know
The rotation count wraps modulo the word width.
Reference: NIST DLMF, Functions of Number Theory (opens in a new tab) ↗
Read the result
Rotate a bit pattern in both directions without discarding any bits.
The primary result is labeled “Rotate left”. Keep the input definitions in view when comparing this result with another method.
Try a related calculation
The rotation count wraps modulo the word width.
For a related exercise, try the greatest common divisor.
A few questions, answered
How can I check the default inputs by hand?
Rotating 10000001 left by one gives 00000011.
Which rule does this calculator apply?
Split at the rotation point and wrap the displaced bits