HashMap原理及put方法与get方法的调用过程

    public V put(K key, V value) {
        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;
        if ((tab = table) == null || (n = tab.length) == 0)
            n = (tab = resize()).length;
        if ((p = tab[i = (n - 1) & hash]) == null)
            tab[i] = newNode(hash, key, value, null);
        else {
            Node<K,V> e; K k;
            if (p.hash == hash &&
                ((k = p.key) == key || (key != null && key.equals(k))))
                e = p;
            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);
                        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;
                }
            }
            if (e != null) { // existing mapping for key
                V oldValue = e.value;
                if (!onlyIfAbsent || oldValue == null)
                    e.value = value;
                afterNodeAccess(e);
                return oldValue;
            }
        }
        ++modCount;
        if (++size > threshold)
            resize();
        afterNodeInsertion(evict);
        return null;
    }

    final void treeifyBin(Node<K,V>[] tab, int hash) {
        int n, index; Node<K,V> e;
        // 如果数组等于null 或 数组长度小于 64
        if (tab == null || (n = tab.length) < MIN_TREEIFY_CAPACITY)
        // 重新散列，使得链表变短
            resize();
        // 如果hash冲突，且数组长度大于 64，则只能使用红黑树结构
        else if ((e = tab[index = (n - 1) & hash]) != null) {
            TreeNode<K,V> hd = null, tl = null;
             // 返回新的红黑树
            do {
                TreeNode<K,V> p = replacementTreeNode(e, null);
                if (tl == null)
                    hd = p;
                else {
                    p.prev = tl;
                    tl.next = p;
                }
                tl = p;
            } while ((e = e.next) != null);
            if ((tab[index] = hd) != null)
                hd.treeify(tab);
        }
    }

public class HashTest {
 public static void main(String[] args) {
  // 对"负载因子的大小对程序的影响规律"进行测试
  // threshold=capacity * loadFactor ---- 阈值 = 容量 x 负载因子
  // 源代码扩容后容量是扩容前的二倍
  int n1 = 10;   // 对照组
  int n2 = 1000000; // put/get多少组
  long t0 = 0;      //总耗时
  float lf = 0.9f;  //负载因子
  int capacity = 100; //初始容量
  HashMap map = null;
  
  //对照组循环
  for (int j = 1; j <= n1; j++) {
   map = new HashMap(capacity, lf);
   List<String> list = new ArrayList<String>();
   // 利用循环进行put
   for (int i = 0; i < n2; i++) {
    String temp = HashTest.randomString();
    map.put(temp, i);
    list.add(temp);
   }
   long time = 0; // 总耗费时间
   // 利用循环get
   for (int i = 0; i < n2; i++) {
    String temp = list.get(i);
    long t1 = System.currentTimeMillis();
    map.get(temp);
    long t2 = System.currentTimeMillis();
    long t3 = t2 - t1;// 花费时间
    time += t3;
   }
   System.out.println("组"+j+"花费时间(ms)=" + time);
   t0 += time;
   map = null;
  }
  System.out.println("get出 "+n2+" 对键值对中，"+n1+"组数据得出:");
  System.out.println("---------------------------------");
  System.out.println("每get"+n2+"对键值对 平均花费时间(毫秒)："+(t0/n1));
 }
 
 public static String randomString() {
  // 最终产生的字符串
  StringBuffer sb = new StringBuffer();
  // 字符串样本
  String str = "回到家卡萨恒大帝景阿萨德节快乐就看见了困窘企业无辜的鄙视你别这么想按一个预告的哈上东国际按时大大伽伽汇顶科技啊啥看的撒打算大的欧亚报出去qwertyuiopasdfghjklzxvcbnm,.;p[']/\1234567890zxcvbnmaksjhfgdlpoiuytrewq阿斯加德克拉斯近段时间的书上方法更符合辅导费的冠福股份极乐空间流口水";
  // System.out.println("样本字符串长度:"+str.length());
  // 产生一个1到30的数字
  int num = (int) (Math.random() * 30 + 1);
  // System.out.println("num="+num);
  // 用for循环从样本字符串中提取出字符进行组合
  for (int i = 0; i < num; i++) {
   int num1 = (int) (Math.random() * str.length()); // 产生一个0到字符串样本的数字
   // 根据索引值获取对应的字符
   char charAt = str.charAt(num1);
   sb.append(charAt);
  }
  // System.out.println("产生一个长度为"+num+"的字符串");
  return sb.toString();
 }