java - 关于list集合和set集合的问题请大神指导一下

Question

请问各位大牛list和set调用contains方法时是比较两个元素的地址，还是调用他们的equals方法呢？ {代码...} 我想问的就是为什么这个输出的结果是true,false

迷茫 · Answer

我查了下源碼，我覺得HashSet的Hash這裡有文章。 HashSet的Hash这里有文章。

1.首先看添加元素的过程
//HashSet代码

    /**
     * Adds the specified element to this set if it is not already present.
     * More formally, adds the specified element e to this set if
     * this set contains no element e2 such that
     * (e==null ? e2==null : e.equals(e2)).
     * If this set already contains the element, the call leaves the set
     * unchanged and returns false.
     *
     * @param e element to be added to this set
     * @return true if this set did not already contain the specified
     * element
     */
    public boolean add(E e) {
        return map.put(e, PRESENT)==null;
    }

向HashSet内部维护的map添加新元素
//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 key, or
     *         null if there was no mapping for key.
     *         (A null return can also indicate that the map
     *         previously associated null with key.)
     */
    public V put(K key, V value) {
        if (table == EMPTY_TABLE) {
            inflateTable(threshold);
        }
        if (key == null)
            return putForNullKey(value);
        int hash = hash(key);
        int i = indexFor(hash, table.length);
        for (Entry e = table[i]; e != null; e = e.next) {
            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++;
        addEntry(hash, key, value, i);
        return null;
    }

可以看出会对Element做哈希，所以如果添加Foo(1)的话，保存到HashSet过程中也少不了这个环节的。

1. 再来看比较的情况
  //HashSet代码

    /**
     * Returns true if this set contains the specified element.
     * More formally, returns true if and only if this set
     * contains an element e such that
     * (o==null ? e==null : o.equals(e)).
     *
     * @param o element whose presence in this set is to be tested
     * @return true if this set contains the specified element
     */
    public boolean contains(Object o) {
        return map.containsKey(o);
    }

//HashMap代码

    /**
     * Returns true if this map contains a mapping for the
     * specified key.
     *
     * @param   key   The key whose presence in this map is to be tested
     * @return true if this map contains a mapping for the specified
     * key.
     */
    public boolean containsKey(Object key) {
        return getEntry(key) != null;
    }

    /**
     * Returns the entry associated with the specified key in the
     * HashMap.  Returns null if the HashMap contains no mapping
     * for the key.
     */
    final Entry getEntry(Object key) {
        if (size == 0) {
            return null;
        }

        int hash = (key == null) ? 0 : hash(key);
        for (Entry e = table[indexFor(hash, table.length)];
             e != null;
             e = e.next) {
            Object k;
            if (e.hash == hash &&
                ((k = e.key) == key || (key != null && key.equals(k))))
                return e;
        }
        return null;
    }

1. 结论
  插入HashSet
  - 1.首先看加入元素的過程
    //HashSet程式碼

在HashSet內部維護的map新增元素
//HashMap程式碼🎜 rrreee 🎜可以看出會對Element做哈希，所以如果加入Foo(1)的話，儲存到HashSet過程中也少不了這個環節的。 🎜

1. 🎜再來看比較的情況
  //HashSet程式碼🎜🎜🎜🎜🎜 rrreee 🎜//HashMap程式碼🎜 rrreee rrreee
  - 1. 🎜結論
      插入HashSet容器時對元素做哈希，判斷容器是否含有某個元素時也要對元素做哈希，他們比較的是元素的雜湊值。 🎜🎜🎜🎜🎜

ringa_lee · Answer

equals的方法，但是值得注意的是二樓說的是String下的equals方法，因為String的equals方法是重寫過的，如果題主希望透過contains方法對於一般Object的比較的話，還是得和String一樣重寫equals方法，確定何種規則

PHPz · Answer

    public boolean contains(Object o) {
    Iterator it = iterator();
    if (o==null) {
        while (it.hasNext())
            if (it.next()==null)
                return true;
    } else {
        while (it.hasNext())
            if (o.equals(it.next()))
                return true;
    }
    return false;
}

這個是AbstractCollection的实现, AbstractList, AbstractSet都是以此為父類實現的.