0

今天打开jre1.6.0_27 HashMap values()方法源码

  389  public Set<K> keySet()
  390  {
  391      Set localSet = this.keySet;
  392      return (this.keySet = new KeySet(null));
  393  }
  394
  395  public Collection<V> values()
  396  {
  397      Collection localCollection = this.values;
  398      return (this.values = new Values(null));
  399  }

我认为这些源代码是错误的，但我不知道为什么它们看起来像这样。谁能告诉我为什么？

========================================

谢谢大家，我认为这是Eclipse的问题，这个源代码我使用Eclipse F3并去了它，所以它看起来像上面那个。

我刚打开src.zip，这个方法源码是对的。

/**
 * Returns a {@link Collection} view of the values contained in this map.
 * The collection is backed by the map, so changes to the map are
 * reflected in the collection, and vice-versa.  If the map is
 * modified while an iteration over the collection is in progress
 * (except through the iterator's own <tt>remove</tt> operation),
 * the results of the iteration are undefined.  The collection
 * supports element removal, which removes the corresponding
 * mapping from the map, via the <tt>Iterator.remove</tt>,
 * <tt>Collection.remove</tt>, <tt>removeAll</tt>,
 * <tt>retainAll</tt> and <tt>clear</tt> operations.  It does not
 * support the <tt>add</tt> or <tt>addAll</tt> operations.
 */
903    public Collection<V> values() {
904        Collection<V> vs = values;
905        return (vs != null ? vs : (values = new Values()));
906    }
4

2 回答 2

0

至少在 OpenJDK 7 中它看起来是正确的：

  880       public Set<K> keySet() {
  881           Set<K> ks = keySet;
  882           return (ks != null ? ks : (keySet = new KeySet()));
  883       }

  916       public Collection<V> values() {
  917           Collection<V> vs = values;
  918           return (vs != null ? vs : (values = new Values()));
  919       }
于 2012-09-28T09:40:37.893 回答
0

为什么你认为这些方法是错误的？您必须查看内部类KeySet和Values内部的源代码HashMap才能了解它们是如何工作的。

该keySet()方法返回一个新KeySet对象。在 JDK 1.6.0_35 中，内部类的源代码KeySet如下所示：

private final class KeySet extends AbstractSet<K> {
    public Iterator<K> iterator() {
        return newKeyIterator();
    }
    public int size() {
        return size;
    }
    public boolean contains(Object o) {
        return containsKey(o);
    }
    public boolean remove(Object o) {
        return HashMap.this.removeEntryForKey(o) != null;
    }
    public void clear() {
        HashMap.this.clear();
    }
}

这是一个Set从HashMap.

同样，有一个内部类Values以相同的方式工作。

于 2012-09-28T09:51:36.000 回答