hashmap在1.7中是由数组和链表组成的,存放的是Entry对象
HashMap()
new一个HashMap对象,会传入默认值initialCapacity=16,loadFactor=0.75
,然后赋值负载因子和阈值大小;
init()是在LinkedHashMap中才实现,暂不管。
public HashMap(int initialCapacity, float loadFactor) {
if (initialCapacity < 0)
throw new IllegalArgumentException("Illegal initial capacity: " +
initialCapacity);
if (initialCapacity > MAXIMUM_CAPACITY)
initialCapacity = MAXIMUM_CAPACITY;
if (loadFactor <= 0 || Float.isNaN(loadFactor))
throw new IllegalArgumentException("Illegal load factor: " +
loadFactor);
this.loadFactor = loadFactor;
threshold = initialCapacity;
init();
}
put()
默认table为空数组
,进入inflateTable(threshold);
中间的细节需要进入方法中查看;
主要的put过程是查找数组链表中是否存在该key,如果存在则替换返回oldValue;
如果不存在并且不进行扩容则进行头插法插入,将.next指向插入的原本的头部
public V put(K key, V value) {
if (table == EMPTY_TABLE) {
inflateTable(threshold); // 进入①
}
if (key == null)
return putForNullKey(value); // 进入②
int hash = hash(key); // 进入③
int i = indexFor(hash, table.length); // 进入④
for (Entry<K,V> e = table[i]; e != null; e = e.next) {
Object k;
if (e.hash == hash && ((k = e.key) == key || key.equals(k))) {
V oldValue = e.value;
e.value = value;
e.recordAccess(this);
return oldValue;
}
}
modCount++;
addEntry(hash, key, value, i); // 进入⑤
return null;
}
① inflateTable()方法中
1、roundUpToPowerOf2(toSize)决定table的大小;
2、重新设置threshold阈值
3、创建table数组分配内存空间
4、initHashSeedAsNeeded赋值hashSeed(hash种子,默认值为0)
private void inflateTable(int toSize) {
// Find a power of 2 >= toSize
// 1
int capacity = roundUpToPowerOf2(toSize);
// 2
threshold = (int) Math.min(capacity * loadFactor, MAXIMUM_CAPACITY + 1);
// 3
table = new Entry[capacity];
// 4
initHashSeedAsNeeded(capacity);
}
// 减一之后左移一位(*2)然后找到小于它的最大2的指数
private static int roundUpToPowerOf2(int number) {
// assert number >= 0 : "number must be non-negative";
return number >= MAXIMUM_CAPACITY
? MAXIMUM_CAPACITY
: (number > 1) ? Integer.highestOneBit((number - 1) << 1) : 1;
}
②putForNullKey()
如果key为null值,如果原本存在该key则替换值,返回oldValue,如果原本不存在该key则直接添加
。
private V putForNullKey(V value) {
for (Entry<K,V> e = table[0]; e != null; e = e.next) {
if (e.key == null) {
V oldValue = e.value;
e.value = value;
e.recordAccess(this);
return oldValue;
}
}
modCount++;
addEntry(0, null, value, 0);
return null;
}
③hash()
将hash和key值的hashCode值进行异或,然后将自身右移异或。
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);
}
④indexFor()
将hash值和table.length-1进行与运算,得到table数组下标
static int indexFor(int h, int length) {
// assert Integer.bitCount(length) == 1 : "length must be a non-zero power of 2";
return h & (length-1);
}
⑤addEntry()
如果不满足扩容条件,进入createEntry(),采用头插法添加key-value,hashmap的size++
void addEntry(int hash, K key, V value, int bucketIndex) {
if ((size >= threshold) && (null != table[bucketIndex])) {
resize(2 * table.length);
hash = (null != key) ? hash(key) : 0;
bucketIndex = indexFor(hash, table.length);
}
createEntry(hash, key, value, bucketIndex);
}
void createEntry(int hash, K key, V value, int bucketIndex) {
Entry<K,V> e = table[bucketIndex];
table[bucketIndex] = new Entry<>(hash, key, value, e);
size++;
}
resize()
如果hashmap的size大于等于阈值,并且put的table下标对应的值不为null则进行扩容
;
创建一个新的table长度为旧table长度的两倍
,然后进入transfer()传输
,重新赋值hashSeed,默认为false;
并且重新赋值table和阈值大小。
void resize(int newCapacity) {
Entry[] oldTable = table;
int oldCapacity = oldTable.length;
if (oldCapacity == MAXIMUM_CAPACITY) {
threshold = Integer.MAX_VALUE;
return;
}
Entry[] newTable = new Entry[newCapacity];
transfer(newTable, initHashSeedAsNeeded(newCapacity)); // 进入①
table = newTable;
threshold = (int)Math.min(newCapacity * loadFactor, MAXIMUM_CAPACITY + 1);
}
①transfer()
画图来描述这个传输Entry的过程
void transfer(Entry[] newTable, boolean rehash) {
int newCapacity = newTable.length;
for (Entry<K,V> e : table) {
while(null != e) {
Entry<K,V> next = e.next;
if (rehash) {
e.hash = null == e.key ? 0 : hash(e.key);
}
int i = indexFor(e.hash, newCapacity);
e.next = newTable[i];
newTable[i] = e;
e = next;
}
}
}
transfer过程
1、e指向和e.next指向
2、e.next=newTable[i]移到新数组,然后newTable[i]=e,e作为头部
3、e=next,next=e.next进入下一循环
4、最后循环后结果,e=next == null退出循环
扩容造成死循环问题
hashmap是不安全
,在多线程中进行扩容可能会造成死循环问题
在线程1先抢到put进行扩容之后就如上图四所示
1、等到线程2抢到put开始扩容操作
:e2指向和e2.next指向
2、e2.next = newTable[i]移到新数组
3、第二次循环,移动第二次时,e2 = next2
4、在第三次循环中,e2.next = newTable[i],使得pang1指向pang2
,造成循环
,而最后e2=null结束
解决方法:
1)设置负载因子使得threshold比hashmap的size大,不让其进行扩容;
2)在多线程方面进行加锁操作