Rotate left 2 bits (like assembler)

[Blitz]

Dude, i don't think you quite understand what bit rotation is and how numbers are stored. There is no such thing as signed or unsigned numbers. -1 and 65535 are the same number. It's just a matter of how you chose to interpret them. So what your saying is pointless. And now i'm getting a bit annoyed becuase your complaints do not make sense. It don't even need to use longs if it was compiled. But the IDE uses special function to convert numbers to help newbies. But they don't really help, they're just limiting.


32768 is in binary
1000 0000 0000 0000
Well guess what, so is -32768


65532 is in binary
1111 1111 1111 1100
Imagine the suprise, so is -4!

So you see my friend, the result of the code i posted is 100% correct. How qb choses to interpret it is another matter. If you were to run that number in x86 rol you would get the exact same binary output.

Other languages do not do such stupid assumptions. This for instance would be perfectly fine in C.

Code:

short rotateLeft ( short num )
{
    return ( (num << 2) | ((num >> 14) & 0x0003) );
}