(copied from ConcurrentHashMap) Spreads (XORs) higher bits of hash to lower and also forces top bit to 0. Because the table uses power-of-two masking, sets of hashes that vary only in bits above the current mask will always collide. (Among known examples are sets of Float keys holding consecutive wh
(int h)
| 166 | * @return adjusted hash code |
| 167 | */ |
| 168 | public static int spread(int h) { |
| 169 | return (h ^ (h >>> 16)) & SPREAD_HASH_BITS; |
| 170 | } |
| 171 | |
| 172 | /** |
| 173 | * Murmur3 finalizer. Kept as a private helper exclusively for |
no outgoing calls
no test coverage detected