This week's book giveaways are in the Refactoring and Agile forums.We're giving away four copies each of Re-engineering Legacy Software and Docker in Action and have the authors on-line!See this thread and this one for details.
Win a copy of Re-engineering Legacy Software this week in the Refactoring forum
or Docker in Action in the Cloud/Virtualization forum!

# code explanation

ten doeschate
Greenhorn
Posts: 16

in this
what does >>= stand for

drac yang
Ranch Hand
Posts: 62
• 1
that's compound operator for signed right shift. it's bitwise operator

x >>= 5; means move rightward 5 bits in the unsigned way(only zero would be moved in from the leftmost bit)

this is its unsigned counterpart, >>>=

Satheesh chandragupthan
Greenhorn
Posts: 4
• 1
take look on the below explanation please..

value >> num

Here, num specifies the number of positions to right-shift the value in value. That is, the >> moves all of the bits in the specified value to the right the number of bit positions specified by num. The following code fragment shifts the value 32 to the right by two positions, resulting in a being set to 8:

int a = 32;
a = a >> 2; // a now contains 8

When a value has bits that are "shifted off," those bits are lost. For example, the next code fragment shifts the value 35 to the right two positions, which causes the two low order bits to be lost, resulting again in a being set to 8.
int a = 35;
a = a >> 2; // a still contains 8

Looking at the same operation in binary shows more clearly how this happens:

00100011 35
>> 2
00001000 8

Winston Gutkowski
Bartender
Posts: 10109
56
drac yang wrote:x >>= 5; means move rightward 5 bits in the unsigned way(only zero would be moved in from the leftmost bit)

<nitpick>
Actually, that's wrong. It's the signed shift, so the sign bit will be moved in regardless of its value.
</nitpick>

You actually go on to show the unsigned version, so I'm not sure if this was a misprint or not.

Winston

Ramesh Pramuditha Rathnayake
Ranch Hand
Posts: 178
2
ten doeschate wrote:
in this
what does >>= stand for

Here 'actual bit size' means, the minimum number of bits need to express the number in binary form.

Think base=2 and exp=5. Then the value is 2*2*2*2*2.
But the actual bit size of exp is 3 (bits- 101). When it is decreased by one first bit is canceled and zero is added to the beginning.(As exp must be>=0). If clause is run only 3 times.
Therefore, if there is no 'if clause', result is 2*2*2.

But the last bit of exp will be 1 two times. Therefore if clause is run twice. Therefore final answer is 2*2*2*2*2

Actually, use of >> here is to decrease bit size by one..