HashMap源码粗解

1.Hash算法

散列表，又叫哈希表，它是基于快速存取的角度设计的，也是一种典型的空间换时间的做法。
散列表是根据关键码值而直接进行访问的数据结构。
哈希冲突：即两个元素通过散列函数得到的地址相同。

2.源码分析

​ ·构造方法

public HashMap() {
        this.loadFactor = DEFAULT_LOAD_FACTOR; // all other fields defaulted
    }


public HashMap(int initialCapacity) {
        this(initialCapacity, DEFAULT_LOAD_FACTOR);
    }

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;
        this.threshold = tableSizeFor(initialCapacity);
    }

public HashMap(Map<? extends K, ? extends V> m) {
        this.loadFactor = DEFAULT_LOAD_FACTOR;
        putMapEntries(m, false);
    }

​ ○ int类型构造方法

//可以自定义负载因子
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;
      //tableSizeFor
      this.threshold = tableSizeFor(initialCapacity);
  }

//计算初始容量，结果为比cap大的最小的2的指数幂
//cap=12-->结果为2^4=16
static final int tableSizeFor(int cap) {
    int n = cap - 1;
    n |= n >>> 1;
    n |= n >>> 2;
    n |= n >>> 4;
    n |= n >>> 8;
    n |= n >>> 16;
    return (n < 0) ? 1 : (n >= MAXIMUM_CAPACITY) ? MAXIMUM_CAPACITY : n + 1;
}

○ 参数为 Map<? extends K, ? extends V> m 的构造方法

public HashMap(Map<? extends K, ? extends V> m) {
        this.loadFactor = DEFAULT_LOAD_FACTOR;
        putMapEntries(m, false);
    }


final void putMapEntries(Map<? extends K, ? extends V> m, boolean evict) {
  		//传入集合大小
      int s = m.size();
      if (s > 0) {
        //判断Node<K,V>[] table数组是否为null
          if (table == null) { // pre-size
              float ft = ((float)s / loadFactor) + 1.0F;
              int t = ((ft < (float)MAXIMUM_CAPACITY) ?
                       (int)ft : MAXIMUM_CAPACITY);
              if (t > threshold)
                  threshold = tableSizeFor(t);
          }
          else if (s > threshold)
            //扩容
              resize();
          for (Map.Entry<? extends K, ? extends V> e : m.entrySet()) {
              K key = e.getKey();
              V value = e.getValue();
            //计算hash值，放入map
              putVal(hash(key), key, value, false, evict);
          }
      }
  }

//获取key的hash值
static final int hash(Object key) {
        int h;
  			//对象的hashcode值 ^(异或) 对象的hashcode值的高位（前16位）
  			//目的：尽可能降低hash冲突，提高hashcode的随机性
        return (key == null) ? 0 : (h = key.hashCode()) ^ (h >>> 16);
    }

例如：
  hashcode = 1101 1001 , 容量 = 15
  	1101 1001
  ^	0000 1101
  -----------
  	1101 0100
  & 0000 1111
  -----------
    0000 0100

○ put方法详解

public V put(K key, V value) {
  		// 根据传入参数key，获取hashcode
      return putVal(hash(key), key, value, false, true);
  }

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数组是否为空或长度为0
      if ((tab = table) == null || (n = tab.length) == 0)
        	// 初始化table
          n = (tab = resize()).length;
  		// 16 - 1 = 15 & hasg值 = i
  		// i = 元素在tab中的位置
  		// p = tab[i], p链表 == null ?
  		// (n - 1) & hash 取余运算，优化计算速度
      if ((p = tab[i = (n - 1) & hash]) == null)
        	// 创建节点，直接存放到tab[i]位置
          tab[i] = newNode(hash, key, value, null);
      else {
        	// tab[i]有元素
          Node<K,V> e; K k;
        	// hash值相同
          if (p.hash == hash &&
              ((k = p.key) == key || (key != null && key.equals(k))))
              e = p;
        	// 判断 p 是否为树节点， jdk1.8优化HashMap存储方案，链表长度超过8自动转为红黑树
          else if (p instanceof TreeNode)
            	// 基于红黑树的插入逻辑
              e = ((TreeNode<K,V>)p).putTreeVal(this, tab, hash, key, value);
          else {
            // 非树结构，链表插入元素
              for (int binCount = 0; ; ++binCount) {
                	// 判断p的下一个元素是否为null
                  if ((e = p.next) == null) {
                      p.next = newNode(hash, key, value, null);
                    	// 判断当前链表长度是否大于树结构的阈值
                      if (binCount >= TREEIFY_THRESHOLD - 1) // -1 for 1st
                        	// 链表转红黑树
                          treeifyBin(tab, hash);
                      break;
                  }
               		// 当前链表包含要插入的值，结束遍历
                  if (e.hash == hash &&
                      ((k = e.key) == key || (key != null && key.equals(k))))
                      break;
                  p = e;
              }
          }
        	// 判断插入的值是否存在hashmap中
          if (e != null) { // existing mapping for key
              V oldValue = e.value;
              if (!onlyIfAbsent || oldValue == null)
                  e.value = value;
              afterNodeAccess(e);
              return oldValue;
          }
      }
  		// 修改次数 +1
      ++modCount;
  		// 判断数组大小是否大于阈值
      if (++size > threshold)
        	// 扩容
          resize();
      afterNodeInsertion(evict);
      return null;
  }

// 扩容
final Node<K,V>[] resize() {
  		// 数组初始化
      Node<K,V>[] oldTab = table;
  		// 扩容前变量的初始化
      int oldCap = (oldTab == null) ? 0 : oldTab.length;
      int oldThr = threshold;
  		// 扩容后的变量初始化
      int newCap, newThr = 0;
      if (oldCap > 0) {
          if (oldCap >= MAXIMUM_CAPACITY) {
              threshold = Integer.MAX_VALUE;
              return oldTab;
          }
        	// oldCap << 1 即当前容量乘以2 = 新的容量
          else if ((newCap = oldCap << 1) < MAXIMUM_CAPACITY &&
                   oldCap >= DEFAULT_INITIAL_CAPACITY)
            	// 阈值容量
              newThr = oldThr << 1; // double threshold
      }
      else if (oldThr > 0) // initial capacity was placed in threshold
          newCap = oldThr;
      else {               // zero initial threshold signifies using defaults
          newCap = DEFAULT_INITIAL_CAPACITY;
        	// 负载因子 * 初始容量 = 阈值
          newThr = (int)(DEFAULT_LOAD_FACTOR * DEFAULT_INITIAL_CAPACITY);
      }
      if (newThr == 0) {
          float ft = (float)newCap * loadFactor;
          newThr = (newCap < MAXIMUM_CAPACITY && ft < (float)MAXIMUM_CAPACITY ?
                    (int)ft : Integer.MAX_VALUE);
      }
      threshold = newThr;
  		// 创建一个新的容器
      @SuppressWarnings({"rawtypes","unchecked"})
          Node<K,V>[] newTab = (Node<K,V>[])new Node[newCap];
      table = newTab;
  		// 对元素重新排位
      if (oldTab != null) {
          for (int j = 0; j < oldCap; ++j) {
              Node<K,V> e;
            	// 获取第j个位置的元素
              if ((e = oldTab[j]) != null) {
                  oldTab[j] = null;
                	// 判断原有j位置是否有元素
                  if (e.next == null)
                    	// 重新计算位置保存元素
                      newTab[e.hash & (newCap - 1)] = e;
                  else if (e instanceof TreeNode)
                    	// 红黑树拆分
                      ((TreeNode<K,V>)e).split(this, newTab, j, oldCap);
                  else { // preserve order
                      Node<K,V> loHead = null, loTail = null;
                      Node<K,V> hiHead = null, hiTail = null;
                      Node<K,V> next;
                      do {
                        	// 遍历链表，将链表节点按照顺序进行分组
                          next = e.next;
                        	// 扩容后在原位的
                          if ((e.hash & oldCap) == 0) {
                              if (loTail == null)
                                  loHead = e;
                              else
                                  loTail.next = e;
                              loTail = e;
                          }
                        	// 扩容后不再原位的
                          else {
                              if (hiTail == null)
                                  hiHead = e;
                              else
                                  hiTail.next = e;
                              hiTail = e;
                          }
                      } while ((e = next) != null);
                      if (loTail != null) {
                          loTail.next = null;
                          newTab[j] = loHead;
                      }
                      if (hiTail != null) {
                          hiTail.next = null;
                        	// 原索引+oldCap
                          newTab[j + oldCap] = hiHead;
                      }
                  }
              }
          }
      }
      return newTab;
  }

○ remove方法

public V remove(Object key) {
    Node<K,V> e;
    return (e = removeNode(hash(key), key, null, false, true)) == null ?
        null : e.value;
}

final Node<K,V> removeNode(int hash, Object key, Object value,
                           boolean matchValue, boolean movable) {
    Node<K,V>[] tab; Node<K,V> p; int n, index;
  	// p是元素要存储的位置
    if ((tab = table) != null && (n = tab.length) > 0 &&
        (p = tab[index = (n - 1) & hash]) != null) {
        Node<K,V> node = null, e; K k; V v;
      	
        if (p.hash == hash &&
            ((k = p.key) == key || (key != null && key.equals(k))))
          	// 定位删除的节点node
            node = p;
      	// 有冲突，不只是一个元素在同一个位置
        else if ((e = p.next) != null) {
            if (p instanceof TreeNode)
              	// 红黑树的查找，定位元素
                node = ((TreeNode<K,V>)p).getTreeNode(hash, key);
            else {
              	//链表
                do {
                    if (e.hash == hash &&
                        ((k = e.key) == key ||
                         (key != null && key.equals(k)))) {
                        node = e;
                        break;
                    }
                    p = e;
                } while ((e = e.next) != null);
            }
        }
      	//node，要删除的元素
        if (node != null && (!matchValue || (v = node.value) == value ||
                             (value != null && value.equals(v)))) {
          	
            if (node instanceof TreeNode)
              	// 红黑树结构的移除
                ((TreeNode<K,V>)node).removeTreeNode(this, tab, movable);
            else if (node == p)
              	// 链表结构删除节点
                tab[index] = node.next;
            else
              	// 数组中p位置的对象下一个元素 = 删除的元素的下一个元素，即直接将其覆盖掉
                p.next = node.next;
            ++modCount;
            --size;
            afterNodeRemoval(node);
            return node;
        }
    }
    return null;
}

○ HashMap遍历

final Node<K,V> nextNode() {
    Node<K,V>[] t;
    Node<K,V> e = next;
    if (modCount != expectedModCount)
        throw new ConcurrentModificationException();
    if (e == null)
        throw new NoSuchElementException();
    if ((next = (current = e).next) == null && (t = table) != null) {
      	// 寻找数组中下一个hash表中不为空的节点
        do {} while (index < t.length && (next = t[index++]) == null);
    }
    return e;
}