提交 4766f23e 编写于 作者: C coffeys

Merge

...@@ -78,7 +78,8 @@ public abstract class AbstractMap<K,V> implements Map<K,V> { ...@@ -78,7 +78,8 @@ public abstract class AbstractMap<K,V> implements Map<K,V> {
/** /**
* {@inheritDoc} * {@inheritDoc}
* *
* <p>This implementation returns <tt>entrySet().size()</tt>. * @implSpec
* This implementation returns <tt>entrySet().size()</tt>.
*/ */
public int size() { public int size() {
return entrySet().size(); return entrySet().size();
...@@ -87,7 +88,8 @@ public abstract class AbstractMap<K,V> implements Map<K,V> { ...@@ -87,7 +88,8 @@ public abstract class AbstractMap<K,V> implements Map<K,V> {
/** /**
* {@inheritDoc} * {@inheritDoc}
* *
* <p>This implementation returns <tt>size() == 0</tt>. * @implSpec
* This implementation returns <tt>size() == 0</tt>.
*/ */
public boolean isEmpty() { public boolean isEmpty() {
return size() == 0; return size() == 0;
...@@ -96,7 +98,8 @@ public abstract class AbstractMap<K,V> implements Map<K,V> { ...@@ -96,7 +98,8 @@ public abstract class AbstractMap<K,V> implements Map<K,V> {
/** /**
* {@inheritDoc} * {@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, * for an entry with the specified value. If such an entry is found,
* <tt>true</tt> is returned. If the iteration terminates without * <tt>true</tt> is returned. If the iteration terminates without
* finding such an entry, <tt>false</tt> is returned. Note that this * finding such an entry, <tt>false</tt> is returned. Note that this
...@@ -126,7 +129,8 @@ public abstract class AbstractMap<K,V> implements Map<K,V> { ...@@ -126,7 +129,8 @@ public abstract class AbstractMap<K,V> implements Map<K,V> {
/** /**
* {@inheritDoc} * {@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, * for an entry with the specified key. If such an entry is found,
* <tt>true</tt> is returned. If the iteration terminates without * <tt>true</tt> is returned. If the iteration terminates without
* finding such an entry, <tt>false</tt> is returned. Note that this * finding such an entry, <tt>false</tt> is returned. Note that this
...@@ -157,7 +161,8 @@ public abstract class AbstractMap<K,V> implements Map<K,V> { ...@@ -157,7 +161,8 @@ public abstract class AbstractMap<K,V> implements Map<K,V> {
/** /**
* {@inheritDoc} * {@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, * for an entry with the specified key. If such an entry is found,
* the entry's value is returned. If the iteration terminates without * the entry's value is returned. If the iteration terminates without
* finding such an entry, <tt>null</tt> is returned. Note that this * finding such an entry, <tt>null</tt> is returned. Note that this
...@@ -191,7 +196,8 @@ public abstract class AbstractMap<K,V> implements Map<K,V> { ...@@ -191,7 +196,8 @@ public abstract class AbstractMap<K,V> implements Map<K,V> {
/** /**
* {@inheritDoc} * {@inheritDoc}
* *
* <p>This implementation always throws an * @implSpec
* This implementation always throws an
* <tt>UnsupportedOperationException</tt>. * <tt>UnsupportedOperationException</tt>.
* *
* @throws UnsupportedOperationException {@inheritDoc} * @throws UnsupportedOperationException {@inheritDoc}
...@@ -206,7 +212,8 @@ public abstract class AbstractMap<K,V> implements Map<K,V> { ...@@ -206,7 +212,8 @@ public abstract class AbstractMap<K,V> implements Map<K,V> {
/** /**
* {@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 * 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 * obtained with its <tt>getValue</tt> operation, the entry is removed
* from the collection (and the backing map) with the iterator's * from the collection (and the backing map) with the iterator's
...@@ -255,7 +262,8 @@ public abstract class AbstractMap<K,V> implements Map<K,V> { ...@@ -255,7 +262,8 @@ public abstract class AbstractMap<K,V> implements Map<K,V> {
/** /**
* {@inheritDoc} * {@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> * <tt>entrySet()</tt> collection, and calls this map's <tt>put</tt>
* operation once for each entry returned by the iteration. * operation once for each entry returned by the iteration.
* *
...@@ -276,7 +284,8 @@ public abstract class AbstractMap<K,V> implements Map<K,V> { ...@@ -276,7 +284,8 @@ public abstract class AbstractMap<K,V> implements Map<K,V> {
/** /**
* {@inheritDoc} * {@inheritDoc}
* *
* <p>This implementation calls <tt>entrySet().clear()</tt>. * @implSpec
* This implementation calls <tt>entrySet().clear()</tt>.
* *
* <p>Note that this implementation throws an * <p>Note that this implementation throws an
* <tt>UnsupportedOperationException</tt> if the <tt>entrySet</tt> * <tt>UnsupportedOperationException</tt> if the <tt>entrySet</tt>
...@@ -302,7 +311,8 @@ public abstract class AbstractMap<K,V> implements Map<K,V> { ...@@ -302,7 +311,8 @@ public abstract class AbstractMap<K,V> implements Map<K,V> {
/** /**
* {@inheritDoc} * {@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 * The subclass's iterator method returns a "wrapper object" over this
* map's <tt>entrySet()</tt> iterator. The <tt>size</tt> method * map's <tt>entrySet()</tt> iterator. The <tt>size</tt> method
* delegates to this map's <tt>size</tt> method and the * delegates to this map's <tt>size</tt> method and the
...@@ -358,7 +368,8 @@ public abstract class AbstractMap<K,V> implements Map<K,V> { ...@@ -358,7 +368,8 @@ public abstract class AbstractMap<K,V> implements Map<K,V> {
/** /**
* {@inheritDoc} * {@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 * AbstractCollection}. The subclass's iterator method returns a
* "wrapper object" over this map's <tt>entrySet()</tt> iterator. * "wrapper object" over this map's <tt>entrySet()</tt> iterator.
* The <tt>size</tt> method delegates to this map's <tt>size</tt> * The <tt>size</tt> method delegates to this map's <tt>size</tt>
...@@ -425,7 +436,8 @@ public abstract class AbstractMap<K,V> implements Map<K,V> { ...@@ -425,7 +436,8 @@ public abstract class AbstractMap<K,V> implements Map<K,V> {
* <tt>equals</tt> method works properly across different implementations * <tt>equals</tt> method works properly across different implementations
* of the <tt>Map</tt> interface. * 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 * 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 * 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 * not, it returns <tt>false</tt>. If so, it iterates over this map's
...@@ -478,7 +490,8 @@ public abstract class AbstractMap<K,V> implements Map<K,V> { ...@@ -478,7 +490,8 @@ public abstract class AbstractMap<K,V> implements Map<K,V> {
* <tt>m1</tt> and <tt>m2</tt>, as required by the general contract of * <tt>m1</tt> and <tt>m2</tt>, as required by the general contract of
* {@link Object#hashCode}. * {@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 * {@link Map.Entry#hashCode hashCode()} on each element (entry) in the
* set, and adding up the results. * set, and adding up the results.
* *
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册