我在HashMap.java中看到了下面的代碼。在Java中^ =是什麼意思?
h ^= k.hashCode();
// This function ensures that hashCodes that differ only by
// constant multiples at each bit position have a bounded
// number of collisions (approximately 8 at default load factor).
h ^= (h >>> 20)^(h >>> 12);
return h^(h >>> 7)^(h >>> 4);
幾個隨機輸入產生類似於另外一個輸出端,但下面的代碼導致0
int p = 10;
p ^= 10;
System.out.println("_______ " + p);
考慮這個'char ch ='1'; ch^= Long.MIN_VALUE;';) –