馬哥Linux高端運維云計算就業(yè)班隨到隨學(xué)專業(yè)輔導(dǎo)定期直播
2022-10-19 21:28 作者:janet19961217 | 我要投稿
final int hash(Object k) {
? ? ? ?int h = hashSeed;
? ? ? ?if (0 != h && k instanceof String) {
? ? ? ? ? ?return sun.misc.Hashing.stringHash32((String) k);
? ? ? ?}
? ? ? ?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);
標(biāo)簽：
