HashMap 源码分析及简述 HashTable
Map的遍历方式
K-V关系图
Map map = new HashMap();
map.put("张一鸣","字节跳动");
map.put("马云","阿里");
map.put("马化腾","腾讯");
map.put("李彦宏","百度");
map.put("雷军","小米");
map.put("王兴","美团");
map.put("张勇","阿里");
map.put("null","null");
System.out.println(map);
增强for遍历
//第一种写法
Set keyset = map.keySet();
for (Object o:keyset){
System.out.println(map.get(o));
}
//第二种写法
for (Object o:map.keySet()){
System.out.println(map.get(o));
}
获取entrySet
//第三种写法
Map<String,String> map = new HashMap();
for (Map.Entry<String, String> entry :map.entrySet()) {
System.out.println(entry.getKey() + " :" + entry.getValue());
}
迭代器遍历
//第一种:获取map.values()
Collection values = map.values();
System.out.println(values);
Iterator iterator = values.iterator();
for (Object o:values){
System.out.println(o);
}
//第二种:获取key值
Iterator iterator = map.keySet().iterator();
while (iterator.hasNext()){
Object key = iterator.next();
System.out.println(map.get(key));
}
获取entrySet
//第三种:获取entrySet()
Iterator<Map.Entry<String, String>> iterator = map.entrySet().iterator();
while (iterator.hasNext()) {
Map.Entry<String, String> entry = iterator.next();
System.out.println(entry.getKey() + " :" + entry.getValue());
}
//第四种:获取entrySet()
Set entrySet = map.entrySet();
Iterator iterator =entrySet.iterator();
while(iterator.hasNext()){
Object entry = iterator.next();
Map.Entry m = (Map.Entry)entry;
System.out.println(m.getKey()+" "+m.getValue());
}
源码分析
//执行构造器 new HashMap()
//初始化加载因子loadFactor = 0.75
//HashMap$Node[] table = null
public HashMap() {
this.loadFactor = DEFAULT_LOAD_FACTOR;
}
//执行put调用hash方法,计算key的hash值
public V put(K key, V value) {
return putVal(hash(key), key, value, false, true);
}
//执行putVal
final V putVal(int hash, K key, V value, boolean onlyIfAbsent,boolean evict) {
Node<K,V>[] tab;
Node<K,V> p;
int n, i;
//如果底层的table数组为null,或者length = 0扩容为16
if ((tab = table) == null || (n = tab.length) == 0)
n = (tab = resize()).length;
//取出hash值对应的table索引位置的Node,如果为null就直接把k-v加入到创建的Node中
if ((p = tab[i = (n - 1) & hash]) == null)
tab[i] = newNode(hash, key, value, null);
else {
Node<K,V> e;
K k;
//如果table索引位置的key的hash和新的key的hash相同
//并满足(table 现有的结点的 key 和准备添加的 key 是同一个对象 || equals 返回真)
//就不能加入加入新的k-v
if (p.hash == hash &&
((k = p.key) == key || (key != null && key.equals(k))))
e = p;
//如果当前的table已有Node是红黑树,就按照红黑树的方式处理
else if (p instanceof TreeNode)
e = ((TreeNode<K,V>)p).putTreeVal(this, tab, hash, key, value);
else {
//如果找到的结点后面是链表,就循环比较
for (int binCount = 0; ; ++binCount) {
//如果整个链表没有和他相同的,就加入到链表的最后
if ((e = p.next) == null) {
p.next = newNode(hash, key, value, null);
//加入后判断当前链表的个数,是否已含有8个,调用treeifyBin方法进行红黑树转换
//如果 table 为 null ,或者大小还没有到 64,暂时不树化,而是进行扩容
//
否则才会真正的树化 -> 剪枝
if (binCount >= TREEIFY_THRESHOLD - 1) // -1 for 1st
treeifyBin(tab, hash);
break;
}
//如果在循环比较过程中,发现有相同,就 break,就只是替换 value
if (e.hash == hash &&
((k = e.key) == key || (key != null && key.equals(k))))
break;
p = e;
}
}
if (e != null) { // existing mapping for key
V oldValue = e.value;
if (!onlyIfAbsent || oldValue == null)
替换, key 对应 value
e.value = value;
afterNodeAccess(e);
return oldValue;
}
}
每增加一个 Node ,就 size++
++modCount;
if (++size > threshold)
resize();
afterNodeInsertion(evict);
return null;
}