HashMap、HashTable、ConcurrentHashMap放入null源码

HashMap

map.put(null, null);

public V put(K key, V value) {
    // hash key的值
    return putVal(hash(key), key, value, false, true);
}

static final int hash(Object key) {
    int h;
    // 如果key为null,hash key的值直接返回0
    return (key == null) ? 0 : (h = key.hashCode()) ^ (h >>> 16);
}

通过源码:hashmap放入key和value都是null,可以成功,key通过hash之后返回的是0,多次放入key为null的值,会覆盖之前放入的key为null的value值

HashTable

map.put(null, null);

public synchronized V put(K key, V value) {
    // Make sure the value is not null
    // 如果value为null,直接抛空指针异常
    if (value == null) {
         throw new NullPointerException();
     }

     // Makes sure the key is not already in the hashtable.
     Entry<?,?> tab[] = table;
     // key为null的情况下,获取key的hashcode报空指针异常,所以key可value都不可以为null
     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;
}

不允许放入key和value为null的值

HashSet

hashSet.add(null);

public boolean add(E e) {
    // 使用的hashmap的put方法,key是null,可以成功放入,多次放入会覆盖前面放入的值
    return map.put(e, PRESENT)==null;
}

ConcurrentHashMap

concurrentHashMap.put(null, null);

final V putVal(K key, V value, boolean onlyIfAbsent) {
        // 如果key或者value任何一个为null,直接抛空指针异常
        if (key == null || value == null) throw new NullPointerException();
        int hash = spread(key.hashCode());
        int binCount = 0;
}

不允许key或value为null