2

In RegularEnumSet implementation, there is a code:

elements = -1L >>> -universe.lengh

It uses a Long type integer to implement efficient EnumSet.

What is notable is that the right-hand operand of >>> is a negative figure.

I have tested and found that 

int i = -1;
i >>> -3

has equivalent effect with

int i = 1;
i << 3;

So why bother to write in this ambiguous form?

l4rmbr
  • 1,227
  • 7
  • 22

2 Answers2

2

From the "Java Language Specification", section 15.19, about shifting "If the promoted type of the left-hand operand is long, then only the six lowest-order bits of the right-hand operand are used as the shift distance. It is as if the right-and operand were subjected to a bitwise logical AND operator & with the mask value 0x3f. The shift distance actually used is therefore awlays 0 to 64, inclusive."

So, >>> -3 has equivalent effect as >>> 61, and -1L >>> -n equals -1L >>> (0x3f&-n)

Actually this seems to be the most effective way of producing a consecutive 1s in the lowest n-bits of a long integer.

xiaofeng.li
  • 8,237
  • 2
  • 23
  • 30
0

First, note that the code you quoted uses -1L, not -1. Longs are unsigned, so -1L is equivalent to setting all the bits on the long, or getting the highest possible long number.

>>> -3 has equivalent effect with << 3

It doesn't. The unsigned right shift operator (>>>) shifts zeroes into the sign bit, while >> and << preserve the sign of the value being shifted, shifting 1 or 0 accordingly. That's why -1L >>> -3 is 7 (0111b) and 1L << 3 is 8 (1000b).

Reuben Morais
  • 1,013
  • 1
  • 8
  • 20