aboutsummaryrefslogtreecommitdiff
path: root/libjava/java/util/Enumeration.java
diff options
context:
space:
mode:
authorBryce McKinlay <bryce@gcc.gnu.org>2001-10-16 06:47:01 +0100
committerBryce McKinlay <bryce@gcc.gnu.org>2001-10-16 06:47:01 +0100
commit41878ce27efa7dac17cc1f3b283303cd6bbedd1e (patch)
treeae47326b1fbf6a430f495ac6b9f0b6405f37d7d6 /libjava/java/util/Enumeration.java
parentffb5e2e21f98abfdb6cb7efdf8ff2e911f09ec64 (diff)
downloadgcc-41878ce27efa7dac17cc1f3b283303cd6bbedd1e.zip
gcc-41878ce27efa7dac17cc1f3b283303cd6bbedd1e.tar.gz
gcc-41878ce27efa7dac17cc1f3b283303cd6bbedd1e.tar.bz2
[multiple changes]
2001-10-15 Bryce McKinlay <bryce@waitaki.otago.ac.nz> * java/util/HashMap.java (HashEntry.clone): Removed. (HashMap(Map)): Use putAllInternal. (clone): Likewise. (putAllInternal): New method. Efficient counterpart to putAll which does not call put(). * java/util/LinkedHashMap.java (rethread): Removed. (putAllInternal): New method. Clear "head" and "tail". (addEntry): New argument "callRemove". Don't call removeEldestEntry() if callRemove == false. * Makefile.am: Add new classes RandomAccess and LinkedHashMap. * Makefile.in: Rebuilt. 2001-10-15 Eric Blake <ebb9@email.byu.edu> * java/util/Collection.java: Updated javadoc. * java/util/Comparator.java: Updated javadoc. * java/util/Enumeration.java: Updated javadoc. * java/util/Iterator.java: Updated javadoc. * java/util/List.java: Updated javadoc. * java/util/ListIterator.java: Updated javadoc. * java/util/Map.java: Updated javadoc. * java/util/RandomAccess.java: New file. * java/util/Set.java: Updated javadoc. * java/util/SortedMap.java: Updated javadoc. * java/util/SortedSet.java: Updated javadoc. From-SVN: r46277
Diffstat (limited to 'libjava/java/util/Enumeration.java')
-rw-r--r--libjava/java/util/Enumeration.java15
1 files changed, 10 insertions, 5 deletions
diff --git a/libjava/java/util/Enumeration.java b/libjava/java/util/Enumeration.java
index 66624bd..5bcfbee 100644
--- a/libjava/java/util/Enumeration.java
+++ b/libjava/java/util/Enumeration.java
@@ -42,7 +42,12 @@ package java.util;
* be obtained by the enumeration method in class Collections.
*
* @author Warren Levy <warrenl@cygnus.com>
- * @date August 25, 1998.
+ * @author Eric Blake <ebb9@email.byu.edu>
+ * @see Iterator
+ * @see Hashtable
+ * @see Vector
+ * @since 1.0
+ * @status updated to 1.4
*/
public interface Enumeration
{
@@ -50,8 +55,8 @@ public interface Enumeration
* Tests whether there are elements remaining in the enumeration.
*
* @return true if there is at least one more element in the enumeration,
- * that is, if the next call to nextElement will not throw a
- * NoSuchElementException.
+ * that is, if the next call to nextElement will not throw a
+ * NoSuchElementException.
*/
boolean hasMoreElements();
@@ -59,7 +64,7 @@ public interface Enumeration
* Obtain the next element in the enumeration.
*
* @return the next element in the enumeration
- * @exception NoSuchElementException if there are no more elements
+ * @throws NoSuchElementException if there are no more elements
*/
- Object nextElement() throws NoSuchElementException;
+ Object nextElement();
}