From 1ae409781cabd4da5a4b07822e9555bdd581ebf0 Mon Sep 17 00:00:00 2001 From: mkoch Date: Wed, 26 Nov 2003 21:45:55 +0000 Subject: 2003-11-26 Stuart Ballard * java/util/HashMap.java (putAll): Use Iterator hasNext() method. (putAllInternal): Likewise. * java/util/Hashtable.java (putAll): Use Iterator hasNext() method. (putAllInternal): Likewise. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@73964 138bc75d-0d04-0410-961f-82ee72b054a4 --- libjava/java/util/Hashtable.java | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) (limited to 'libjava/java/util/Hashtable.java') diff --git a/libjava/java/util/Hashtable.java b/libjava/java/util/Hashtable.java index a94143b8f09..b0de0a231b8 100644 --- a/libjava/java/util/Hashtable.java +++ b/libjava/java/util/Hashtable.java @@ -510,7 +510,7 @@ public class Hashtable extends Dictionary { Iterator itr = m.entrySet().iterator(); - for (int msize = m.size(); msize > 0; msize--) + while (itr.hasNext()) { Map.Entry e = (Map.Entry) itr.next(); // Optimize in case the Entry is one of our own. @@ -859,11 +859,11 @@ public class Hashtable extends Dictionary void putAllInternal(Map m) { Iterator itr = m.entrySet().iterator(); - int msize = m.size(); - this.size = msize; + size = 0; - for (; msize > 0; msize--) + while (itr.hasNext()) { + size++; Map.Entry e = (Map.Entry) itr.next(); Object key = e.getKey(); int idx = hash(key); -- cgit v1.2.3