HashMap和Hashtable的区别

HashMap和Hashtable都是java中的集合类，二者会有什么区别呢？

区别1

通过源码我们可以发现，二者继承的类不相同

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

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

二者都实现了Map接口，但是HashMap继承的是AbstractMap，而Hashtable继承的是Dictionary

区别2

HashMap中的的方法都是非同步的而Hashtable中的方法是同步的

//HashMap中的方法
public void putAll(Map<? extends K, ? extends V> m) {
        putMapEntries(m, true);
}
//Hashtable中的方法
public synchronized void putAll(Map<? extends K, ? extends V> t) {
        for (Map.Entry<? extends K, ? extends V> e : t.entrySet())
            put(e.getKey(), e.getValue());
}

所以HashMap是线程不安全的，Hashtable是线程安全的。但是在单线程中，HashMap的效率却是比Hashtable高

区别3

HashMap的put方法允许键值对为空，而Hashtable不可以

//HashMap
 /**
     * Associates the specified value with the specified key in this map.
     * If the map previously contained a mapping for the key, the old
     * value is replaced.
     *
     * @param key key with which the specified value is to be associated
     * @param value value to be associated with the specified key
     * @return the previous value associated with <tt>key</tt>, or
     *         <tt>null</tt> if there was no mapping for <tt>key</tt>.
     *         (A <tt>null</tt> return can also indicate that the map
     *         previously associated <tt>null</tt> with <tt>key</tt>.)
     */
public V put(K key, V value) {
        return putVal(hash(key), key, value, false, true);
}
//Hashtable
 public synchronized V put(K key, V value) {
        // Make sure the value is not null
        if (value == null) {
            throw new NullPointerException();
        }

        // Makes sure the key is not already in the hashtable.
        Entry<?,?> tab[] = table;
        int hash = key.hashCode();
        int index = (hash & 0x7FFFFFFF) % tab.length;
        @SuppressWarnings("unchecked")
        Entry<K,V> entry = (Entry<K,V>)tab[index];
        for(; entry != null ; entry = entry.next) {
            if ((entry.hash == hash) && entry.key.equals(key)) {
                V old = entry.value;
                entry.value = value;
                return old;
            }
        }

        addEntry(hash, key, value, index);
        return null;

}