1 背景知识
list、set和map的基本介绍如下图:
2、猜想
- 在数据量级比较小的情况下(十万以内),查询速度快慢对比: map 、 set 、 list的速度相差不大。
- 在数据量比较大的情况下(百万以内),查询速度: map > set > list。
3、验证
某个集合中是否包含某个元素。
3.1 数据量: 9.9万
public class TestFindSpeed {
public static void main(String[] args) {
Map<String, String> map = new HashMap<>();
List<String> list = new ArrayList<>();
Set<String> set = new HashSet<>();
for (int i = 1; i < 99000; i++) {
map.put(i + "123456789", i + "");
list.add(i + "123456789");
set.add(i + "123456789");
}
String element = "8888";
System.out.println("测试查找某个 element 的速度,集合中的数据条数:" + 9.9 + " 万条。");
long mapStart = System.currentTimeMillis();
boolean mapRes = map.containsKey(element);
System.out.println("Map:" + mapRes + " ---> " + (System.currentTimeMillis() - mapStart));
long listStart = System.currentTimeMillis();
boolean listRes = list.contains(element);
System.out.println("List:" + listRes + " ---> " + (System.currentTimeMillis() - listStart));
long setStart = System.currentTimeMillis();
boolean setRes = set.contains(element);
System.out.println("Set:" + setRes + " ---> " + (System.currentTimeMillis() - setStart));
}
}
3.2 数据量: 99 万
public class TestFindSpeed {
public static void main(String[] args) {
Map<String, String> map = new HashMap<>();
List<String> list = new ArrayList<>();
Set<String> set = new HashSet<>();
for (int i = 1; i < 990000; i++) {
map.put(i + "123456789", i + "");
list.add(i + "123456789");
set.add(i + "123456789");
}
String element = "8888";
System.out.println("测试查找某个 element 的速度,集合中的数据条数:" + 99 + " 万条。");
long mapStart = System.currentTimeMillis();
boolean mapRes = map.containsKey(element);
System.out.println("Map:" + mapRes + " ---> " + (System.currentTimeMillis() - mapStart));
long listStart = System.currentTimeMillis();
boolean listRes = list.contains(element);
System.out.println("List:" + listRes + " ---> " + (System.currentTimeMillis() - listStart));
long setStart = System.currentTimeMillis();
boolean setRes = set.contains(element);
System.out.println("Set:" + setRes + " ---> " + (System.currentTimeMillis() - setStart));
}
}
3.3 数据量:500 万
public class TestFindSpeed {
public static void main(String[] args) {
Map<String, String> map = new HashMap<>();
List<String> list = new ArrayList<>();
Set<String> set = new HashSet<>();
for (int i = 1; i < 5000000; i++) {
map.put(i + "123456789", i + "");
list.add(i + "123456789");
set.add(i + "123456789");
}
String element = "8888";
System.out.println("测试查找某个 element 的速度,集合中的数据条数:" + 500 + " 万条。");
long mapStart = System.currentTimeMillis();
boolean mapRes = map.containsKey(element);
System.out.println("Map:" + mapRes + " ---> " + (System.currentTimeMillis() - mapStart));
long listStart = System.currentTimeMillis();
boolean listRes = list.contains(element);
System.out.println("List:" + listRes + " ---> " + (System.currentTimeMillis() - listStart));
long setStart = System.currentTimeMillis();
boolean setRes = set.contains(element);
System.out.println("Set:" + setRes + " ---> " + (System.currentTimeMillis() - setStart));
}
}