Java源碼角度分析HashMap用法

Map<Integer,String> maps=new HashMap<Integer,String>();   
maps.put(1, "a");   
maps.put(2, "b");

Map<int,double> maps=new HashMap<int,double>();

public class HashMap<K,V>  
  extends AbstractMap<K,V>  
  implements Map<K,V>, Cloneable, Serializable 

Map<String,String> rm=new HashMap<String,String>(2)

Map<String, Object> map = Maps.newHashMapWithExpectedSize(7);

public HashMap() {   
    this.loadFactor = DEFAULT_LOAD_FACTOR;   
    threshold = (int)(DEFAULT_INITIAL_CAPACITY * DEFAULT_LOAD_FACTOR);   
    table = new Entry[DEFAULT_INITIAL_CAPACITY];   
    init();   
  } 

/** 
   * Constructs an empty <tt>HashMap</tt> with the specified initial 
   * capacity and the default load factor (0.75). 
   * 
   * @param initialCapacity the initial capacity. 
   * @throws IllegalArgumentException if the initial capacity is negative. 
   */ 
  public HashMap(int initialCapacity) { 
    this(initialCapacity, DEFAULT_LOAD_FACTOR); 
  }

DEFAULT_LOAD_FACTOR  //默認(rèn)加載因子，如果不制定的話是0.75  
DEFAULT_INITIAL_CAPACITY //默認(rèn)初始化容量，默認(rèn)是16  
threshold //閾（yu）值 根據(jù)加載因子和初始化容量計(jì)算得出 ，<span microsoft yahei";">threshold表示當(dāng)HashMap的size大于threshold時(shí)會執(zhí)行resize操作。

public V put(K key, V value) {  
    if (key == null) //鍵為空的情況，HashMap和HashTable的一個(gè)區(qū)別  
      return putForNullKey(value);  
    int hash = hash(key.hashCode()); //根據(jù)鍵的hashCode算出hash值  
    int i = indexFor(hash, table.length); //根據(jù)hash值算出究竟該放入哪個(gè)數(shù)組下標(biāo)中  
    for (Entry<K,V> e = table[i]; e != null; e = e.next) {//整個(gè)for循環(huán)實(shí)現(xiàn)了如果存在K那么就替換V  
      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++;//計(jì)數(shù)器  
    addEntry(hash, key, value, i); //添加到數(shù)組中  
    return null;  
  }

addEntry(hash, key, value, i);

void addEntry(int hash, K key, V value, int bucketIndex) {   
Entry<K,V> e = table[bucketIndex];   
    table[bucketIndex] = new Entry<K,V>(hash, key, value, e);   
    if (size++ >= threshold)   
     <span ><strong> resize(2 * table.length);
}

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]; <span >new 一個(gè)新的數(shù)組，</span> 
    <strong> <span >transfer(newTable);</span> </strong> //將就數(shù)組轉(zhuǎn)移到新的數(shù)組中 
    table = newTable;   
    threshold = (int)(newCapacity * loadFactor);  //重新計(jì)算容量 
  }

void transfer(Entry[] newTable) {   
    Entry[] src = table;   
    int newCapacity = newTable.length;   
    for (int j = 0; j < src.length; j++) {   
      Entry<K,V> e = src[j];   
      if (e != null) {   
        src[j] = null;   
        do {   
          Entry<K,V> next = e.next;   
          int i = <strong><span >indexFor(e.hash, newCapacity);  //根據(jù)hash值個(gè)容量重新計(jì)算下標(biāo)</span></strong> 
          e.next = newTable[i];   
          newTable[i] = e;   
          e = next;   
        } while (e != null);   
      }   
    }   
  } 

Map<Integer,String> maps=new HashMap<Integer,String>(1000);