jdk-sandbox: comparison jdk/src/share/classes/java/util/AbstractMap.java

equal deleted inserted replaced

-:a1ee9743f4ee
+:ca113030b2b3
 // Query Operations
 /**
 * {@inheritDoc}
 *
-* <p>This implementation returns <tt>entrySet().size()</tt>.
+* @implSpec
+* This implementation returns <tt>entrySet().size()</tt>.
 */
 public int size() {
 return entrySet().size();
 }
 /**
 * {@inheritDoc}
 *
-* <p>This implementation returns <tt>size() == 0</tt>.
+* @implSpec
+* This implementation returns <tt>size() == 0</tt>.
 */
 public boolean isEmpty() {
 return size() == 0;
 }
 /**
 * {@inheritDoc}
 *
-* <p>This implementation iterates over <tt>entrySet()</tt> searching
+* @implSpec
+* This implementation iterates over <tt>entrySet()</tt> searching
 * for an entry with the specified value.  If such an entry is found,
 * <tt>true</tt> is returned.  If the iteration terminates without
 * finding such an entry, <tt>false</tt> is returned.  Note that this
 * implementation requires linear time in the size of the map.
 *
 }
 /**
 * {@inheritDoc}
 *
-* <p>This implementation iterates over <tt>entrySet()</tt> searching
+* @implSpec
+* This implementation iterates over <tt>entrySet()</tt> searching
 * for an entry with the specified key.  If such an entry is found,
 * <tt>true</tt> is returned.  If the iteration terminates without
 * finding such an entry, <tt>false</tt> is returned.  Note that this
 * implementation requires linear time in the size of the map; many
 * implementations will override this method.
 }
 /**
 * {@inheritDoc}
 *
-* <p>This implementation iterates over <tt>entrySet()</tt> searching
+* @implSpec
+* This implementation iterates over <tt>entrySet()</tt> searching
 * for an entry with the specified key.  If such an entry is found,
 * the entry's value is returned.  If the iteration terminates without
 * finding such an entry, <tt>null</tt> is returned.  Note that this
 * implementation requires linear time in the size of the map; many
 * implementations will override this method.
 // Modification Operations
 /**
 * {@inheritDoc}
 *
-* <p>This implementation always throws an
+* @implSpec
+* This implementation always throws an
 * <tt>UnsupportedOperationException</tt>.
 *
 * @throws UnsupportedOperationException {@inheritDoc}
 * @throws ClassCastException            {@inheritDoc}
 * @throws NullPointerException          {@inheritDoc}
 }
 /**
 * {@inheritDoc}
 *
-* <p>This implementation iterates over <tt>entrySet()</tt> searching for an
+* @implSpec
+* This implementation iterates over <tt>entrySet()</tt> searching for an
 * entry with the specified key.  If such an entry is found, its value is
 * obtained with its <tt>getValue</tt> operation, the entry is removed
 * from the collection (and the backing map) with the iterator's
 * <tt>remove</tt> operation, and the saved value is returned.  If the
 * iteration terminates without finding such an entry, <tt>null</tt> is
 // Bulk Operations
 /**
 * {@inheritDoc}
 *
-* <p>This implementation iterates over the specified map's
+* @implSpec
+* This implementation iterates over the specified map's
 * <tt>entrySet()</tt> collection, and calls this map's <tt>put</tt>
 * operation once for each entry returned by the iteration.
 *
 * <p>Note that this implementation throws an
 * <tt>UnsupportedOperationException</tt> if this map does not support
 }
 /**
 * {@inheritDoc}
 *
-* <p>This implementation calls <tt>entrySet().clear()</tt>.
+* @implSpec
+* This implementation calls <tt>entrySet().clear()</tt>.
 *
 * <p>Note that this implementation throws an
 * <tt>UnsupportedOperationException</tt> if the <tt>entrySet</tt>
 * does not support the <tt>clear</tt> operation.
 *
 transient volatile Collection<V> values = null;
 /**
 * {@inheritDoc}
 *
-* <p>This implementation returns a set that subclasses {@link AbstractSet}.
+* @implSpec
+* This implementation returns a set that subclasses {@link AbstractSet}.
 * The subclass's iterator method returns a "wrapper object" over this
 * map's <tt>entrySet()</tt> iterator.  The <tt>size</tt> method
 * delegates to this map's <tt>size</tt> method and the
 * <tt>contains</tt> method delegates to this map's
 * <tt>containsKey</tt> method.
 }
 /**
 * {@inheritDoc}
 *
-* <p>This implementation returns a collection that subclasses {@link
+* @implSpec
+* This implementation returns a collection that subclasses {@link
 * AbstractCollection}.  The subclass's iterator method returns a
 * "wrapper object" over this map's <tt>entrySet()</tt> iterator.
 * The <tt>size</tt> method delegates to this map's <tt>size</tt>
 * method and the <tt>contains</tt> method delegates to this map's
 * <tt>containsValue</tt> method.
 * <tt>m2</tt> represent the same mappings if
 * <tt>m1.entrySet().equals(m2.entrySet())</tt>.  This ensures that the
 * <tt>equals</tt> method works properly across different implementations
 * of the <tt>Map</tt> interface.
 *
-* <p>This implementation first checks if the specified object is this map;
+* @implSpec
+* This implementation first checks if the specified object is this map;
 * if so it returns <tt>true</tt>.  Then, it checks if the specified
 * object is a map whose size is identical to the size of this map; if
 * not, it returns <tt>false</tt>.  If so, it iterates over this map's
 * <tt>entrySet</tt> collection, and checks that the specified map
 * contains each mapping that this map contains.  If the specified map
 * <tt>entrySet()</tt> view.  This ensures that <tt>m1.equals(m2)</tt>
 * implies that <tt>m1.hashCode()==m2.hashCode()</tt> for any two maps
 * <tt>m1</tt> and <tt>m2</tt>, as required by the general contract of
 * {@link Object#hashCode}.
 *
-* <p>This implementation iterates over <tt>entrySet()</tt>, calling
+* @implSpec
+* This implementation iterates over <tt>entrySet()</tt>, calling
 * {@link Map.Entry#hashCode hashCode()} on each element (entry) in the
 * set, and adding up the results.
 *
 * @return the hash code value for this map
 * @see Map.Entry#hashCode()

changeset 22096	ca113030b2b3
parent 18818	a9ceff754226
child 22097	49bc688ee68b