Java中Map集中遍历方式比较

1、Map的遍历方式大体上分为两种：keySet方式和entrySet方式，细分可以分为四种：keySet forEach、keySet iterator方式和entrySet forEach、entrySet iterator方式，下面对这四种方式的效率作一个简单的比较：

public static void main(String[] args){
        Map<Object, String> map = new HashMap<>();
        for (int i = 0; i < 100000; i++) {
            map.put(i, "map"+i);
        }
        long entrySetForEachTime = entrySetForEach(map);
        System.out.println("entrySet foreach 遍历时间：" + entrySetForEachTime);
        long entrySetIteratorTime = entrySetIterator(map);
        System.out.println("entrySet Iterator 遍历时间：" + entrySetIteratorTime);
        long keySetForEachTime = keySetForEach(map);
        System.out.println("keySet foreach 遍历时间：" + keySetForEachTime);
        long keySetIteratorTime = keySetIterator(map);
        System.out.println("keySet Iterator 遍历时间：" + keySetIteratorTime);
    }

/**
     * keySet foreach 遍历
     * @param map
     * @return
     */
    public static long keySetForEach(Map<Object, String> map) {
        long startTime = System.currentTimeMillis();
        for (Object key : map.keySet()) {
            log.info("key = " + key + ", value = " + map.get(key));
        }
        long endTime = System.currentTimeMillis();
        return endTime - startTime;
    }

/**
     * keySet Iterator  遍历
     * @param map
     * @return
     */
    public static long keySetIterator(Map<Object, String> map) {
        long startTime = System.currentTimeMillis();
        Iterator<Object> iterator = map.keySet().iterator();
        while (iterator.hasNext()) {
            Object key = iterator.next();
            log.info("key = " + key + ", value = " + map.get(key));
        }
        long endTime = System.currentTimeMillis();
        return endTime - startTime;
    }

/**
     * entrySet foreach 遍历
     * @param map
     * @return
     */
    public static long entrySetForEach(Map<Object, String> map) {
        long startTime = System.currentTimeMillis();
        for (Map.Entry<Object, String> entry : map.entrySet()) {
            log.info("key = " + entry.getKey() + ", value = " + entry.getValue());
        }
        long endTime = System.currentTimeMillis();
        return endTime - startTime;
    }

/**
     * entrySet Iterator 遍历
     * @param map
     * @return
     */
    public static long entrySetIterator(Map<Object, String> map) {
        long startTime = System.currentTimeMillis();
        Iterator<Map.Entry<Object, String>> iterator = map.entrySet().iterator();
        while (iterator.hasNext()) {
            Map.Entry<Object, String> entry = iterator.next();
            log.info("key = " + entry.getKey() + ", value = " + entry.getValue());
        }
        long endTime = System.currentTimeMillis();
        return endTime - startTime;
    }

2、上面四种方式运行效率如下：

entrySet foreach 遍历时间：544
entrySet Iterator 遍历时间：529
keySet foreach 遍历时间：549
keySet Iterator 遍历时间：547

3、比较上面可以得出大概的结论：
①entrySet方式遍历效率高于keySet方式；
②iterator遍历效率高于forEach；
③最终推荐使用entrySet iterator方式来遍历Map。