Bit-shifting in Effective Java hashCode() implementation

Question

I was wondering if someone could explain in detail what

(int)(l ^ (l >>> 32));

does in the following hashcode implementation (generat

Answer 1

It takes a 64 bit number, splits it half, and xors the two halves together (essentially).