Why doesn't C have rotate left/right operators? [closed]

Answer 1

I think it's because there are two types of rotations: with and without carry, which makes the rotation to be done differently, according to the resulting machine's CARRY flag (1 or 0). That would imply implementing a total of 4 operators, thus making the language unnecessarily complex, provided that rotation can be simply implemented as @Aniket has shown.

EDIT:

Nevertheless, shifting may also be done signed and unsigned. Actually Javascript has both operators, AFAIK. However, since C supports signed and unsigned variables, I think it has no sense to perform signed shifts, because the compiler should know whether we are shifting a signed or unsigned variable. Signed/unsigned shifts are useful for arithmetical computations, and a C compiler may use them to generate the assembly code. For instance, many arithmetical operations such as multiplying or dividing by a power of 2 are translated by the compiler into shift operations. The only reason we have shift operators in C is for working with bitmasks.

Answer 2

C doesn't have rotate-left and rotate-right for binary. You can code rotate left and rotate-right functions yourself. But as per standards: nope.

Simple rotate-left :

int rotate_left(int num, int bits)
{
  return ((num << bits) | (num >> (32 -bits)));
} 

int rotate_right(int num, int bits)
{
  return ((num >> bits) | (num << (32 -bits)));
}

The above functions will work with 32 bit integers only :)

Now for the philosophy: C was meant to be portable as much as possible. That's what the standards team want it to be "a portable assembler". There is no guarantee that rol and ror is present on architectures of the future. Or might behave differently. Hence it was kept away from standards.