-
Bug
-
Resolution: Fixed
-
P3
-
1.3.0
-
None
-
kestrel
-
generic
-
generic
The current implementation of java.util.Hashtable iteration is slow if the hash
table is empty, since the default size of hashtable is 101, and the iteration
linearly goes through all the 101 buckets. Although hash table is not designed
for iterating, this is a problem for applications like javac, which creates a
lot of empty hashtables and iterates through them.
table is empty, since the default size of hashtable is 101, and the iteration
linearly goes through all the 101 buckets. Although hash table is not designed
for iterating, this is a problem for applications like javac, which creates a
lot of empty hashtables and iterates through them.