java集合遍歷性能測試

java version "1.8.0_144"
Java(TM) SE Runtime Environment (build 1.8.0_144-b01)
Java HotSpot(TM) 64-Bit Server VM (build 25.144-b01, mixed mode)

ArrayList LinkedList

Code

import org.junit.Before;
import org.junit.FixMethodOrder;
import org.junit.Test;
import org.junit.runners.MethodSorters;

import java.util.ArrayList;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;

/**
 * ArrayList LinkedList 多種遍歷性能測試
 *
 * @author chigusa
 * @function
 * @date 2017/9/25
 */
@FixMethodOrder(MethodSorters.JVM)
public class ListSpeedTest {
    private static final int NUM = 100000;
    private List<Integer> arrayList;
    private List<Integer> linkedList;
    private Integer temp;

    @Before
    public void init() {
        arrayList = new ArrayList<>(NUM);
        linkedList = new LinkedList<>();
        for (int i = 0; i < NUM; i++) {
            arrayList.add(Integer.MAX_VALUE);
            linkedList.add(Integer.MAX_VALUE);
        }
    }

    @Test
    public void forArrayList() {
        for (int i = 0; i < NUM; i++) {
            temp = arrayList.get(i);
        }
    }

    @Test
    public void forLinkedList() {
        for (int i = 0; i < NUM; i++) {
            temp = linkedList.get(i);
        }
    }

    @Test
    public void iteratorInArrayList() {
        Iterator<Integer> iterator = arrayList.iterator();
        while (iterator.hasNext()) {
            temp = iterator.next();
        }
    }

    @Test
    public void iteratorInLinkedList() {
        Iterator<Integer> iterator = linkedList.iterator();
        while (iterator.hasNext()) {
            temp = iterator.next();
        }
    }

    @Test
    public void forEachArrayList() {
        for (Integer i : arrayList) {
            temp = i;
        }
    }

    @Test
    public void forEachLinkedList() {
        for (Integer i : linkedList) {
            temp = i;
        }
    }

    @Test
    public void java8forEachArrayList() {
        arrayList.forEach(integer -> temp = integer);
    }

    @Test
    public void java8forEachLinkedList() {
        arrayList.forEach(integer -> temp = integer);
    }
}

結果

測試結果

HashMap

Code

import org.junit.Before;
import org.junit.FixMethodOrder;
import org.junit.Test;
import org.junit.runners.MethodSorters;

import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;

/**
 * HashMap 遍歷方法性能測試
 *
 * @author chigusa
 * @function
 * @date 2017/9/25
 */
@FixMethodOrder(MethodSorters.JVM)
public class HashMapTest {
    private static final int NUM = 100000;
    private HashMap<Integer, Integer> hashMap;
    private Integer k, v;

    @Before
    public void init() {
        hashMap = new HashMap<>(NUM);
        for (int i = 0; i < NUM; i++) {
            hashMap.put(i, i);
        }
    }

    @Test
    public void forEachKeySet() {
        for (Integer i : hashMap.keySet()) {
            k = i;
            v = hashMap.get(i);
        }
    }

    @Test
    public void forEachEntitySet() {
        for (Map.Entry<Integer, Integer> entry : hashMap.entrySet()) {
            k = entry.getKey();
            v = entry.getValue();
        }
    }

    @Test
    public void iterator() {
        Iterator<Map.Entry<Integer, Integer>> iterator = hashMap.entrySet().iterator();
        while (iterator.hasNext()) {
            Map.Entry<Integer, Integer> entry = iterator.next();
            k = entry.getKey();
            v = entry.getValue();
        }
    }

    @Test
    public void java8ForEach() {
        hashMap.forEach((k, v) -> {
            this.k = k;
            this.v = v;
        });
    }
}

結果

測試結果
最后編輯于
?著作權歸作者所有,轉載或內(nèi)容合作請聯(lián)系作者
【社區(qū)內(nèi)容提示】社區(qū)部分內(nèi)容疑似由AI輔助生成,瀏覽時請結合常識與多方信息審慎甄別。
平臺聲明:文章內(nèi)容(如有圖片或視頻亦包括在內(nèi))由作者上傳并發(fā)布,文章內(nèi)容僅代表作者本人觀點,簡書系信息發(fā)布平臺,僅提供信息存儲服務。

相關閱讀更多精彩內(nèi)容

友情鏈接更多精彩內(nèi)容