HashTable的源码分析JDK1.7

对于hashtable部分，主要分析JDK1.7版本的

（1）继承关系

public class Hashtable<K,V>
    extends Dictionary<K,V>
    implements Map<K,V>, Cloneable, java.io.Serializable {

继承了Dictionary，实现了Map、Cloneable、Serializable接口

2.基本属性和默认值

private transient Entry<K,V>[] table;
private static class Entry<K,V> implements Map.Entry<K,V> {
        int hash;
        final K key;
        V value;
        Entry<K,V> next;
//该属性用来存储HashTable的数据
//当前采用的是哈希表的存储结构，采用的是链地址法解决哈希冲


//表示集合中存储的Entry实体个数=hashmap->size
private transient int count;

//阈值  threshold=loadFactor*table.length
private int threshold;


//加载因子[0-1]的取值范围
private float loadFactor;

//版本记录
private transient int modCount = 0;

（3）构造函数

public Hashtable(int initialCapacity, float loadFactor) {
	//校验
        if (initialCapacity < 0)
            throw new IllegalArgumentException("Illegal Capacity: "+
                                               initialCapacity);
        if (loadFactor <= 0 || Float.isNaN(loadFactor))
            throw new IllegalArgumentException("Illegal Load: "+loadFactor);

        if (initialCapacity==0)
            initialCapacity = 1;
        this.loadFactor = loadFactor;
	//对hash中数组做初始化
        table = new Entry[initialCapacity];
	//变更加载因子
        threshold = (int)Math.min(initialCapacity * loadFactor, MAX_ARRAY_SIZE + 1);
        initHashSeedAsNeeded(initialCapacity);
    }

    /**
     * Constructs a new, empty hashtable with the specified initial capacity
     * and default load factor (0.75).
     *
     * @param     initialCapacity   the initial capacity of the hashtable.
     * @exception IllegalArgumentException if the initial capacity is less
     *              than zero.
     */
    public Hashtable(int initialCapacity) {
        this(initialCapacity, 0.75f);
    }

    /**
     * Constructs a new, empty hashtable with a default initial capacity (11)
     * and load factor (0.75).
     */
    public Hashtable() {
        this(11, 0.75f);
    }


 public Hashtable(Map<? extends K, ? extends V> t) {
        this(Math.max(2*t.size(), 11), 0.75f);
        putAll(t);
    }
/*默认值：
初始容量默认值：11
加载因子默认值：0.75f
*/

4.基本CURD操作

(1)put()操作

public synchronized V put(K key, V value) {
        // Make sure the value is not null
        if (value == null) {
            throw new NullPointerException();
        }
	//HashTable中的value值是不能为null的

        // Makes sure the key is not already in the hashtable.
        Entry tab[] = table;
        int hash = hash(key);
        int index = (hash & 0x7FFFFFFF) % tab.length;
	//key是不能重复的
        for (Entry<K,V> e = tab[index] ; e != null ; e = e.next) {
            if ((e.hash == hash) && e.key.equals(key)) {
                V old = e.value;
                e.value = value;
                return old;
            }
        }
	
        modCount++;
        if (count >= threshold) {
            // Rehash the table if the threshold is exceeded
            rehash();

            tab = table;
            hash = hash(key);
            index = (hash & 0x7FFFFFFF) % tab.length;
        }

        // 采用的是头插法插入新的节点
        Entry<K,V> e = tab[index];
        tab[index] = new Entry<>(hash, key, value, e);
        count++;
        return null;
    }

synchronized是线程同步关键字，其修饰在HashTable中的put方法
即表明同一时刻只能有一个线程来访问HashTable的实例，所以HashTable是线程安全的
为什么有些地方不需要加锁（即没有synchronize）

HashTable中的key和value都不能为null
key是不能重复的，value是可以重复的

（2）rehash操作

protected void rehash() {
        int oldCapacity = table.length;
        Entry<K,V>[] oldMap = table;

        //扩容机制   2*table.length+1
        int newCapacity = (oldCapacity << 1) + 1;
        if (newCapacity - MAX_ARRAY_SIZE > 0) {
            if (oldCapacity == MAX_ARRAY_SIZE)
                // Keep running with MAX_ARRAY_SIZE buckets
                return;
            newCapacity = MAX_ARRAY_SIZE;
        }
        Entry<K,V>[] newMap = new Entry[newCapacity];

        modCount++;
        threshold = (int)Math.min(newCapacity * loadFactor, MAX_ARRAY_SIZE + 1);
        boolean rehash = initHashSeedAsNeeded(newCapacity);

        table = newMap;


//重新hash
        for (int i = oldCapacity ; i-- > 0 ;) {
            for (Entry<K,V> old = oldMap[i] ; old != null ; ) {
                Entry<K,V> e = old;
                old = old.next;

                if (rehash) {
                    e.hash = hash(e.key);
                }
                int index = (e.hash & 0x7FFFFFFF) % newCapacity;
                e.next = newMap[index];
                newMap[index] = e;
            }
        }
    }


 private int hash(Object k) {
        
        return hashSeed ^ k.hashCode();//key不能为null，从这里提现出来的
    }

（3）get()操作

public synchronized V get(Object key) {
        Entry tab[] = table;
        int hash = hash(key);
        int index = (hash & 0x7FFFFFFF) % tab.length;
        for (Entry<K,V> e = tab[index] ; e != null ; e = e.next) {
            if ((e.hash == hash) && e.key.equals(key)) {
                return e.value;
            }
        }
        return null;
    }
//有的版本get操作没有加synchronized？
//get操作只是查询，没有修改类的操作

（4）remove()操作

public synchronized V remove(Object key) {
//类似与单链表的删除，主要分析是头结点和不是头结点的区别
        Entry tab[] = table;
        int hash = hash(key);
        int index = (hash & 0x7FFFFFFF) % tab.length;
        for (Entry<K,V> e = tab[index], prev = null ; e != null ; prev = e, e = e.next) {
            if ((e.hash == hash) && e.key.equals(key)) {
                modCount++;
                if (prev != null) {
                    prev.next = e.next;
                } else {
                    tab[index] = e.next;
                }
                count--;
                V oldValue = e.value;
                e.value = null;
                return oldValue;
            }
        }
        return null;
    }
//删除操作使用synchronize修饰，即同一时刻只能是一个线程访问remove()方法