研究 研究而已 java和.net的HashSet對比
今天,應(yīng)為工作問題,測試了一下C#和java同意的代碼功能執(zhí)行情況,發(fā)現(xiàn)一個問題。
HashSet.contains 方法對比,在java下面性能居然沒有c#的高。
- private static final Logger log = Logger.getLogger(NewClass.class);
- public static void main(String[] args) {
- for (int j = 0; j < 5; j++) {
- HashSet<Integer> ids = new HashSet<>(0);
- log.error("開始測試:" + j);
- int forCount = 200 * 10000;
- for (int i = 0; i < forCount; i++) {
- if (!ids.contains(i)) {
- ids.add(i);
- }
- }
- log.error("結(jié)束測試:" + j + " 執(zhí)行次數(shù):" + forCount);
- }
- }
[04-12 16:16:57:427] -> 開始測試:0
[04-12 16:16:58:063] -> 結(jié)束測試:0 執(zhí)行次數(shù):2000000
[04-12 16:16:58:064] -> 開始測試:1
[04-12 16:16:58:835] -> 結(jié)束測試:1 執(zhí)行次數(shù):2000000
[04-12 16:16:58:835] -> 開始測試:2
[04-12 16:16:58:993] -> 結(jié)束測試:2 執(zhí)行次數(shù):2000000
[04-12 16:16:58:994] -> 開始測試:3
[04-12 16:16:59:247] -> 結(jié)束測試:3 執(zhí)行次數(shù):2000000
[04-12 16:16:59:249] -> 開始測試:4
[04-12 16:16:59:382] -> 結(jié)束測試:4 執(zhí)行次數(shù):2000000
看出java運行結(jié)果 執(zhí)行200萬次檢索插入,執(zhí)行時間100多毫秒,大約是。
- private static final Logger log = Logger.getLogger(NewClass.class);
- public static void main(String[] args) {
- for (int j = 0; j < 5; j++) {
- HashSet<Integer> ids = new HashSet<>(0);
- log.error("開始測試:" + j);
- int forCount = 2000 * 10000;
- for (int i = 0; i < forCount; i++) {
- if (!ids.contains(i)) {
- ids.add(i);
- }
- }
- log.error("結(jié)束測試:" + j + " 執(zhí)行次數(shù):" + forCount);
- }
- }
[04-12 16:18:09:345] -> 開始測試:0
[04-12 16:18:24:835] -> 結(jié)束測試:0 執(zhí)行次數(shù):20000000
[04-12 16:18:24:836] -> 開始測試:1
[04-12 16:18:36:600] -> 結(jié)束測試:1 執(zhí)行次數(shù):20000000
[04-12 16:18:36:600] -> 開始測試:2
[04-12 16:18:44:331] -> 結(jié)束測試:2 執(zhí)行次數(shù):20000000
[04-12 16:18:44:331] -> 開始測試:3
[04-12 16:18:51:801] -> 結(jié)束測試:3 執(zhí)行次數(shù):20000000
[04-12 16:18:51:803] -> 開始測試:4
[04-12 16:19:01:277] -> 結(jié)束測試:4 執(zhí)行次數(shù):20000000
而執(zhí)行2000完成檢索插入的時候執(zhí)行平均時間 大約是9秒左右
接下來我們看看c#的運行結(jié)果
- static void Main(string[] args)
- {
- for (int j = 0; j < 5; j++)
- {
- HashSet<int> ids = new HashSet<int>();
- Console.WriteLine(DateTime.Now.NowString() + "開始測試:" + j);
- int forCount = 200 * 10000;
- for (int i = 0; i < forCount; i++)
- {
- if (!ids.Contains(i))
- {
- ids.Add(i);
- }
- }
- Console.WriteLine(DateTime.Now.NowString() + "結(jié)束測試:" + j + " 執(zhí)行次數(shù):" + forCount);
- }
- Console.ReadLine();
- }
2015-04-12 16:20:06:223:開始測試:0
2015-04-12 16:20:06:321:結(jié)束測試:0 執(zhí)行次數(shù):2000000
2015-04-12 16:20:06:322:開始測試:1
2015-04-12 16:20:06:413:結(jié)束測試:1 執(zhí)行次數(shù):2000000
2015-04-12 16:20:06:414:開始測試:2
2015-04-12 16:20:06:500:結(jié)束測試:2 執(zhí)行次數(shù):2000000
2015-04-12 16:20:06:500:開始測試:3
2015-04-12 16:20:06:616:結(jié)束測試:3 執(zhí)行次數(shù):2000000
2015-04-12 16:20:06:617:開始測試:4
2015-04-12 16:20:06:717:結(jié)束測試:4 執(zhí)行次數(shù):2000000
執(zhí)行200萬次檢索插入,執(zhí)行平均時間100毫秒左右,比java略勝一湊
再看看2000萬次的檢索插入情況
- static void Main(string[] args)
- {
- for (int j = 0; j < 5; j++)
- {
- HashSet<int> ids = new HashSet<int>();
- Console.WriteLine(DateTime.Now.NowString() + "開始測試:" + j);
- int forCount = 2000 * 10000;
- for (int i = 0; i < forCount; i++)
- {
- if (!ids.Contains(i))
- {
- ids.Add(i);
- }
- }
- Console.WriteLine(DateTime.Now.NowString() + "結(jié)束測試:" + j + " 執(zhí)行次數(shù):" + forCount);
- }
- Console.ReadLine();
- }
2015-04-12 16:20:51:746:開始測試:0
2015-04-12 16:20:52:633:結(jié)束測試:0 執(zhí)行次數(shù):20000000
2015-04-12 16:20:52:634:開始測試:1
2015-04-12 16:20:53:645:結(jié)束測試:1 執(zhí)行次數(shù):20000000
2015-04-12 16:20:53:645:開始測試:2
2015-04-12 16:20:54:615:結(jié)束測試:2 執(zhí)行次數(shù):20000000
2015-04-12 16:20:54:615:開始測試:3
2015-04-12 16:20:55:623:結(jié)束測試:3 執(zhí)行次數(shù):20000000
2015-04-12 16:20:55:624:開始測試:4
2015-04-12 16:20:56:561:結(jié)束測試:4 執(zhí)行次數(shù):20000000
看看2000萬次的檢索插入時間大約是1秒鐘樣子。
這個不曉得是不是量級的性能問題呢????
接下來再看看,直接插入,。,因為插入也自帶了檢索條件的
- private static final Logger log = Logger.getLogger(NewClass.class);
- public static void main(String[] args) {
- for (int j = 0; j < 5; j++) {
- HashSet<Integer> ids = new HashSet<>(0);
- log.error("開始測試:" + j);
- int forCount = 2000 * 10000;
- for (int i = 0; i < forCount; i++) {
- ids.add(i);
- }
- log.error("結(jié)束測試:" + j + " 執(zhí)行次數(shù):" + forCount);
- }
- }
[04-12 16:30:32:591] -> 開始測試:0
[04-12 16:30:44:725] -> 結(jié)束測試:0 執(zhí)行次數(shù):20000000
[04-12 16:30:44:726] -> 開始測試:1
[04-12 16:30:57:535] -> 結(jié)束測試:1 執(zhí)行次數(shù):20000000
[04-12 16:30:57:536] -> 開始測試:2
[04-12 16:31:08:237] -> 結(jié)束測試:2 執(zhí)行次數(shù):20000000
[04-12 16:31:08:237] -> 開始測試:3
[04-12 16:31:19:306] -> 結(jié)束測試:3 執(zhí)行次數(shù):20000000
[04-12 16:31:19:309] -> 開始測試:4
[04-12 16:31:23:810] -> 結(jié)束測試:4 執(zhí)行次數(shù):20000000
單純插入java執(zhí)行2000萬次的時間大約是9秒多,
- static void Main(string[] args)
- {
- for (int j = 0; j < 5; j++)
- {
- HashSet<int> ids = new HashSet<int>();
- Console.WriteLine(DateTime.Now.NowString() + "開始測試:" + j);
- int forCount = 2000 * 10000;
- for (int i = 0; i < forCount; i++)
- {
- ids.Add(i);
- }
- Console.WriteLine(DateTime.Now.NowString() + "結(jié)束測試:" + j + " 執(zhí)行次數(shù):" + forCount);
- }
- Console.ReadLine();
- }
2015-04-12 16:32:35:355:開始測試:0
2015-04-12 16:32:36:064:結(jié)束測試:0 執(zhí)行次數(shù):20000000
2015-04-12 16:32:36:065:開始測試:1
2015-04-12 16:32:36:879:結(jié)束測試:1 執(zhí)行次數(shù):20000000
2015-04-12 16:32:36:879:開始測試:2
2015-04-12 16:32:37:657:結(jié)束測試:2 執(zhí)行次數(shù):20000000
2015-04-12 16:32:37:657:開始測試:3
2015-04-12 16:32:38:466:結(jié)束測試:3 執(zhí)行次數(shù):20000000
2015-04-12 16:32:38:467:開始測試:4
2015-04-12 16:32:39:238:結(jié)束測試:4 執(zhí)行次數(shù):20000000
c# 2000萬次插入執(zhí)行時間大約是1秒不到。,,是不是很有趣。。。
不知道是不是我電腦問題,還是我的執(zhí)行情況不對。各位看官提出建議看看。。。
======================================================================
這里是應(yīng)各位看官要求,改成string的方式,同樣是用guid的生成方式,保證完全代碼一模一樣
- static void Main(string[] args)
- {
- Console.ReadLine();
- for (int j = 0; j < 5; j++)
- {
- serverID = j;
- id = 0;
- HashSet<String> ids = new HashSet<String>();
- Console.WriteLine(DateTime.Now.NowString() + "開始測試:" + j);
- int forCount = 600 * 10000;
- for (int i = 0; i < forCount; i++)
- {
- //long tempID = getId();
- String tempID = Guid.NewGuid().ToString();
- bool add = ids.Add(tempID);
- if (!add)
- {
- Console.WriteLine(DateTime.Now.NowString() + "重復(fù):" + i + " " + tempID);
- }
- }
- Console.WriteLine(DateTime.Now.NowString() + "結(jié)束測試:" + j + " 執(zhí)行次數(shù):" + forCount);
- }
- Console.ReadLine();
- }
2015-04-12 18:17:19:501:開始測試:0
2015-04-12 18:17:29:757:結(jié)束測試:0 執(zhí)行次數(shù):6000000
2015-04-12 18:17:29:757:開始測試:1
2015-04-12 18:17:39:582:結(jié)束測試:1 執(zhí)行次數(shù):6000000
2015-04-12 18:17:39:583:開始測試:2
2015-04-12 18:17:48:141:結(jié)束測試:2 執(zhí)行次數(shù):6000000
2015-04-12 18:17:48:141:開始測試:3
2015-04-12 18:17:56:255:結(jié)束測試:3 執(zhí)行次數(shù):6000000
2015-04-12 18:17:56:256:開始測試:4
2015-04-12 18:18:04:374:結(jié)束測試:4 執(zhí)行次數(shù):6000000
執(zhí)行插入600完成執(zhí)行時間大約是9秒
- private static final SimpleDateFormat DF2 = new SimpleDateFormat("yyyy-MM-dd HH:mm:ss:SSS: ");
- public static String getDateFormat1() {
- return DF2.format(new Date());
- }
- public static void main(String[] args) throws Exception {
- for (int j = 0; j < 5; j++) {
- serverID = j;
- id = 0;
- HashSet<String> ids = new HashSet<>(0);
- System.out.println(getDateFormat1() + "開始測試:" + j);
- int forCount = 600 * 10000;
- for (int i = 0; i < forCount; i++) {
- //long tempid = getId();
- String tempid = UUID.randomUUID().toString();
- boolean add = ids.add(tempid);
- if (!add) {
- System.out.println(getDateFormat1() + "重復(fù): " + i + " " + tempid);
- }
- }
- System.out.println(getDateFormat1() + " 結(jié)束測試:" + j + " 執(zhí)行次數(shù):" + forCount);
- }
- }
2015-04-12 18:19:34:589: 開始測試:0
2015-04-12 18:19:49:246: 結(jié)束測試:0 執(zhí)行次數(shù):6000000
2015-04-12 18:19:49:246: 開始測試:1
2015-04-12 18:20:00:516: 結(jié)束測試:1 執(zhí)行次數(shù):6000000
2015-04-12 18:20:00:516: 開始測試:2
2015-04-12 18:20:10:670: 結(jié)束測試:2 執(zhí)行次數(shù):6000000
2015-04-12 18:20:10:670: 開始測試:3
2015-04-12 18:20:20:401: 結(jié)束測試:3 執(zhí)行次數(shù):6000000
2015-04-12 18:20:20:401: 開始測試:4
2015-04-12 18:20:31:124: 結(jié)束測試:4 執(zhí)行次數(shù):6000000
同樣是600完成大約是11秒