public static void main(String[] args) {
Map<Object, Object> map = new HashMap<Object, Object>();
for (int i = 0, j = 10000 << 10; i < j; i++) {
map.put(i, i);
}
long a = System.currentTimeMillis();
for (Object key : map.keySet()) {
Object o = map.get(key);
}
System.err.println(System.currentTimeMillis() - a);
long b = System.currentTimeMillis();
for (Map.Entry<Object, Object> entry : map.entrySet()) {
Object o = entry.getValue();
}
System.err.println(System.currentTimeMillis() - b);
long c = System.currentTimeMillis();
map.forEach((key, value) -> {
Object o = value;
});
System.err.println(System.currentTimeMillis() - c);
long d = System.currentTimeMillis();
Iterator<Entry<Object, Object>> entries = map.entrySet().iterator();
while (entries.hasNext()) {
Entry<Object, Object> entry = entries.next();
Object o = entry.getValue();
}
System.err.println(System.currentTimeMillis() - d);
}
运行结果:
186
93
123
90
故,推荐使用通过entryset()进行遍历